二层交换机中IGMP/MLD探听机制的原理分析

IGMP/MLD探听是一项基础的高性能网络技术,用于解决由二层交换设备构成的局域网中的多播数据流扩散问题.分析了它的基本机制,给出了它的形式化描述.     

计算机网络的语音技术

本文通过对Ipv6组播技术、资源预留协议、VOIP等技术的介绍，阐述了在计算机网络的应用实例，说明了技术实现。     

IPTV在有线HFC网络上的实现

文章就IPTV的组网技术选择,IPTV的系统组成及其在有线电视HFC网上实现所必需的组播技术、信息编码、内容分发网络等关键技术进行了论述.     

离散萤火虫算法在车载网的应用

车载自组织网(Vehicular ad hoc network,VANET)是移动自组织网络之一,具有节点变动迅速、拓扑结构灵活、通信能力要求较高的特点。为提高车载自组织网络的可靠性,实现数据的安全共享和快速交互,将离散萤火虫(DFA)算法应用求解车载网络中具有服务质量约束的多播路由问题。根据VANET的路由特点,将该问题转化为延迟成本最小化约束优化问题,并将车载网络路径时延转化为萤火虫的荧光素值,然后将该算法用4个实例进行测试,并与Dijkstra最短路径算法、粒子群优化算法进行比较。研究结果表明:离散萤火虫算法性能更佳,可有效解决VANET中Steiner minimum tree(SMT)问题,成功取得最优路径。该算法在一定程度上稳定了网络拓扑结构,能够实时更新节点信息。     

一种基于多等级拥塞标记的分层组播方案

针对分层组播中存在的公平性、分组丢失、收敛和响应速度缓慢等问题,提出一种基于多等级拥塞标记的分层组播方案LM-MCM。该方案通过引入一个多等级拥塞标记策略,使中间路由器能够根据输出端口的队列状况对流经本端口的组播分组进行标记,接收端根据标记值判断当前网络的拥塞等级,并据此进行相应的层次订阅调整,实现对网络拥塞的响应。仿真实验表明新方案能够快速收敛到最优订阅层次并逐渐稳定在该层次上;当网络发生拥塞时能够及时响应拥塞以减少不必要的分组丢失;同时LM-MCM还具有良好的会话间公平性和一定程度的TCP友好性。     

A probabilistic characterization of a fault-tolerant gossiping algorithm

Gossiping is a popular technique for probabilistic reliable multicast (or broadcast). However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times (or rounds); whereas in gossiping, an infected node (i.e., a node having received the message in question) may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models (especially that every node has equal contact to everyone else in the population) has been silently inherited in the gossiping literature, meaning that an expensive membership protocol is often needed for maintaining nodes’ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes (known as “push-based gossiping”) based on a novel probabilistic model, while taking the afore-mentioned factors into consideration. This work is supported in part by the US National Science Foundation. The views and conclusions contained in the paper are those of the authors and should not be interpreted as, in any sense, the official policies or endorsements of the government or the agencies.     

单小区多播业务调度算法设计与仿真

在分析现有无线通信系统多播业务调度算法的基础上,针对每个MS同时接收多个多播业务的场景,提出两种单小区多播业务调度算法:基于流行度的SC-PPMS算法和基于相似度的SC-SPMS算法.仿真结果表明,SC-PPMS和SC-SPMS算法在保证MS服务质量的同时明显减少了小区内所有MS的总醒来次数,进而有效降低了MS的总的能耗.同时,从计算复杂度、带宽占用率等角度综合分析考虑,得出了两种算法的不同适用范围.     

基于光分组交换的高性能计算机系统分析

提出基于光分组交换及组播的新型高性能计算机系统,分析了系统冲突产生的原因.提出基于循环光纤延时线(Rec-FDL)的冲突解决方案,建立了该结构解决系统冲突时的稳定性及时延模型.比较了Rec-FDL与分组重传冲突解决机制的稳定性及时延特性.Rec-FDL架构所接入的CPU及从节点分组到达率比分组重传机制分别多了400和100 packets/s,具有更高稳定性;分组到达率为500 packets/s时,若CPU与控制节点距离大于20 km,Rec-FDL架构在输出端口产生的时延比分组重传机制至少小4.5 ms;若增至50 km,Rec-FDL架构在系统内部产生的时延比分组重传机制小5 μs.Rec-FDL架构更适于构建分布式HPCS及大范围的网格计算网络.     

链路优化时延约束组播路由的遗传算法

针对网络的瓶颈路径易造成网络拥塞的现象,分析了链路负载不平衡的原因,重新给出链路代价定义,提出一种遗传算法求解该类组播路由问题.算法从链路代价权值转化开始,以满意的时延树为遗传算法的初始解集,然后在交叉操作过程中不断地用低链路代价的边代替树中高链路代价的边,以求得满足链路代价最优的组播树.仿真结果表明,该算法在考虑网络的负载均衡情况下,选择链路代价较低的空闲路径,快速、有效地构建满足时延要求,链路代价最小的组播树.