• Corpus ID: 10829097

Content replication and placement in mobile networks

  title={Content replication and placement in mobile networks},
  author={Chi-Anh La and Pietro Michiardi and Claudio Ettore Casetti and Carla-Fabiana Chiasserini and Marco Fiore},
Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a static network can be cast as a facility location problem. The endeavor of this work is to design a practical solution to the above joint optimization problem that is suitable for mobile wireless… 
Content Replication in Mobile Networks
This work designs a practical, distributed solution to content replication that is suitable for dynamic environments and achieves load balancing, and uses local measurements only, which approximates well an optimal solution while being robust against network and demand dynamics.
Distributed Placement of Autonomic Internet Services
A distributed service migration heuristic that iteratively solves instances of the 1-median problem pushing progressively the service to more cost-effective locations and demonstrating the effectiveness of the heuristic over synthetic and real-world topologies as well as its advantages against comparable local-search-like migration schemes are proposed.
Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach
A differential evolution (DE) based method is proposed to solve the problem of a large database of video files, that are pre-partitioned to multiple segments based on the demand patterns of users, with the objective of minimizing the total routing cost.
Cooperative mechanisms for information dissemination and retrieval in networks with autonomous nodes
This dissertation proposes, model and evaluate novel algorithms and schemes that allow information dissemination and retrieval to be performed more efficiently in a modern networking environment, focusing on how common interests of nodes can be used to improve communication efficiency.


A Lightweight Content Replication Scheme for Mobile Ad Hoc Environments
This paper proposes the Expanding Ring replication strategy for pull-based information dissemination environments and develops a lightweight scheme for mobile nodes that shows a reduction in the average response times and the message processing overhead on nodes.
Data replication protocols for mobile ad-hoc networks: a survey and taxonomy
This paper surveys the existing data replication protocols in mobile ad-hoc networks and proposes a classification scheme that categorizes the protocols into various classes, with respect to the issues they address, and provides a comparison of the protocols.
Integrated data lookup and replication scheme in mobile ad hoc networks
This paper develops an integrated data lookup and replication scheme for mobile ad hoc networks that predicts group partitioning based on each node's current location and movement patterns, and replicates data to other partitions before partitioning occurs.
Distributed Placement of Service Facilities in Large-Scale Networks
A scalable, distributed approach that answers the key question through an iterative re-optimization of the location and the number of facilities within such balls, and achieves performance under various synthetic and real Internet topologies that is comparable to that of optimal, centralized approaches requiring full topology and demand information.
P2P cache-and-forward mechanisms for mobile ad hoc networks
This paper shows that information dissemination can be achieved by simple cache-and-forward mechanisms inspired by well-known node mobility models, provided that a sufficient number of information replicas are injected into the network.
Cluster-based replication for large-scale mobile ad-hoc networks
  • Haobo Yu, P. Martin, H. Hassanein
  • Computer Science, Business
    2005 International Conference on Wireless Networks, Communications and Mobile Computing
  • 2005
This paper proposes a novel optimistic replication scheme, for achieving efficient consistency maintenance in large-scale ad-hoc mobile networks, and demonstrates that DHTR improves the performance with respect to update propagation in comparison with the ROAM replication system.
Balancing the tradeoffs between data accessibility and query delay in ad hoc networks
  • Liangzhong Yin, G. Cao
  • Computer Science
    Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004.
  • 2004
Simulation results show that the proposed schemes to balance the tradeoffs between data accessibility and query delay under different system settings and requirements can achieve a balance between these two metrics and provide satisfying system performance.
Efficient content location in wireless ad hoc networks
The Geography-based Content Location Protocol (GCLP) makes use of physical location information to lower proactive traffic while reducing query cost and the results show that GCLP performs favorably in terms of overhead and scalability.
Replica allocation considering power consumption in mobile ad hoc networks
This paper proposes a replica allocation method for not only improving data accessibility but also balancing the power consumption among mobile hosts, and presents simulation results to evaluate the performance of this method.
Effective replica allocation in ad hoc networks for improving data accessibility
  • T. Hara
  • Computer Science
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
This work proposes three replica allocation methods to improve data accessibility by replicating data items on mobile hosts by taking into account the access frequency from mobile hosts to each data item and the status of the network connection.