Network calculus and queueing theory: two sides of one coin: invited paper

Network calculus is a theory dealing with queueing type problems encountered in computer networks, with particular focus on quality of service guarantee analysis. Queueing theory is the mathematical study of queues, proven to be applicable to a wide area of problems, generally concerning about the (average) quantities in an equilibrium state. Since both network calculus and queueing theory are analytical tools for studying queues, a question arises naturally as is if and where network calculus and queueing theory meet. In this paper, we explore queueing principles that underlie network calculus and exemplify their use. Particularly, based on the network calculus queueing principles, we show that for GI/GI/1, similar inequalities in the theory of queues can be derived. In addition, we prove that the end-to-end performance of a tandem network is independent of the order of servers in the network even under some general settings. Through these, we present a network calculus perspective on queues and relate network calculus to queueing theory.

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

[2]  Yuming Jiang,et al.  Stochastic service guarantee analysis based on time-domain models , 2009, 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems.

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

[4]  Harry H. Tan.  Another martingale bound on the waiting-time distribution in GI/G/1 queues , 1979 .

[5]  J. Kingman.  A martingale inequality in the theory of queues , 1964 .

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

[7]  Ralf Steinmetz,et al.  Network calculus meets queueing theory -a simulation based approach to bounded queues , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

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

[9]  Yong Liu,et al.  Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks , 2009, Comput. Networks.

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

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

[12]  Yong Liu,et al.  A calculus for stochastic QoS analysis , 2007, Perform. Evaluation.

[13]  Cheng-Shang Chang,et al.  A general framework for deterministic service guarantees in telecommunication networks with variable length packets , 2001, IEEE Trans. Autom. Control..

[14]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[15]  Yong Liu,et al.  Stochastic Network Calculus , 2008 .

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

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

[18]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[19]  Chen-Khong Tham,et al.  Conformance analysis in networks with service level agreements , 2005, Comput. Networks.

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

[21]  Kam Lee,et al.  Performance bounds in communication networks with variable-rate links , 1995, SIGCOMM '95.

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

[23]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[24]  Arne Jensen,et al.  The life and works of A. K. Erlang , 1960 .

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

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

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

[28]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.

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

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

[31]  Cheng-Shang Chang,et al.  On the exponentiality of stochastic linear systems under the max-plus algebra , 1996, IEEE Trans. Autom. Control..