On the effectiveness of path pre-computation in reducing the processing cost of on-demand QoS path computation

Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

Volumn , Issue , 1998, Pages 42-46

  Apostolopoulos, G ^a   Tripathi, S K ^b  

^a Institute of Advanced Computer Science   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST REDUCTION; HEURISTIC ALGORITHMS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK ROUTING;

INTEGRATED SERVICE; PROCESSING COMPLEXITY; QOS ROUTING ALGORITHMS; QUALITY OF SERVICE ROUTING; REALISTIC TRAFFICS; RECENT RESEARCHES; ROUTING PERFORMANCE; WIDEST SHORTEST PATHS;

QUALITY OF SERVICE;

EID: 0346235589     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.1998.702437     Document Type: Conference Paper

References (6)

1. C. Alaettinoglu, A. U. Shankar, K. Dussa-Zieger, and I. Matta. Design and implementation of mars: A routing testbed. Journal of Internetworking Research and Experience, 5(1):17-41, 1994
2. R. Guerin, D. Williams, and A. Orda. Qos routing mechanisms and ospf extensions. In GLOBECOM, 1997
3. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Two distributed algorithms for the constrained steiner tree problem. In 2nd International Conference on Computer Communication and Networking, pages 343-349, 1993
4. W. C. Lee, M. G. Hluchyj, and P. A. Humblet. Routing subject to quality of service constraints in integrated communication networks. IEEE Networks, pages 46-55, July/August 1995
5. Q. Ma and P. Steenkiste. On path selection for traffic with bandwidth guarantees. In IEEE International Conference on Network Protocols, October 1997
6. Z.Wang and J. Crowcroft. Quality of service routing for supporting multimedia applications. IEEE Journal of Selected Areas in Communications, 7(14):1228-1234, 1996