Request scheduling on WDM networks with tunable ADMs

Authors:
Yinlong Xu;Wei Zhou
Affiliations:
Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei, Anhui, P. R. China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei, Anhui, P. R. China
Venue:
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Year:
2006

Citing 9
Cited 0

On the 1.1 edge-coloring of multigraphs

SIAM Journal on Discrete Mathematics
Scheduling of multicast traffic in tunable-receiver WDM networks with non-negligible tuning latencies

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Approximation algorithms for routing and call scheduling in all-optical chains and rings

Theoretical Computer Science
Approximating Call-Scheduling Makespan in All-Optical Networks

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies

Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimizing ADMs on WDM directed fiber trees

Journal of Computer Science and Technology
Wavelength assignment to minimize requirement on tunable range of optical transceivers in WDM networks

Computer Communications
Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies

IEEE Journal on Selected Areas in Communications
Impact of tuning delay on the performance of bandwidth-limited optical broadcast networks with uniform traffic

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies request scheduling on wavelength division multiplexed (WDM) all-optical networks with one tunable add/drop multiplexer (tADM) per node. The objective is to minimize the overall scheduling time. For request scheduling on unidirectional linear networks, we reduce the problem to an edge-coloring problem on bipartite graph and prove it to be polynomial time solvable. For the scheduling problem on unidirectional rings and symmetric trees, several approximation algorithms are proposed with their performance evaluated by theoretical and experimental analyses.