NDLI: Polynomial-Time Optimal Distributed Algorithm for Dynamic Allocation of Discrete Resources

Content Provider	IEEE Xplore Digital Library
Author	Guha, R.K. Ray, S.
Copyright Year	2008
Description	Author affiliation: Telcordia Technol. Piscataway, Piscataway, NJ (Guha, R.K.)
Abstract	Today a growing number of applications that operate in dynamic environments use distributed systems. Often, one or more constrained resources need to be allocated across such systems. In addition, for a number of important applications, the resources to be allocated are discrete quantities and the demand profile is intrinsically location and time dependent (thus pre-computating the resource allocation problem off-line is inadequate). We model such systems using graphs - vertices representing the sites and edges capturing locality - where each vertex is associated with the a pair of (integer) numbers representing the current and the required level of a resource. We seek on-the-fly reallocation of resources that satisfy the demand at each node, if it is feasible to do so, while minimizing a given metric of interest, such as the total distance traveled, maximum disruption time, etc. Due to integrality constraints, one expects such a problem to be NP-hard. However, we show that the matrix representing constraints of the problem satisfies the Total Unimodularity property and hence the problem is solvable in polynomial time. We propose a distributed algorithm that employs only local communications. We characterize the proposed algorithm and by numerical performance evaluation, show that it significantly outperforms known heuristic algorithms.
Starting Page	161
Ending Page	169
File Size	296590
Page Count	9
File Format	PDF
ISBN	9781424417773
DOI	10.1109/SAHCN.2008.29
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-06-16
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Distributed algorithms Resource management Heuristic algorithms Aerospace industry Routing Scalability Costs Context modeling Usability
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