Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion

Authors:
Lin Liu;Yuanyuan Yang
Affiliations:
State University of New York at Stony Brook, Stony Brook, NY;State University of New York at Stony Brook, Stony Brook, NY
Venue:
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Year:
2007

Citing 8
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Analysis, modeling and generation of self-similar VBR video traffic

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Optimal Scheduling Algorithms in WDM Optical Interconnects with Limited Range Wavelength Conversion Capability

IEEE Transactions on Parallel and Distributed Systems
Designing WDM Optical Interconnects with Full Connectivity by Using Limited Wavelength Conversion

IEEE Transactions on Computers
Optimal Scheduling in Buffered WDM Interconnects with Limited Range Wavelength Conversion Capability

IEEE Transactions on Computers
Techniques for optical packet switching and optical burst switching

IEEE Communications Magazine
Computing approximate blocking probabilities in wavelength routed all-optical networks with limited-range wavelength conversion

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Ran-dom Access Memory, the traditional Virtual Output Queue (VOQ) based input-queued switches are difficult to implement in optical domain. In this paper we consider output-buffered optical packet switches. We focus on packet scheduling in an output-buffered optical packet switch with limited-range wavelength conversion, aiming at maximizing throughput and minimizing average queuing delay simultaneously. We show that it can be converted to a minimum cost maximum network flow problem. To cope with the high complexity of general network flow algorithms, we further present a new algorithm that can determine an optimal scheduling in O (min {W2,BW}) time, where W is the number of wave-length channels in each fiber and B is the length of the output buffer. We also conduct simulations to test the performance of the proposed scheduling algorithm under different traffic models.