Maximizing Throughput for Optical Burst Switching Networks

A key problem in optical burst switching (OBS) is to schedule as many bursts as possible on wavelength channels so that the throughput is maximized and the burst loss is minimized. In this paper, we use competitive analysis to analyze the worst-case performance of a large set of scheduling algorithms, called best-effort online scheduling algorithms, for OBS networks, and establish a number of interesting upper and lower bounds on the performance of such algorithms. A surprising discovery is that the worst-case performance of any best-effort online scheduling algorithm is primarily determined by the maximum to minimum burst length ratio, followed by the range of offset time. Furthermore, if all bursts have the same burst length and offset time, all best-effort online scheduling algorithms generate the same optimal solution, regardless how different they may look like. Our analysis can also be extended to some nonbest-effort online scheduling algorithms, such as the well-known Horizon algorithm, and establish similar bounds. Based on the analytic results, we give guidelines for several widely discussed OBS problems, including burst assembly, offset time setting and scheduling algorithm design, and propose a new channel reservation protocol called VFO to improve the worst-case performance. Our simulation shows that it is quite often for an online scheduling algorithm to exhibit its (near) worst-case performance. Thus improving the worst-case performance is essential. Our simulation also suggests that VFO reduces the average burst loss rate by as much as 35%

[1]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  Marco Listanti,et al.  Impact of segments aggregation on TCP Reno flows in optical burst switching networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..

[4]  George N. Rouskas,et al.  Techniques for optical packet switching and optical burst switching , 2001, IEEE Commun. Mag..

[5]  George N. Rouskas,et al.  A Simulation Study of Access Protocols for Optical Burst-Switched Ring Networks , 2002, NETWORKING.

[6]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[7]  Chunming Qiao,et al.  High-speed protocol for bursty traffic in optical networks , 1997, Other Conferences.

[8]  Yijun Xiong,et al.  Control architecture in optical burst-switched WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[9]  George N. Rouskas,et al.  A simulation study of optical burst switching and access protocols for WDM ring networks , 2003, Comput. Networks.

[10]  Jonathan S. Turner,et al.  WDM burst switching for petabit capacity routers , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[11]  Duan-Shin Lee,et al.  Using switched delay lines for exact emulation of FIFO multiplexers with variable length bursts , 2006, IEEE J. Sel. Areas Commun..

[12]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[13]  Chunming Qiao,et al.  Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[14]  George N. Rouskas,et al.  A queueing network model of an edge optical burst switching node , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Darrell D. E. Long,et al.  Scheduling real-time disk transfers for continuous media applications , 1993, [1993] Proceedings Twelfth IEEE Symposium on Mass Storage systems.

[16]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Hai Le Vu,et al.  Blocking probabilities of optical burst switching networks based on reduced load fixed point approximations , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Ulrich Faigle,et al.  Note on Scheduling Intervals on-line , 1995, Discret. Appl. Math..

[19]  Jonathan S. Turner,et al.  Terabit burst switching , 1999, J. High Speed Networks.

[20]  Chunming Qiao,et al.  Efficient channel scheduling algorithms in optical burst switched networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[22]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[23]  Chunming Qiao,et al.  Labeled optical burst switching for IP-over-WDM integration , 2000, IEEE Commun. Mag..

[24]  Jonathan S. Turner,et al.  Time sliced optical burst switching , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[25]  Jonathan S. Turner.  Terabit Burst Switching Progress Report (12/97-2/98) , 1998 .