Bandwidth sensitive routing in diffServ networks with heterogeneous bandwidth requirements

IEEE International Conference on Communications

Volumn 1, Issue , 2003, Pages 188-192

  Wang, Jun ^a   Xiao, Li ^a   Lui, King Shan ^a   Nahrstedt, Klara ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER SIMULATION; COST EFFECTIVENESS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC;

SMALL SCALE NETWORKS;

COMPUTER NETWORKS;

EID: 0038391312     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. S.Blake et. al., "An Architecture for Differentiated Services," RFC 2475, December 1998.
2. K.Nichols, V.Jacobson, and L.Zhang, "A Two-bit Differentiated Services Architecture for the Internet," RFC 2638, July 1999.
3. Jun Wang and Klara Nahrstedt, "Hop-by-Hop Routing Algorithms For Premium-class Traffic In DiffServ Networks," in Proceedings of IEEE Infocom 2002 (to appear), June 2002.
4. J.L. Sobrinho, "Algebra and algorithms for QoS path computation and hop-by-hop routing in the Inernet," in IEEE INFOCOM 2001, Anchorage, Alaska, April 2001, pp. 727-735.
5. J. Wang, Y. Wang, and K. Nahrstedt, "Quantitative Study of Differentiated Service Model Using UltraSAN," Tech. Report UIUCDCS- R-2001-2237, Department of Computer Science, University of Illinois at Urbana-Champaign, July 2001.
6. A. Amberg and W. Domschke, "Capacitated minimum spanning trees: Algorithms using intelligent search," Combinatorial Optimization: Theory and Practice, vol. 1, pp. 9-39, Summer.
7. C.H. Papadimitriou, "The complexity of the capacitated tree problem," Networks, vol. 8, pp. 217 - 230, 1978.
8. Leslie Hall, "Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem," INFORMS Journal on Computing, vol. 8, no. 3, Summer 1996.
9. B. Gavish, "Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem," Journal of the ACM, vol. 30, pp. 118-132, 1983.
10. "Ilog cplex," in http://www.ilog.com/products/cplex/.
11. Q. Ma and P. Steenkiste, "On path selection for traffic with bandwidth guarantees," in 5th IEEE International Conference on Network Protocols, Atlanta, GA, October 1997, pp. 191 - 202.
12. A. Medina, A. Lakhina, I. Matta, and J. Byers, "Brite: An approach to universal topology generation," in Proceedings of the International Workshop on MASCOTS '01, Cincinnati, Ohio, August 2001.
13. S. Chen and K. Nahrstedt, "An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions," IEEE Network, Special Issue on Transmission and Distribution of Digital Video, Nov./Dec. 1998.
14. Q. Ma and P. Steenkiste, "Supporting Dynamic Inter-Class Resource Sharing: A Multi-class QoS Routing Algorithm," in IEEE Proceedings of INFOCOM '99, 1999, pp. 649-660.
15. G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, and T. Przygienda, "QoS Routing Mechanisms and OSPF Extensions," RFC 2676, Aug. 1999.
16. R. Ahuja, "Multi-exchange neighborhood structures for the cmst problem," in Mathematical Programming 91, 2001, pp. 71-97.
17. J.K. Lenstra, D. Shmoys, and E. Tardos, "Approximation algorithms for scheduling unrelated parallel machines," in 28th IEEE FOCS, 1987.
18. J. Kleinberg, Y. Rabani, and E. Tardos, "Fairness in routing and load balancing," in 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 568 - 578.