Multi-tiered, burstiness-aware bandwidth estimation and scheduling for VBR video flows

Kalle,; Devi,; Kalyanaraman,

doi:10.1109/iwqos.2011.5931315

Cited by 4 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…) and, hence, maximum weight, that is, (1 ) i i BSP   at time t 1 , and the other session (suppose http://dx.doi.org/10.4218/etrij.14.0112.0524 f j ) has the minimum weight, that is, j  , after time t 1 .…”

Section: A Service Fairness Indexmentioning

confidence: 99%

“…Although packet scheduling algorithms have been widely studied over the past several years [1]- [25], this subject is reemerging as a fresh and challenging subject [1]- [5] due to the widespread usage of such multimedia applications as IPTV and video on demand and the introduction of such services as realtime and interactive gaming. For current and future multimedia services and applications, the provisioning and guaranteeing of the quality of service (QoS) are important issues for service providers.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, one of the most effective ways to minimize the undesirable effects of bursty traffic is to control the burstiness using smoothing methods [1]. LB shaping is currently used in many switches and is the basis for many analyses [31]- [33].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Approach to Scheduling Bursty Traffic

Farzanegan¹,

Saidi²,

Mahdavi³

2014

ETRI J

View full text Add to dashboard Cite

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

show abstract

Section: A Service Fairness Indexmentioning

confidence: 99%