Optimal routing policy

IEEE Communications Letters

Volumn 12, Issue 3, 2008, Pages 222-224

  Kühn, Reimer ^a   Mostafavi, S M ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

Heterogeneous networks; Optimal resources allocation

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL METHODS; QUEUEING THEORY;

HETEROGENEOUS NETWORKS; OPTIMAL RESOURCES ALLOCATION;

ROUTING PROTOCOLS;

EID: 41849104722     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2008.071777     Document Type: Article

References (8)

1. A. Orda, R. Rem, and M. Sidi, "Minimum delay routing in stochastic network," IEEE/ACM Trans. Networking, vol. 1, no. 2, pp. 187-198, 1993.
2. S. Chen and K. Nahrstedt, "An overview ot quality-of-service routing for the next generation high-speed networks: Problems and solutions," IEEE Network Mag., vol. 12, no. 6, p. 64-79. 1998.
3. Y. D. Lin, N. B. Hsu, and R.-H. Hwang, "QoS routing granularity in MPLS networks," IEEE Commun. Mag., vol. 46, no. 2, pp. 58-65, 2002.
4. S. Nelakuditi and Z.-L. Zhang, "A localized adaptive proportioning approach to QoS routing granularity," IEEE Commun. Mag., vol. 46, no. 2, pp. 66-71, 2002.
5. F. Hao, E. W. Zegura, and M. H. Ammar, "QoS routing for anycast communications: Motivation and an architecture for Diffserv networks," IEEE Commun. Mag., vol. 46, no. 2, pp. 48-56, 2002.
6. N. Deo and C. Y., Pang, "Shortest path algorithms: Taxonomy and annotation," Networks, vol. 14, pp. 275-323, 1984.
7. L. Kleinrock, Queuing Systems, vol. 1. New York: Wiley Interscience, 1975.
8. J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization. Theory and Examples. New York: CMS Books in Mathematics, Springer-Verlag, 2000.