Policing aggregates of voice traffic with the token bucket algorithm

Buchli, M.; Vleeschauwer, Danny De; Janssen, J.H.; Petit, Guido H.

doi:10.1109/icc.2002.997302

Cited by 4 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the second method, we assume the number of sources is relatively large. In this case, the VoIP aggregate can also be modeled as a M/D/1 flow [24], [25]. A large number of results are available for the M/D/1 queue, and thus can be…”

Section: A Single Nodementioning

confidence: 99%

Delay Analysis of a Multi-Hop Strict Priority Scheduler

Eynde

Blondia

2022

2022 20th Mediterranean Communication and Computer Networking Conference (MedComNet)

View full text Add to dashboard Cite

Strict priority schedulers are often used in IP networks to guarantee delays for traffic that has strict delay requirements. There is literature for single node bounds for some priorities, however, for end-to-end delay bounds throughtraffic is often ignored, which can be crucial in obtaining correct end-to-end bounds. In this paper we give an upper bound on the end-to-end delay and delay variation distributions for all the priorities in a strict priority scheduler. We assume the highest two priorities are aggregates of constant-bit rate traffic, the third priority is modeled as an aggregate of on-off sources (e.g. VoIP), followed by a video stream. The delay distribution takes through-traffic and cross-traffic into account. Using simulations we demonstrate that our approach gives an upper bound to the delay and delay variation distributions.

show abstract

Section: A Single Nodementioning

confidence: 99%

Delay Analysis of a Multi-Hop Strict Priority Scheduler

Eynde

Blondia

2022

2022 20th Mediterranean Communication and Computer Networking Conference (MedComNet)

View full text Add to dashboard Cite

show abstract

“…Descriptions -Traffic descriptions can be applied to single sources or aggregates [51] of traffic. Analytic models of traffic sources include such things as rate limited sources, or leaky bucket limited sources.…”

Section: Models For Trafficmentioning

confidence: 99%

Admission control in multi-service IP networks: A tutorial

Wright¹

2007

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Admission Control (AC) has long been considered as a key mechanism to support Quality of Service objectives in networks. There is a significant base of literature in the area of admission control algorithms, but not all of these algorithms are directly comparable in terms of inputs, outputs or objectives. Current theory does not well describe the when, where, and how to best apply AC in designing network and service infrastructure for multi-service IP networks. This tutorial takes an ontological perspective within which to categorize admission control schemes. Industrystandard architectures (both core and access networks) are used to illustrate some of the key concepts. Two tables are provided to summarize the different approaches for categorization of admission control schemes.

show abstract