论文信息 - Multiclass Resource Allocation in Interconnected WDM Rings

Multiclass Resource Allocation in Interconnected WDM Rings

We discuss the problem of scheduling bandwidth-guaranteed and best-effort traffic in interconnected WDM rings. The problem is formally defined as an ILP problem. We propose complex optimal algorithms based on flow maximization and simpler heuristic solutions to solve the scheduling problem. Performance of the presented algorithms, obtained by simulation, are discussed to assess the merits of the proposed solutions.

[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] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

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

[5] Thomas E. Anderson,et al. High-speed switch scheduling for local-area networks , 1993, TOCS.

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

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

[8] Andrea Bianco,et al. Access Control Protocols for Interconnected WDM Rings in the DAVID Metro Network , 2001, IWDC.

[9] Nick McKeown,et al. A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

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

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