research-article

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

Author:

Yuming JiangAuthors Info & Claims

VALUETOOLS '09: Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools

Article No.: 37, Pages 1 - 12

Published: 20 October 2009 Publication History

Abstract

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.

References

[1]

R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn. Statistical service assurances for traffic scheduling algorithms. IEEE J. Select. Areas Commun., 18(12):2651--2664, 2000.

Digital Library

[2]

E. Brockmeyer, H. L. Halstrøm, and A. Jensen. The life and works of A. K. Erlang. Transactions of the Danish Academy of Technical Sciences, 2, 1948.

[3]

A. Burchard, J. Liebeherr, and S. D. Patek. A min-plus calculus for end-to-end statistical service guarantees. IEEE Trans. Information Theory, 52:4105--4114, 2006.

Digital Library

[4]

C. S. Chang. Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Trans. Auto. Control, 39(5):913--931, May 1994.

[5]

C.-S. Chang. On the exponentiality of stochastic linear systems under the max-plus algebra. IEEE Trans. Automatic Control, 41(8):1182--1188, August 1996.

[6]

C.-S. Chang. Performance Guarantees in Communication Networks. Springer-Verlag, 2000.

Digital Library

[7]

C.-S. Chang and Y. H. Lin. A general framework for deterministic service guarantees in telecommunication networks with variable length packets. IEEE Trans. Automatic Control, 46:210--221, 2001.

[8]

F. Ciucu. Network calculus delay bounds in queueing networks with exact solutions. In Proc. ITC 2007.

Digital Library

[9]

F. Ciucu, A. Burchard, and J. Liebeherr. A network service curve approach for the stochastic analysis of networks. IEEE Trans. Information Theory, 52(6):2300--2312, June 2006.

Digital Library

[10]

R. L. Cruz. A calculus for network delay, part I and part II. IEEE Trans. Information Theory, 37(1):114--141, Jan. 1991.

Digital Library

[11]

M. Fidler. An end-to-end probabilistic network calculus with moment generating functions. In Proceedings of IWQoS, 2006.

[12]

P. Goyal, S. S. Lam, and H. M. Vin. Determining end-to-end delay bounds in heterogeneous networks. In Proc. NOSSDAV 1995.

Digital Library

[13]

Y. Jiang. A basic stochastic network calculus. In Proc. ACM SIGCOMM 2006, pages 123--134, 2006.

Digital Library

[14]

Y. Jiang. Network calculus - bridging erlang and the internet. In Annual Report 2008, Q2S Center, NTNU, 2009.

[15]

Y. Jiang and Y. Liu. Stochastic Network Calculus. Springer, 2008.

Digital Library

[16]

Y. Jiang, Q. Yin, Y. Liu, and S. Jiang. Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks. Computer Networks, 53(12):2011--2021, 2009.

Digital Library

[17]

J. Kingman. A martingale inequality in the theory of queues. Proc. Camb. Phil. Soc., 59:359--361, 1964.

[18]

J. Kurose. On computing per-session performance bounds in high-speed multi-hop computer networks. In Proc. ACM SIGMETRICS 1992.

Digital Library

[19]

J.-Y. Le Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queueing Systems for the Internet. Springer-Verlag, 2001.

Digital Library

[20]

K. Lee. Performance bounds in communication networks with variable-rate links. In Proc. ACM SIGCOMM 1995.

Digital Library

[21]

C. Li, A. Burchard, and J. Liebeherr. A network calculus with effective bandwidth. IEEE/ACM Trans. Networking, 15(6):1442--1453, December 2007.

Digital Library

[22]

Y. Liu, C.-K. Tham, and Y. Jiang. Conformance analysis in networks with service level agreements. Computer Networks, 47:885--906, 2005.

Digital Library

[23]

Y. Liu, C.-K. Tham, and Y. Jiang. A calculus for stochastic QoS analysis. Performance Evaluation, 64:547--572, 2007.

Digital Library

[24]

K. Pandit, J. Schmitt, and R. Steinmetz. Network calculus meets queueing theory - a simulation based approach to bounded queues. In Proc. IWQoS 2004.

[25]

A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in intergrated services networks: The single-node case. IEEE/ACM Trans. Networking, 1(3):344--357, 1993.

Digital Library

[26]

D. Stoyan. Comparison Methods for Queues and Other Stochastic Models. John Wiley & Sons, 1983.

[27]

H. H. Tan. Another martingale bound on the waiting-time distribution in GI/G/1 queues. Journal of Applied Probability, 16(2):454--457, 1979.

[28]

J. Xie and Y. Jiang. Stochastic service guarantee analysis based on time-domain models. In Proc. MASCOTS 2009.

[29]

O. Yaron and M. Sidi. Performance and stability of communication network via robust exponential bounds. IEEE/ACM ToN, 1:372--385, 1993.

Digital Library

[30]

L. Zhang. Virtual clock: a new traffic control algorithm for packet switching networks. In Proc. ACM SIGCOMM 1990.

Digital Library

Cited By

Wang HHu JNiu W(2019)RC performance analysis based on model optimization with the aid of network calculusPhotonic Network Communications10.1007/s11107-018-00827-737:2(253-260)Online publication date: 17-May-2019
https://dl.acm.org/doi/10.1007/s11107-018-00827-7
Kobayashi KTakahashi YHorvath ABuchholz PCortellessa VMuscariello LSquillante M(2013)Tractable effective bandwidths for end-to-end evaluation and fractional Brownian motion trafficProceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools10.4108/icst.valuetools.2013.254393(108-117)Online publication date: 10-Dec-2013
https://dl.acm.org/doi/10.4108/icst.valuetools.2013.254393
Kiasari AJantsch ALu Z(2013)Mathematical formalisms for performance evaluation of networks-on-chipACM Computing Surveys10.1145/2480741.248075545:3(1-41)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480755
Show More Cited By

Index Terms

Network calculus and queueing theory: two sides of one coin: invited paper
1. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory
2. Networks
  1. Network services

Recommendations

Robust queueing theory: an initial study using imprecise probabilities

We study the robustness of performance predictions of discrete-time finite-capacity queues by applying the framework of imprecise probabilities. More concretely, we consider the Geo/Geo/1/L model with probabilities of arrival and departure that are no ...
Robust Queueing Theory

We propose an alternative approach for studying queues based on robust optimization. We model the uncertainty in the arrivals and services via polyhedral uncertainty sets, which are inspired from the limit laws of probability. Using the generalized ...
Response times in a two-node queueing network with feedback

The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

VALUETOOLS '09: Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools

October 2009

628 pages

ISBN:9789639799707

General Chair:
Giovanni Stea
University of Pisa, Italy
,
Program Chairs:
Jean Mairesse
University of Paris 7, France
,
José Mendes
University of Aveiro, Portugal

Sponsors

ICST

In-Cooperation

SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)

Brussels, Belgium

Publication History

Published: 20 October 2009

Check for updates

Qualifiers

Research-article

Conference

VALUETOOLS '09

Sponsor:

VALUETOOLS '09: 4th International Conference on Performance Evaluation Methodologies and Tools

October 20 - 22, 2009

Pisa, Italy

Acceptance Rates

VALUETOOLS '09 Paper Acceptance Rate 27 of 71 submissions, 38%;

Overall Acceptance Rate 90 of 196 submissions, 46%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
448
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)3

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang HHu JNiu W(2019)RC performance analysis based on model optimization with the aid of network calculusPhotonic Network Communications10.1007/s11107-018-00827-737:2(253-260)Online publication date: 17-May-2019
https://dl.acm.org/doi/10.1007/s11107-018-00827-7
Kobayashi KTakahashi YHorvath ABuchholz PCortellessa VMuscariello LSquillante M(2013)Tractable effective bandwidths for end-to-end evaluation and fractional Brownian motion trafficProceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools10.4108/icst.valuetools.2013.254393(108-117)Online publication date: 10-Dec-2013
https://dl.acm.org/doi/10.4108/icst.valuetools.2013.254393
Kiasari AJantsch ALu Z(2013)Mathematical formalisms for performance evaluation of networks-on-chipACM Computing Surveys10.1145/2480741.248075545:3(1-41)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480755
Ciucu FSchmitt J(2012)Perspectives on network calculusACM SIGCOMM Computer Communication Review10.1145/2377677.237774742:4(311-322)Online publication date: 13-Aug-2012
https://dl.acm.org/doi/10.1145/2377677.2377747
Ciucu FSchmitt JEggert LOtt JPadmanabhan VVarghese G(2012)Perspectives on network calculusProceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication10.1145/2342356.2342426(311-322)Online publication date: 13-Aug-2012
https://dl.acm.org/doi/10.1145/2342356.2342426
Vastag S(2012)A calculus for SLA delay propertiesProceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance10.1007/978-3-642-28540-0_6(76-90)Online publication date: 19-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28540-0_6

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents