Multiclass scheduling algorithms for the DAVID metro network

The data and voice integration over dense wavelength-division-multiplexing (DAVID) project proposes a metro network architecture based on several wavelength-division-multiplexing (WDM) rings interconnected via a bufferless optical switch called Hub. The Hub provides a programmable interconnection among rings on the basis of the outcome of a scheduling algorithm. Nodes connected to rings groom traffic from Internet protocol routers and Ethernet switches and share ring resources. In this paper, we address the problem of designing efficient centralized scheduling algorithms for supporting multiclass traffic services in the DAVID metro network. Two traffic classes are considered: a best-effort class, and a high-priority class with bandwidth guarantees. We define the multiclass scheduling problem at the Hub considering two different node architectures: a simpler one that relies on a complete separation between transmission and reception resources (i.e., WDM channels) and a more complex one in which nodes fully share transmission and reception channels using an erasure stage to drop received packets, thereby allowing wavelength reuse. We propose both optimum and heuristic solutions, and evaluate their performance by simulation, showing that heuristic solutions exhibit a behavior very close to the optimum solution.

[1]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[2]  Kai-Yeung Siu,et al.  Supporting bursty traffic with bandwidth guarantee in WDM distribution networks , 2000, IEEE Journal on Selected Areas in Communications.

[3]  Ray Wild,et al.  Optimization Algorithms for Networks and Graphs , 1980 .

[4]  Andrea Bianco,et al.  Measurement Based Resource Allocation for Interconnected WDM Rings , 2004, Photonic Network Communications.

[5]  Andrea Bianco,et al.  Multiclass Resource Allocation in Interconnected WDM Rings , 2003 .

[6]  Arnaud Dupas,et al.  IST-DAVID: concept presentation and physical layer modeling of the metropolitan area network , 2003 .

[7]  Chris Develder,et al.  The European IST project DAVID: a viable approach toward optical packet switching , 2003, IEEE J. Sel. Areas Commun..

[8]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[9]  William Stallings,et al.  Local and Metropolitan Area Networks , 1993 .

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

[11]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[13]  William Stallings,et al.  Local and metropolitan area networks (5th ed.) , 1993 .

[14]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[15]  Bruce Hajek,et al.  Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.

[16]  Suresh Chalasani,et al.  An Incremental Algorithm for TDM Switching Assignments in Satellite and Terrestrial Networks , 1992, IEEE J. Sel. Areas Commun..

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