article

Delay jitter bounds and packet scale rate guarantee for expedited forwarding

Authors:

Jon C. R. Bennett,

William F. Courtney, and

Jean-Yves Le BoudecAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 10, Issue 4

Pages 529 - 540

https://doi.org/10.1109/TNET.2002.801404

Published: 01 August 2002 Publication History

Abstract

We consider the definition of the expedited forwarding per-hop behavior (EF PHB) as given in RFC 2598 and its impact on worst case end-to-end delay jitter. On the one hand, the definition in RFC 2598 can be used to predict extremely low end-to-end delay jitter, independent of the network scale. On the other hand, we find that the worst case delay jitter can be made arbitrarily large, while each flow traverses at most a specified number of hops, if we allow networks to become arbitrarily large; this is in contradiction with the previous statement. We analyze where the contradiction originates and find the explanation. It resides in the fact that the definition in RFC 2598 is not easily implementable in schedulers we know of, mainly because it is not formal enough, and also because it does not contain an error term. We propose a new definition for the EF PHB, called "packet scale rate guarantee" (PSRG) that preserves the spirit of RFC 2598 while allowing a number of reasonable implementations and has very useful properties for per-node and end-to-end network engineering. We show that this definition implies a rate-latency service curve property. We also show that it is equivalent, in some sense, to the stronger concept of "adaptive service guarantee." Then we propose some proven bounds on delay jitter for networks implementing this new definition, both in cases without loss and with loss.

References

[1]

V. Jacobson, K. Nichols, and K. Poduri, "An expedited forwarding PHB," Internet Engineering Task Force (IETF), RFC 2598, June 1999.]]

Digital Library

[2]

V. Jacobson, (2000, Mar.) The virtual wire behavior aggregate. Work in progress. Internet Engineering Task Force (IETF). {Online}. Available: www.ietf.org/internet-drafts/draft-ietf-diffserv-vw-00.txt.]]

[3]

G. Mercankosk. (2000, July) The virtual wire per domain behavior---Analysis and extensions. Work in progress. Internet Engineering Task Force (IETF). {Online}. Available: www.ietf.org/internet-drafts/draft-mercankosk-diffserv-pdb-vw-00.txt.]]

[4]

A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single node case," IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, June 1993.]]

Digital Library

[5]

J.-Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE Trans. Inform. Theory, vol. 44, pp. 1087-1096, May 1998.]]

[6]

C. S. Chang, "On deterministic traffic regulation and service guarantee: A systematic approach by filtering," IEEE Trans. Inform. Theory, vol. 44, pp. 1096-1107, Aug. 1998.]]

[7]

R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan, "Performance bounds for flow control protocols," IEEE/ACM Trans. Networking, vol. 7, pp. 310-323, June 1999.]]

Digital Library

[8]

R. L. Cruz and C. M. Okino, "Service guarantees for window flow control," in Proc. 34th Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 1996.]]

[9]

A. Charny and J.-Y. Le Boudec, "Delay bounds in a network with aggregate scheduling," in Proc. 1st Int. Workshop Quality of Future Internet Services (QofIS'2000), Berlin, Germany, Sept. 2000, pp. 1-13.]]

Digital Library

[10]

J.-Y. Le Boudec and P. Thiran, Network Calculus. Heidelberg, Germany: Springer-Verlag, 2001, Lecture Notes in Computer Science, vol. 2050. {Online.} Available: http://icawww.epfl.ch.]]

[11]

C. S. Chang, Performance Guarantees in Communication Networks. New York: Springer-Verlag, 2000.]]

Digital Library

[12]

J.-Y. Le Boudec, "Some properties of variable length packet shapers," in Proc. ACM SIGMETRICS/Performance'01, 2001, pp. 175-183.]]

Digital Library

[13]

A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," J. Internetworking Res. Experience, pp. 3-26, Oct. 1990.]]

[14]

A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," IEEE/ACM Trans. Networking, vol. 2, pp. 137-150, Apr. 1994.]]

Digital Library

[15]

J. C. R. Bennett and H. Zhang, "WF2Q: Worst-case fair weighted fair queueing," in Proc. IEEE INFOCOM, vol. 1, Mar. 1996, pp. 120-128.]]

[16]

M. Vojnovic and J.-Y. Le Boudec. (2001, July) Stochastic analysis of some expedited forwarding networks. EPFL-DSC. {Online}. Available: http://dscwww.epfl.ch./EN/publications/documents/tr01_039.pdf.]]

[17]

H. Zhang, "Service disciplines for guaranteed performance service in packet switching networks," Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.]]

[18]

C. S. Chang, "Stability, queue length and delay, part I: Deterministic queueing networks," IBM, Tech. Rep. RC 17708, 1992.]]

[19]

L. Tassiulas and L. Georgiadis, "Any work conserving policy stabilizes the ring with spatial reuse," IEEE/ACM Trans. Networking, vol. 4, pp. 205-208, Apr. 1996.]]

Digital Library

[20]

M. Andrews, "Instability of FIFO in session-oriented networks," in Proc. 11th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA 2000), San Francisco, CA, Jan. 2000, pp. 440-447.]]

Digital Library

[21]

J.-Y. Le Boudec and G. Hebuterne, "Comment on a deterministic approach to the end-to-end analysis of packet flows in connection oriented network," IEEE/ACM Trans. Networking, vol. 8, pp. 121-124, Feb. 2000.]]

Digital Library

[22]

I. Chlamtac, A. Faragó, H. Zhang, and A. Fumagalli, "A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks," IEEE/ACM Trans. Networking, vol. 6, pp. 422-431, Aug. 1998.]]

Digital Library

[23]

Y. Jiang, "Delay bounds for a network of guaranteed rate servers with FIFO aggregation," National University of Singapore, preprint, 2001.]]

[24]

C. M. Chuang and J. F. Chang, "Deterministic loss ratio quality of service guarantees for high-speed networks," IEEE Commun. Lett., vol. 4, pp. 236-238, July 2000.]]

[25]

T. Chahed, G. Hebuterne, and C. Fayet, "Mapping of loss and delay between IP and ATM using network calculus," in Proc. Networking 2000, Paris, France, May 2000, pp. 240-251.]]

Digital Library

[26]

R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, "Statistical service assurances for traffic scheduling algorithms," IEEE J. Select. Areas Commun., vol. 3, pp. 1223-1232, 2000.]]

[27]

M. Vojnovic and J.-Y. Le Boudec, "Bounds for independent regulated inputs multiplexed in a service curve network element," in Proc. GLOBECOM, vol. 3, Nov. 2001, pp. 1857-1861.]]

[28]

J.-Y. Le Boudec and A. Charny. (2001, July) Packet scale rate guarantee for non-FIFO nodes. EPFL-DSC. {Online}. Available: http://dscwww.epfl.ch./EN/publications/documents/tr01_038.pdf.]]

[29]

R. L. Cruz, "A calculus for network delay, part II: Network analysis," IEEE Trans. Inform. Theory, vol. 37, pp. 132-141, Jan. 1991.]]

Digital Library

[30]

R. L. Cruz, "Quality of service guarantees in virtual circuit switched networks," IEEE J. Select. Areas Commun., pp. 1048-1056, Aug. 1995.]]

Digital Library

Cited By

Zippo RStea G(2023)Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks With Network CalculusIEEE Transactions on Information Theory10.1109/TIT.2023.324427669:4(2664-2690)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3244276
Zippo RNikolaus PStea G(2023)Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and compositionDiscrete Event Dynamic Systems10.1007/s10626-022-00373-533:3(181-219)Online publication date: 18-Aug-2023
https://dl.acm.org/doi/10.1007/s10626-022-00373-5
Zhang JChen LWang TWang X(2019)Analysis of TSN for Industrial Automation based on Network Calculus2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)10.1109/ETFA.2019.8869053(240-247)Online publication date: 10-Sep-2019
https://dl.acm.org/doi/10.1109/ETFA.2019.8869053
Show More Cited By

Index Terms

Delay jitter bounds and packet scale rate guarantee for expedited forwarding
1. Networks
  1. Network types
    1. Packet-switching networks
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Delay bound and packet scale rate guarantee for some expedited forwarding networks

Expedited Forwarding (EF) is a service defined under the Differentiated Services framework. Based on its recently revised definition in IETF RFC 3246, Packet Scale Rate Guarantee (PSRG) is its key construct, with which bounded nodal delay and edge-to-...
Read More
Per-domain packet scale rate guarantee for expedited forwarding

The expedited forwarding per-hop behavior (EF PHB) was recently replaced by a new definition, called packet scale rate guarantee (PSRG), under the Differentiated Services (DiffServ) framework. This replacement raises two challenges. One is the ...
Read More
Per-domain packet scale rate guarantee for expedited forwarding
IWQoS'03: Proceedings of the 11th international conference on Quality of service

The Expedited Forwarding Per-hop Behavior (EF PHB) was recently replaced by a new definition, called Packet Scale Rate Guarantee (PSRG), under the Differentiated Services (DiffServ) framework. This replacement raises two challenges. One is the ...
Read More

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 10, Issue 4

August 2002

148 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 August 2002

Published in TON Volume 10, Issue 4

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
722
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Zippo RStea G(2023)Computationally Efficient Worst-Case Analysis of Flow-Controlled Networks With Network CalculusIEEE Transactions on Information Theory10.1109/TIT.2023.324427669:4(2664-2690)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3244276
Zippo RNikolaus PStea G(2023)Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and compositionDiscrete Event Dynamic Systems10.1007/s10626-022-00373-533:3(181-219)Online publication date: 18-Aug-2023
https://dl.acm.org/doi/10.1007/s10626-022-00373-5
Zhang JChen LWang TWang X(2019)Analysis of TSN for Industrial Automation based on Network Calculus2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)10.1109/ETFA.2019.8869053(240-247)Online publication date: 10-Sep-2019
https://dl.acm.org/doi/10.1109/ETFA.2019.8869053
Le Boudec J(2018)A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved RegulatorsIEEE/ACM Transactions on Networking10.1109/TNET.2018.287519126:6(2721-2733)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2875191
Tomanek OMulinka PKencl L(2016)Multidimensional cloud latency monitoring and evaluationComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2016.06.011107:P1(104-120)Online publication date: 9-Oct-2016
https://dl.acm.org/doi/10.1016/j.comnet.2016.06.011
Jafari FLu ZJantsch A(2015)Least Upper Delay Bound for VBR Flows in Networks-on-Chip with Virtual ChannelsACM Transactions on Design Automation of Electronic Systems10.1145/273337420:3(1-33)Online publication date: 24-Jun-2015
https://dl.acm.org/doi/10.1145/2733374
Karsten M(2011)FIFO Service with Differentiated QueueingProceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems10.1109/ANCS.2011.29(122-133)Online publication date: 3-Oct-2011
https://dl.acm.org/doi/10.1109/ANCS.2011.29
Karsten M(2010)Approximation of generalized processor sharing with interleaved stratified timer wheelsIEEE/ACM Transactions on Networking10.1109/TNET.2009.203305918:3(708-721)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1109/TNET.2009.2033059
Bisti LLenzini LMingozzi EStea GBaras J(2008)Estimating the worst-case delay in FIFO tandems using network calculusProceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools10.4108/ICST.VALUETOOLS2008.4388(1-10)Online publication date: 20-Oct-2008
https://dl.acm.org/doi/10.4108/ICST.VALUETOOLS2008.4388
Bouillard AJouhet LThierry EBaras J(2008)Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysisProceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools10.4108/ICST.VALUETOOLS2008.4349(1-7)Online publication date: 20-Oct-2008
https://dl.acm.org/doi/10.4108/ICST.VALUETOOLS2008.4349
Show More Cited By

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents