PCN-Based Flow Termination with Multiple Bottleneck Links
暂无分享,去创建一个
[1] Michael Menth,et al. PCN-based marked flow termination , 2011, Comput. Commun..
[2] John Wroclawski,et al. Specification of the Controlled-Load Network Element Service , 1997, RFC.
[3] Michael Menth,et al. A Survey of PCN-Based Admission Control and Flow Termination , 2010, IEEE Communications Surveys & Tutorials.
[4] Philip Eardley,et al. Pre-Congestion Notification (PCN) Architecture , 2009, RFC.
[5] Michael Menth,et al. Threshold configuration and routing optimization for PCN-based resilient admission control , 2009, Comput. Networks.
[6] Lixia Zhang,et al. A Framework for Integrated Services Operation over Diffserv Networks , 2000, RFC.
[7] Michael Menth,et al. PCN-based measured rate termination , 2010, Comput. Networks.
[8] Michael Menth,et al. Comparison of Marking Algorithms for PCN-Based Admission Control , 2011, MMB.
[9] Michael Menth,et al. Marking Conversion for Pre-Congestion Notification , 2009, 2009 IEEE International Conference on Communications.
[10] Michael Menth,et al. Performance Evaluation of PCN-Based Admission Control , 2008, 2008 16th Interntional Workshop on Quality of Service.
[11] Xinyang Zhang,et al. Performance Evaluation of Pre-Congestion Notification , 2008, 2008 16th Interntional Workshop on Quality of Service.
[12] Christophe Diot,et al. An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[13] Michael Menth,et al. Efficiency of PCN-Based Network Admission Control with Flow Termination , 2007, Prax. Inf.verarb. Kommun..