Advance Reservation of Lightpaths in Optical-Network Based Grids

Advance reservation is an important part of grid computing. It guarantees that resources will be available at a pre-determined time to participate in the execution of a grid application. The advance reservation and scheduling of optical networks are key in guaranteeing that enough bandwidth, i.e., lightpaths, will be available for an application during a pre- determined interval of time. This paper studies the behavior of two algorithms developed for scheduling multiple lightpaths requested by advance reservation. To assess the benefit of each algorithm, we compare the blocking probability introduced by each of them. The blocking probability is obtained by simulating their behavior on different topologies. This simulation is based on traces of requests generated by FONTS, our Flexible Optical Network Traffic Simulator, which provides on-demand and advance-reservation requests with different characteristics.

[1]  Ian Foster,et al.  A quality of service architecture that combines resource reservation and application adaptation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[2]  George N. Rouskas,et al.  Blocking in wavelength routing networks .I. The single path case , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Lei Zhao,et al.  Disjoint paths in random graphs , 1999 .

[4]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[5]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[6]  Ian T. Foster,et al.  The virtual data grid: a new model and architecture for data-intensive collaboration , 2003, 15th International Conference on Scientific and Statistical Database Management, 2003..

[7]  Kevin H. Liu,et al.  IP over WDM , 2002 .

[8]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[9]  Ahmed Mokhtar,et al.  Adaptive wavelength routing in all-optical networks , 1998, TNET.

[10]  Biswanath Mukherjee,et al.  On the study of routing and wavelength assignment approaches for survivable wavelength-routed WDM mesh networks , 2003 .

[11]  Franco Travostino,et al.  DWDM-RAM: enabling Grid services with dynamic optical networks , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[12]  Masayuki Murata,et al.  Performance of alternate routing methods in all-optical switching networks , 1997, Proceedings of INFOCOM '97.

[13]  Joseph Y. Hui,et al.  Load-Balanced K-Shortest Path Routing for Circuit-Switched Networks , 1992 .

[14]  Moshe Zukerman,et al.  Internet traffic modeling and future technology implications , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Jean-Yves Le Boudec,et al.  Design of a survivable WDM photonic network , 1997, Proceedings of INFOCOM '97.

[16]  Biswanath Mukherjee,et al.  Dynamic lightpath establishment in wavelength-routed WDM networks , 2001, IEEE Commun. Mag..

[17]  H. Perros,et al.  Blocking in Wavelength Routing Networks, Part II: Mesh Topologies , 1998 .

[18]  Edwin K. P. Chong,et al.  Lambda scheduling algorithm for file transfers on high-speed optical circuits , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[19]  Sudhir Dixit,et al.  IP Over WDM: building the next-generation optical internet , 2003 .

[20]  J. Banks,et al.  Discrete-Event System Simulation , 1995 .

[21]  Joel Mambretti,et al.  Optical Switching Middleware for the OptlPuter , 2003 .

[22]  Andrew A. Chien,et al.  The OptIPuter , 2003, CACM.

[23]  Martin Knoke,et al.  Dynamic wavelength assignment schemes for wavelength routed WDM ring transport networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[24]  Jorma T. Virtamo,et al.  Dynamic routing and wavelength assignment using first policy iteration , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[25]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[26]  Miron Livny,et al.  Stork: making data placement a first class citizen in the grid , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[27]  Olov Schelén,et al.  Sharing Resources through Advance Reservation Agents , 1997 .

[28]  Olov Schelén,et al.  An agent-based architecture for advance reservations , 1997, Proceedings of 22nd Annual Conference on Local Computer Networks.

[29]  Jarek Nabrzyski,et al.  Grid Resource Management , 2004 .

[30]  H. Perros,et al.  Blocking in Wavelength Routing Networks , Part I : The Single Path CaseYuhong , 2006 .