一种新的QoS保证的快速组播路由算法

提出了一种新的服务质量保证的组播路由算法。算法使用了一个修改的斯坦利树近似算法来构建时延有界的低代价组播树，再通过最小时延路径与其他尚不在组播树的组内节点连接，并消除环路。理论和仿真表明，新算法与其他一些时延有界组播路由算法一样有较好的性能。并且有较小的复杂度。     

高效率的小规模Ad Hoc组播路由协议

Ad Hoc网络中,组播路由协议具有广泛的应用前景。但由于网络拓扑的变化和节点能量的限制,设计具有高效传输能力的组播路由协议比较困难。通过综合比较表驱动路由协议与按需路由协议的优缺点,并且考虑Ad Hoc网络中节点的移动性以及路由发现与路由维护的方法对传输效率的影响,在无状态组播路由的基础上,使用表驱动与按需路由驱动相结合的路由方法,提出一种新的组播路由协议,使传输效率有较高的提升。     

光组播路由代价与波长使用量的联合优化方法

为解决光组播路由中组播中路由代价和波长资源消耗单一化造成的组播路树路由的代价过高问题,在分光节点约束条件下,提出了光组播路由代价与波长使用量联合优化的长路优先(LPF)方法和短路优先(SPF)方法。算法通过检查最小光组播树是否存在节点分光约束的问题,根据设置的波长使用代价控制因子,使LPF或SPF的路由代价和波长使用量最小。LPF方法首先选择组播树最长路径或新波长通道重路由受分光约束的目的节点,SPF方法先选择组播树中最短路径或新波长通道重路由受分光约束的目的节点,仿真结果表明,本文提出的两种联合优化方法都能实现路由代价较低和波长需求较少的目的。     

IP网组播的实现机制（下）

广域网上的组播实现有多种技术方式，但是最常用的实现方式是采用PIM—SM组播路由协议。PIM—SM协议与单播路由协议无关，并可同时支持基于源的组播树和共享树两种组播方式，特别是它是实现跨AS域组播的基础。因此，当前多数网络是以PIM—SM作为其组播路由协议。下面，将针对实例详细介绍PIM—SM的组播实现方式。     

IPv6组播路由协议仿真研究

分析了PIMIPv6组播路由协议的原理．在NS2网络模拟环境下设计了组播网络仿真模型，编写了实现PIM组播路由协议的代码。成功模拟了协议运行过程。在此基础上。对比分析了不同PIM组播路由协议的性能特点，并指出了其应用特性。     

基于GMPLS控制平面的ASON组播

阐述了利用自动交换光网络(ASON)实现组播的意义,分析了ASON组播的GMPLS信令协议、路由协议,给出了通过改进ASON现有技术实现组播的可行方案,包括信令过程和路由算法,得出结论并对ASON组播的前景作出展望。     

IP Multicast组播技术——网络广播的基石(二)

２几种主要的路由协议２ １ＩＰ组播路由的两种模式———密集模式 ,稀疏模式由一个特定的“源 ,宿组”对表示的ＩＰ组播 ,是指通过一个将该组中所有的主机联结在一起的一个生成树 (ｓｐａｎｎｉｎｇｔｒｅｅ) ,将信息从源端分发到所有接收者的传输。不同的ＩＰ组播路由协议采用不同的技巧构造生成树 ,一旦构造了一个树 ,所有的组播流就通过它进行分发。ＩＰ组播路由选择主要有两种方法。ＩＰ组播路由协议一般根据组播组的成员在整个网络上的预期分布 ,在两种方法中选择其中之一来构造生成树。第一种方法假定组播组成员密集地分布在整个网络…     

一种新的QoS组播路由算法

针对现有的求解多约束QoS组播路由中存在的问题,结合BP神经网络局部搜索的优势和蚁群算法全局搜索的优势的特点,进行QoS组播路由算法的设计,提出了一种新型的NNAC算法。该算法通过BP神经网络寻找路径的更优解,改善了QoS组播路由路径寻找的方法。通过实验仿真表明,NNAC算法得到最优组播树的总延时为35,总代价费用为21,在完成150个度约束组播路由路径时,NNAC算法在进行最优组播树的寻找成功率上高于AC算法,同时该算法还克服了AC算法易陷入局部最小点的不足。     

基于遗传算法优化的QoS组播路由算法

QoS组播路由技术作为网络多媒体信息传输的一种核心技术,下一代网络中的QoS组播路由的优化算法已经成为目前研究的一个热点。针对QoS组播的网络模型,提出一种适用于下一代网络的组播路由算法能够更好的满足下一代网络的QoS组播需求显得尤为重要。本文讨论了遗传算法优化的QoS组播路由算法,最后探讨了下一代网络QoS组播路由算法的研究方向。     

无线ATM标签交换上的基于可变QoS的IP组播

一个移动IP组播原型结合了无线异步传输模式标签交换，它的核心建立在组播的体系结构上。MCOM创建了独立于成员所属网络的多核心的第二层多点交换树，并通过Internet第三层多点交换路由来互相连接。Internet与无线ATM边界的网关把IP包转换成ATM信元，但需要改变ATM阻塞传送能力解决信元交叉问题。另外，讨论了动态组管理、组播重选路由和可靠组播与现在的各种网络协议的关系。     

基于网络控制的分层多点播送速率控制机制研究

本文在视频分层编码及分层传输协议的基础上，将基于网络控制与接收端控制机制相结合，提出一种新的分层多点播送速率控制机制。文中给出了该机制的拥塞检测、流行度权衡和数据层增加和丢弃算法。实验结果表明，该速率控制机制通史对拥塞做也快速响应，并在较好利用宽带的基础上保证高流行度的会话流具有较好的服务质量。     

Channel‐switching and power control mechanisms for improving network connectivity in wireless mesh networks

A Wireless Mesh Network (WMN) consists of fixed wireless routers, each of which provides service for mobile clients within its coverage area and inter‐connects mesh routers to form a connected mesh backbone. Wireless mesh routers are assigned with a channel or a code to prevent collisions in transmission. With a power control mechanism, each router could be assigned with a power level to control connectivity, interference, spectrum spatial reuse, and topology. Assigning high transmitting power level to a router can enhance the network connectivity but may increase the number of neighbors and worsen the collision problem. How to assign an appropriate power level to each router to improve the network connectivity with a constraint of limited channels is one of the most important issues in WMNs. Given a network topology and a set of channels that has been assigned to mesh routers, the proposed channel‐switching mechanism further reassigns each router with a power level and switches channels of routers to optimize both power efficiency and connectivity. A matrix‐based presentation and operations are proposed to respectively identify and resolve the channel switching problems. Simulation study reveals that the proposed mechanisms increase network throughput and provides a variety of route selection, and thus improves the performance of a given WMN. Copyright © 2009 John Wiley & Sons, Ltd.     

Local and dynamic analysis of Internet multicast router topology

We study data on routers topology gathered using IGMP messages. Although this mechanism is limited to multicast routers we show that it allows getting precise information on the local topology of routers. This information is difficult to obtain with classical tools based on traceroute. Moreover its low cost allows to frequently collect data and to study the dynamics of this topology.     

Ensuring safety and efficiency in networks-on-chip

Networks-on-Chip (NoCs) for real-time systems require solutions for safe and predictable sharing of network resources between transmissions with different quality of service requirements. In this work, we present a mechanism for a global and dynamic admission control in NoCs dedicated to real-time systems. It introduces an overlay network to synchronize transmissions using arbitration units called Resource Managers (RMs), which allows a global and work-conserving scheduling. We present a formal worst-case timing analysis for the proposed mechanism and demonstrate that this solution not only exposes higher performance in simulation but, even more importantly, consistently reaches smaller formally guaranteed worst-case latencies than TDM for realistic levels of system's utilization. Our mechanism does not require the modification of routers and therefore can be used together with any architecture utilizing non-blocking routers.     

Core‐stateless fair rate estimation fair queuing

Core‐stateless mechanisms, such as core‐stateless fair queuing (CSFQ), reduce the complexity of fair queuing, which usually need to maintain states, manage buffers, and perform flow scheduling on a per‐flow basis. However, they require executing label rewriting and dropping decision on a per‐packet basis, thus preventing them from being widely deployed. In this paper, we propose a novel architecture based on CSFQ without per‐packet labelling. Similarly, we distinguish between edge routers and core routers. Edge routers maintain the per‐flow state by employing a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per‐flow state; they use FIFO packet scheduling extended by a fare rate alarm mechanism by estimating the arrival rate and the number of flows using a matching–mismatching algorithm. The novel scheme is called core‐stateless fair rate estimation fair queuing (CSFREFQ). CSFREFQ is proven to be capable of achieving max–min fairness. Furthermore, we present and discuss simulations and experiments on the performance under different traffic scenarios. Copyright © 2005 John Wiley & Sons, Ltd.     

基于重构的片上网络容错机制

为了保证片上网络的可靠性,本文提出了一种新的容错机制。在片上网络中由于路由器故障将导致与其连接的IP核不能与其他核通信,使片上网络的可靠性降低。本文的方法通过选择最优相邻的路由器来替代故障路由器,从而达到恢复IP核通信的目的。通过为每个路由器配置一个状态寄存器,用来存储相邻路由器的安全度,在路由时采用新的可重构路由算法绕过故障的路由器,以提高片上网络的可靠性。在OPNET平台上对5×52D-Mesh结构的片上网络进行仿真实验,统计了数据传输延时。试验结果表明,本文提出的路由算法与对比文献的路由算法相比,在延迟方面有明显的优势。     

Avoiding Transient Loops During the Convergence of Link-State Routing Protocols

When using link-state protocols such as OSPF or IS-IS, forwarding loops can occur transiently when the routers adapt their forwarding tables as a response to a topological change. In this paper, we present a mechanism that lets the network converge to its optimal forwarding state without risking any transient loops and the related packet loss. The mechanism is based on an ordering of the updates of the forwarding tables of the routers. Our solution can be used in the case of a planned change in the state of a set of links and in the case of unpredictable changes when combined with a local protection scheme. The supported topology changes are link transitions from up to down, down to up, and updates of link metrics. Finally, we show by simulations that sub-second loop-free convergence is possible on a large Tier-1 ISP network.     

Control architecture in optical burst-switched WDM networks

Optical burst switching (OBS) is a promising solution for building terabit optical routers and realizing IP over WDM. In this paper, we describe the basic concept of OBS and present a general architecture of optical core routers and electronic edge routers in the OBS network. The key design issues related to the OBS are also discussed, namely, burst assembly (burstification), channel scheduling, burst offset-time management, and some dimensioning rules. A nonperiodic time-interval burst assembly mechanism is described. A class of data channel scheduling algorithms with void filling is proposed for optical routers using a fiber delay line buffer. The LAUC-VF (latest available unused channel with void filling) channel scheduling algorithm is studied in detail. Initial results on the burst traffic characteristics and on the performance of optical routers in the OBS network with self-similar traffic as inputs are reported in the paper.     

TIE Breaking: Tunable Interdomain Egress Selection

In a large backbone network, the routers often have multiple egress points they could use to direct traffic toward an external destination. Today's routers select the ldquoclosestrdquo egress point, based on the intradomain routing configuration, in a practice known as early-exit or hot-potato routing. In this paper, we argue that hot-potato routing is restrictive, disruptive, and convoluted and propose an alternative called TIE (Tunable Interdomain Egress selection). TIE is a flexible mechanism that allows routers to select the egress point for each destination prefix based on both the intradomain topology and the goals of the network administrators. In fact, TIE is designed from the start with optimization in mind, to satisfy diverse requirements for traffic engineering and network robustness. We present two example optimization problems that use integer-programming and multicommodity-flow techniques, respectively, to tune the TIE mechanism to satisfy networkwide objectives. Experiments with traffic, topology, and routing data from two backbone networks demonstrate that our solution is both simple (for the routers) and expressive (for the network administrators).     

A Transparent Failover Mechanism for a Mobile Network with Multiple Mobile Routers

In a mobile network that is multihomed by multiple mobile routers, a mobile router that loses link connectivity can be replaced by the other mobile routers. We propose a transparent failover mechanism (TFM) to provide seamless Internet services to nodes in the mobile network, which is validated by implementing a real test-bed. Compared to the network mobility basic support protocol, TFM does not require the nodes attached to the failed mobile router to change their addresses, and hence has two advantages: (a) IP connectivity is maintained transparently, and (b) failover is quickly accomplished by avoiding the address re-configuration process in each node.