NDLI: Reliable End-to-End APNs interaction framework

Content Provider	IEEE Xplore Digital Library
Author	Singh, R. Chatterjee, I. Smrati
Copyright Year	2014
Description	Author affiliation: Dept. of CS & IT, MJP Rohilkhand Univ., Bareilly, India (Singh, R.; Chatterjee, I.; Smrati)
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.
Sponsorship	IEEE Delhi Sect.
Starting Page	921
Ending Page	926
File Size	6130405
Page Count	6
File Format	PDF
ISBN	9789380544106
e-ISBN	9789380544120
DOI	10.1109/IndiaCom.2014.6828098
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-03-05
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Bharati Vidyapeeth University
Subject Keyword	Degradation APNs Interaction Framework Negotiation System performance Admission control Bandwidth QoS-based Resource Management Multimedia communication Resource management
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in