On the Location-Awareness of Bandwidth Allocation and Admission Control for the Support of Real-Time Traffic in Class-Based IP Networks

Abstract

Abstract. The support of real-time traffic in class-based IP networks requires reservation of resources, accompanied by admission control in order to guarantee that newly admitted real-time traffic flows do not cause any violation to the Quality of Service (QoS) perceived by the already established ones. In this paper we highlight certain issues with respect to bandwidth allocation and admission control for supporting real-time traffic in class-based IP networks. We investigate the implications of topological placement of both bandwidth allocation and admission control schemes. We show that their performance depends highly on the location of the employed procedures with respect to the end-users and the various network boundaries. We conclude that the strategies for applying these schemes should be location-aware, because their performance at different points in a class-based IP network can be different and can deviate from the expected performance. Through simulations we also provide a quantitative view of these deviations.

Performance Improvement for VOIP Based Systems

“…Switching traffic by means of PQ optimization is dependent on an ideal packet servicing in a prime voice PQ queue [53][54][55].Within the condition as there is an efficiently utilized packet disintegration method taking place at the output switch line, it is feasible to disregard the control of serial delay of data packets by means of a lesser precedence, the voice packets contain. Within this case, intended for the modeling needs of traffic load and time delay during switching, it is adequate to observe a delay simply within a priority queue.…”

An integrated bandwidth allocation and admission control framework for the support of heterogeneous real-time traffic in class-based IP networks

“…In this case, the effective bandwidth of N multiplexed sources is given by [6,8] We will present this first part of our work with a list of different simulated scenarios using a two-level tree topology, which allows us to illustrate the mains points of our study, while, at the same time, being simple enough to suit the nature and the computational demands of the required packet-level simulations. (An initial reduced set of results was originally presented in [21]).…”