z-logo
open-access-imgOpen Access
Performance Study on the System of Real-Time VBR Service with Shared Cache
Author(s) -
Hongfei Zhang,
Shengye Huang
Publication year - 2012
Publication title -
international journal of engineering and manufacturing
Language(s) - English
Resource type - Journals
eISSN - 2306-5982
pISSN - 2305-3631
DOI - 10.5815/ijem.2012.05.05
Subject(s) - variable bitrate , computer science , cache , network packet , computer network , processor sharing , queue , packet loss , real time computing , admission control , queueing theory , bit rate , quality of service
In this paper, we study a system that adopts complete sharing admission policy to multiple broadband realtime variable bit rate (VBR) service sharing a common buffer or cache. Under joint connection-level and packet-level analysis, we utilize shared cache queue model with multiple ON-OFF sources to analyze the probability distribution of the number of packets and then obtain the formulas of calculating packet loss rate and average delay. Through numerical calculation, the results compared with the non-caching system indicate that the packet loss rate has decreased, but the average delay has increased. Taking into account the delay sensitive nature of real-time VBR service, this paper puts forward a call admission control (CAC) algorithm that gives consideration to both packet-level performance parameters and connection-level performance parameters. The algorithm optimizes the average delay of the system with constraints on call blocking probabilities for each kind of VBR service and a common packet loss rate for all services. Numerical examples exhibit the nature of such systems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom