PCN-based measured rate termination

Overload in a packet-based network can be prevented by admitting or blocking new flows depending on its load conditions. However, overload can occur in spite of admission control due to unforseen events, e.g., when admitted traffic is rerouted in the network after a failure. To restore quality of service for the majority of admitted flows in such cases, flow termination has been proposed as a novel control function. We present several flow termination algorithms that measure so-called pre-congestion notification (PCN) feedback. We analyze their advantages and shortcomings in particular under challenging conditions. The results improve the understanding of PCN technology which is currently being standardized by the Internet Engineering Task Force (IETF).

[1]  Jean-Yves Le Boudec,et al.  SRP: a scalable resource reservation protocol for the Internet , 1998, Comput. Commun..

[2]  Bob Briscoe.  PCN 3-State Encoding Extension in a single DSCP , 2009 .

[3]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[4]  Priyadarsi Nanda,et al.  Resource Management in Differentiated Services Networks , 2002, INTERWORKING.

[5]  Michael Menth,et al.  Comparison of Marking Algorithms for PCN-Based Admission Control , 2011, MMB.

[6]  Raj Jain,et al.  Analytical Model of Pre-Congestion Notification ( PCN ) for Multimedia Traffic over DiffServ Domains , 2008 .

[7]  Michael Menth,et al.  Marking Conversion for Pre-Congestion Notification , 2009, 2009 IEEE International Conference on Communications.

[8]  Michael Menth,et al.  A PCN encoding using 2 DSCPs to provide 3 or more states , 2012 .

[9]  Michael Menth,et al.  PCN-Based Flow Termination with Multiple Bottleneck Links , 2009, 2009 IEEE International Conference on Communications.

[10]  David L. Black,et al.  The Addition of Explicit Congestion Notification (ECN) to IP , 2001, RFC.

[11]  Michael Menth,et al.  Performance Evaluation of PCN-Based Admission Control , 2008, 2008 16th Interntional Workshop on Quality of Service.

[12]  Jens B. Schmitt,et al.  Packet marking for integrated load control , 2005, 2005 9th IFIP/IEEE International Symposium on Integrated Network Management, 2005. IM 2005..

[13]  Michael Menth,et al.  PCN Encoding for Packet-Specific Dual Marking (PSDM) , 2008 .

[14]  Lixia Zhang,et al.  A Framework for Integrated Services Operation over Diffserv Networks , 2000, RFC.

[15]  Piet Demeester,et al.  An autonomic PCN based admission control mechanism for video services in access networks , 2009, 2009 IFIP/IEEE International Symposium on Integrated Network Management-Workshops.

[16]  Michael Menth,et al.  PCN-based marked flow termination , 2011, Comput. Commun..

[17]  Xinyang Zhang,et al.  Performance Evaluation of Pre-Congestion Notification , 2008, 2008 16th Interntional Workshop on Quality of Service.

[18]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[19]  Richard J. Gibbens,et al.  Distributed connection acceptance control for a connectionless network , 1999 .

[20]  Michael Menth,et al.  A Survey of PCN-Based Admission Control and Flow Termination , 2010, IEEE Communications Surveys & Tutorials.

[21]  Michael Menth,et al.  Threshold configuration and routing optimization for PCN-based resilient admission control , 2009, Comput. Networks.

[22]  Philip Eardley,et al.  Pre-Congestion Notification (PCN) Architecture , 2009, RFC.

[23]  Philip Eardley,et al.  Metering and Marking Behaviour of PCN-Nodes , 2009, RFC.

[24]  Sally Floyd,et al.  Specifying Alternate Semantics for the Explicit Congestion Notification (ECN) Field , 2006, RFC.

[25]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[26]  Stan Zachary,et al.  Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.

[27]  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).

[28]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[29]  Michael Menth,et al.  Efficiency of PCN-Based Network Admission Control with Flow Termination , 2007, Prax. Inf.verarb. Kommun..

[30]  Michael Menth,et al.  Baseline Encoding and Transport of Pre-Congestion Information , 2009, RFC.

[31]  Michael Menth,et al.  Internet Engineering Task Force (ietf) Pre-congestion Notification (pcn) Boundary-node Behavior for the Single Marking (sm) Mode of Operation , 2022 .

[32]  David Wetherall,et al.  Robust Explicit Congestion Notification (ECN) Signaling with Nonces , 2003, RFC.

[33]  Tamás Henk,et al.  RESOURCE MANAGEMENT IN DIFFERENTIATED SERVICES ( RMD ) IP NETWORKS , 2022 .

[34]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[35]  Michael Menth,et al.  Performance evaluation of termination in CL-algorithm , 2009 .

[36]  Michael Menth,et al.  Internet Engineering Task Force (ietf) Pre-congestion Notification (pcn) Boundary-node Behavior for the Controlled Load (cl) Mode of Operation , 2022 .

[37]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[38]  John Wroclawski,et al.  Specification of the Controlled-Load Network Element Service , 1997, RFC.

[39]  Martin Karsten,et al.  Darmstadt University of Technology Admission Control based on Packet Marking and Feedback Signalling – Mechanisms , Implementation and Experiments , 2002 .

[40]  Michael Menth,et al.  Capacity overprovisioning for networks with resilience requirements , 2006, SIGCOMM.