• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Data replication and scheduling for content availability in vehicular networks.
【24h】

Data replication and scheduling for content availability in vehicular networks.

机译：车载网络中的数据复制和内容可用性调度。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

On-demand delivery of audio and video clips in a vehicular network is a growing area of interest. A given repository of such data items, each with an associated popularity, may be available to the passengers of the vehicles. The vehicles themselves are equipped with a 'TiVO' like device that has several gigabytes of storage and a wireless interface allowing short range communication at 10s to 100s of Megabits per second. The goal is to minimize the latency between request issuance and the time till a copy of the requested item is encountered. This latency is termed the availability latency. This thesis explores two generic tools to alleviate availability latency: (a) data replication (b) data delivery scheduling.; With the replication study, we propose a general optimization formulation that seeks to minimize average availability latency subject to a storage constraint per vehicle. We explore the effects of a family of popularity-based replication schemes on availability latency. When the vehicles follow a 2D random walk based mobility model, via analysis and extensive simulations, we determine the optimal replication scheme that minimizes latency across a wide parameter space with major dimensions being data item size and client trip duration.; Once an appropriate static replication scheme has allocated replicas, the vehicles themselves may be employed as data carriers to further improve availability latency. These data carriers are termed zebroids. However, a zebroid's local storage may be completely exhausted. Hence, to accommodate this new data item, it may need to evict an existing one. Various replacement policies such as LFU, LRU, random etc. are examined and their relative performance is studied. Via analysis and extensive simulations we study the behavior of zebroids as a function of large parameter space comprising data item repository size, storage per vehicle, number of vehicles, popularity distribution of the data items, different replacement schemes for zebroids etc.; We validate the Markov model based observations with two independent validation phases employing (a) freeway traffic information on a city map (b) real world traces from a small bus network.
机译：在车载网络中按需交付音频和视频片段是人们越来越感兴趣的领域。这些数据项的给定存储库（每个具有相关的受欢迎程度）可能对车辆的乘客可用。车辆本身配备了类似“ TiVO”的设备，该设备具有数GB的存储空间和无线接口，可以以每秒10s至100s兆位的速度进行短距离通信。目的是最大程度地减少请求发出和遇到被请求项副本之间的等待时间。该等待时间称为可用性等待时间。本文探讨了两种缓解可用性延迟的通用工具：（a）数据复制（b）数据交付计划。通过复制研究，我们提出了一种通用的优化方案，该方案旨在使每辆车受存储限制的平均可用性延迟最小化。我们探索了一系列基于流行度的复制方案对可用性延迟的影响。当车辆遵循基于2D随机行走的移动性模型时，通过分析和广泛的模拟，我们确定了最佳的复制方案，该方案可将主要参数为数据项大小和客户行程持续时间的整个参数空间的延迟降至最低。一旦适当的静态复制方案分配了副本，即可将车辆本身用作数据载体，以进一步改善可用性延迟。这些数据载体称为Zebroids。但是，Zebroid的本地存储可能会完全耗尽。因此，为了容纳此新数据项，可能需要逐出现有数据项。研究了各种替换策略，例如LFU，LRU，random等，并研究了它们的相对性能。通过分析和广泛的模拟，我们研究了作为大参数空间的函数的Zebroids行为，这些参数空间包括数据项存储库大小，每辆车的存储量，车辆数量，数据项的受欢迎程度分布，不同的Zebroids替换方案等；我们使用两个独立的验证阶段来验证基于马尔可夫模型的观测结果，这些阶段使用（a）城市地图上的高速公路交通信息（b）来自小型公交车网络的真实世界轨迹。

著录项

  • 作者

    Kapadia, Shyam N.;

  • 作者单位

    University of Southern California.$bComputer Science: Doctor of Philosophy.;

  • 授予单位 University of Southern California.$bComputer Science: Doctor of Philosophy.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2007
  • 页码 138 p.
  • 总页数 138
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号