基于MPLS流量工程的约束路由的研究

约束路由的使用促进了基于MPLS的流量工程的发展和实现.简单介绍了MPLS流量工程中约束路由的技术框架,提出了在支持Diff-Serv的MPLSTE环境下实施约束路由的一种算法,使得在保证使用有效链路的同时也保证了链路的QoS.     

Energy-aware IP traffic engineering with shortest path routing

Internet energy consumption is rapidly becoming a critical issue due to the exponential traffic growth and the rapid expansion of communication infrastructures worldwide. We address the problem of energy-aware intra-domain traffic engineering in networks operated with a shortest path routing protocol. We consider the problem of switching off (putting in sleep mode) network elements (links and routers) and of adjusting the link weights so as to minimize the energy consumption as well as a network congestion measure. To tackle this multi-objective optimization problem with priority (first minimize the energy consumption and then the network congestion), we propose a Mixed Integer Linear Programming based algorithm for Energy-aware Weights Optimization (MILP-EWO). Our heuristic exploits the Interior Gateway Protocol Weight Optimization (IGP-WO) algorithm for optimizing the OSPF link weights so as to minimize the total cost of link utilization. The computational results obtained for eight real network topologies and different types of traffic matrices show that it is possible to switch off a substantial number of nodes and links during low and moderate traffic periods, while guaranteeing that network congestion is low enough to ensure service quality. The proposed approach is also validated on two networks of emulated Linux routers.     

Interface split routing for finer-grained traffic engineering

Legacy IP routing restricts the efficacy of traffic engineering solutions. This restriction stems from the constraint that traffic at a node must be uniformly split across all next-hop nodes corresponding to equal cost shortest path to a destination. Proposals that alleviate this constraint either completely overhaul legacy IP routing, or introduce complex control and/or forwarding plane components. This additional complexity departs from the elegant simplicity of legacy routing protocols where statically optimized link weights embed all traffic engineering semantics.

We present Interface Split Routing (ISR), which retains the basic forwarding and control mechanism of legacy IP routing. Furthermore, a set of link weights embed all traffic engineering semantics in ISR. However, ISR makes possible finer-grained traffic engineering by configuring independent sets of next-hops to a destination at each incoming interface. This lends itself well to modern router architectures where each incoming interface has its own forwarding table. Consequently, at the aggregated node level, traffic to a particular destination may be non-uniformly distributed across next-hop nodes. Hence, ISR allows additional flexibility in routing traffic as compared to default IP routing while retaining its simplicity. We conduct simulation studies on representative ISP topologies to compare ISR with traditional link-weight-optimized routing. ISR reduces the difference between optimal routing and weight-optimized routing by 50%.     

MPLS流量工程路由优化机制的研究

对最小干涉算法进行了链路权值优化研究,提出集中和分布相结合的方式计算显式路由的方法.使用专门的策略和权值服务器PAWS为链路计算权值,标记边缘路由器LER实施分布式最小干涉算法,计算满足带宽的显式路由.通过路由算法及其体系结构的优化,提高了MPLS显式路由计算的效率和准确性,增强了MPLS流量工程系统的可扩展性.     

一种基于MPLS流量工程的动态路由算法

MPLS流量工程的问题最终可以归结为数据流传输的路径确定问题,即显式路径的确立问题.通过对XUE算法的分析,提出了一种新的基于链路和路径的动态路由算法-LPK.依据网络链路平均利用率的取值范围对网络进行裁剪,在选路由时优先选择轻度占用的链路,避开重度占用的链路;从路径的角度出发,计算每条路径中的各链路带宽利用率相对于网络中链路带宽利用率均值的方差.用C++语言完成了该算法的实现,同时验证了该算法较SPF算法及XUE算法的有效性.     

An immune-theory-based model for monitoring inter-domain routing system

The inter-domain routing system faces many serious security threats because the border gateway protocol(BGP) lacks effective security mechanisms.However,there is no solution that satisfies the requirements of a real environment.To address this problem,we propose a new model based on immune theory to monitor the inter-domain routing system.We introduce the dynamic evolution models for the "self" and detection cells,and construct washout and update mechanisms for the memory detection cells.Furthermore,borrowing an idea from immune network theory,we present a new coordinative method to identify anomalous nodes in the inter-domain routing system.In this way,the more nodes working with their own information that join the coordinative network,the greater is the ability of the system to identify anomalous nodes through evaluation between nodes.Because it is not necessary to modify the BGP,the ITMM is easy to deploy and inexpensive to implement.The experimental results confirm the method’s ability to detect abnormal routes and identify anomalous nodes in the inter-domain routing system.     

Minimizing hierarchical routing error

In hierarchical routing schemes, nodes are grouped into clusters at multiple levels, and a given node sees only a summarized view of the entire network. Hierarchical routing introduces error, which is the difference between the hierarchical path length and the optimal path length using flat routing. Since in practice the routing table size at each node is limited, we formulate the constrained optimization problems of finding a hierarchy structure that minimizes either the worst case or average case routing error. We prove results characterizing solutions of these problems, and present dynamic programming solution algorithms and computational results.     

基于博弈的域间路由协同监测激励策略

域间路由协同监测无需扩展原有BGP协议、支持增量部署且实现成本低,是目前解决域间路由系统安全问题较为有效且可行的一种方法.然而参与节点的行为自治、多变,在协同监测过程中或者隐藏部分路由信息或者共享路由信息的意愿较低,致使难以获取到足够全面、详细的路由监测信息,从而降低了域间路由协同监测的可用性.将上述问题抽象为非合作博弈问题,并基于博弈论的思想,提出一种域间路由协同监测激励策略GTIS.利用信誉状态参数量化描述节点的行为表现,然后根据节点在各次信息交互时的行为策略选择,对其信誉状态进行动态调整,从而以获取更大的长期收益为驱动,鼓励节点选择友好的行为策略.同时制定"人性化"的惩罚机制遏制节点的投机行为,对行为多次偏离的节点进行叠加惩罚,有效区分"初犯"节点和"惯犯"节点.实验结果表明,GTIS策略能够有效激励节点积极、诚实地参与协同监测,提高协同节点间信息交互的成功率,为域间路由协同监测的高效运行提供有力支撑.     

Selfish routing and wavelength assignment strategies with advance reservation in inter-domain optical networks

The main challenge in developing large data network in the wide area is in dealing with the scalability of the underlying routing system. Accordingly, in this work we focus on the design of an effective and scalable routing and wavelength assignment (RWA) framework supporting advance reservation services in wavelength-routed WDM networks crossing multiple administrative domains. Our approach is motivated by the observation that traffic in large optical networks spanning several domains is not controlled by a central authority but rather by a large number of independent entities interacting in a distributed manner and aiming at maximizing their own welfare. Due to the selfish strategic behavior of the involved entities, non-cooperative game theory plays an important role in driving our approach. Here the dominant solution concept is the notion of Nash equilibria, which are states of a system in which no participant can gain by deviating unilaterally its strategy. On this concept, we developed a selfish adaptive RWA model supporting advance reservation in large-scale optical wavelength-routed networks and developed a distributed algorithm to compute approximate equilibria in computationally feasible times. We showed how and under which conditions such approach can give rise to a stable state with satisfactory solutions and analyzed its performance and convergence features.     

A network accountability based verification mechanism for detecting inter-domain routing path inconsistency

Border Gateway Protocol (BGP) has no mechanism to guarantee the consistency between actual routing path and announced routing path in the inter-domain routing. Due to incentives of gaining more economic benefits, malicious Autonomous Systems (AS) could announce inconsistent path and misroute data packets. In this case, routing policies are meaningless, rational ASes are cheated and stability of Internet is destroyed seriously. Existing methods are devoted to securing announce routing path only or discovering path inconsistency with lots of overhead. Based on network accountability, a routing path verification mechanism is proposed to detect path inconsistency. The mechanism enables ASes in the path to generate routing evidence. Routing evidence is produced by analyzing packets in a time slot and is encrypted with the key of AS. With routing evidence, source AS checks every subpath connecting adjacent ASes until it confirms the existence of path inconsistency. The factors that influence the mechanism and the deployment in the real network are also discussed. The experiment results show that it has a good performance from aspects of effectiveness, overhead and scalability.     

Adaptive routing for road traffic

The article reports on an integrated system which uses road congestion information to guide routing, both in advance and while in transit. It offers two novel features: historic information about congestion is collected and retained for use when planning routes; and GPS tracks vehicles while they undertake journeys, and the Global System for Mobile Communications (GSM) Short Message Service (SMS) maintains communications between a moving vehicle and a central planning service to suggest revised routes avoiding congestion     

Constrained traffic equilibrium in routing

We study noncooperative routing in which each user is faced with a multicriterion optimization problem, formulated as the minimization of one criterion subject to constraints on others. We address the questions of existence and uniqueness of equilibrium. We show that equilibria indeed exist but uniqueness may be destroyed due to the multicriteria nature of the problem. We obtain uniqueness in some weaker sense under appropriate conditions: we show that the link utilizations are uniquely determined at equilibrium. We further study the normalized constrained equilibrium and apply it to pricing.     

一种基于HMIPv6网络的域间切换改进方案

针对层次型移动IPv6网络的域间切换中的切换延迟和丢包问题,提出一种使用转交地址池改进原来DAD的检测方法来减少切换延迟,采用双路径通信方式降低丢包率的域间切换的改进方案。理论分析改进前后的切换延迟,使用NS-2工具对改进协议进行仿真。实验结果表明,改进方案在切换时延和丢包率方面表现出较好的优越性。     

Fine two-phase routing over shortest paths with traffic matrix

This paper presents an IP finely-distributed load-balanced routing scheme based on two-phase routing over shortest paths, where the traffic matrix is given. It is called the fine two-phase routing (F-TPR) scheme. F-TPR more finely distributes traffic from a source node to intermediate nodes than the original TPR. F-TPR determines the distribution ratios to intermediate nodes for each source–destination node pair independently. To determine an optimum set of distribution ratios, a linear programming (LP) formulation is derived. We compare the F-TPR scheme against the TPR scheme and the sophisticated traffic engineering (TE) scheme of Multi-Protocol Label Switching (MPLS-TE). Numerical results show that F-TPR greatly reduces the network congestion ratio compared to TPR. In addition, F-TPR provides almost the same network congestion ratios as MPLS-TE, the difference is surprisingly less than 0.1% for the various network topologies examined. In addition, considering the practical implementation of F-TPR for routers, we also investigate the case that traffic from a source node to a destination node is not allowed to be split over multiple routes. The non-split problem is formulated as an integer linear programming (ILP) problem. As it is difficult to solve the ILP problem within practical time, two heuristic algorithms are presented: Largest Traffic Demand First (LTDF) and a Random Selection (RS). The applicability of LTDF and RS are presented in terms of network size. We find that non-split F-TPR also matches the routing performance of MPLS-TE within an error of 1%, when network size is large enough.     

Efficient parallel hierarchical clustering algorithms

Clustering of data has numerous applications and has been studied extensively. Though most of the algorithms in the literature are sequential, many parallel algorithms have also been designed. In this paper, we present parallel algorithms with better performance than known algorithms. We consider algorithms that work well in the worst case as well as algorithms with good expected performance.     

QoS routing with traffic distribution in mobile ad hoc networks

Mobile ad hoc networks (MANETs) follow a unique organizational and behavioral logic. MANETs’ characteristics such as their dynamic topology coupled with the characteristics of the wireless communication medium make Quality of Service provisioning a difficult challenge. This paper presents a new approach based on a mobile routing backbone for supporting Quality of Service (QoS) in MANETs. In real-life MANETs, nodes will possess different communication capabilities and processing characteristics. Hence, we aim to identify those nodes whose capabilities and characteristics will enable them to take part in the mobile routing backbone and efficiently participate in the routing process. Moreover, the route discovery mechanism we developed for the mobile routing backbone dynamically distributes traffic within the network according to current network traffic levels and nodes’ processing loads. Simulation results show that our solution improves network throughput and packet delivery ratio by directing traffic through lowly congested regions of the network that are rich in resources. Moreover, our protocol incurs lower communication overheads than AODV (ad hoc on-demand distance vector routing protocol) when searching for routes in the network.     

MPLS感知区分服务的流量工程的研究

分析了MPLS区分服务和流量工程这两种技术;由于在一些应用情景下,需要使流量工程能够感知流量的类型,因此引入了MPLS感知区分服务的流量工程的方案,来建立基于类的流量中继。着重论述了该解决方案的各个方面,包括路径的计算、建立路径的信令、带宽约束模型等。     

k-pairwise disjoint paths routing in perfect hierarchical hypercubes

Hierarchical hypercubes (HHC), also known as cube-connected cubes, have been introduced in the literature as an interconnection network for massively parallel systems. Effectively, they can connect a large number of nodes while retaining a small diameter and a low degree compared to a hypercube of the same size. Especially (2 ^m +m)-dimensional hierarchical hypercubes ( $\mathit {HHC}_{2^{m}+m}$ ), called perfect HHCs, are popular as they are symmetrical, which is a critical property when designing routing algorithms. In this paper, we describe an algorithm finding, in an $\mathit{HHC}_{2^{m}+m}$ , mutually node-disjoint paths connecting k=?(m+1)/2? pairs of distinct nodes. This problem is known as the k-pairwise disjoint-path routing problem and is one of the important routing problems when dealing with interconnection networks. In an $\mathit{HHC}_{2^{m}+m}$ , our algorithm finds paths of lengths at most 2 ^m+1+m(2 ^m+1+1)+4 in O(2^5m ) time, where 2 ^m+1 is the diameter of an $\mathit{HHC}_{2^{m}+m}$ . Also, we have shown through an experiment that, in practice, the lengths of the generated paths are significantly lower than the worst-case theoretical estimations.