Shahram Ghandeharizadeh
ABSTRACT
On-demand delivery of audio and video clips in peer-to-peer vehicular ad-hoc networks is an emerging area of research. Our target environment uses data carriers, termed zebroids, where a mobile device carries a data item on behalf of a server to a client thereby minimizing its availability latency. In this study, we quantify the variation in availability latency with zebroids as a function of a rich set of parameters such as car density, storage per device, repository size, and replacement policies employed by zebroids. Using analysis and extensive simulations, we gain novel insights into the design of carrier-based systems. Significant improvements in latency can be obtained with zebroids at the cost of a minimal overhead. These improvements occur even in scenarios with lower accuracy in the predictions of the car routes. Two particularly surprising findings are: (1) a naive random replacement policy employed by the zebroids shows competitive performance, and (2) latency improvements obtained with a simplified instantiation of zebroids are found to be robust to changes in the popularity distribution of the data items.
- Federal Highway Administration. Corridor simulation. Version 5.1, http://www.ops.fhwa.dot.gov/trafficanalysistools/cors im.htm.Google Scholar
- D. Aldous and J. Fill. Reversible markov chains and random walks on graphs. Under preparation.Google Scholar
- A. Bar-Noy, I. Kessler, and M. Sidi. Mobile Users: To Update or Not to Update. In IEEE Infocom, 1994.Google ScholarCross Ref
- J. Burgess, B. Gallagher, D. Jensen, and B. Levine. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networking. In IEEE Infocom, April 2006.Google ScholarCross Ref
- E. Cohen and S. Shenker. Replication Strategies in Unstructured Peer-to-Peer Networks. In SIGCOMM, 2002. Google ScholarDigital Library
- A. Dan, D. Dias, R. Mukherjee, D. Sitaram, and R. Tewari. Buffering and Caching in Large-Scale Video Servers. In COMPCON, 1995. Google ScholarDigital Library
- S. Ghandeharizadeh, S. Kapadia, and B. Krishnamachari. PAVAN: A Policy Framework for Content Availabilty in Vehicular Ad-hoc Networks. In VANET, New York, NY, USA, 2004. ACM Press. Google ScholarDigital Library
- S. Ghandeharizadeh, S. Kapadia, and B. Krishnamachari. Comparison of Replication Strategies for Content Availability in C2P2 networks. In MDM, May 2005. Google ScholarDigital Library
- S. Ghandeharizadeh, S. Kapadia, and B. Krishnamachari. An Evaluation of Availability Latency in Carrier-based Vehicular Ad-hoc Networks. Technical report, Department of Computer Science, University of Southern California,CENG-2006-1, 2006.Google Scholar
- S. Ghandeharizadeh and B. Krishnamachari. C2p2: A peer-to-peer network for on-demand automobile information services. In Globe. IEEE, 2004.Google Scholar
- T. Hara. Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility. In IEEE Infocom, 2001.Google Scholar
- H. Hayashi, T. Hara, and S. Nishio. A Replica Allocation Method Adapting to Topology Changes in Ad Hoc Networks. In DEXA, 2005. Google ScholarDigital Library
- P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D. Rubenstein. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet. SIGARCH Comput. Archit. News, 2002. Google ScholarDigital Library
- A. Pentland, R. Fletcher, and A. Hasson. DakNet: Rethinking Connectivity in Developing Nations. Computer, 37(1):78--83, 2004. Google ScholarDigital Library
- F. Sailhan and V. Issarny. Cooperative Caching in Ad Hoc Networks. In MDM, 2003. Google ScholarDigital Library
- R. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Networks Journal, 1, September 2003.Google ScholarCross Ref
- T. Spyropoulos, K. Psounis, and C. Raghavendra. Single-Copy Routing in Intermittently Connected Mobile Networks. In SECON, April 2004.Google ScholarCross Ref
- A. Tanenbaum. Modern Operating Systems, 2nd Edition, Chapter 4, Section 4.4 . Prentice Hall, 2001. Google ScholarDigital Library
- A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Department of Computer Science, Duke University, 2000.Google Scholar
- W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In MobiHoc, pages 187-198, New York, NY, USA, 2004. ACM Press. Google ScholarDigital Library
- M. Zonoozi and P. Dassanayake. User Mobility Modeling and Characterization of Mobility Pattern. IEEE Journal on Selected Areas in Communications, 15:1239--1252, September 1997. Google ScholarDigital Library
- An evaluation of availability latency in carrier-based wehicular ad-hoc networks
Recommendations
Cache Replacement Algorithms with Nonuniform Miss Costs
Cache replacement algorithms originally developed in the context of uniprocessors executing one instruction at a time implicitly assume that all cache misses have the same cost. However, in modern systems, some cache misses are more expensive than ...
Introducing hierarchy-awareness in replacement and bypass algorithms for last-level caches
PACT '12: Proceedings of the 21st international conference on Parallel architectures and compilation techniquesThe replacement policies for the last-level caches (LLCs) are usually designed based on the access information available locally at the LLC. These policies are inherently sub-optimal due to lack of information about the activities in the inner-levels of ...
Temporal-based multilevel correlating inclusive cache replacement
Inclusive caches have been widely used in Chip Multiprocessors (CMPs) to simplify cache coherence. However, they have poor performance compared with noninclusive caches not only because of the limited capacity of the entire cache hierarchy but also due ...
Comments