Buffer overflow asymptotics for multiplexed regulated traffic

By characterizing the worst-case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upper bound in the many-sources regime for the tail distribution of the workload generated by these flows in a FIFO queue wi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Performance evaluation Jg. 65; H. 8; S. 555 - 572
Hauptverfasser: Ying, Y., Guillemin, F., Mazumdar, R., Rosenberg, C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.07.2008
Schlagworte:
Better than Poisson
Network calculus
Statistical multiplexing
Network calculus
Better than Poisson
Statistical multiplexing
ISSN:0166-5316, 1872-745X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:By characterizing the worst-case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upper bound in the many-sources regime for the tail distribution of the workload generated by these flows in a FIFO queue with constant service rate. Furthermore, we compare this workload distribution with an M / G / 1 queue and get insights on the better-than-Poisson property of regulated flows. We conclude that the superposition of independent regulated flows generates an asymptotically smaller workload than a marked Poisson process whose service times and intensity depend on the parameters of regulated sources.
ISSN:0166-5316
1872-745X
DOI:10.1016/j.peva.2007.10.004