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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Performance evaluation Ročník 65; číslo 8; s. 555 - 572
Hlavní autoři: Ying, Y., Guillemin, F., Mazumdar, R., Rosenberg, C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.07.2008
Témata:
Better than Poisson
Network calculus
Statistical multiplexing
Network calculus
Better than Poisson
Statistical multiplexing
ISSN:0166-5316, 1872-745X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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