QoS routing in networks with inaccurate information: Theory and algorithms

IEEE/ACM Transactions on Networking

Volumn 7, Issue 3, 1999, Pages 350-364

  Guérin, Roch A ^a,b   Orda, Ariel ^a,c  

^a IEEE

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); DECISION THEORY; MATHEMATICAL MODELS; PROBABILITY; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC; UNCERTAIN SYSTEMS; VALUE ENGINEERING;

PATH-SELECTION PROCESS; QUALITY OF SERVICE (QOS);

COMPUTER NETWORKS;

EID: 0032636674     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.779203     Document Type: Article

References (36)

1. R. Cherakuri, D. Dykeman (Eds.), and M. Goguen (chair), "PNNI draft specification," ATM Forum 94-0471, Nov. 1995.
2. G. Apostolopoulos, R. Guérin, S. Kamat, A. Orda, T. Przygienda, and D. Williams, "QoS routing mechanisms and OSPF extensions," Internet Draft, draft-guerin-qos-routing-ospf-0.5.txt, to appear as Experimental RFC. [Online]. Available HTTP: http://www.seas.upenn.edu/∼guerin/qos_ospf.html
3. R. Guérin, S. Kamat, and S. Herzog, "QoS path management with RSVP," in Proc. GLOBECOM, Phoenix, AZ, Nov. 1997, pp. 1914-1918.
4. T. E. Tedijanto, R. O. Onvural, D. C. Verma, L. G ün, and R. A. Guérin, "NBBS path selection framework," IBM Syst. J.: Special Issue on Networking BroadBand Services, vol. 34, no. 4, pp. 629-639, Nov. 1995.
5. A. Shaikh, J. Rexford, and K. Shin, "Dynamics of quality-of-service routing with inaccurate link-state information," Univ. of Michigan, Ann Arbor, MI, Tech. Rep. CSE-TR-350-97, Nov. 1997.
6. G. Apostolopoulos, R. Guérin, S. Kamat, and S. Tripathi, "Quality of service based routing: A performance perspective," in Proc. SIGCOMM, Vancouver, ON, Canada, Sept. 1998, pp. 17-28.
7. S. Shenker, C. Partridge, and R. Guérin, Specification of Guaranteed Quality of Service, Request For Comments (Proposed Standard) RFC 2212, Internet Engineering Task Force, Sept. 1997.
8. S. Sathaye, "ATM forum traffic management specification version 4.0," ATM Forum 95-0013, Dec. 1995.
9. P. Samudra, "ATM user-network interface (UNI) signalling specification version 4.0," ATM Forum 95-1434, Dec. 1995.
10. G. Apostolopoulos, R. Guérin, and S. Kamat, "Implementation and performance measurements of QoS routing extensions to OSPF," in Proc. INFOCOM, New York, NY, Mar. 1999, pp. 680-688.
11. J. Moy, OSPF version 2, Request For Comments (Standard) RFC 2178, Internet Engineering Task Force, July 1997.
12. R. Guérin, A. Orda, and D. Williams, "QoS routing mechanisms and OSPF extensions," in Proc. GLOBECOM, Phoenix, AZ, Nov. 1997, pp. 1903-1908.
13. G. Apostolopoulos, R. Guérin, S. Kamat, and S. Tripathi, "Improving QoS routing performance under inaccurate link state information," in Proc. ITC'16, pp. 1351-1362, June 1999.
14. D. H. Lorenz and A. Orda, "QoS Routing in networks with uncertain parameters," IEEE/ACM Trans. Networking, vol. 6, pp. 768-778, Dec. 1998.
15. D. H. Lorenz and A. Orda, "Optimal partition of QoS requirements on unicast paths and multicast trees," in Proc. INFOCOM, New York, NY, Mar. 1999, pp. 246-253.
16. L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks - Performance evaluation and optimization," Comput. Networks, vol. 1, pp. 82-92, 1977.
17. A. Bar-Noy and P. M. Gopal, "Topology distribution cost vs. efficient routing in large networks," in Proc. SIGCOMM, Philadelphia, PA, Sept. 1990, pp. 242-252.
18. W. C. Lee, "Topology aggregation for hierarchical routing in ATM networks," in Proc. SIGCOMM, pp. 82-92, Apr. 1995.
19. W. C. Lee, "Spanning tree methods for link state aggregation in large communication networks," in Proc. INFOCOM, Boston, MA, Apr. 1995, pp. 297-302.
20. U. Gremmelmaier, J. Puschner, M. Winter, and P. Jocher, "Performance evaluation of the PNNI routing protocol using and emulation tool," in Proc. ISS, Toronto, ON, Canada, Sept. 1997, vol. 1, pp. 401-408.
21. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, "Fast network decomposition," in Proc. 11th Ann. Symp. Principles of Distributed Computing, Vancouver, BC, Canada, Aug. 1992, pp. 169-177.
22. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, "Near linear cost sequential and distributed constructions of sparse neighborhood covers," in Proc. 34th Annu. Symp. Foundations of Computer Science, Palo Alto, CA, Nov. 1993, pp. 638-647.
23. N. Linial and M. Saks, "Low diameter graph decompositions," Combinatorica, vol. 13, no. 4, pp. 441-454, 1993.
24. Y. Bartal, "Probabilistic approximation of metric spaces and its algorithmic applications," in Proc. 37th Annu. Symp. Foundations of Computer Science, Burlington, VT, Oct. 1996, pp. 184-193.
25. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, "Fast distributed network decomposition and covers," J. Parallel Distrib. Comput., vol. 39, no. 2, pp. 105-114, Dec. 1996.
26. R. Guérin and A. Orda, "QoS-based routing in networks with inaccurate information: Theory and algorithms," IBM, T. J. Watson Research Center, Yorktown Heights, NY, Res. Rep. RC 20515, July 1996.
27. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," IEEE/ACM Trans. Networking, vol. 2, pp. 137-150, Apr. 1994.
28. L. Georgiadis, R. Guérin, V. Peris, and K. N. Sivarajan, "Efficient network QoS provisioning based on per node traffic shaping," IEEE/ACM Trans. Networking, vol. 4, pp. 482-501, Aug. 1996.
29. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
30. J. B. Rosen, S. Z. Sun, and G. L. Xue, "Algorithms for the quickest path problem," Comput. Oper. Res., vol. 18, pp. 579-584, 1991.
31. A. Orda, "Routing with end to end QoS guarantees in broadband networks," this issue, pp. 365-374.
32. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
33. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks Flows. Englewood Cliffs, NJ: Prentice-Hall, 1993.
34. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
35. N. Megiddo, "Combinatorial optimization with rational objective functions," Math. Oper. Res., vol. 4, pp. 414-424, 1979.
36. R. K. Ahuja, J. L. Batra, and S. K. Gupta, "Combinatorial optimization with rational objective functions: A communication," Math. Oper. Res., vol. 4, p. 314, 1983.