Minimum Rejection Scheduling in All-Photonic Networks

Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to perform efficient optical buffering introduces network scheduling challenges. In this paper we focus on the problem of scheduling fixed-length frames in all-photonic star-topology networks with the goal of minimizing rejected demand. We formulate the task as an optimization problem and characterize its complexity. We describe the minimum rejection algorithm (MRA), which minimizes total rejection, and demonstrate that the fair matching algorithm (FMA) minimizes the maximum percentage rejection of any connection. We analyze through OPNET simulation the rejection and delay performance.

[1]  G. Bongiovanni,et al.  An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders , 1981, IEEE Trans. Commun..

[2]  Emilio Leonardi,et al.  Multiclass scheduling algorithms for the DAVID metro network , 2004, IEEE Journal on Selected Areas in Communications.

[3]  T. V. Lakshman,et al.  Scheduling schemes for delay graphs with applications to optical packet networks , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[4]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[5]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[6]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[7]  M. Coates,et al.  Fair Matching Algorithm : An Optimal Scheduling Algorithm for the AAPN network , 2006 .

[8]  Aura Ganz,et al.  Efficient algorithms for SS/TDMA scheduling , 1992, IEEE Trans. Commun..

[9]  Mark Coates,et al.  Fair Matching Algorithm: Fixed-Length Frame Scheduling in All-Photonic Networks , 2006, Wireless and Optical Communications.

[10]  William J. Dally,et al.  Guaranteed scheduling for switches with configuration overhead , 2003, IEEE/ACM Trans. Netw..

[11]  Marco Ajmone Marsan,et al.  Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks , 2000, Eur. Trans. Telecommun..

[12]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[13]  Chak-Kuen Wong,et al.  Minimizing the Number of Switchings in an SS/TDMA System , 1985, IEEE Trans. Commun..

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

[15]  G. Bongiovanni,et al.  An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams , 1982, IEEE Trans. Commun..

[16]  Carlos A. Pomalaza-Raez.  A note on efficient SS/TDMA assignment algorithms , 1988, IEEE Trans. Commun..

[17]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[18]  Gregor von Bochmann.  The Agile All-Photonic Network: An architectural outline , 2004 .

[19]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[20]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[21]  Krishna M. Sivalingam,et al.  Low-Complexity Multiple Access Protocols for Wavelength-Division Multiplexed Photonic Networks , 1993, IEEE J. Sel. Areas Commun..

[22]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[23]  George N. Rouskas,et al.  Analysis and optimization of transmission schedules for single-hop WDM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[24]  Lorne Mason,et al.  Topological design and dimensioning of Agile All-Photonic Networks , 2006, Comput. Networks.

[25]  Xiao Lu,et al.  A Comparison between Tnime-slot Scheduling Approaches for All-Photonic Networks , 2005, 2005 5th International Conference on Information Communications & Signal Processing.

[26]  Aura Ganz,et al.  A time-wavelength assignment algorithm for a WDM star network , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[27]  Xiaotie Deng,et al.  On Approximating a Scheduling Problem , 2001, J. Comb. Optim..