Congestion Control in Networks with Mixed IP and P2P Traffic

Services such as multimedia, VoIP, video-conferencing, social networking and others impose new requirements on providers and constraints on network designers. Fair Queueing algorithms like CSFQ or Stochastic Fair BLUE have been used to improve the quality of the packet transmission. Such mechanisms usually supervise the bandwidth consumption per-flow and become helpless in the presence of P2P traffic. In quest for high quality transmission, multimedia applications are designed to use more and more P2P paradigms. As P2P traffic is also exposed to congestion, few works address congestion control in mixed traditional IP (for short called IP traffic) and P2P traffic. In this paper, we propose a model flow for the mixture of the two and present a principle and a method based on per-subscriber flow control, for congestion control. An architecture based on the Token-Based Traffic Control for P2P applications is introduced. The token resource consumed by each subscriber is counted and controls for both core and edge routers are generated in the case of IP and P2P traffic. The traffic is measured at core routers and the measurement data is conveyed to edge routers. They label the Token-Level on incoming packets according to the congestion index, and police the total input token of each P2P subscriber. Simulations results and the analysis of the impact on the performance of this approach on some P2P experiments are given.

[1]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

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

[3]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[4]  Scott Shenker,et al.  Self-verifying CSFQ , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  M. Nabeshima Adaptive CSFQ: a new fair queuing mechanism for SCORE networks , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[6]  R. Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM '04.

[7]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[8]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[9]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[11]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[12]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

[13]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[14]  S. Floyd,et al.  Tcp-friendly unicast rate-based flow control , 1997 .

[15]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[16]  Zhiqiang Shi Token-based congestion control: Achieving fair resource allocations in P2P networks , 2008, 2008 First ITU-T Kaleidoscope Academic Conference - Innovations in NGN: Future Network and Services.

[17]  Bob Briscoe,et al.  Flow rate fairness: dismantling a religion , 2007, CCRV.