Controlling performance in the congested parts of an asymmetric network using controls and routing
暂无分享,去创建一个
[1] Deep Medhi,et al. QoS routing computation with path caching: a framework and network performance , 2002, IEEE Commun. Mag..
[2] Deep Medhi,et al. Some studies on the impact of dynamic traffic in a QoS-based dynamic routing environment , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.
[3] Deep Medhi,et al. Benefits of traffic engineering using QoS routing schemes and network controls , 2004, Comput. Commun..
[4] Hamid Ahmadi,et al. Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..
[5] Victor S. Frost,et al. Prioritized resource allocation for stressed networks , 2001, TNET.
[6] Ajay D. Kshemkalyani,et al. Network path caching: : Issues, algorithms and a simulation study , 1997, Comput. Commun..
[7] Deep Medhi,et al. Multi-Service Dynamic QoS Routing Schemes with Call Admission Control: A Comparative Study , 2004, Journal of Network and Systems Management.
[8] F. P. Kelly,et al. Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..
[9] Charles Riley,et al. Quality of Service (QoS) , 2020, CCNA Certification Study Guide.
[10] Satish K. Tripathi,et al. Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.
[11] Deep Medhi,et al. Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing , 1997, TNET.
[12] Gerald R. Ash,et al. Dynamic Routing in Telecommunications Networks , 1997 .
[13] Deep Medhi,et al. A case study on evaluating the benefits of MPLS traffic engineering through constraint-based routing and network controls , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).