Packet scheduling in WDM ring networks with non-uniform traffic demands and arbitrary transceiver tuning latencies

Authors:
Hann-Jang Ho;Rongjou Yang;Jungchun Liu;Singling Lee
Affiliations:
Wufeng Institute of Technology, Dept. of CSIE, Chia-yi, Taiwan, R.O.C.;Wufeng Institute of Technology, Dept. of IM, Chia-yi, Taiwan, R.O.C.;National Chung-Cheng University, Dept. of CSIE, Chiayi, Taiwan, R.O.C.;National Chung-Cheng University, Dept. of CSIE, Chiayi, Taiwan, R.O.C.
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 7
Cited 0

An architecture for optimal all-to-all personalized communication

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Performance measures and scheduling policies in ring networks

IEEE/ACM Transactions on Networking (TON)
Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies

IEEE/ACM Transactions on Networking (TON)
Off-line permutation embedding and scheduling in multiplexed optical networks with regular topologies

IEEE/ACM Transactions on Networking (TON)
On scheduling all-to-all personalized connections and cost-effective designs in WDM rings

IEEE/ACM Transactions on Networking (TON)
Optimal WDM schedules for optical star networks

IEEE/ACM Transactions on Networking (TON)
Pipelined Transmission Scheduling in All-Optical TDM/WDM Rings

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the scheduling problem of packet transmissions in a TDM/WDM unidirectional optical ring network. Our objective is to design a scheduling scheme for packet transmission with minimum scheduling length satisfying a set of traffic requirements. We focus on a fairly general case in that non-uniform traffic demands and arbitrary transmitter tuning latencies are allowed. Since the scheduling problem in TDM/WDM ring networks is known to be NP-Complete, we formulate the problem as an Integer Linear Program (ILP) and propose some heuristic algorithms to find feasible solutions.