Connection admission control for flow level QoS in bufferless models

Rácz, Sándor; Jakabfy, Tam'As; Farkas, János; Antal, Csaba

doi:10.1109/infcom.2005.1498353

Cited by 6 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We note that predicting the loss probability of statistical multiplexing from statistical descriptors of the video traffic has been extensively studied for MPEG encoded videos and verified through simulations with traces of MPEG encoded videos, see e.g., [56], [65]- [70]. Generally, such prediction works relatively well when the number of multiplexed streams is high and the streams are relatively smooth.…”

Section: B Bufferless Statistical Multiplexingmentioning

confidence: 84%

“…In the real-time frame-based video streaming scenario based on a bufferless statistical multiplexer [56], [65]- [67], a channel with bandwidth capacity [bit/s] connects a streaming video server with a bufferless statistical multiplexer to receivers. Each video frame is transmitted during one frame period (e.g., 33 ms for a frame rate of 30 frames/s).…”

Section: B Bufferless Statistical Multiplexingmentioning

confidence: 99%

“…Aside from providing an appropriate model for low-delay, low-buffer transmission systems [65], [67], bufferless statistical multiplexing provides a "ground truth" for studying the fundamental implications of the bit rate variabilities associated with the H.264 SVC, H.264/AVC, and MPEG-4 Part 2 video encoders and with the video content. By considering the outlined elementary bufferless statistical multiplexing scenario, we avoid introducing confounding parameters, such as network buffers, cross traffic, and network topology.…”

Section: B Bufferless Statistical Multiplexingmentioning

confidence: 99%

See 2 more Smart Citations

Implications of Smoothing on Statistical Multiplexing of H.264/AVC and SVC Video Streams

Auwera

Reisslein

2009

IEEE Trans. on Broadcast.

View full text Add to dashboard Cite

Abstract-While the hierarchical B frames based Scalable Video Coding (SVC) extension of the H.264/AVC standard achieves significantly improved compression over the initial H.264/AVC codec, the SVC video traffic is significantly more variable than H.264/AVC traffic. The higher traffic variability of the SVC encoder can lead to smaller numbers of streams supported with bufferless statistical multiplexing than with the H.264/AVC encoder (and even less streams than with the MPEG-4 Part 2 encoder) for prescribed link capacities and loss constraints. In this paper we examine the implications of video traffic smoothing on the numbers of statistically multiplexed H.264 SVC, H.264/AVC, and MPEG-4 Part 2 streams, the bandwidth requirements for streaming, and the introduced delay. We identify the levels of smoothing that ensure that more H.264 SVC streams than H.264/AVC streams can be supported. For a basic low-complexity smoothing technique that is readily applicable to both live and prerecorded streams, we identify the levels of smoothing that give (bufferless) statistical multiplexing performance close to an optimal off-line smoothing technique. We thus characterize the trade-offs between increased smoothing delay and increased statistical multiplexing performance for both H.264/AVC, which employs classical B frames, and H.264 SVC, which employs hierarchical B frames. We similarly identify the buffer sizes for the buffered multiplexing of unsmoothed H.264 SVC, H.264/AVC, and MPEG-4 Part 2 streams that give close to optimal performance.

show abstract

Section: B Bufferless Statistical Multiplexingmentioning

confidence: 84%

Section: B Bufferless Statistical Multiplexingmentioning

confidence: 99%

Section: B Bufferless Statistical Multiplexingmentioning

confidence: 99%

See 1 more Smart Citation

Implications of Smoothing on Statistical Multiplexing of H.264/AVC and SVC Video Streams

Auwera

Reisslein

2009

IEEE Trans. on Broadcast.

View full text Add to dashboard Cite

show abstract

“…Deciding who will gain the access has been an active research topic on admission control for decades [e.g., 10,12,13,14,15,16,17]. Many theories and practical solutions have been developed for admission control of connectionoriented traffic flows, but there are two fundamental approaches [18].…”

Section: Introductionmentioning

confidence: 99%

“…Many theories and practical solutions have been developed for admission control of connectionoriented traffic flows, but there are two fundamental approaches [18]. They are parameter-based schemes, where decisions are derived from the known traffic and network descriptors [12,14,15], and measurement-based methods, in which traffic is characterized from the network measurements rather than relying on known traffic descriptors [10,13,17,20]. Furthermore, from the control granularity view point, most of the work for packet networks focused on flow or connection level control, so that a new connection or flow is admitted if it does not degrade the performance of existing flows.…”

Section: Introductionmentioning

confidence: 99%

Admission control for VoIP calls with heterogeneous codecs

Mang

Levy

Johnson

et al. 2009

2009 18th Annual Wireless and Optical Communications Conference

View full text Add to dashboard Cite

As VoIP services proliferate due to rapid advances in technology and market demands, service providers are aggressively looking for better ways to offer VoIP services to customers including support of different codec technologies via a single network access point. This service flexibility introduces major traffic engineering challenges, especially when supporting a mix of data and voice services. In order to guarantee individual source's call blocking probability, intelligence must be added to the call admission process. To tackle the issue, we propose an intelligent call blocking algorithm that is guided by a pre-defined blocking targets. VoIP call admission control, Call blocking, QoS, VoIP traffic modeling

show abstract