无线Ad Hoc网络P2P流媒体分发缓存算法  

The Replication Strategy for P2P Media Streaming Delivery in Wireless Ad Hoc Networks

作　　者：左冬红[1] 杜旭[1] 杨宗凯[1] 

机构地区：[1]华中科技大学电信系,武汉430074

出　　处：《计算机科学》2007年第6期44-46,80,共4页Computer Science

基　　金：湖北省自然科学基金(2005ABA264)。

摘　　要：无线Ad Hoc网络由于其传输时延较长,网络拓扑动态变化以及高丢包率,给流媒体在无线网络中的分发带来了挑战。但随着移动通信终端设备存储能力的提高,在无线Ad Hoc网络中进行P2P的流媒体分发服务成为可能。本文提出一种最小化网络总体有效传输代价的P2P流媒体分发启发式缓存算法,它是在网络总体缓存资源有限的条件下,综合考虑流媒体片段内部流行度、无线节点可靠性,以及片段实际缓存密度与期望缓存密度之差等因素,以减少流媒体分发总体传输代价为目标的启发式缓存算法,此算法能很好地减少流媒体分发起动时延,有效地减少流媒体分发在无线Ad Hoc网络中的传输代价。In wireless Ad Hoc networks, due to the long transmission time, dynamic network connectivity, and potentially high loss rate, media streaming delivery in such networks is challenging. But with the memory increase of mobile terminal, media streaming delivery in a Peer to Peer fashion is possible in wireless Ad Hoc networks. The heuristic cache algorithm aimed to minimal the total effective network transmission cost is proposed for peer to peer media streaming delivery in wireless Ad Hoc networks, it considers the media internal segment＇s popularity, the reliability of wireless hosts, and the difference of segment＇s reality cache dense and expected cache dense. It can effectively reduce the start-up delay and the total transmission cost of media streaming delivering in wireless Ad Hoc networks.

关 键 词：对等 流媒体 缓存算法 传输代价 自组织 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]