策略路由在校园网中的应用

随着校园网用户数量和各种网络业务在互联网上的不断增长,互联网出口带宽不足已成为高校信息化发展面临的一个重要问题,为此笔者所在单位对校园网接入带宽进行了升级改造,在原有出口带宽基础上增加一条线路,以解决出口带宽不足的问题。通过在相关网络设备上利用路由策略为校内多个区域用户分配出口线路,实现了高效、合理地利用出口带宽资源。本文通过问题的引入、策略路由的概述、具体应用策略路由等几个方面阐述了在核心路由器进行合理的策略路由设置,解决了双线接入的流量分流问题,更加有效的利用了网络资源。     

IP over WDM 网络集成动态路由算法研究

提出了一种IP over WDM网络中有带宽保证的集成动态路由算法，称之为最大开放容量路由算法，它充分考虑了IP层和光层的拓扑和资源利用信息，能保证路径的带宽，算法可以决定：（1）是否将一个到达的请求路由到已经存在的拓扑上，还是重新建一条波长路径；（2）如果在已经存在的IP层路由，计算最佳路径。（3）如果要创建新的波长交换路径，就决定选用哪些中间路由器，并计算最佳路径，性能目标是在不需要任何网络资源的将来可得性先验知识的情况下容纳尽可能多的连接请求，仿真结果显示，本算法在给定的性能尺度（如被拒绝的连接请求数量）上和集成最小跳数算法比较效果明显。     

基于ANN的双重选路算法实现ATM路由选择

本文研究人工神经网络用于ATM网络路由选择问题．通过引入等效带宽的概念，利用Hopfield网络求解一般通信网路由选择的原理，求解ATM网络最优选路问题．本文以降低呼损率和运算复杂度为目标，提出双重选路算法，在运算复杂度和路由最优化之间取得折衷．计算机仿真结果表明，ATM双重选路算法有效降低了呼损率．     

一种基于延时及带宽受限的启发式组播路由算法

在分析了网络中基于延时和带宽受限的组播路由优化问题的基础上,本文提出了一种新的启发式算法,并进行了实验和分析.结果表明文中构造的路由方案成功地解决了当网络中存在多组组播业务时的QoS路由选择问题.此方案不仅保证了带宽、端到端延时,优化了路由树的代价,而且有效地控制了算法的复杂性并可适用于大规模的网络中.     

一类基于网络服务品质要求的单播路由算法

本文提出了一类基于网络服务品质QoS（quality of service）要求的单播路由算法。首先,我们给出了基于网络分组调度机制WFQ的延迟和带宽相耦合的分析模型,从而推导出了最佳端到端通信延迟的上界。基于该模型,我们改造了传统最小跳数和最短延迟的两类路由算法以支持实时通信的服务品质要求。此外,我们还给出了两种新的服务品质路由算法,它们是多路径第k条最短延迟路由算法以及组合带宽和跳数（hop counts）的最大能量路由算法。仿真实验结果表明,四种算法尤其是后两种算法在满足用户带宽、延迟服务要求以及增加网络资源使用效率和网络吞吐率等方面各有特色。     

基于蚂蚁算法的分布式QoS路由选择算法

本文基于蚂蚁的自组织能力描述了一种新的分布动态路由选择方法,针对当前通信网中存在的服务质量问题提出了QoS保证的分布式路由选择算法（DQRA）。DRQA能以并行的方式解决网络中呼叫的时延和带宽分配问题,避免了NP－完全问题,算法简单,易于实现,能有效地解决大型网络的负载平衡问题,本文选择了OPNET仿真环境对网络进行实时仿真,通过和最小代价算法的比较,进一步表明了算法的有效性。     

Ad hoc网络中带宽保证路由协议

研究ad hoc网络中无线链路存在邻近链路干扰及隐藏终端和暴露终端问题，提出新的带宽预留模型及带宽保证路由协议(BGRP)，旨在按需探测符合带宽需要的路由路径并预留可靠的带宽资源。理论分析证明，BGRP探测的路由路径能满足带宽需要，而且预留的带宽资源准确有效。仿真结果表明，就有效带宽而言，BGRP较INSIGNIA和BGSR算法有效，而且消息复杂性较小，具有良好的网络扩展性。     

MANET中一种新的基于节点位置的按需路由算法

移动Ad hoc网络(MANET)是一种由无线移动主机/节点组成的动态自治网络.在MANET中进行有带宽保证的按需路由选择具有重要意义.本文提出一种新的按需路由算法LABGR(Location Aided Bandwidth Guaranteed Routing).LABGR以节点当前位置信息为基础,在路由选择过程中把路径稳定性和节点能量受限问题结合起来,采用受限扩散路由方法,利用多种机制避免在全网中进行扩散,限制路由请求过程中被影响的节点数目,有效提高了路由请求效率并且保证了链路带宽.本文还对LABGR算法特性进行了深入分析.     

无线Ad hoc网络机会路由的实现与仿真

在无线自组织网络中,路由协议对网络的性能起着关键性作用。然而由于无线信道的不稳定性经常造成通信中断而需重建路由,使自组织网传统路由协议的效率大大降低。提出了一种应用于无线自组织网络的机会路由协议（WAOR）,利用无线信道的广播特性和多径传输来增强链路的可靠性。采用网络仿真器NS2的仿真结果表明,WAOR的性能优于传统的动态源路由协议（DSR）和自组织网按需平面距离矢量路由协议（AODV）。     

ASON域间路由的特点与应用

自动变换光网络（ASON）是传送网发展的趋势，而路由技术是整个ASON的核心技术之一。主要讨论了ASON域间路由的特点及其在网络中的应用。首先介绍了域的概念和网络的分缀与分层；然后讨论了ASON路由与IP路由的不同之处；接着讨论了ASON域间路由的特点，并对几种路由协议进行了分析，阐述了多层网络的路由问题；给出ASON域间路由在网络中的不同应用方式。     

Bandwidth‐satisfied routing in multi‐rate MANETs by cross‐layer approach

Previous quality‐of‐service (QoS) routing protocols in mobile ad hoc networks (MANETs) determined bandwidth‐satisfied routes for QoS applications. Since the multi‐rate enhancements have been implemented in MANETs, QoS routing protocols should be adapted to exploit them fully. However, existing works suffer from one bandwidth‐violation problem, named the hidden route problem (HRP), which may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Without considering the bandwidth consumption to ongoing flows is the reason the problem is introduced. This work proposes a routing protocol that can avoid HRP for data rate selection and bandwidth‐satisfied route determination with an efficient cross‐layer design based on the integration of PHY and MAC layers into the network layer. To use bandwidth efficiently, we aim to select the combination of data rates and a route with minimal bandwidth consumption to the network, instead of the strategy adopted in the most previous works by selecting the combination with the shortest total transmission time. Using bandwidth efficiently can increase the number of flows supported by a network. Copyright 2010 John Wiley & Sons, Ltd.     

An End-to-End Bandwidth Allocation Algorithm for Ad Hoc Networks

Bandwidth-guaranteed QoS service in ad hoc networks is a challenging task due to several factors such as the absence of the central control, the dynamic network topology, the hidden terminal problem and the multihop routing property. An end-to-end bandwidth allocation algorithm was proposed in [Lin and Liu, 15] to support the QoS service in ad hoc networks. However, without exploring the global resource information along the route, the performance of that algorithm is quite limited. In addition, it also incurs significant control overhead. We develop a new algorithm for end-to-end bandwidth calculation and assignment in ad hoc networks which utilizes the global resource information along the route to determine the available end-to-end bandwidth. Our method also employs the topology-transparent scheduling technology to reduce the control overhead. The proposed algorithm can be efficiently utilized in a distributed manner. Both theoretical analysis and simulation results show that our end-to-end bandwidth allocation scheme can significantly improve the network capacity compared with the existing method.     

A Shoelace-Based QoS Routing Protocol for Mobile Ad Hoc Networks Using Directional Antenna

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.     

Bandwidth‐guaranteed QoS routing of multiple parallel paths in CDMA/TDMA ad hoc wireless networks

This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.     

A Multi-Path QoS Routing Protocol in a Wireless Mobile Ad Hoc Network

A mobile ad hoc network (MANET) is one composed of a set of mobile hosts capable of communicating with each other without the assistance of base stations. This paper considers the QoS (quality-of-service) routing problem in a MANET, which is important for many real-time multimedia applications. We propose an on-demand protocol for searching for a multi-path QoS route from a source host to a destination host in a MANET, where a multi-path is a network with a source and a sink satisfying certain bandwidth requirement. Existing works all try to find a uni-path to the destination. The basic idea is to distribute a number of tickets from the source, which can be further partitioned into subtickets to search for a satisfactory multi-path. Through simulations, we justify that the value of our multi-path protocol is in its flexibility: (i) when the network bandwidth is very limited, it can offer a higher success rate to find a satisfactory QoS route than those protocols which try to find a uni-path, and (ii) when the network bandwidth is sufficient, it can perform almost the same as those protocols which try to find a uni-path (in both routing overhead and success rate).     

Bandwidth-Satisfied Multicast Trees in MANETs

Previous quality-of-service (QoS) routing/multicasting protocols in mobile ad hoc networks determined bandwidth-satisfied routes for QoS applications. However, they suffer from two bandwidth-violation problems, namely, the hidden route problem (HRP) and the hidden multicast route problem (HMRP). HRP may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Similarly, HMRP may arise when multiple flows are permitted concurrently. Not considering the bandwidth consumption of two-hop neighbors is the reason that the two problems are introduced. In this paper, a novel algorithm that can avoid the two problems is proposed to construct bandwidth-satisfied multicast trees for QoS applications. Furthermore, it also aims at minimizing the number of forwarders so as to reduce bandwidth and power consumption. Simulation results show that the proposed algorithm can improve the network throughput.     

QoS-aware routing based on bandwidth estimation for mobile ad hoc networks

Routing protocols for mobile ad hoc networks (MANETs) have been explored extensively in recent years. Much of this work is targeted at finding a feasible route from a source to a destination without considering current network traffic or application requirements. Therefore, the network may easily become overloaded with too much traffic and the application has no way to improve its performance under a given network traffic condition. While this may be acceptable for data transfer, many real-time applications require quality-of-service (QoS) support from the network. We believe that such QoS support can be achieved by either finding a route to satisfy the application requirements or offering network feedback to the application when the requirements cannot be met. We propose a QoS-aware routing protocol that incorporates an admission control scheme and a feedback scheme to meet the QoS requirements of real-time applications. The novel part of this QoS-aware routing protocol is the use of the approximate bandwidth estimation to react to network traffic. Our approach implements these schemes by using two bandwidth estimation methods to find the residual bandwidth available at each node to support new streams. We simulate our QoS-aware routing protocol for nodes running the IEEE 802.11 medium access control. Results of our experiments show that the packet delivery ratio increases greatly, and packet delay and energy dissipation decrease significantly, while the overall end-to-end throughput is not impacted, compared with routing protocols that do not provide QoS support.     

在分群分布式Ad hoc网络中一种基于TDMA带宽预定的QoS路由协议

研究了在基于TDMA接入方式分层分布式Ad hoc网络中,如何预约带宽来支持QoS路由.所提出的路由协议在计算带宽时考虑了隐藏终端和暴露终端问题,充分利用信道资源.在路由维护时考虑了节点的移动性,从而保持通信的不间断.     

Design of ATM Networks with Multiple Traffic Classes

In this paper, we propose a new heuristic design algorithm for the virtual path (VP)-based ATM network with multiple traffic classes, in which QoS constraints associated with traffic class are taken into account. The minimum bandwidth of VP required to carry given amount of traffic is obtained by utilizing an equivalent bandwidth concept, and the route of each VP is placed so that the network cost is minimized while the QoS requirement is fulfilled. To evaluate our design algorithm, we consider two kinds of traffic: voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in providing a cost-effective VP-based ATM network.     

A spare bandwidth sharing scheme based on network reliability

Spare bandwidth is required for recovering the network service from network faults. However, it degrades the efficiency of network utilization. Spare bandwidth demand can be reduced significantly by letting spare bandwidth be shared among several network services. Spare bandwidth reserved on a network element can be shared by a set of network services for a network fault if they are not simultaneously affected by the network fault. A new, and more practical spare bandwidth sharing scheme, which is based on the network reliability, is proposed in this paper. In the proposed scheme, multiple link failures are allowed with a given link failure rate, and a reasonable restoration level of near 100%; while in the conventional scheme, only a single link failure, and 100% restoration level are considered. To develop the spare bandwidth sharing scheme, we first investigate the framework for evaluating the reliability of path-based network services, and then we explain the proposed spare bandwidth sharing scheme with decision parameters such as lifetime of the path, restoration level, and the maximum number of working paths which can be protected by a backup link. Simulation results show that the proposed spare bandwidth sharing scheme requires a smaller amount of spare bandwidth than the conventional scheme.