Traffic conditioner: upper bound for the spacer overflow probability

Authors:
Nathalie Omnès;Annie Gravey;Raymond Marie
Affiliations:
Mitsubishi Electric ITE TCL, 1, allée de Beaulieu, CS 10 806, 35 708 Rennes Cedex 7, France;Département informatique, ENST Bretagne, Technopole de Brest Iroise, B.P. 832, 28 285 Brest Cedex, France;Equipe ARMOR, IRISA, Campus universitaire de Beaulieu, 35 042 Rennes Cedex, France
Venue:
Performance Evaluation
Year:
2004

Citing 2
Cited 1

Computer networks (3rd ed.)

Computer networks (3rd ed.)
Network calculus: a theory of deterministic queuing systems for the internet

Network calculus: a theory of deterministic queuing systems for the internet

Call packing bound for overflow loss systems

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The current challenge for telecommunication networks is to offer new types of services. To achieve this, somehow traffic has to be conditioned. A spacer is a token bucket traffic conditioner that reshapes flows according to a periodic profile. Packets are delayed until they can be inserted according to this profile. This short paper concentrates on packet discard by overflow in the spacer. An upper bound for the overflow probability is given, valid even when it is fully loaded. It shows the ratio of discarded packets is of the same order than the ratio of out-of-profile packets.