Efficient QoS partition and routing in multiservice IP networks
暂无分享,去创建一个
[1] Eric S. Crawley,et al. A Framework for QoS-based Routing in the Internet , 1998, RFC.
[2] Eric C. Rosen,et al. Multiprotocol Label Switching Architecture , 2001, RFC.
[3] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[4] Zheng Wang,et al. An Architecture for Differentiated Services , 1998, RFC.
[5] Bezalel Gavish,et al. A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..
[6] Heesang Lee,et al. Preplanned rerouting optimization and dynamic path rerouting for ATM VP restoration , 2000, Telecommun. Syst..
[7] Richard J. Harris,et al. Framework for capacity planning of multiservice IP networks , 2003, Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint.
[8] Ariel Orda,et al. Optimal partition of QoS requirements on unicast paths and multicast trees , 2002, TNET.
[9] Hieu T. Tran,et al. Near-Optimal Allocation of Delay Requirements on Multicast Trees , 2002, INTERWORKING.
[10] David L. Black,et al. An Architecture for Differentiated Service , 1998 .
[11] Richard J. Harris,et al. Dimensioning Method for Multiservice IP Networks to Satisfy Delay QoS Constraints , 2002, INTERWORKING.
[12] Jon Crowcroft,et al. Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..