Precomputing high quality routes for bandwidth guaranteed traffic

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 2, Issue , 2004, Pages 1202-1207

  Acharya, Swarup ^a   Chang, Yuh Jye ^a   Gupta, Bhawna ^a   Risbood, Pankaj ^a   Srivastava, Anurag ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW SCALABILITY; HIGH QUALITY ROUTES; PATH GENERATION; ROUTINGS;

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; ONLINE SYSTEMS; REAL TIME SYSTEMS;

TELECOMMUNICATION TRAFFIC;

EID: 18144364327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin, "Network Flows: Theory, Algorithms, and Applications", Prentice Hall, 1993.
2. S. Acharya, et al., "Architecting Self-Tuning Optical Networks" Proc. of ECOC, 2002.
3. M. Kodialam and T. V. Lakshman, "Integrated Dynamic IP and Wave-length Routing in IP over WDM Networks", Proc. of IEEE Infocom, 2001.
4. E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik 1, pp.269-271, 1959.
5. E. L. Lawler, "A Procedure for Computing the K best solutions to Discrete Optimization Problems and its Application to the Shortest Path Problem", Management Science, vol.18, pp.401-405, March 1972.
6. R. Guerin, D. Williams and A. Orda, "QoS Routing Mechanisms and OSPF Extensions", Proc. of Globecom 1997.
7. Z. Wang and J. Crowcroft, "QoS routing for supporting resource reservation", IEEE Journal on Selected Areas in Comm., Vol.14(7), pp.1228-1234, Sep. 1996.
8. M. Kodialam and T. V. Lakshman, "Minimum Interference Routing with Applications to MPLS Traffic Engineering", Proc. of IEEE Infocom, 2000.
9. G. Apostolopoulos and S. K. Tripathi, "On the Effectiveness of Path Pre-Computation in Reducing the Processing Cost of On-Demand QoS Path Computation", Proc. of IEEE Symposium on Computer and Comm., Athens, Greece, June 1998.
10. A. Shaikh, J. Rexford and K. G. Shin, "Efficient Precomputation of Quality-of-Service Routes", Proc. Workshop on Network and Operating Systems Support for Digital Audio and Video, pp. 15-27, July 1998.
11. Q. Ma and P. Steenkiste, "On Path Selection for Traffic with Bandwidth Guarantees", Proceedings of IEEE International Conference on Network Protocols, October 1997.
12. A. Orda and A. Sprintson, "QoS Routing: The Precomputation Perspective", Proc. of IEEE Infocom, 1999.
13. Shi-Wei Lee and C. S. Wu, "A K-best paths algorithms for highly reliable communication networks", IEICE Trans. Communications, 1999.
14. S. D. Nikolopoulos, A. Pitsillides and D. Tipper, "Addressing Network Survivability Issues by Finding the K-best paths through a Trellis Graph", Proc. of IEEE Infocom, 1997.
15. D. A. Dunn, W. D. Grover and M. H. MacGregor, "Comparison of k-Shortest Paths and Maximum Flow Routing for Network Facility Restoration", IEEE J. Sel. Areas of Communication, vol.12, no.1, 1994.
16. G. Baier, E. Köhler and M. Skutella, "On the k-Splittable Flow Problem", Technische Universität Berlin, 2002.