Link Capacity Distributions and Optimal Capacities for Competent Network Performance

This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate packet flow probability mass function at any arbitrary edge of the network for a given routing algorithm and traffic rate. We further discuss techniques of assigning optimal capacity at each edge for attaining desired minimized congestion and discuss related trade-offs. Our framework is built around the assumption of Poisson traffic, however the numerical approach fits for any general distribution of packet influx. Lastly, we define metrics of global performance of link capacities allocation and discuss the effect of network structure on capacity allocation and performance.

[1]  Panos M. Pardalos,et al.  On the minimization of traffic congestion in road networks with tolls , 2017, Ann. Oper. Res..

[2]  Sheng Xu,et al.  Consensus Congestion Control in Multirouter Networks Based on Multiagent System , 2017, Complex..

[3]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[4]  Sun Ye,et al.  Research on Urban Road Traffic Congestion Charging Based on Sustainable Development , 2012 .

[5]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[6]  Michel Mandjes,et al.  Dimensioning network links: a new look at equivalent bandwidth , 2009, IEEE Network.

[7]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[8]  Nong Ye,et al.  Onset of traffic congestion in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Mohammed Alasmar,et al.  Network Link Dimensioning based on Statistical Analysis and Modeling of Real Internet Traffic , 2017, ArXiv.

[10]  Richard Steinberg,et al.  PREVALENCE OF BRAESS' PARADOX , 1983 .

[11]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

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

[13]  A. Atamtūrk,et al.  On Capacity Models for Network Design , 2017, 1711.10147.

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