Asymptotic laws for content replication and delivery in wireless networks

A key consideration in novel communication paradigms in multihop wireless networks regards the scalability of the network. We investigate the case of nodes making random requests on content stored in multiple replicas over the wireless network. We show that, in contrast to the conventional paradigm of random communicating pairs, multihop communication is a sustainable scheme for certain values of file popularity, cache and network size. In particular, we formulate the joint problem of replication and routing and compute an order optimal solution. Assuming a Zipf file popularity distribution, we vary the number of files M in the system as a function of the nodes N, let both go to infinity and identify the scaling regimes of the required link capacity, from O(√N) down to O(1).

[1]  Mark Crovella,et al.  Characteristics of WWW Client-based Traces , 1995 .

[2]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[3]  Toshihiko Yamakami,et al.  A Zipf-Like Distribution of Popularity and Hits in the Mobile Web Pages with Short Life Time , 2006, 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06).

[4]  M. Newman.  Power laws, Pareto distributions and Zipf's law , 2005 .

[5]  Shudong Jin,et al.  Content and service replication strategies in multi-hop wireless mesh networks , 2005, MSWiM '05.

[6]  Leandros Tassiulas,et al.  Mobility Support Through Caching in Content-Based Publish/Subscribe Networks , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Gustavo de Veciana,et al.  Capacity of ad hoc wireless networks with infrastructure support , 2005, IEEE Journal on Selected Areas in Communications.

[9]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  Massimo Franceschetti,et al.  Random Networks for Communication , 2008 .

[11]  Stavros Toumpis.  Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic Patterns , 2008, IEEE Transactions on Wireless Communications.

[12]  Srinivasa Rao,et al.  Cooperative Caching in Wireless P2P Networks: Design, Implementation and Evaluation , 2013 .

[13]  B. Levine,et al.  Availability and Popularity Measurements of Peer-to-Peer File Systems , 2004 .

[14]  Jacky C. Chu,et al.  Availability and locality measurements of peer-to-peer file systems , 2002, SPIE ITCom.

[15]  Lada A. Adamic,et al.  Zipf's law and the Internet , 2002, Glottometrics.

[16]  Massimo Franceschetti,et al.  The Capacity of Wireless Networks: Information-Theoretic and Physical Limits , 2009, IEEE Transactions on Information Theory.

[17]  John A. Silvester,et al.  On the Capacity of Multihop Slotted ALOHA Networks with Regular Structure , 1983, IEEE Trans. Commun..

[18]  Leandros Tassiulas,et al.  Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[19]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.