Modeling and Performance Analysis of Networks with Flow Transformations

Data flows in modern networks have exhibited increasingly complex prospect along with the evolving network infrastructures and emerging diverse applications. Performance evaluation must adequately consider this trend. The tractable queueing network as a traditional theoretical tool for performance evaluation can not satisfy the new requirement anymore. One reason is that the important assumption of queueing theory, i.e. Poisson arrivals, does not further hold accurate for many networks, within which the flows are more bursty, self-similar, or long-range dependent. Many alternative methodologies to the classical queueing theory appeared. Network calculus, over two decades after Cruz’s pioneer work in 1991, has established itself as one promising theoretical tool for assessing this kind of networks. It can deal with problems that are fundamentally hard for queueing theory based on the fact that it works with (probabilistic) bounds rather than striving for exact solutions. The complexity of network flows attributes itself not only to the upgrading infrastructure and enlarging number of users but also to the operations onto the flows caused by various algorithms, protocols, services, and even network topologies. The flows might be altered due to the operations along the path from source to destination, e.g., in a lossy network, being transcoded, randomly routed, or somehow processed for certain purpose like improving energy efficiency. This is called flow transformation. It is a great challenge for the existing queueing methodologies, including network calculus. One reason is, the basic assumption that the system is lossless when defining the performance metric delay, does not hold anymore. The other is, usually these flow transformations are random. This thesis addresses an extension of the network calculus to deal with the random flow transformations and provides the performance evaluation. The thesis mainly comprises of three inter-connected parts. The first is to develop the so-called stochastic data scaling elements to model the flow

[1]  Nick McKeown,et al.  Optimal load-balancing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[3]  Cheng-Shang Chang.  On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering , 1998, IEEE Trans. Inf. Theory.

[4]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[5]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .

[6]  Ivan Martinovic,et al.  A Self-adversarial Approach to Delay Analysis under Arbitrary Scheduling , 2010, ISoLA.

[7]  Jörg Liebeherr,et al.  Stochastic Bandwidth Estimation in Networks With Random Service , 2014, IEEE/ACM Transactions on Networking.

[8]  Utz Roedig,et al.  Sensor Network Calculus with Multiple Sinks , 2006 .

[9]  Cheng-Shang Chang,et al.  A time varying filtering theory for constrained traffic regulation and dynamic service guarantees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  Florin Ciucu,et al.  End-to-end delay analysis for networks with partial assumptions of statistical independence: invited paper , 2009, VALUETOOLS.

[11]  Henrik Schiøler,et al.  CyNC: a MATLAB/SimuLink toolbox for network calculus , 2007, VALUETOOLS.

[12]  Ivan Martinovic,et al.  Dynamic demultiplexing in network calculus - Theory and application , 2011, Perform. Evaluation.

[13]  Bruno Gaujal,et al.  Packetization and packet curves in network calculus , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[14]  N. McKeown,et al.  Designing a Predictable Internet Backbone Network , 2004 .

[15]  Chengzhi Li,et al.  A Network Calculus With Effective Bandwidth , 2007, IEEE/ACM Transactions on Networking.

[16]  Almut Burchard,et al.  A Min-Plus Calculus for End-to-End Statistical Service Guarantees , 2006, IEEE Transactions on Information Theory.

[17]  Wu-chun Feng,et al.  A systematic approach for providing end-to-end probabilistic QoS guarantees , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[18]  Simonetta Balsamo,et al.  A survey of product form queueing networks with blocking and their equivalences , 1994, Ann. Oper. Res..

[19]  Jens B. Schmitt,et al.  On the Way to a Wireless Network Calculus – The Single Node Case with Retransmissions , 2010 .

[20]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[21]  R. Agrawal,et al.  Performance Bounds for Flow Control Protocols 1 , 1998 .

[22]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[23]  Florin Ciucu,et al.  On Q(H log H) Scaling of Network Delays , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[24]  Felix Poloczek,et al.  Scheduling analysis with martingales , 2014, Perform. Evaluation.

[25]  Ness B. Shroff,et al.  Improved loss calculations at an ATM multiplexer , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[26]  E. O. Elliott.  Estimates of error rates for codes on burst-noise channels , 1963 .

[27]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[28]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.

[29]  George C. Polyzos,et al.  Scheduling for quality of service guarantees via service curves , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[30]  Jens B. Schmitt,et al.  Statistical response time bounds in randomly deployed wireless sensor networks , 2010, IEEE Local Computer Network Conference.

[31]  Ravi Mazumdar,et al.  Performance Modeling, Loss Networks, and Statistical Multiplexing , 2010, Performance Modeling, Loss Networks, and Statistical Multiplexing.

[32]  Ian F. Akyildiz,et al.  Exact Product Form Solution for Queueing Networks with Blocking , 1987, IEEE Transactions on Computers.

[33]  Cheng-Shang Chang.  Stability, Queue Length and Delay, Part 11: Stochastic Queueing Networks , 1992 .

[34]  Ivan Martinovic,et al.  Improving Performance Bounds in Feed-Forward Networks by Paying Multiplexing Only Once , 2008, MMB.

[35]  Nick Duffield,et al.  Large deviations and overflow probabilities for the general single-server queue, with applications , 1995 .

[36]  L. Tu.  The Life and Works of , 2006 .

[37]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[38]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..

[39]  Felix Poloczek,et al.  Sharp per-flow delay bounds for bursty arrivals: The case of FIFO, SP, and EDF scheduling , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[40]  Richard J. Boucherie,et al.  Product forms for queueing networks with state-dependent multiple job transitions , 1991, Advances in Applied Probability.

[41]  Ilkka Nomos.  On the Use of Fractional Brownian Motion in the Theory of Connectionless Networks , 1995 .

[42]  Eduardo Tovar,et al.  Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[43]  Florin Ciucu,et al.  Non-asymptotic throughput and delay distributions in multi-hop wireless networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[44]  Amr Rizk,et al.  Statistical end-to-end performance bounds for networks under long memory FBM cross traffic , 2010, 2010 IEEE 18th International Workshop on Quality of Service (IWQoS).

[45]  Markus Fidler,et al.  WLC15-2: A Network Calculus Approach to Probabilistic Quality of Service Analysis of Fading Channels , 2006, IEEE Globecom 2006.

[46]  Florin Ciucu,et al.  Network Calculus Delay Bounds in Queueing Networks with Exact Solutions , 2007, ITC.

[47]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[48]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[49]  Chaiwat Oottamakorn,et al.  Effective envelopes: statistical bounds on multiplexed traffic in packet networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[50]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[51]  Shivendra S. Panwar,et al.  A survey of envelope processes and their applications in quality of service provisioning , 2006, IEEE Communications Surveys & Tutorials.

[52]  Jens B. Schmitt,et al.  The DISCO network calculator: a toolbox for worst case analysis , 2006, valuetools '06.

[53]  D. V. Lindley,et al.  The theory of queues with a single server , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[54]  Florin Ciucu,et al.  Non-asymptotic Delay Bounds for Networks with Heavy-Tailed Traffic , 2010, 2010 Proceedings IEEE INFOCOM.

[55]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[56]  Jens B. Schmitt,et al.  Delay Bounds Calculus for Variable Length Packet Transmissions under Flow Transformations , 2014 .

[57]  Florin Ciucu,et al.  A Case for Decomposition of FIFO Networks , 2009, IEEE INFOCOM 2009.

[58]  Lothar Thiele,et al.  Performance evaluation of network processor architectures: combining simulation with analytical estimation , 2003, Comput. Networks.

[59]  Florin Ciucu,et al.  Scaling properties in the stochastic network calculus , 2007 .

[60]  Laurent Massoulié,et al.  Large buffer asymptotics for the queue with fractional brownian input , 1999 .

[61]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[62]  Jens Schmitt,et al.  On Average and Worst Case Behaviour in Non-Preemptive Priority Queueing , 2003 .

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

[64]  Murad S. Taqqu,et al.  On the Self-Similar Nature of Ethernet Traffic , 1993, SIGCOMM.

[65]  Guoqiang Hu,et al.  A calculus for information-driven networks , 2009, 2009 17th International Workshop on Quality of Service.

[66]  Michael A. Beck,et al.  The DISCO stochastic network calculator version 1.0: when waiting comes to an end , 2013, VALUETOOLS.

[67]  Lothar Thiele,et al.  A Comprehensive Worst-Case Calculus for Wireless Sensor Networks with In-Network Processing , 2007, RTSS 2007.

[68]  Ivan Martinovic,et al.  Pay bursts only once holds for (some) non-FIFO systems , 2011, 2011 Proceedings IEEE INFOCOM.

[69]  Markus Fidler,et al.  An End-to-End Probabilistic Network Calculus with Moment Generating Functions , 2005, 200614th IEEE International Workshop on Quality of Service.

[70]  Rene L. Cruz,et al.  A service-curve model with loss and a multiplexing problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[71]  Florin Ciucu,et al.  On expressing networks with flow transformations in convolution-form , 2011, 2011 Proceedings IEEE INFOCOM.

[72]  Erol Gelenbe,et al.  Product form networks with negative and positive customers , 1991 .

[73]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[74]  Michael A. Beck,et al.  On the calculation of sample-path backlog bounds in queueing systems over finite time horizons , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[75]  Florin Ciucu,et al.  A leftover service curve approach to analyze demultiplexing in queueing networks , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[76]  Chuang Lin,et al.  Stochastic Performance Analysis of a Wireless Finite-State Markov Channel , 2013, IEEE Transactions on Wireless Communications.

[77]  Jens B. Schmitt,et al.  Energy-Efficent TDMA Design Under Real-Time Constraints in Wireless Sensor Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[78]  Rene L. Cruz,et al.  SCED+: efficient management of quality of service guarantees , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[79]  Edward W. Knightly,et al.  D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic , 1997, TNET.

[80]  Moshe Sidi,et al.  Performance and stability of communication networks via robust exponential bounds , 1993, TNET.

[81]  Weijia Jia,et al.  Performance of Acyclic Stochastic Networks with Network Coding , 2011, IEEE Transactions on Parallel and Distributed Systems.

[82]  Florin Ciucu,et al.  Performance modelling and analysis of unreliable links with retransmissions using network calculus , 2013, Proceedings of the 2013 25th International Teletraffic Congress (ITC).

[83]  J. R. Jackson.  Networks of Waiting Lines , 1957 .

[84]  Lothar Thiele,et al.  Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[85]  Michael A. Beck,et al.  Towards a statistical network calculus — Dealing with uncertainty in arrivals , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[86]  Ward Whitt,et al.  Waiting-time tail probabilities in queues with long-tail service-time distributions , 1994, Queueing Syst. Theory Appl..

[87]  Yuming Jiang,et al.  Analysis of Stochastic Service Guarantees in Communication Networks: A Server Model , 2005, IWQoS.

[88]  Jens B. Schmitt,et al.  Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch... , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[89]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[90]  Markus Fidler,et al.  Survey of deterministic and stochastic service curve models in the network calculus , 2009, IEEE Communications Surveys & Tutorials.

[91]  A. K. Erlang.  The theory of probabilities and telephone conversations , 1909 .

[92]  Jens B. Schmitt,et al.  End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations , 2014, VALUETOOLS.

[93]  Tor Skeie,et al.  Timeliness of real-time IP communication in switched industrial Ethernet networks , 2006, IEEE Transactions on Industrial Informatics.

[94]  Ivan Martinovic,et al.  The DISCO Network Calculator , 2008, MMB.

[95]  Yuming Jiang.  A basic stochastic network calculus , 2006, SIGCOMM 2006.

[96]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[97]  F. B. Shepherd,et al.  Selective randomized load balancing and mesh networks with changing demands , 2006 .

[98]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[99]  Yuming Jiang,et al.  Analysis on generalized stochastically bounded bursty traffic for communication networks , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[100]  Kim G. Larsen,et al.  Network Calculus for Real Time Analysis of Embedded Systems with Cyclic Task Dependencies , 2005, Computers and Their Applications.

[101]  Nader Mohamed,et al.  A Survey of Load Balancing in Cloud Computing: Challenges and Algorithms , 2012, 2012 Second Symposium on Network Cloud Computing and Applications.

[102]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[103]  Mukesh Taneja.  A service curve approach for quality of service management in integrated services networks , 1998 .

[104]  Florin Ciucu,et al.  A network service curve approach for the stochastic analysis of networks , 2005, SIGMETRICS '05.

[105]  Florin Ciucu,et al.  Perspectives on network calculus: no free lunch, but still good value , 2012, CCRV.

[106]  F. Kelly,et al.  Stochastic networks : theory and applications , 1996 .

[107]  Lothar Thiele,et al.  Workload characterization model for tasks with variable execution demand , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[108]  Gunnar Karlsson,et al.  Performance models of statistical multiplexing in packet video communications , 1988, IEEE Trans. Commun..

[109]  Yashar Ghiassi-Farrokhfal,et al.  On the Impact of Link Scheduling on End-to-End Delays in Large Networks , 2011, IEEE Journal on Selected Areas in Communications.

[110]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[111]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[112]  Rajeev Agrawal,et al.  Ibm Research Report Performance Bounds for Guaranteed and Adaptive Services Performance Bounds for Guaranteed and Adaptive Services , 2007 .

[113]  Ward Whitt,et al.  Squeezing the Most Out of ATM , 1995, IEEE Trans. Commun..

[114]  Rolf Ernst,et al.  System level performance analysis - the SymTA/S approach , 2005 .

[115]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[116]  Chaiwat Oottamakorn,et al.  Statistical service assurances for traffic scheduling algorithms , 2000, IEEE Journal on Selected Areas in Communications.

[117]  James F. Kurose,et al.  On computing per-session performance bounds in high-speed multi-hop computer networks , 1992, SIGMETRICS '92/PERFORMANCE '92.

[118]  Jens B. Schmitt,et al.  On the way to a distributed systems calculus: an end-to-end network calculus with data scaling , 2006, SIGMETRICS '06/Performance '06.

[119]  Florin Ciucu,et al.  Scaling of buffer and capacity requirements of voice traffic in packet networks , 2009, 2009 21st International Teletraffic Congress.

[120]  Lothar Thiele,et al.  Real-time calculus for scheduling hard real-time systems , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[121]  Jennifer C. Hou,et al.  Network calculus based simulation for TCP congestion control: theorems, implementation and evaluation , 2004, IEEE INFOCOM 2004.

[122]  Richard J. Gibbens,et al.  Effective bandwidths for the multi-type UAS channel , 1991, Queueing Syst. Theory Appl..

[123]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[124]  Almut Burchard,et al.  A (min, ×) network calculus for multi-hop fading channels , 2013, 2013 Proceedings IEEE INFOCOM.

[125]  Ramin Yahyapour,et al.  An analytical model for software defined networking: A network calculus-based approach , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[126]  Donald F. Towsley,et al.  Queuing Network Models with State-Dependent Routing , 1980, JACM.

[127]  Yashar Ghiassi-Farrokhfal,et al.  Does Link Scheduling Matter on Long Paths? , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[128]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[129]  Joseph D. Langford,et al.  Models for analysis of packet voice communications systems , 1986, IEEE J. Sel. Areas Commun..

[130]  Florin Ciucu,et al.  A Stochastic Power Network Calculus for Integrating Renewable Energy Sources into the Power Grid , 2012, IEEE Journal on Selected Areas in Communications.

[131]  Amr Rizk,et al.  Sample Path Bounds for Long Memory FBM Traffic , 2010, 2010 Proceedings IEEE INFOCOM.

[132]  Florin Ciucu,et al.  Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic , 2009, IEEE Transactions on Information Theory.

[133]  Yuming Jiang,et al.  Stochastic service curve and delay bound analysis: A single node case , 2013, Proceedings of the 2013 25th International Teletraffic Congress (ITC).

[134]  Jens B. Schmitt,et al.  The DiscoDNC v2 - A Comprehensive Tool for Deterministic Network Calculus , 2014, VALUETOOLS.

[135]  Florin Ciucu,et al.  Scaling properties of statistical end-to-end bounds in the network calculus , 2006, IEEE Transactions on Information Theory.

[136]  RAJ JAIN,et al.  Histograms Without Storing Observations , 1999 .

[137]  Peter G. Taylor,et al.  Product form in networks of queues with batch arrivals and batch services , 1990, Queueing Syst. Theory Appl..

[138]  S. Resnick,et al.  Is network traffic approximated by stable Levy motion or fractional Brownian motion , 2002 .

[139]  Utz Roedig,et al.  Sensor Network Calculus - A Framework for Worst Case Analysis , 2005, DCOSS.

[140]  Moshe Sidi,et al.  Stochastically bounded burstiness for communication networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[141]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[142]  Stephen S. Lavenberg,et al.  Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers , 1980, Journal of Applied Probability.