Distributed queue packet scheduling algorithms for WDM-based networks

Authors:
Andrew Muir;J. J. Garcia-Luna-Aceves
Affiliations:
Computer Engineering Department, University of California, Santa Cruz, CA;Computer Engineering Department, University of California, Santa Cruz, CA
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Year:
1996

Citing 3
Cited 2

An efficient communication protocol for high-speed packet-switched multichannel networks

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Scheduling variable-length messages in a single-hop multichannel local lightwave network

IEEE/ACM Transactions on Networking (TON)
A distributed global queue transmission strategy for a WDM optical fiber network

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1

Optimal WDM schedules for optical star networks

IEEE/ACM Transactions on Networking (TON)
HiPeR-l: A High Performance Reservation Protocol with look-ahead for Broadcast WDM Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two protocols for scheduling variable-length packet transmissions in an optical passive star network using wavelength division multiplexing (WDM) are specified and analyzed. These protocols require: a separate channel for transmission of control packets, a fixed transmitter and receiver and a tunable transmitter and receiver. The distinction between these protocols and other WDM protocols is that message transmissions are initiated by the receipt of a control message; other schemes schedule packet transmission for some fixed point in the future. This flexibility allows these protocols to avoid "head-of-line" blocking, which is a problem encountered in some other protocols. The protocols presented here place no constraints on the size of a message the size of a packet or on the number of available data channels; maintain a distributed queue for each of the output nodes; and guarantee that there are no receiver or data channel collisions. The delay characteristics of these protocols are analyzed and compared to those of the TTAS algorithm [3,11].