Abstract
In the context of Diffserv networks some services should be characterized by end-to-end quantitative QoS guarantees. In order to provide such guarantees to single flows (or flow aggregates), the end-to-end analysis of delay and loss performance in a Diffserv domain is needed. The impact of jitter should be considered in the performance analysis at the successive nodes along the path of a flow (flow aggregate). Worst-case analysis is a solution to provide deterministic quantitative guarantees, at the price of very low efficiency. As an alternative this paper proposes a probabilistic approach, aimed at providing statistical quantitative guarantees and achieve higher efficiency. The proposed analytical approach is based on the insertion of a discarding device before the FIFO queue, called “dropper”. The purpose of the dropper is to avoid the analysis of the congestion at the burst level in the queue, allowing for the application of an analytical result derived for packet scale conflicts in the modulated ND/D/1 queue. Simulations are presented that validate the analytical bound. Finally numerical results are provided to evaluate the efficiency of the bound in an admission control scheme.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
U. Mocci, J. Roberts, J. Virtamo eds., “Broadband Network Teletraffic”, Final report of action Cost-242, Springer 1996.
I. Norros, J. W. Roberts, A. Simonian, J. T. Virtamo, “The Superposition of Variable Bit Rate Sources in an ATM Multiplexer”, IEEE JSACApril 1991, pp. 378–387.
M. Listanti, F. Ricciato, S. Salsano, “Delivering End-to-end Statistical QoS Guarantees for Expedited Forwarding”, SPECTS 2000, Vancouver.
M. Listanti, F. Ricciato, S. Salsano, L. Veltri “Worst-Case Analysis for Deterministic Allocation in a Differentiated Services Network” To appear in IEEE Globecom 2000, S. Francisco, USA, November 2000.
A. Charny “Delay bounds in a network with aggregate scheduling”, Draft version 3, 2/99, Cisco, Available from ftp://ftpeng.cisco.com/acharny/aggregate_delay.ps
J. Y. Le Boudec “A proven delay bound for a network with Aggregate Scheduling” EPFL-DCS Technical Report DSC2000/002, http://ica1www.epfl.ch/PS_files/ds2.pdf.
G. Bianchi, R. Melen, “Effects of multiple nodes crossing on ATM traffic Performance”, European Transaction on Telecommunications, Jan–Feb 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Listanti, M., Ricciato, F., Salsano, S. (2001). An Upper Bound to the Loss Probability in the Multiplexing of Jittered Flows. In: Marsan, M.A., Bianco, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2001. Lecture Notes in Computer Science, vol 1989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44554-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-44554-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41512-1
Online ISBN: 978-3-540-44554-8
eBook Packages: Springer Book Archive