Cart (Loading....) | Create Account
Close category search window

MP-DNA: A novel distributed replica placement heuristic for WMNs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Al-Arnaout, Z. ; Sch. of Eng. & Comput. Sci., Victoria Univ. of Wellington, Wellington, New Zealand ; Hart, J. ; Qiang Fu ; Frean, M.

Content replication and placement is an area that has been well explored in the scope of Content Delivery Networks (CDNs), but has received relatively less attention from the research community when it comes to Wireless Mesh Networks (WMNs). There are a number of Replica Placement Algorithms (RPAs) that are specifically designed for CDNs. But they do not consider the special features of wireless networks. In this paper, we propose a new heuristic called MP-DNA (Multiple Partitions per Delegate Node Assignment). We study the problem of optimal content replication and placement in WMNs. In our model, each mesh router acts as a replica server with limited storage capacity. 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. We formulate this problem in terms of combinatorial optimization and propose a novel, distributed, scalable heuristic for content replication. Using simulation tests, we demonstrate that MP-DNA is scalable, performing well with respect to the number of replica servers and the number of objects. Furthermore, MP-DNA can achieve a performance close to the Greedy-Global heuristic, with a significant reduction in running time, mean throughput and storage space required.

Published in:

Local Computer Networks (LCN), 2012 IEEE 37th Conference on

Date of Conference:

22-25 Oct. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.