Abstract
In this paper, an analytic approximation is derived for the end-to-end delay-jitter incurred by a periodic traffic with constant packet size. The single node case is considered first. It is assumed that the periodic traffic is multiplexed with a background packet stream under the FCFS service discipline. The processes governing the packet arrivals and the packet sizes of the background traffic are assumed to be general renewal processes. A very simple analytical approximation is derived and its accuracy is assessed by means of event-driven simulations. This approximation is then extended to the multiple node case yielding a simple analytical approximation of the end-to-end jitter. This approximation is shown to be fairly accurate in the light to moderate traffic conditions typically encountered in IP core networks.
Similar content being viewed by others
References
J. Abate, G.L. Choudhury and W. Whitt, Asymptotics for steady-state tail probabilities in structured Markov queueing models, Stoch. Models 10 (1994) 99–143.
J. Abate, G.L. Choudhury and W. Whitt, Exponential approximations for tail probabilities in queues, I: Waiting times, Operations Research 43(5) (1995).
H. Alshaer and E. Horlait, Expedited forwarding end to end delay jitter in the differentiated services networks, in: Proceedings of HSNMC 2004 (2004) .
P.E. Boyer, F.M. Guillemin, M.J. Servel, et al., Spacing cells protects and enhances utilization of ATM network links, IEEE Network 6 (1992).
P.T. Brady, A Model for generating ON-OFF speech patterns in two-way conversations, Bell System Technology Journal 48 (1969).
R. Cruz, A calculus for network delay, Part I: Network elements in isolation, IEEE Trans. on Inf. Theory 37 (1991).
R. Cruz, A calculus for network delay, Part II: Network analysis, IEEE Trans. on Inf. Theory 37 (1991).
A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single node case, IEEE/ACM Trans. on Networking 1 (1993).
A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE/ACM Trans. on Networking 1 (1993).
J. Kurose, On computing per-session performance bounds in high-speed multi-hop computer networks, in: Proceedings ACM SIGMETRICS’92 (1992).
O. Yaron, and M. Sidi, Calculating performance bounds in communication networks, in: Proceedings IEEE INFOCOM’93 (San Francisco, 1993).
I. Cidon, A. Khamisy and M. Sidi, Dispersed messages in discrete-time queues: delay, jitter and threshold crossing, in: IEEE INFOCOM (Toronto, Canada, 1994).
D. Ferrari, Delay jitter control scheme for packet-switching internetworks, Computer Communications 15(6) (1992) 367–373.
F. Guillemin and J.W. Roberts, Jitter and bandwidth enforcement, in: IEEE GLOBECOM, (9.3), Phoenix, Arizona (1991) pp. 261–265.
F. Guillemin and W. Monin, Limitation of cell delay variation in ATM networks, in: Proceedings of ICCT’92, (Beijing, 1992).
F. Guillemin, P. Boyer, A. Dupuis, et al., Peak rate enforcement in ATM networks, in: IEEE INFOCOM, (Florence, Italy, 1992).
H. Heffes and D.M. Lucantoni, A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance, IEEE Journ. of Selected Areas in Communications (1986) 856–867.
S. Lam and G. Xie, Burst scheduling: Architecture and algorithm for switching packet video, in: IEEE INFOCOM, (Boston, Massachussets, 1995).
R. Landry and I. Stavrakakis, Traffic shaping of a tagged stream in an ATM network: Approximate end-to-end analysis, in: IEEE INFOCOM (Boston, Massachussets, 1995).
R. Landry and I.Stavrakakis, Study of delay jitter with and without peak rate enforcement, IEEE/ACM Transactions on Networking 5 (1997).
S.Q. Li and C. Fulton, Delay jitter first-order statistics of general traffic on high-speed networks, in: IEEE ICC (Dallas, Texas, 1996).
Z. Liu, P. Nain and D. Towsley, Exponential bounds with applications to call admission, Journal of the ACM, 44(3) (1997).
W. Matragi, C. Bisdikian and K. Sohraby, Jitter calculus in ATM networks: single node case, in: Proceedings IEEE Infocom, Toronto, Canada, 1994.
W. Matragi, K. Sohraby and C. Bisdikian, A framework for jitter analysis in cell based multiplexors, Performance Evaluation 22 (1996).
W. Matragi, K. Sohraby and C. Bisdikian, Jitter calculus in ATM networks: Multiple node case, IEEE/ACM Transactions on Networking 5 (1997).
A. Privalov and K. Sohraby, Per-stream jitter analysis in CBR ATM multiplexors, IEEE/ACM Transactions on Networking 6 (1998) 2.
J.W. Roberts, Jitter due to an ATM multiplex—application to peak rate policing, Technical Report COST 224-35, RACE Cost Project (1989).
J.W. Roberts and F. Guillemin, Jitter in ATM networks and its impact on peak rate enforcement, Performance Evaluation 16 (1992) 35–48.
L.P. Seelen, H.C. Tijms and M.H. Van Hoorn, Tables for Multi-Server Queues (North-Holland, Amsterdam, 1985) pp. 35–48.
K. Sriram and W. Whitt, Characterizing superposition arrival processes in packet multiplexers for voice and data, IEEE Journal of Selected Areas in Communications (1986) 833–846.
H.C. Tijms, Stochastic Modeling and Analysis: A Computational Approach (John Wiley, New York, 1986) pp. 35–48
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Brun, O., Bockstal, C. & Garcia, JM. Analytic approximation of the jitter incurred by CBR traffics in IP networks. Telecommun Syst 33, 23–45 (2006). https://doi.org/10.1007/s11235-006-9005-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-006-9005-1