Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks

Details Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks

2012-01-15

arxiv.org/abs/1201.3095v1

Computer Science

Networking and Internet Architecture

Scientific paper

We study the scalability of multihop wireless communications, a major concern in networking, for the case that users access content replicated across the nodes. In contrast to the standard paradigm of randomly selected communicating pairs, content replication is efficient for certain regimes of file popularity, cache and network size. Our study begins with the detailed joint content replication and delivery problem, a hard combinatorial optimization, which is reduced to the simpler replication density problem whose performance is of the same order as the original. Assuming a Zipf popularity law, and letting the number of files and network nodes both go to infinity, we identify scaling capacity laws from O(\sqrt{N}) down to O(1).

Affiliated with

Also associated with

No associations

Rating

Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159461