Efficient computation of delay-sensitive routes from one source to all destinations

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2001, Pages 854-858

  Goel, Ashish ^a   Ramakrishnan, K G ^b   Kataria, Deepak ^c   Logothetis, Dimitris ^c  

^a University of Southern California ^*  (United States)

^b Winphoria Networks ^*  (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; QUALITY OF SERVICE; ROUTERS;

CONSTRAINED SHORTEST PATH PROBLEM; QUALITY OF SERVICE ROUTING;

PACKET NETWORKS;

EID: 0035009494     PISSN: 0743166X     EISSN: None     Source Type: Journal    
DOI: 10.1109/INFCOM.2001.916276     Document Type: Article

References (0)