Allocation of copies of a file in an information network

Casey, R. G.

doi:10.1145/1478873.1478955

Cited by 110 publications

(46 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chu [8] studied the file allocation problem with respect to multiple files in a multiprocessor system. Casey [6] extended this work by distinguishing between updates and read file requests. Eswaran [10] proved that Casey's formulation was NP-complete.…”

Section: Related Workmentioning

confidence: 99%

Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks

Khan

2009

J Supercomput

View full text Add to dashboard Cite

Due to the continuous mobility of hosts, an ad hoc network suffers from frequent disconnections. This phenomenon is undesirable when mobile hosts are accessing data from each other, and thus, data accessibility is lower than that in conventional fixed networks. Because one cannot control network disconnections, an alternative solution to this problem is to replicate data objects onto mobile hosts so that when disconnections occur, mobile hosts can still access data. In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. We prove that this problem in general is NP-complete and propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative environment to improve data accessibility by replicating data objects. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity, and communication costs. In the proposed scheme, players (mobile hosts) compete through bids in a non-cooperative environment to replicate data objects that are beneficial to themselves and the system as a whole. To cater for the possibility of cartel type behavior of the players, the scheme uses the Vickrey payment protocol that leaves the players with no option than to bid in such a fashion that is beneficial to the system as a whole. The paper also identifies some useful properties of the proposed scheme and the necessary conditions of optimality. The proposed technique is extensively evaluated against some well-known ad hoc network replica allocation methods, such as: (a) randomized, (b) extended static access frequency, (c) extended dynamic access frequency and neighborhood, and (d) extended dynamic connectivity grouping. The experimental results reveal that the proposed approach outperforms the four techniques in solution quality and projects a competitive execution time.

show abstract

Section: Related Workmentioning

confidence: 99%

Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks

Khan

2009

J Supercomput

View full text Add to dashboard Cite

show abstract

“…Fragmentation llIlit can be a file where aııocation issue becomes the file aııocation problem. File aııocation problem is studied extensively in the literature, started by Chu (1969) and conlinued for non-replicated and replicated mode1s (Apers, 1988;Casey, 1972;OTapa and Belford, 1977;Mahmoud and Riordan 1976;Morgan and Levin, 1977;Ramamoorthy and Wah, 1983;Wlıitney, 1970). Some studies considered dynarnic file aııocation (Ames, 1977;Smith, 198 1;Wah, 1979;Wang and Chen, 2005;Alın and Kim, 2005).…”

Section: Introductionmentioning

confidence: 99%

A Threshold Based Dynamic Data Allocation Algorithm-A Markov Chain Model Approach

Uysal¹,

Ulus²

2007

J. of Applied Sciences

View full text Add to dashboard Cite

In this study, a new dynamic data allocation algoritlnn for non-replicated Distributed Database Systems (DDS), name1y tbe ıbresho1d a1goritbm, is formulated and proposed. The ıbresho1d a1goritbm reallocates data with respect to changing data access patterns. The proposed algoritlnn İs distributed İn the sense that each node autonomously decides whether to transfer the ownership of a fragınent İn DDS to another node or not. The transfer decİsİon depends on the past access es of the fragınent. Each fragınent continuously migrates from the node where it İs not access ed locaııy more than a certaİn number of past accesses, namely a threshold value. The threshold algoritlnn İs modeled for a fragınent of the clatabase as a finite Markov chain with constant node access probabilities. In the model, a special case, where aıı nodes have equal access probabilities except one with a different access probability, is analyzed. it has been shown that for positive threshold values the fragment wiıı tend to remain at the node with the higher access probability. it is also sho"\iVIl that the greater the threshold values are, the greater the tendency of the fragment to remain at the node with higher access probability wiıı be. The threshold algoritlnn is especiaııy suitable for a DDS where data access pattem changes dynamicaııy.

show abstract

“…Chu [10] studied the file allocation problem with respect to multiple files in a multiprocessor system. Casey [8] extended this work by distinguishing between updates and queries on files. Eswaran [12] proved that Casey's formulation was NP complete.…”

Section: Related Workmentioning

confidence: 99%

Static and adaptive data replication algorithms for fast information access in large distributed systems

Loukopoulos

Ahmad

Proceedings 20th IEEE International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

show abstract

Allocation of copies of a file in an information network

Cited by 110 publications

References 3 publications

Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks

Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks

A Threshold Based Dynamic Data Allocation Algorithm-A Markov Chain Model Approach

Static and adaptive data replication algorithms for fast information access in large distributed systems

Contact Info

Product

Resources

About