Proceedings ArticleDOI
An approximation algorithm to the file allocation problem in computer networks
Kowtha Murthy,John Kam,M. S. Krishnamoorthy +2 more
- pp 258-266
TLDR
A polynomial appro,;'at:on algorithm is developed which guarantees a reallstlc worst case bound for file allocation in arbitrary computer networks.Abstract:
In this paper, we are going to examine the problem of optimal file allocation In arbitrary computer networks This problem has been shown to be NP-complete [CHAHD76, ESWAR74] Several authors TCHU69, CASEY72, CHAND76, MAHMD76] have stud3ed this problem using analytical, heurlstlc and lmearInteger programmlng methods But these techniques only tend to demonstrate their relative efficiencies in fIndIng solutions to known problems and for small values of the number of nodes In the network They did not provide any mathematical analysis of the worst case sltuatlon of their techniques Hence, they falled to establish bounds on the devlatlon of their solutions In terms of exact solutions for problems with no known optimal solutlons They also did not establish the time and space complexltles of their algorithms This has motivated us to develop a polynomial appro,;'at:on algorithm which guarantees a reallstlc worst case boundread more
Citations
More filters
Journal ArticleDOI
The Capacitated K -Center Problem
Samir Khuller,Yoram J. Sussmann +1 more
TL;DR: The capacitated K-center problem is a basic facility location problem, where the authors are asked to locate K facilities in a graph and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned.
Journal ArticleDOI
How to Allocate Network Centers
TL;DR: The paper discusses the significant parameters of center allocation, defines the resulting optimization problems, and proposes several approximation algorithms for selecting centers and for distributing the users among them.
Journal ArticleDOI
Dynamic file migration in distributed computer systems
TL;DR: The importance of file migration is increasing because of its potential to improve the performance of distributed office, manufacturing, and hospital information systems as discussed by the authors, and the authors summarize accomplishments of researchers of the file migration problem, provide a detailed comparison of file migrations and dynamic file allocation problems, and identify important areas of research to support the development of effective file migration policies.
Journal ArticleDOI
Placement of Web-server proxies with consideration of read and update operations on the Internet
TL;DR: Simulations have been conducted to evaluate the performance of the proposed algorithms and to demonstrate how the effectiveness of proxy placement is affected by various factors, such as network traffic load, number of proxies, read‐write ratio and proxy hit ratio.
Journal ArticleDOI
Achieving optimal data storage position in wireless sensor networks
TL;DR: Simulation results show that NDS not only provides substantial cost benefit over centralized data storage (CDS) and geographic hash table (GHT), but performs as well as ODS in over 75% cases.
References
More filters
Journal ArticleDOI
A Greedy Heuristic for the Set-Covering Problem
TL;DR: It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A when all the components of cT are the same, which reduces to a theorem established previously by Johnson and Lovasz.
Journal ArticleDOI
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
Journal ArticleDOI
Comparative Models of the File Assignment Problem
TL;DR: This perspective exposes the further research which is necessary in order to provide a truly satisfactory solution to the file assignment problem.
Journal ArticleDOI
Optimal allocation of resources in distributed information networks
Samy A. Mahmoud,J. S. Riordon +1 more
TL;DR: Numerical results for a variety of network configurations indicate that the heuristic algorithm, while not theoretically convergent, yields practicable low cost solutions with substantial savings in computer processing time and storage requirements.
Proceedings ArticleDOI
Allocation of copies of a file in an information network
TL;DR: This work considers a mathematical model of an information network of n nodes, some of which contain copies of a given data file, and is concerned with transactions with the multiply-located file.
Related Papers (5)
Centralized and distributed approximation algorithms for routing and weighted max-min fair bandwidth allocation
Miriam Allalouf,Yuval Shavitt +1 more