Delay jitter bounds and packet scale rate guarantee for expedited forwarding

IEEE/ACM Transactions on Networking - Tập 10 Số 4 - Trang 529-540 - 2002
J.C.R. Bennett1, K. Benson2, A. Charny3, W.F. Courtney4, J.-Y. Le Boudec5
1River Delta Networks, Tewkesbury, MA, UK
2Tellabs Research Center, Mishawaka, IN, USA
3Cisco, Inc., Chelmsford, MA, USA
4TRW, Inc., Redondo Beach, CA, USA
5EPFL-DSC, Lausanne, Switzerland

Tóm tắt

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, 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 known schedulers, 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 in cases without loss and with loss.

Từ khóa

#Delay #Jitter #Traffic control #Aggregates #Bandwidth #Telecommunication traffic #Diffserv networks #Context-aware services #Spine #Electronic mail

Tài liệu tham khảo

10.1109/49.400660 le boudec, 2001, Network Calculus, 10.1007/3-540-45318-0 10.1007/978-1-4471-0459-9 le boudec, 2001, some properties of variable length packet shapers, Proc ACM SIGMETRICS/Performance 01, 175, 10.1145/384268.378780 demers, 1990, analysis and simulation of a fair queueing algorithm, J Internetworking Res Experience, 3 10.1109/90.298432 10.1109/INFCOM.1996.497885 vojnovic, 2001, Stochastic analysis of some expedited forwarding networks 10.1109/5.469298 chang, 1992, Stability queue length and delay part I Deterministic queueing networks 10.1109/90.490748 le boudec, 2001, Packet scale rate guarantee for non-FIFO nodes 10.1109/90.234856 10.1109/GLOCOM.2001.965896 mercankosk, 2000, The virtual wire per domain behavior&#x2014 Analysis and extensions Work in progress 10.1109/18.669173 10.1109/18.61110 10.1109/18.669170 cruz, 1996, service guarantees for window flow control, Proc 34th Allerton Conf Communication Control and Computing 10.1109/90.779197 jacobson, 2000, The virtual wire behavior aggregate Work in progress charny, 2000, delay bounds in a network with aggregate scheduling, Proc 1st Int Workshop Quality of Future Internet Services (QofIS 2000), 1, 10.1007/3-540-39939-9_1 10.17487/rfc2598 10.1016/S0196-6774(03)00096-8 10.1109/90.720877 10.1109/90.836483 10.1109/4234.852927 jiang, 2001, Delay bounds for a network of guaranteed rate servers with FIFO aggregation 10.1109/49.898747 chahed, 2000, mapping of loss and delay between ip and atm using network calculus, Proc Networking 2000, 240