A routing framework for load balancing of bandwidth sensitive traffic in differentiated service networks
暂无分享,去创建一个
[1] Clifford Stein,et al. Approximation Algorithms for Single-Source Unsplittable Flow , 2001, SIAM J. Comput..
[2] Ying Wang,et al. Quantitative Study of Differentiated Service Model Using UltraSAN , 2001 .
[3] Nasser Yazdani,et al. ADPQ: an adaptive approach for expedited forwarding traffic scheduling , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).
[4] Klara Nahrstedt,et al. Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[5] Whay C. Lee,et al. Topology aggregation for hierarchical routing in ATM networks , 1995, CCRV.
[6] Fred Baker,et al. Assured Forwarding PHB Group , 1999, RFC.
[7] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[8] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[9] Van Jacobson,et al. A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.
[10] David L. Black,et al. An Architecture for Differentiated Service , 1998 .
[11] Klara Nahrstedt,et al. Bandwidth sensitive routing in DiffServ networks with heterogeneous bandwidth requirements , 2003, IEEE International Conference on Communications, 2003. ICC '03..
[12] Peter Steenkiste,et al. On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.
[13] Klara Nahrstedt,et al. Hop-by-hop routing algorithms for premium traffic , 2002, CCRV.
[14] R. Braden,et al. Resource reSer Vation Protocol (RSVP) , 1997 .
[15] João L. Sobrinho,et al. Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[16] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[17] Van Jacobson,et al. An Expedited Forwarding PHB , 1999, RFC.
[18] Christos H. Papadimitriou,et al. The complexity of the capacitated tree problem , 1978, Networks.
[19] Stefan Voß,et al. Capacitated minimum spanning trees: algorithms using intelligent search , 1995 .