基于主机性能评价的视频会议系统优化方案

组播技术的出现为基于P2P的视频会议系统提供了负载更小的开发方案,但在传统的组播技术支持下,分配到每台主机上的负载量依然可观。为解决突发负载问题,文中提出了一种基于主机性能评价的应用层组播算法,利用拓扑信息减少冗余数据在网络上传输,根据主机性能平衡负载分配,减轻主机负担。之后,在此组播算法之上,阐述了一种传统视频会议系统的优化实现方案。     

一种基于访问频率的非结构化P2P复制策略

旨在通过数据复制来提高非结构化P2P系统的数据访问效能,提出了基于访问频率的复制策略—AFRE算法,该算法通过赋予不同时间片的访问记录不同的权重,计算数据的局部访问频率,并将适量的数据副本放置到节点度较大的节点.实验证明,提出的复制策略在副本总数明显减少的情况下,能够获得较好的平均查询长度及优于其他常用复制策略的查询成功率.     

P2P与组播结合实现高质量IP视频直播承载

本文首先研究了高质量IP视频直播技术要求特点,然后分别对P2P及组播承载高质量IP视频直播进行分析,发现两者均存在一定的缺点。本文提出了一种P2P与组播结合实现高质量IP视频直播承载的技术方案,很好地解决了以上问题。     

P2P与组播结合实现高质量IP视频直播承载

本文首先研究了高质量IP视频直播技术要求特点，然后分别对P2P及组播承载高质量IP视频直播进行分析，发现两者均存在一定的缺点。本文提出了一种P2P与组播结合实现高质量IP视频直播承载的技术方案，很好地解决了以上问题。     

基于Mesh优先的P2P流媒体应用层组播算法

解决数据流动途径(即构造合理的组播结构)问题,是实现覆盖网组播的关键因素.通常而言,绝大部分的群组通信均能够将其简化为以下模型,即仅仅牵涉一个源节点与诸多目的节点,我们所需要做的就是以最快的速度将目标数据从源节点传输到全部目的节点.当前,由于当前各种网络终端数量急剧增加,目的节点数目巨大,为了有效解决这一问题,我们可以...     

P2P流媒体中的多发送端选择算法

 在多对单P2P流模式下,如何选择多个发送端,并为其最优地分配发送速率和数据是一个难题.为此,提出了一种新的多发送端选择和最优速率及数据分配算法(MSRDA).首先把待解决的问题模型化为线性最优化问题,然后给出了求解最优化问题的算法.不同于已有的算法只按链路的丢包率来选择发送端,MSRDA根据到各发送端链路的丢包率与链路的可用带宽比升序排序来选择多发送端,并最优地分配发送速率和数据.理论分析和仿真实验结果表明:在不同的网络条件下MSRDA能有效地减少聚合带宽的丢包率,并具有自适应性,优于现有同类算法.     

组播VPN以及P2MP技术在广电网络中的应用

本文介绍了关于MPLS VPN组播以及P2MP技术与组播技术结合方面的一些信息.     

基于平衡多叉树的P2P网络拓扑研究

为了进一步提高P2P网络的服务质量,构建性能更为优良的P2P网络,提出了一种新的基于平衡多叉树P2P网络(MBTN)拓扑构建方案,对相关的调度算法进行了研究,并详细阐述了在该拓扑网络上节点加入和退出算法.最后,从节点平均恢复时间、平均延迟时间两方面对MBTN拓扑结构组播网络上的P2P业务进行仿真试验.实验表明,基于MBTN仿真出的拓扑网络可以有效减少节点恢复时间和延迟时间,较好地降低了控制成本.     

基于自适应蚁群的多约束QoS组播路由算法

结合多约束QoS组播路由的特点,应用一种自适应蚁群优化算法解决组播路由问题.考虑到实际通信中链路利用率对网络的影响,将网络中链路的带宽转化为链路的代价问题,并在蚁群算法中根据蚂蚁所选路径的代价进行信息素更新,增加了信息素调整的自适应性,同时加快了算法的收敛速度,使得组播路由算法在考虑网络QoS约束的基础上进一步贴合实际网络的需求.     

无线Ad-Hoc网络中P2P文件搜索机制的研究

对低移动性、频繁搜索文件的无线Ad-Hoc网络,提出一种新型P2P文件共享系统,介绍一种将文件查找和路由功能统一起来形成跨层的方案.所有共享文件采用全分布哈希表,在无线网络拓扑结构建立的同时存储和保留位置信息以及路由信息,通过节点间的树形逻辑结构解决共享文件的定位查询和下载问题.     

基于多竞价拍卖机制的对等网络 分布式组播协议研究

本文提出了一种新的对等网络组播算法,该算法能通过多竞价拍卖机制有效地遏制了组播节点的自私行为和其它恶意行为.同时,本文提出了分布式的组播协议,以保证该组播算法在高度动态的对等网络环境下有效运行.仿真结果验证了本文所提组播算法及协议的有效性和可靠性.     

非集中式P2P系统信任值安全管理的研究

由于P2P系统的开放性、匿名性和动态性,使得实体之间难以确定相互的可靠性。信任值这一概念的引入基本解决了这一问题,同时也使得信任值在整个P2P系统中扮演了至关重要的角色。论文提出了一种能够安全地管理非集中式P2P系统信任值的协议,从而保证了信任值的安全存储、分发、访问以及修改。     

Fast Handover Mechanism for Seamless Multicasting Services in Mobile IPv6 Wireless Networks

This paper proposes a fast handover mechanism to provide a seamless multicast service for Mobile IPv6 hosts. With the proposed Fast handover based on a Mobile IP-Multi casting (FMIP-M) protocol, the selection of a new multicast service method, service preparation, and initialization procedures are all performed during the fast handover period, thereby enabling a reliable and efficient multicast service. When mobile hosts move to other networks, they can encounter data loss, out-of-synch problems for multicast data, and multicast service exchange latency. Therefore, the proposed FMIP-M allows the new access router to select a suitable multicast service method according to the multicast service-related network conditions and supports a reliable multicast transmission by compensating for data losses from the previous access router. An analysis is conducted of the overheads associated with a fast multicast handover, including the signaling cost and multicast packet-forwarding cost, where the costs are formulated based on timing diagrams, and compared with a fast handover using Mobile IPv6. The performance analysis and numerical results confirm that the proposed FMIP-M provides a fast multicast handover and reliable service with a relatively small signaling cost and packet-delivery cost.     

对等网络流量检测技术研究

P2P流量检测技术可分为基于流量特征的识别方法(TLI)和基于深层数据包识别方法(DPI)。TLI通过对传输层数据包进行分析并结合P2P系统所表现出来的流量特征,来识别某个网络流是否属于P2P。DPI采用协议分析与还原技术,提取P2P应用层数据,通过分析其载荷所包含的协议特征值,来判断网络流量是否属于P2P应用。DPI由于具有准确性高、健壮性好、具有分类功能,是P2P流量识别的主要方法。如果能够结合TLI和DPI的优点,就有可能设计出一个准确、高效的P2P流量实时识别算法。     

Reliable concurrent multicast from bursty sources

This paper presents a protocol and design for concurrent and reliable group multicast (many-to-many) from bursty data sources in general networks. In a group multicast, any node can be a multicast source and multiple nodes may start to multicast simultaneously, i.e., an asynchronous access to the network. The reliable multicast protocol presented is window based with a combined sender and receiver initiation of the recovery protocol. In reliable multicasting the necessary requirement is to ensure that data is received correctly by all the active members of the multicast group. The approach taken is to combine the multicast operation with the internal flow control. As a result, it is possible to provide: (1) congestion-free multicast routing with a single and immediate acknowledgment message to the sender. Furthermore, in every multicast, (2) a node can access all the capacity allocated to its group with no delay, however, if several nodes are active in the same group, then the capacity will be shared fairly. In addition, (3) each sender in the multicast group uses a single timer, and (4) a node can become active or inactive in a transparent fashion, i.e., there is no need to explicitly notify the members of the group. A multiple criteria optimization study of the bandwidth allocation to each multicast group is presented. The optimization problem has two min-max objective functions: (1) for delay, which is caused by the number of links needed to connect the group, and (2) for congestion, which is caused by sharing a link among multiple multicast groups. The bandwidth allocation among multicast groups sharing the same link are further optimized using the max-min fairness criterion     

A Simple and Efficient One‐to‐Many Large File Distribution Method Exploiting Asynchronous Joins

In this paper, we suggest a simple and efficient multiple‐forwarder‐based file distribution method which can work with a tree‐based application layer multicast. Existing multiple‐forwarder approaches require high control overhead. The proposed method exploits the assumption that receivers join a session at different times. In tree‐based application layer multicast, a set of data packets is delivered from its parent after a receiver has joined but before the next receiver joins without overlapping that of other receivers. The proposed method selects forwarders from among the preceding receivers and the forwarder forwards data packets from the non‐overlapping data packet set. Three variations of forwarder selection algorithms are proposed. The impact of the proposed algorithms is evaluated using numerical analysis. A performance evaluation using PlanetLab, a global area overlay testbed, shows that the proposed method enhances throughput while maintaining the data packet duplication ratio and control overhead significantly lower than the existing method, Bullet.     

A media access and feedback protocol for reliable multicast over wireless channel

A link level reliable multicast requires a channel access protocol to resolve the collision of feedback messages sent by multicast data receivers. Several deterministic media access control protocols have been proposed to attain high reliability, but with large delay. Besides, there are also protocols which can only give probabilistic guarantee about reliability, but have the least delay. In this paper, we propose a virtual token-based channel access and feedback protocol (VTCAF) for link level reliable multicasting. The VTCAF protocol introduces a virtual (implicit) token passing mechanism based on carrier sensing to avoid the collision between feedback messages. The delay performance is improved in VTCAF protocol by reducing the number of feedback messages. Besides, the VTCAF protocol is parametric in nature and can easily trade off reliability with the delay as per the requirement of the underlying application. Such a cross layer design approach would be useful for a variety of multicast applications which require reliable communication with different levels of reliability and delay performance. We have analyzed our protocol to evaluate various performance parameters at different packet loss rate and compared its performance with those of others. Our protocol has also been simulated using Castalia network simulator to evaluate the same performance parameters. Simulation and analytical results together show that the VTCAF protocol is able to considerably reduce average access delay while ensuring very high reliability at the same time.     

BowCast：一种适应非对称链路延时网络的P2P多播路由协议

虽然IP多播的性能优势无可否认,但是它却面临着部署上的困难。近年来,P2P多播作为提供多播服务的另一可行途径正不断为人们所认可。研究非对称链路延时网络环境下P2P多播的路由问题,提出一个新的P2P多播路由协议：BowCast.该协议采用基于树（tree-based）的分布式路由策略,使多播组成员之间能自组织地构建一棵基于源的最小延时P2P多播树。BowCast主要利用范围受限的单向探测技术（BOW）来实现路由优化算法。BOW能提供端系统节点间的单向相对延时,无需全局的同步时钟。仿真实验表明,BowCast能很好地适应非对称链路延时环境。通过调节BOW的探测范围,BowCast能灵活地在路由性能和控制开销之间进行折中。     

Efficient Resource Allocation for Wireless Multicast

In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet protocol (IP) multicast tree by adaptively selecting the cell and the wireless technology for each mobile host to join the multicast group. Our mechanism enables more mobile hosts to cluster together and leads to the use of fewer cells to save the scarce wireless bandwidth. Besides, the paths in the multicast tree connecting to the selected cells share more common links to save the wireline bandwidth. Our mechanism supports the dynamic group membership and offers mobility of group members. Moreover, our mechanism requires no modification to the current IP multicast routing protocols. We formulate the selection of the cell and the wireless technology for each mobile host in the heterogeneous wireless networks as an optimization problem. We use integer linear programming to model the problem and show that the problem is NP-hard. To solve the problem, we propose a distributed algorithm based on Lagrangean relaxation and a network protocol based on the algorithm. The simulation results show that our mechanism can effectively save the wireless and wireline bandwidth as compared to the traditional IP multicast.     

一种基于Echord协议的网格资源发现方法

针对网格集中式的资源发现方法存在单点失效、负载均衡差等问题,提出利用P2P技术进行网格资源发现方法.该方法通过改进Chord协议的后继节点函数和finger表,提出Echord(Enhanced Chord)协议,结合Echord协议特点,将网格中的虚拟组织构建成环状拓扑结构.网格资源被描述成基于XML的RDF形式,并按照一定的资源部署算法被均衡地发布在网格节点上.给出了如何应用Echord协议进行网格资源发现的算法.理论分析和仿真实验结果表明,相比于基于Chord的网格资源发现方法,该方法能改善系统的平均查找长度、消息传播性能、资源随机查找成功率.