Delay Performance Analysis for an Agile All-Photonic Star Network

In this paper, we study the delay performance of a centrally-controlled agile all-photonic star WDM network that provides multiplexing in the time domain over each wavelength. We consider two timeslot allocation strategies, First-Fit (FF) and First-Fit+Random (FFR), as well as network scenarios with different propagation delays. Both theoretical analyses and simulation experiments are conducted to evaluate the delay performance of the network. Through analytical and simulation results, we show that allocating residual free bandwidth can significantly improve queuing delay performance under light traffic load while maintaining good delay performance under heavy traffic load, especially for a network scenario with large propagation delays. The results obtained can be used to guide the design of scheduling algorithms especially for large-scale networks.

[1]  Gregor von Bochmann,et al.  Quick Birkhoff-von Neumann Decomposition Algorithm for Agile All-Photonic Network Cores , 2006, 2006 IEEE International Conference on Communications.

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

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

[4]  Andrea Bianco,et al.  Network controller design for SONATA-a large-scale all-optical passive network , 2000, IEEE Journal on Selected Areas in Communications.

[5]  N. Kamiyama A large-scale AWG-based single-hop WDM network using couplers with collision avoidance , 2005, Journal of Lightwave Technology.

[6]  Adam Wolisz,et al.  Wavelength reuse for efficient transport of variable-size packets in a metro WDM network , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Devavrat Shah,et al.  Delay bounds for approximate maximum weight matching algorithms for input queued switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Marco Ajmone Marsan,et al.  Bounds on average delays and queue size averages and variances in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.

[10]  Yuval Tamir,et al.  High-performance multiqueue buffers for VLSI communication switches , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.

[11]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.