P2P cache-and-forward mechanisms for mobile ad hoc networks

Casetti, Claudio; Chiasserini, Carla-Fabiana; Fiore, Marco; La, Chi-Anh; Michiardi, Pietro

doi:10.1109/iscc.2009.5202293

Cited by 4 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our previous work [8], we show preliminary results indicating that a uniformly distributed replica placement can be well approximated using distributed store-and-forward mechanisms, in which nodes store content only temporarily. The endeavor of this work is to extend our previous study and target the joint problem (i) of establishing the number of replicas to deploy in a dynamic network, (ii) of finding their most suitable location, and (iii) of letting users efficiently access stored content.…”

Section: Introductionmentioning

confidence: 90%

See 1 more Smart Citation

A Lightweight Distributed Solution to Content Replication in Mobile Networks

Michiardi

Casetti

et al. 2010

2010 IEEE Wireless Communication and Networking Conference

View full text Add to dashboard Cite

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a network can be cast as an uncapacitated facility location problem.The endeavour of this work is to design a distributed, lightweight solution to the above joint optimization problem, while taking into account the network dynamics. In particular, we devise a mechanism that lets nodes share the burden of storing and providing content, so as to achieve load balancing, and decide whether to replicate or drop the information so as to adapt to a dynamic content demand and time-varying topology. We evaluate our mechanism through simulation, by exploring a wide range of settings and studying realistic content access mechanisms that go beyond the traditional assumption matching demand points to their closest content replica. Results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating various content access patterns, including variation in time and space of the content demand.

show abstract

Section: Introductionmentioning

confidence: 90%

“…2). For the placement problem alone, in [8] we also explored the implications of clustered networks, different mobility models, and the parameter τ .…”

Section: How Well Does Our Replica Placement Approximate the Target Dmentioning

confidence: 99%

A Lightweight Distributed Solution to Content Replication in Mobile Networks

Michiardi

Casetti

et al. 2010

2010 IEEE Wireless Communication and Networking Conference

View full text Add to dashboard Cite

show abstract

“…Finally, relevant to our study are the numerous schemes proposed for handling query/reply messages; examples are [32], which resembles the perfect-discovery mechanism, and [33], [34] where queries are propagated along trajectories so as to meet the requested information. Also, we point out that the RWD scheme was first proposed in our work [35]. That paper, however, besides being a preliminary study, focused on mechanisms for content handover only: no replication or content access were addressed.…”

Section: Related Workmentioning

confidence: 99%

Content Replication in Mobile Networks

Michiardi

Casetti

et al. 2012

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. In this work, we design a practical, distributed solution to content replication that is suitable for dynamic environments and achieves load balancing. Simulation results show that our mechanism, which uses local measurements only, approximates well an optimal solution while being robust against network and demand dynamics. Also, our scheme outperforms alternative approaches in terms of both content access delay and access congestion.

show abstract

“…Random-Walk Diffusion (RWD) mechanism was proposed in [48] in which a mobile device hosting a content replica, stores it for a storage time t. At the end of its storage time, the replica node selects with equal probability one of its neighbors to store the content for the following storage period. Therefore, content replicas roam the network by moving from one node to another, randomly, at each time step t. In [49], the main contribution is the design of a mechanism for content placement and replication that achieves load balancing according to the variations in the network topology and the query rate.…”

Section: Replication Schemes In Manetsmentioning

confidence: 99%

“…Where is a tolerance value to avoid replication/drop decisions in case of small changes in the node's workload. In both [48] and [49], the mechanisms do not replicate the content according to the clients' demands, where the former mechanism guarantees the existence of one replica at anytime and the latter mechanism replicate, handover or drop the replica.…”

Section: Replication Schemes In Manetsmentioning

confidence: 99%

Content Replication and Placement Schemes for Wireless Mesh Networks

Al-Arnaout¹

View full text Add to dashboard Cite

<p>Recently, Wireless Mesh Networks (WMNs) have attracted much of interest from both academia and industry, due to their potential to provide an alternative broadband wireless Internet connectivity. However, due to different reasons such as multi-hop forwarding and the dynamic wireless link characteristics, the performance of current WMNs is rather low when clients are soliciting Web contents. Due to the evolution of advanced mobile computing devices; it is anticipated that the demand for bandwidth-onerous popular content (especially multimedia content) in WMNs will dramatically increase in the coming future. Content replication is a popular approach for outsourcing content on behalf of the origin content provider. This area has been well explored in the context of the wired Internet, but has received comparatively less attention from the research community when it comes to WMNs. There are a number of replica placement algorithms that are specifically designed for the Internet. But they do not consider the special features of wireless networks such as insufficient bandwidth, low server capacity, contention to access the wireless medium, etc. This thesis studies the technical challenges encountered when transforming the traditional model of multi-hop WMNs from an access network into a content network. We advance the thesis that support from packet relaying mesh routers to act as replica servers for popular content such as media streaming, results in significant performance improvement. Such support from infrastructure mesh routers benefits from knowledge of the underlying network topology (i.e., information about the physical connections between network nodes is available at mesh routers). The utilization of cross-layer information from lower layers opens the door to developing efficient replication schemes that account for the specific features of WMNs (e.g., contention between the nodes to access the wireless medium and traffic interference). Moreover, this can benefit from the underutilized resources (e.g., storage and bandwidth) at mesh routers. This utilization enables those infrastructure nodes to participate in content distribution and play the role of replica servers. In this thesis, our main contribution is the design of two lightweight, distributed, and scalable object replication schemes for WMNs. The first scheme follows a hierarchical approach, while the second scheme follows a flat one. The challenge is to replicate content as close as possible to the requesting clients and thus, reduce the access latency per object, while minimizing the number of replicas. The two schemes aim to address the questions of where and how many replicas should be placed in the WMN. In our schemes, we consider the underlying topology joint with link-quality metrics to improve the quality of experience. We show using simulation tests that the schemes significantly enhance the performance of a WMN in terms of reducing the access cost, bandwidth consumption and computation/communication cost.</p>

show abstract

P2P cache-and-forward mechanisms for mobile ad hoc networks

Cited by 4 publications

References 16 publications

A Lightweight Distributed Solution to Content Replication in Mobile Networks

A Lightweight Distributed Solution to Content Replication in Mobile Networks

Content Replication in Mobile Networks

Content Replication and Placement Schemes for Wireless Mesh Networks

Contact Info

Product

Resources

About