4th International IEEE Conference on Broadband Communications, Networks, Systems

Research Article

Design and Control of Optical Grid Network

  • @INPROCEEDINGS{10.1109/BROADNETS.2007.4550413,
        author={Marc  De Leenheer and Chris Develder and Tim Stevens and Bart Dhoedt and Mario Pickavet and Piet Demeester},
        title={Design and Control of Optical Grid Network},
        proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems},
        keywords={Algorithm design and analysis  Delay  Grid computing  Heuristic algorithms  Optical control  Optical design  Optical fiber networks  Processor scheduling  Routing  Scheduling algorithm},
  • Marc De Leenheer
    Chris Develder
    Tim Stevens
    Bart Dhoedt
    Mario Pickavet
    Piet Demeester
    Year: 2008
    Design and Control of Optical Grid Network
    DOI: 10.1109/BROADNETS.2007.4550413
Marc De Leenheer1,*, Chris Develder1,*, Tim Stevens1, Bart Dhoedt1, Mario Pickavet1, Piet Demeester1
  • 1: Dept. of Information Technology - IBBT Ghent University Ghent University, Gaston Crommenlaan 8 bus 201, 9050 Gent, Belgium
*Contact email: marc.deleenheer@intec.ugent.be, chris.develde@intec.ugent.be


Grid computing aims to realize a high-performance computing environment, while increasing the usage efficiency of installed resources. This puts considerable constraints on the network technology, and ultimately has led to the development of Grids over optical networks. In this paper, we investigate the fundamental question of how to optimize the performance of such Grid networks. We start with an analysis of different architectural approaches (and their respective technological choices) to integrate Grid computing with optical networks. This results in models and algorithms to design optical Grid networks, and we show the importance to combine both dimensioning (offline) and scheduling (online) in the design phase of such systems. Finally, the concept of anycast routing is introduced and motivated. Both exact and heuristic algorithms are proposed, and their performance in terms of blocking probability and latency is presented.