Call Scheduling in Trees, Rings and Meshes

Authors:
T. Erlebach;K. Jansen
Affiliations:
-;-
Venue:
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
Year:
1997

Citing 0
Cited 20

Improved access to optical bandwidth in trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks

Journal of Experimental Algorithmics (JEA)
On the wavelength assignment problem in multifiber WDM star and ring networks

IEEE/ACM Transactions on Networking (TON)
An efficient algorithm for reducing the number of add-drop Multiplexers in SONET/WDM rings

Journal of High Speed Networks
Approximation algorithms for routing and call scheduling in all-optical chains and rings

Theoretical Computer Science
Randomized path coloring on binary trees

Theoretical Computer Science
Bandwidth allocation in WDM tree networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Randomized path coloring on binary trees

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Approximating Call-Scheduling Makespan in All-Optical Networks

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Decidable Properties of Graphs of All-Optical Networks

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Recent Advances in Wavelength Routing

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
The permutation-path coloring problem on trees

Theoretical Computer Science - Latin American theoretical informatics
Short length Menger's theorem and reliable optical routing

Theoretical Computer Science
Multicommodity flows over time: Efficient algorithms and complexity

Theoretical Computer Science
Multicommodity flows over time: efficient algorithms and complexity

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Paths coloring algorithms in mesh networks

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Research: Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of establishing and completing a given set ofcalls as early as possible is studied for bidirectional and directed calls in various classes of networks. Even under theassumption of unit bandwidth requirements and unit calldurations, call scheduling is NP-hard for trees with unboundeddegree, for rings, and for meshes. Whereas bidirectionalcalls can be scheduled optimally in polynomial time for trees of constant degree, the problem for directed calls is already NP-hard for binary trees. Approximation algorithms with constant performance ratio are known for many NP-hard variants of call scheduling.