Distributed upload bandwidth assigning algorithm in P2P VoD system

In a peer-to-peer(P2P) live streaming system,each peer uses greedy strategy to download chunks as many as possible so as to assure smooth playback and promote the chunk propagation.However,diversity of video playback rate,heterogeneity of peer downlink bandwidth and no prefetching limitation determine that greedy strategy is not the best strategy for P2P video-on-demand(VoD) system though this strategy performs well in P2P live system.To reasonably assign upload bandwidth among peers,we first present a stochastic model to relate expected downloading speed(EDS) with buffered data amount(BDA,the amount of data has been fetched in buffer,however has not been played yet by the peer),video playback rate and fluency(the probability of no interruption in a viewing process).On the base of this model,we design an equal fluency bandwidth assigning algorithm(EFBAA).In this algorithm,requesting peers compute EDS according to several local parameters(such as BDA,video playback rate and fluency) dynamically and independently and send the EDS to neighbor peers together with buffer map.Then the neighbor peer proportionally partitions and assigns its upload bandwidth to requesting peers according to their EDS.Extensive simulations demonstrate that EFBAA outperforms greedy strategy in terms of server load and startup latency.     

Model of downloading strategy from peers and server for saving server bandwidth in P2P VoD system

In peer-to-peer(P2P)video on demand(VoD)system,once the P2P downloading rate cannot satisfy the need of playback,server is quickly referred to for help in providing enough bandwidth.Thus the switch of downloading from other peers(P2P)and server(HTTP)exists.This paper uses the proportion of P2P downloading amount(PPDA)during the video watching process to measure server load.This article is interested in finding a better strategy or switch rule between P2P and HTTP downloading for saving server bandwidth.The authors suggest and model a kind of switch rule based on local buffer amount,using mathematical theory of Brownian motion.It can effectively alleviate the impact of P2P rate fluctuation,reduce the switch times and improve the PPDA by at least 3%-5% on the basis of the former switch rule,which means substantial cost can be saved.Particularly the PPDA is related with the ratio of playback bit rate to the HTTP downloading rate which means the PPDA can be restricted by controlling the ratio in the real-world system.Though the result comes from constant bit rate(CBR)video supposition,it provides perspective and method for variable bit rate(VBR)application,and valuable insights for the future development of P2P VoD system.     

基于分布式缓存管理架构的P2P VoD系统

针对P2PVoD系统中怎样有效地管理和使用节点所缓存的媒体内容的问题,本文提出了一种基于分布式的缓存管理架构。在这一架构中每个节点存储系相应的媒体分块,所存储的媒体分块可以组合成一个完整的媒体文件的所有节点分布在一个环内。因此在一个环内可以快速定位到这个媒体文件的不同分块,提高了资源搜素的效率。仿真证明这种架构可以有效地管理和使用节点所缓存的媒体内容支持用户的VCR操作。     

基于双层P2P架构的VoD系统

本文提出的视频点播系统基于双层P2P架构实现,由城域网与驻地网媒体内容分发构成2级数据分发服务平台,用户终端点播并接受视频服务的同时,还能为其他用户提供数据服务,双层P2P架构有效地扩展了系统带宽,增强了服务能力,降低了系统成本,并提供QoS保证.     

基于P2P流媒体播放模型的内容发布策略

P2P流媒体播放软件的出现对现阶段的电视与网络行业产生巨大的影响，它使得在网上远程实时观看播放节目成为可能。阐述了基于P2P流媒体播放模型的几种内容发布策略，并经过计算与模拟仿真得到了最佳内容发布策略。     

基于拍卖的P2P内容分发网络带宽分配机制

为了解决P2P内容分发网络中带宽资源稀缺且分配不合理这一突出问题,抑制节点的自私性行为,设计了一种基于拍卖的带宽分配机制。该机制通过上载带宽支付方式,迫使自私请求节点选择合适的带宽需求,使得整个P2P网络中的节点良性竞争带宽资源,避免了"公共地悲剧"的发生;且带宽分配算法在资源节点和请求节点并行执行,能很好适应P2P网络的分布式特性。仿真结果表明,该机制能够有效遏制搭便车行为,从而缩短P2P内容分发的平均完成时间,降低内容源服务器的上传数据比例。     

基于P2P应用的校园网安全策略及防护技术

首先介绍了P2P网络模型及特征。其次，分析了P2P应用突破校园网安全体系的可能性及目前典型的旁路技术。在P2P应用与传统应用对比分析的基础上，提出了基于P2P应用的入侵检测模型及校园网安全的防护技术，以及配置安全防火墙与入侵检测系统等安全构件相结合的安全策略。     

基于双重特征的P2P流量检测方法

P2P流量逐渐成为了互联网流量的重要组成部分,精确地识别P2P流量对于有效地管理网络和合理地利用网络资源都具有重要意义.首先提出了在特定网络拓扑结构下的P2P流量表现出的流量特征,然后结合P2P流量的payload特征,设计了一种基于双重特征的P2P流量检测方法.该方法既克服了基于流量特征的检测方法应用级分类能力弱的缺点,又克服了基于payload特征的方法不能检测加密和未知P2P应用且检测效率不高的缺点.实验结果显示该方法比传统的基于payload特征的方法具有较高检测效率和合适的检测精度.     

基于预算机制的非结构化P2P网络分段搜索策略

在非结构化P2P网络中,降低消息冗余,提高搜索的效率,一直是资源搜索的关键问题.目前非结构化P2P网络均采用生存时间（Time-To-Live）机制控制搜索算法的深度,但是同时产生了大量的冗余消息,严重影响了网络的利用率.为了能够在保持高搜索效率的前提下减少冗余消息的数量,提出了一种基于预算机制的非结构化P2P网络分段搜索策略DBudgetSearch.DBudgetSearch将搜索过程分为两个阶段,并在每个阶段中使用预算机制来控制消息转发的数量和导向,根据邻居节点的连接度大小来选择消息的转发对象.分析和试验结果表明,DBudgetSearch导向性好,算法搜索效率高,能够有效减少冗余消息.     

基于应用层签名的P2P流量识别与控制

针对网络中P2P流量难以识别和控制的问题,在对P2P流量识别技术进行研究对比后,提出了一种基于应用层签名的P2P流量识别和控制的方法。分析并提取了风行、爱奇艺、优酷3种主流P2P流媒体及一些常用P2P应用软件的应用层签名,并通过实验验证了基于应用层签名的P2P流量识别方法对流量识别的高精确性以及对流量控制的有效性。     

P2P对FTTH的影响

文章对点对点( Peer-to-Peer,P2P)技术和光纤到户(FTTH)的概念进行了简单描述.重点对P2P的应用、P2P应用的带宽需求、P2P在IP网络电视(IPTV)中的应用特点进行了分析.最后得出了这样一个结论,P2P的应用不可阻挡,FTTH的普及也是不可阻挡的.     

基于Java语言P2P结构的网络视频会议系统

随着信息技术和网络技术的飞速发展以及人们的应用需求,产生了网络视频会议系统.针对P2P网络技术协同网络会议系统的需求,分析流媒体传输与控制技术、Java Media Framework （JMF）媒体框架技术、RTP/RTCP流媒体传输与控制协议、P2P结构分析和P2P工作原理,建立P2P结构的系统框架和基于时间戳的RTCP流媒体同步机制,设计了基于JMF类及P2P结构的网络视频会议系统.     

服务感知的移动P2P流媒体系统视频片调度算法

与有线网络相比,目前移动互联网的带宽普遍较低.这种情况下,如果移动P2P流媒体系统中用户节点上行带宽的利用率不高,将会极大地加重视频源服务器的负载,增加播放延时.为了充分地利用移动节点的上行带宽,缩短播放延时,文中提出了服务感知的视频片调度算法,它由请求算法和服务算法两部分组成.请求节点会根据最近的服务状况动态地调整请求的片数,减少服务拥塞的发生.服务节点会根据请求的优先级合理地安排上传顺序,提高服务的效率.仿真结果表明,该算法很好地适应了移动网络带宽低的情况,能够提高上行带宽的利用率,缩短播放延时.     

Modeling and analysis of access transparency and scalability in P2P distributed systems

Peer‐to‐peer (P2P) systems have been developed with the goal of providing support for transparent and efficient sharing of scalable distributed resources wherein size scalability is limited by the costs of all types of transparencies, especially data access transparency, which are due to the need for frequent data exchanges between peers and other related communication overheads. We present a model that formulates the relationship between scalability and data access transparency in P2P distributed systems to figure out how large these systems can be scaled up, given the overheads of establishing data access transparency. To validate our model and show how our model can be deployed in real life, we consider a real P2P distributed system as a case study and evaluate how CPU utilization, bandwidth, and data request frequency parameters of our model relate to the amount of effort required by the system management to establish data access transparency. We then calculate the strength of the coefficient of correlation of scalability and data access transparency in the system. The degree of strength of this coefficient allows the system designer to decide at design time whether to allow the use of the model in the management of system at runtime or not. Copyright © 2012 John Wiley & Sons, Ltd.     

VoD系统的负载均衡存储策略及调度算法研究

介绍了使用集群技术的VoD系统结构,并就适用于VoD系统的负载均衡存储策略和调度算法进行了分析,提出了基于节目流行度的存储策略和最强能力优先调度算法,利用仿真环境进行了试验和性能对比分析.     

基于P2P技术的网络资源搜索机制研究

网络上充斥着海量的信息,并且还在不断地迅速增长。人们依靠传统搜索引擎来寻找自己想要的信息和资源,其效果已经显得有些不尽人意。P2P技术给人们带来了一种全新的检索理念和方式,必将成为未来搜索引擎的发展方向。文中对P2P技术、P2P搜索及其分类作了简单总结和比较,并指出了P2P搜索技术未来的发展方向。     

An agent-based incentive mechanism for P2P systems

1 Introduction P2P systems differ from the traditional distributed computing systems. They are self-organizing, distributed resource-sharing networks. In P2P systems, there is no central authority that controls or manages the various components. Nodes can…     

P2P网络视频监控技术机制解析

当前,民用市场中中小企业和家庭视频监控规模呈爆发式增长,针对上千万摄像机的监控需求,产业界普遍采用点对点（peer to peer,P2P）网络视频监控技术,综合阐述了P2P网络视频监控技术原理,分析了主流的P2P 网络视频监控所采用的流媒体控制技术、传输技术以及私网穿越技术,最后提出了大规模部署的P2P视频监控解决方案建议。     

基于Pastry改进的P2P模型

有效的资源查询是P2P应用所面临的关键问题之一。通过对结构化Pastry进行研究,将性能稳定的超级节点组织成一个主Pastry环,普通节点根据自身的物理位置关系动态地加入到某个子Pastry环中,主环和子环通过超级节点相互连接构成覆盖网络。仿真结果表明：改进后的模型查询性能优于Pastry,更好地适应动态的网络环境。     

Modeling and analysis of anti-worm in P2P networks

Anti-worm is an effective way to fight against malicious worm and has been followed closely by malicious worm researchers recently.However,active and passive confronting technologies in peer-to-peer (P...