2nd International ICST Conference on Broadband Networks

Research Article

A multi-layered approach to optical burst-switched based grids

  • @INPROCEEDINGS{10.1109/ICBN.2005.1589723,
        author={Farid  Farahmand and Marc De Leenheer and Pieter Thysebaert and Bruno Volckaert and Filip De Turck and Bart Dhoedt and Piet Demeester and Jason P.  Jue},
        title={A multi-layered approach to optical burst-switched based grids},
        proceedings={2nd International ICST Conference on Broadband Networks},
  • Farid Farahmand
    Marc De Leenheer
    Pieter Thysebaert
    Bruno Volckaert
    Filip De Turck
    Bart Dhoedt
    Piet Demeester
    Jason P. Jue
    Year: 2006
    A multi-layered approach to optical burst-switched based grids
    DOI: 10.1109/ICBN.2005.1589723
Farid Farahmand1,*, Marc De Leenheer2,*, Pieter Thysebaert2, Bruno Volckaert2, Filip De Turck2, Bart Dhoedt2, Piet Demeester2, Jason P. Jue3
  • 1: Department of Computer Electronics and Graphics Technology, Central Connecticut State University
  • 2: Dept. of Information Technology, Ghent University - IBBT - IMEC, Gaston, Crommenlaan 8, 9050 Gent, Belgium
  • 3: Dept. of Eectrical Engineering and Computer Science, The University of Texas at Dallas
*Contact email: farahmandfar@ccsu.edu, marc.deleenheer@intec.ugent.be


In this paper we consider implementing optical burst switching as an alternative approach to meet computationally intensive grid applications. Such architecture has been referred to as grid-over-OBS (GoOBS). We first present a unique layered architecture for grid-over-OBS and position OBS protocol stack within the framework of the layered grid architecture. Then, we present a generic framework for anycast routing in the context of GoOBS when requests don't have explicit addresses and they can be serviced by any appropriate grid resource. We develop several algorithms to support an casting when only a single copy of a request is transmitted. Through simulation analysis, we show the performance of our anycast algorithms and compare them with the shortest-path unicast routing in which all jobs have specific addresses. In our performance analysis, we focus on average end-to-end delay and blocking probability of requests