DocumentCode :
150126
Title :
Reliable End-to-End APNs interaction framework
Author :
Singh, Rajdeep ; Chatterjee, I. ; Smrati
Author_Institution :
Dept. of CS & IT, MJP Rohilkhand Univ., Bareilly, India
fYear :
2014
fDate :
5-7 March 2014
Firstpage :
921
Lastpage :
926
Abstract :
Most of the admission control algorithms treat every admission request uniformly and hence optimize the system performance by maximizing the number of admitted and served requests. In practice, requests might have different levels of importance to the system. Requests offering high contribution or reward to the system performance deserve priority treatment. Failure of accepting a high-priority request would incur high penalty to the system. Our Proposed framework takes three priority classes of requests. The network capacity is divided into three partitions based on the threshold values: one for high class of requests and second for low class of request and third is common pool which accept the high, low and other classes of requests respectively. We take a condition in common pool if common pool is filled ¾ of its total capacity and at this time new request comes then we degrade the low priority class and accept that coming request. Reward and penalty are adopted in the proposed system model. High-priority requests are associated with higher values of reward as well as penalty than low-priority ones. In this paper, we have used these characteristics of the system in access provider network to admit more requests and to increase workload without degradation of system performance. Our proposed framework will improve the processing of the system model and optimize the system performance based on the objective function of the total reward minus the total penalty. The negotiation mechanism reduces the QoS requirements of several low-priority clients, by cutting out a small fraction of the assigned capacity, to accept a new high-priority client and to achieve a higher net earning value for enhancing the system performance.
Keywords :
channel capacity; quality of service; resource allocation; subscriber loops; telecommunication network reliability; QoS requirements; access provider network; admission control algorithms; admission request; admitted requests; assigned capacity; common pool; high-priority request; low priority class; low-priority clients; negotiation mechanism; net earning value; network capacity; priority classes; priority treatment; served requests; system penalty; system performance enhancement; total penalty; total reward; Admission control; Bandwidth; Degradation; Multimedia communication; Resource management; System performance; APNs Interaction Framework; Admission control; Negotiation; QoS-based Resource Management;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing for Sustainable Global Development (INDIACom), 2014 International Conference on
Conference_Location :
New Delhi
Print_ISBN :
978-93-80544-10-6
Type :
conf
DOI :
10.1109/IndiaCom.2014.6828098
Filename :
6828098
Link To Document :
بازگشت