Off-Line and On-Line Call-Scheduling in Stars and Trees (1997)

Cached

Download Links

by Thomas Erlebach , Klaus Jansen
Venue:in Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG ‘97, LNCS1335, Springer-Verlag
Citations:11 - 2 self

Active Bibliography

22 The Complexity of Path Coloring and Call Scheduling – Thomas Erlebach, Klaus Jansen, Corso Elvezia - 2000
Scheduling in modern networks: state-of-the-art survey – n.n. - 2002
Approximation Algorithms for Path Coloring in Trees – Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano - 2001
10 Short Length Menger's Theorem and Reliable Optical Routing – Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman - 2003
Directed Tree Networks – Thomas Erlebach, et al. - 1994
1 Wavelength Assignment Algorithms for WDM Optical Networks – Zhengbing Bian - 2003
10 Limited Wavelength Conversion in All-Optical Tree Networks (Extended Abstract) – L. Gargano, Luisa Gargano - 1998
de recherche ISSN 0249-6399Graph Problems Arising from Wavelength–Routing in All–Optical Networks – Bruno Beauquier, Jean-claude Bermond, Luisa Gargano, Pavol Hell, Stéphane Pérennes, Ugo Vaccaro, Bruno Beauquier, Jean-claude Bermond, Luisa Gargano, Pavol Hell, Stéphane Pérennes, Ugo Vaccaro, Thème Réseaux Et Systèmes, Projet Sloop, Unité Inria, Sophia Antipolis
82 Graph problems arising from wavelength-routing in all-optical networks – Bruno Beauquier, Luisa Gargano, Stéphane Perennes, et al. - 1997
7 Wavelength Routing in All-Optical Tree Networks: A Survey – Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano - 2001
Minimum Wavelength Assignment for Multicast Traffic in All-Optical WDM Tree Networks – Anuj Rawat, Mark Shayman, Richard La, Steve Marcus
2 Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks – Thomas Erlebach, Klaus Jansen - 1998
51 Scheduling of Virtual Connections in Fast Networks – Thomas Erlebach, Klaus Jansen - 1996
3 Approximation algorithms for routing and call scheduling in all-optical chains and rings – Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-spaccamela - 1999
27 All-to-All Communication for some Wavelength-Routed All-Optical Networks – Bruno Beauquier - 1998
6 Decidable Properties of Graphs of All-Optical Networks – Luciano Margara , Janos Simon
12 Randomized Path Coloring on Binary Trees – Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano - 2000
12 Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing – Luisa Gargano, Pavol Hell, Stephane Perennes - 1997
6 Graph Coloring Problems and Their Applications in Scheduling – Dániel Marx - 2004