P2P流媒体系统中,减少ISP(Internet Service Provider)交叉流量是一个重要的研究方向,本文提出了一种减少ISP交叉流量的P2P流媒体方案,方案综合考虑了Pull机制、DHT(Distributed Hash Table,分布式哈希表)原理和IPv6地址的聚类特性,从...P2P流媒体系统中,减少ISP(Internet Service Provider)交叉流量是一个重要的研究方向,本文提出了一种减少ISP交叉流量的P2P流媒体方案,方案综合考虑了Pull机制、DHT(Distributed Hash Table,分布式哈希表)原理和IPv6地址的聚类特性,从网络拓扑构建和包调度机制两个方面,通过增加ISP内数据共享和减少ISP间数据请求的方式,减少P2P流媒体系统中的ISP交叉流量.仿真结果显示,在大规模系统中,该方案能够有效的减少ISP交叉流量.展开更多
We present an effective routing solution for the backbone of hierarchical MANETs. </span></span><span><span><span style="font-family:""><span style="font-family:Ver...We present an effective routing solution for the backbone of hierarchical MANETs. </span></span><span><span><span style="font-family:""><span style="font-family:Verdana;">Our solution leverages the storage and retrieval mechanisms of a Distributed Hash Table (DHT) common to many (structured) P2P overlays. Th</span><span style="font-family:Verdana;">e DHT provides routing information in a decentralized fash</span><span style="font-family:Verdana;">ion, while supporting different forms of node and network mobility. We split a flat network into clusters, each having a gateway who participates in a DHT overlay. These g</span><span style="font-family:Verdana;">ateways interconnect the clusters in a backbone network. Two routing </span><span style="font-family:Verdana;">approaches for the backbone are explore</span><span style="font-family:Verdana;">d: floodi</span><span style="font-family:Verdana;">ng and a new solution exploit</span><span style="font-family:Verdana;">ing the storage and retrieval capabilities of a P2P overlay based on a DHT.</span><span style="font-family:Verdana;"> We </span><span style="font-family:Verdana;">implement both approaches in a net</span><span style="font-family:Verdana;">work simulator and thoroughly evaluate th</span><span style="font-family:Verdana;">e performance of the proposed scheme using a range of stati</span><span style="font-family:Verdana;">c and mobile scenarios. We also compare our solution against flooding. The simulation results show that our solution, even in the presence of mobility, achieved well abo</span><span style="font-family:Verdana;">ve 90% success rates and maintained very low and constant round tr</span><span style="font-family:Verdana;">ip times, unlike the flooding approach. In fact, the performance of the proposed </span><span style="font-family:Verdana;">inter-cluster routing solution, in many cases, is comparable to the perfo</span><span style="font-family:Verdana;">rma</span><span style="font-family:Verdana;">nce of the intra-cluster routing case. The advantage of our proposed ap</span><span style="font-family:Verdana;">proach compared to flooding increases as the number of clusters increases, demonstrating the superior scalability of our proposed approach.展开更多
文摘P2P流媒体系统中,减少ISP(Internet Service Provider)交叉流量是一个重要的研究方向,本文提出了一种减少ISP交叉流量的P2P流媒体方案,方案综合考虑了Pull机制、DHT(Distributed Hash Table,分布式哈希表)原理和IPv6地址的聚类特性,从网络拓扑构建和包调度机制两个方面,通过增加ISP内数据共享和减少ISP间数据请求的方式,减少P2P流媒体系统中的ISP交叉流量.仿真结果显示,在大规模系统中,该方案能够有效的减少ISP交叉流量.
文摘We present an effective routing solution for the backbone of hierarchical MANETs. </span></span><span><span><span style="font-family:""><span style="font-family:Verdana;">Our solution leverages the storage and retrieval mechanisms of a Distributed Hash Table (DHT) common to many (structured) P2P overlays. Th</span><span style="font-family:Verdana;">e DHT provides routing information in a decentralized fash</span><span style="font-family:Verdana;">ion, while supporting different forms of node and network mobility. We split a flat network into clusters, each having a gateway who participates in a DHT overlay. These g</span><span style="font-family:Verdana;">ateways interconnect the clusters in a backbone network. Two routing </span><span style="font-family:Verdana;">approaches for the backbone are explore</span><span style="font-family:Verdana;">d: floodi</span><span style="font-family:Verdana;">ng and a new solution exploit</span><span style="font-family:Verdana;">ing the storage and retrieval capabilities of a P2P overlay based on a DHT.</span><span style="font-family:Verdana;"> We </span><span style="font-family:Verdana;">implement both approaches in a net</span><span style="font-family:Verdana;">work simulator and thoroughly evaluate th</span><span style="font-family:Verdana;">e performance of the proposed scheme using a range of stati</span><span style="font-family:Verdana;">c and mobile scenarios. We also compare our solution against flooding. The simulation results show that our solution, even in the presence of mobility, achieved well abo</span><span style="font-family:Verdana;">ve 90% success rates and maintained very low and constant round tr</span><span style="font-family:Verdana;">ip times, unlike the flooding approach. In fact, the performance of the proposed </span><span style="font-family:Verdana;">inter-cluster routing solution, in many cases, is comparable to the perfo</span><span style="font-family:Verdana;">rma</span><span style="font-family:Verdana;">nce of the intra-cluster routing case. The advantage of our proposed ap</span><span style="font-family:Verdana;">proach compared to flooding increases as the number of clusters increases, demonstrating the superior scalability of our proposed approach.
