A general methodology for direction-based irregular routing algorithms

This paper presents a general methodology for generating deadlock-free routing algorithms for irregular networks. Constructing a spanning tree on the given network, assigning directions to the network channels, creating deadlock-free zones, and specifying a logical sequence of the produced deadlock-free zones are the four fundamental steps that the proposed methodology takes to generate deadlock-free and connected routing algorithms. By applying the proposed methodology with two known labeling methods we have generated six irregular routing algorithms: three of them are novel routing algorithms and three of them (the Up/Down, Left/Right, and L-turn routing algorithms) have already been proposed in the literature. Extensive simulation experiments have been performed considering various network topologies, different network sizes (considering different network nodes and network channels), various message lengths, a variety of spanning tree roots, and a wide range of message (traffic) generation rates. Simulation results show that the six routing algorithms can be divided into three pairs. Routing members of each pair show similar behavior in terms of message latencies and saturation generation rates. However, it is worth noting that for a given topology the performance of the six routing algorithms may be totally different and it mainly depends on the network topology.     

城域以太网物理拓扑发现算法研究

在现代城域以太网中,自动物理拓扑发现对提高管理效率非常重要,然而当前存在的一些商业化的网络管理工具主要是针对逻辑拓扑发现或某种设备的管理。而在[1]-[3]中的算法主要是依赖标准的SNMP的AFT信息,在网状的网络中,这种条件只能发现生成树路径。我们的算法能发现包括生成树中非激活的接口在内的完全的物理拓扑。     

Convergence routing on disjoint spanning trees

This paper presents a new design and a performance study for convergence routing in a general network with multiple spanning trees. Such an arbitrary topology network is used in the design of a switch-based LAN/MAN architecture. Convergence routing can be viewed as a variant of deflection routing which combines, in a dynamic fashion, the on-line routing decision with the traffic load inside network. However, unlike other deflection techniques, convergence routing guarantees that packets will reach (or converge) to their destinations.In particular, a new algorithm for constructing two edge-disjoint spanning trees of a given network is presented, and the resulting trees are used for convergence routing. It is shown empirically that convergence routing on two edge-disjoint spanning trees yields a better bound than a single spanning tree, on the maximum route length. The construction of the two edge-disjoint spanning trees is done with specific strategies for improving the fault-tolerance and performance of the system.     

A Timed Verification of the IEEE 1394 Leader Election Protocol

The IEEE 1394 architecture standard defines a high performance serial multimedia bus that allows several components in a network to communicate with each other at high speed. In the physical layer of the architecture, a leader election protocol is used to find a spanning tree with a unique root in the network topology. If there is a cycle in the network, the protocol treats this as an error situation. This paper presents a formal model of the leader election protocol in the language IOA and a correctness proof. Hereby, it is shown that under certain timing restrictions the protocol behaves correctly. The timing parameters in the IEEE 1394 standard documentation obey the restrictions found in this proof.     

Bandwidth sensitive fast failure recovery scheme for Metro Ethernet

Restoration in Ethernet has evolved over the years as specified in various standards: first the classical reconstruction of spanning trees was proposed in 802.1d; later 802.w specified RSTP to reduce the convergence time required in the STP protocol. Recently, the use of multiple spanning tree was suggested in 802.1s standard. In addition, there have been several proposals to implement multiple tree based restoration. Even though the results are promising they fall short of elevating Ethernet to a carrier grade technology. In this paper, we develop a distributed fast failure recovery spanning tree scheme, which restores lost facilities within tens of milliseconds. Recovery algorithm is localized around the point of failure on the spanning tree, thus avoiding disruption of the entire network. Failures are repaired using pre-configured sub spanning trees which are computed based on traffic requirements and resource availability. This paper also proposes possible enhancements to the failure recovery method using IEEE link aggregation standard to further reduce restoration time and provide differentiated survivability.     

基于6LoWPAN的嵌入式多网关系统设计与实现

6LoWPAN是一种在IEEE802.15.4标准基础上IP化实现无线传感器网络的技术。在现有单目的导向的有向无环图（DODAG）环路由协议标准下,存在围绕单边界路由器的网络拥塞和能耗问题。设计了一种嵌入式6LoWPAN多网关协议和系统,嵌入式网关节点具备双模通信功能,可实现无线传感网（WSN）和固定IPv6网络的物理连接,双模网关通过固网建立与6LoWPAN根边界路由器之间的IP隧道来实现上下行路由。通过对现有6LoWPAN协议标准的补充和优化,使双模节点具有网内和网际路由能力,从而实现多网关架构和多径路由功能。优化的多点互通拓扑位置和流量分担算法实现上下行链路的有效负载平衡,也减小了节点多跳路由能耗。通过对多网关平台进行实验测试,并与单网关系统对比测试,结果表明该方案不仅实现了6LoWPAN在以太网的多点接入,降低了网络内数据传输时延和丢包率,并且提升了网络整体吞吐量。     

A Service-Centric Multicast Architecture and Routing Protocol

In this paper, we present a new multicast architecture and the corresponding multicast routing protocol for providing efficient and flexible multicast services over the Internet. Traditional multicast protocols construct and update the multicast tree in a distributed manner, which may cause two problems: first, since each node has only local or partial information on the network topology and group membership, it is difficult to build an efficient multicast tree and, second, due to the lack of complete information, broadcast is often used for sending control packets and data packets, which consumes a great deal of network bandwidth. In the newly proposed multicast architecture, a few powerful routers, called m-routers, collect multicast-related information and process multicast requests based on the information collected. The m-routers handle most of the multicast-related tasks, whereas other routers in the network only need to perform minimum functions for routing. The m-routers are designed to be able to handle simultaneous many-to-many communications efficiently. The new multicast routing protocol, called the Service-Centric Multicast Protocol (SCMP), builds a shared multicast tree rooted at the m-router for each group. The multicast tree is computed in the m-router by employing the Delay-Constrained Dynamic Multicast (DCDM) algorithm, which dynamically builds a delay-constrained multicast tree and minimizes the tree cost as well. The physical construction of the multicast tree over the Internet is performed by a special type of self-routing packets in order to minimize the protocol overhead. Our simulation results on ns-2 demonstrate that the new SCMP protocol outperforms other existing protocols and is a promising alternative for providing efficient and flexible multicast services over the Internet.     

DBridges: Flexible floodless frame forwarding

Ethernet has become the de facto layer 2 transmission technology, partly due to ease of use and cost efficiency. The cores of most data centers around the world are based on Ethernet, and large access and core networks are built without IP routing. The inherent simplicity of Ethernet has several drawbacks, including the overhead of network-wide broadcasting and the use of the spanning tree protocol. The academia and the industry have presented numerous solutions to overcome the limitations of Ethernet. Many of these solutions have deployment constraints and often force a change of the whole network.     

Internet路由仿真系统研究与实现

随着Internet不断的发展扩大,如何测量路由协议实现在实际网络环境中的运行特性成为一个重要难题.针对这个问题,设计实现了Internet路由仿真系统IRES(Internet routing emulation system),为这种特性的测试和评价提供了试验床.首先提出了一种将Internet拓扑生成和路由协议实现相结合的思想,并基于此给出了IRES的总体结构.接着研究了将GT-ITM网络拓扑模型转换到面向BGP-OSPF的Internet拓扑结构的方法.最后给出了IRES的应用实例,通过与CISCO2600路由器的路由交互,分析得到了被测系统OSPF协议实现的复杂度为O((lgN)⁴),并给出了其所支持的网络规模上限.实验证明,IRES系统作为试验床,具有其他测试系统不可取代的重要作用.     

TCP／IP协议对快速网络的作用分析

1 引文 Myrinet和Gigabit-Ethernet是当今世界上性能最好的两种可以运用于局域网的高性能并行计算的网络系统。它们以其高效、高速的传输特点在广泛的领域里得到了好评。但是,这两种同样是高端的网络产品,其实现的技术在很多方面却是大相径庭的。而在当今的网络协议中,TCP/IP协议是当然的主角。无论是万维网(WWW),还是一般的局域网(LAN),我们都曾经,或者正在使用TCP/IP协议。对于TCP/IP协议,Myrinet和Gigabit-Ethernet有着不同选择。虽然对于Myrinet来说,用户能够直接挂接TCP/IP     

Fault-Tolerant Convergence Routing

This paper presents fault-tolerant protocols for fast packet switch networks withconvergence routing. The objective is to provide fast reconfiguration and continuous host-to-host communication after a link or a node (switch) failure,Convergence routingcan be viewed as a variant ofdeflection routing,which combines, in a dynamic fashion, the on-line routing decision with the traffic load inside the network. Unlike other deflection techniques, convergence routing operates withglobal sense of directionand guarantees that packets will reach or converge to their destinations. Global sense of direction is achieved by embedding of virtual rings to obtain a linear ordering of the nodes. We consider virtual ring embeddings over (i) a single spanning tree, and (ii) over two edge-disjoint spanning trees. Thus, the fault-tolerant solution is based on spanning trees and designed for a switch-based (i.e., arbitrary topology) architecture called MetaNet. In this work, the original MetaNet's convergence routing scheme has been modified in order to facilitate the property that the packet header need not be recomputed after a failure and/or a reconfiguration. This is achieved by having, at the network interface, a translator that maps the unique destination address to a virtual address. It is argued that virtual rings embedded over two-edge disjoint spanning trees increase the fault tolerance for both node and link faults and provides continuous host-to-host communication.     

EPON系统中虚拟网络设备的实现

描述了以太网无源光网络(EPON)系统的软件结构,分析了网管和生成树协议的实现需求,从而提出了B虚拟网络接口设备（Virtual Network Dcvice,VND)的方案,最后对方案实现进行了详细的叙述。     

An artificial bee colony algorithm for the minimum routing cost spanning tree problem

Given a connected, weighted, and undirected graph, the minimum routing cost spanning tree problem seeks a spanning tree of minimum routing cost on this graph, where routing cost of a spanning tree is defined as the sum of the costs of the paths connecting all possible pairs of distinct vertices in that spanning tree. This problem has several important applications in networks design and computational biology. In this paper, we have proposed an artificial bee colony (ABC) algorithm-based approach for this problem. We have compared our approach against four best methods reported in the literature—two genetic algorithms, a stochastic hill climber and a perturbation-based local search. Computational results show the superiority of our ABC approach over other approaches.     

一种基于责任域的安全路由体系

为了解决前缀劫持、路由伪造和源地址欺骗问题,设计了一种路由体系——基于责任域的安全路由体系(accountability realm based secure routing architecture,简称Arbra)。首先,提出了自治系统到责任域的映射方法和基于责任域的两级路由结构,责任域是具有独立管理主体的网络,也是 Arbra 网络拓扑的基本元素,因为它为内部用户的网络行为负责,所以称做责任域;其次,建立了基于责任域的路由体系设计框架,主要包括混合寻址方案、核心路由协议、标签映射协议、分组转发流程和公钥管理机制等研究内容;最后,比较了 Arbra 和其他著名路由结构(IPv4/v6,LISP,AIP)的异同,分析了Arbra的安全性、可扩展性、通信性能和部署代价。研究结果表明：(1) Arbra具有的分布式信任模型,不仅有利于抵御前缀劫持、路由伪造和源地址欺骗攻击,而且还给许多其他网络安全问题的解决奠定了基础;(2) Arbra具有优良的可扩展性,路由表的规模较小;(3) Arbra具有合理的通信性能和部署代价。该研究成果可以看做是以网络安全为视角对未来信息网络体系结构的有益探索。     

Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks

We propose the minimum Wiener index spanning tree (MWST) as a routing topology that is suitable for sensor networks with multiple mobile base nodes. However, it was proved that finding a spanning tree with the minimum Wiener index from a weighted graph is NP-hard. To address this problem and analyze the effectiveness of the MWST as the routing tree on sensor networks with multiple mobile base nodes, we designed two algorithms: a branch and bound algorithm for small-scale wireless sensor networks and a simulated annealing algorithm for large-scale wireless sensor networks. The simulation results show that MWST outperforms the minimum spanning tree (MST), one of the representative spanning trees used in many routing protocols for sensor networks, in terms of energy efficiency and packet delay.     

基于树形拓扑的无线Mesh网络路由协议研究

研究和分析了无线Mesh网络路由协议及其特点,提出了无线Mesh网络路由协议设计原则.遵循这些原则,充分利用Mesh网络全相连的优点构建出树形逻辑拓扑结构,该拓扑结构能满足无线Mesh网络业务特点的要求.在该拓扑树基础上设计了一种基于树形拓扑的无线Mesh网络路由协议(TTRP),该协议采用无开销的源地址学习方式构建路由相关表项,快速链路切换和路由重定向机制大大提高了TTRP路由协议的健壮性和网络的抗毁性.网络仿真结果表明了该路由协议的可行性.     

HFC网络支持生成树协议的透明网桥研究与实现

实现了一种在光纤同轴电缆混合接入(HFC)中连接电缆网络和以太网的透明网桥。该网桥基于电缆数据传输业务接口规范协议，在MAC层实现了MAC地址动态获取、MAC帧过滤和转发功能，利用生成树协议从逻辑上切断冗余的网络连接，将环路拓扑缩减为树形结构，从而解决了HFC网络中的环路拓扑结构造成的数据回传问题。该方法已经成功用于自主开发的物理层和MAC层芯片组成的HDTV双向系统平台，通过验证能有效去除网络冗余，防止广播风暴的产生。     

A fast algorithm for computing minimum routing cost spanning trees

Communication networks have been developed based on two networking approaches: bridging and routing. The convergence to an all-Ethernet paradigm in Personal and Local Area Networks and the increasing heterogeneity found in these networks emphasizes the current and future applicability of bridging. When bridging is used, a single active spanning tree needs to be defined. A Minimum Routing Cost Tree is known to be the optimal spanning tree if the probability of communication between any pair of network nodes is the same. Given that its computation is a NP-hard problem, approximation algorithms have been proposed.We propose a new approximation Minimum Routing Cost Tree algorithm. Our algorithm has time complexity lower than the fastest known approximation algorithm and provides a spanning tree with the same routing cost in practice. In addition, it represents a better solution than the current spanning tree algorithm used in bridged networks.     

OBQA: Smart and cost-efficient queue scheme for Head-of-Line blocking elimination in fat-trees

High-speed interconnection networks are essential elements for different high-performance parallel-computing systems. One of the most common interconnection network topologies is the fat-tree, whose advantages have turned it into the favorite topology of many interconnect designers. One of these advantages is the possibility of using simple but efficient routing algorithms, like the recently proposed deterministic routing algorithm referred to as DET, which offers similar (or better) performance than Adaptive Routing while reducing complexity and guaranteeing in-order packet delivery. However, as other deterministic routing proposals, DET cannot react when packets intensely contend for network resources, leading to the appearance of Head-of-Line (HoL) blocking which spoils network performance. In this paper, we describe and evaluate a simple queue scheme that efficiently reduces HoL-blocking in fat-trees using the DET routing algorithm, without significantly increasing switch complexity and required silicon area. Additionally, we propose an implementation of OBQA in a feasible switch architecture.     

A QoS multicast routing protocol for dynamic group topology

Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A multicast routing tree with multiple QoS constraints may be the tree in which the delay, delay-jitter, packet-loss and bandwidth should satisfy the pre-specified bounds. This paper discusses the multicast routing problem with multiple QoS constraints, which may deal with the delay, delay-jitter, bandwidth and packet-loss metrics, and describes a network model for researching the routing problem. It presents a QoS multicast routing protocol with dynamic group topology (QMRPD). The QMRPD attempts to significantly reduce the overhead of constructing a multicast tree with multiple QoS constraints. In MPRMQ, a multicast group member can join or leave a multicast session dynamically, which should not disrupt the multicast tree. It also attempts to minimize overall cost of the tree, and satisfy the multiple QoS constraints and least cost's (or lower cost) requirements. In this paper, the proof of correctness and complexity analysis of the QMRPD are also given. Simulation results show that QMRPD is an available approach to multicast routing decision with dynamic group topology.