Algorithm for minimum end-to-end delay paths

IEEE Communications Letters

Volumn 1, Issue 5, 1997, Pages 152-154

  Rao, Nageswara S V ^a,b   Batsell, Stephen G ^a,b  

^a IEEE   (United States)

^b OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

End to end delay; Quality of service routing; Routing algorithms

Indexed keywords

ALGORITHMS; BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; POLYNOMIALS; TELECOMMUNICATION LINKS;

END TO END DELAY PATHS; ROUTING ALGORITHMS;

COMPUTER NETWORKS;

EID: 0031236831     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.625044     Document Type: Article

References (8)

1. P. Aukia, "Quality of service based routing, 1996," Internet draft.
2. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1992.
3. Y.-L. Chen and Y.-H. Chin, "The quickest path problem," Comput. Oper. Res., vol. 17, no. 2, pp. 153-161, 1990.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
5. J. J. Garcia-Luna-Aceves and S. Murthy, "A path-finding algorithm for loop-free routing," IEEE/ACM Trans. Networking, vol. 5, pp. 148-160, Feb. 1997.
6. O. Kyas, ATM Networks, International Thomson Computer Press, 1997, 2nd. ed.
7. J.-B. Rosen, S.-Z. Sun, and G.-L. Xue, "Algorithms for the quickest path problem and the enumeration of quickest paths," Comput. Oper. Res., vol. 18, no. 6, pp. 579-584, 1991.
8. Z. Wang and J. Crowcroft, "QOS routing for supporting resource reservation," IEEE J, Select. Areas Commun., vol. 14, pp. 1228-1234, Sept. 1996.