一种面向多业务恢复的路由优化算法

讨论了在WDM光传送网中完成多业务恢复时所出现的恢复路由资源竞争问题，并提出了一种基于遗传算法的面向多业务恢复的路由优化算法。该算法可以有效地解决恢复路由资源竞争问题，得到全局最优恢复路由。通过对实际网络的计算，验证了该算法在解决多业务恢复路由优化问题上所具备的优势。     

自组网及其路由技术

由若干个移动无线通信终端构成的临时性的无中心自组网，无需依靠任何基础设施，能够提高通信网络的可靠性和应变能力，所介绍的动态源路由算法和分层路由算法可以很好地解决自组网的路由计算复杂问题，并能较好地避免网络拥塞，在一定程度上保证了通信网的可靠运行及业务质量。     

Ad Hoc网络中一种基于QoS的分布式多播路由算法

通过分析Ad Hoe网络的特点及基于QoS的多播路由问题，提出了一种新的分布式多播路由算法。实验和分析的结果表明，文中构造的路由方案成功地解决了Ad Hoe网中基于QoS的多播路由问题。当Ad Hoe网络的拓扑结构改变不太快时，本文提出的路由方案不仅满足了实时业务对网络带宽和端到端延时的要求，优化了路由树的代价，而且有效地控制了算法的复杂性并可适用于大规模的网络中。     

多光纤WDM网中支持QoS的波长重路由算法

在WDM网上，波长连续性限制会降低网络的信道利用率，增加光路建立请求的阻塞率。采用波长重路由技术可以减少波长连续性限制对网络性能的影响。该文采用波长图模型，对多光纤WDM网中支持QoS的波长重路由算法进行了探讨，提出一种支持QoS的波长重路由算法－－动态选择法，并采用两种网络模型，在不同负载的动态业务下对所提算法进行了仿真研究；仿真结果表明所提算法既满足了上层业务不同的QoS要求，同时又充分利用了有限的网络资源，使全网的平均阻塞率降低。     

一种波长转换范围受限全光网中的波长分配算法

本文研究了波长转换范围受限全光网中的动态路由和波长分配问题,提出了一种固定备选路由条件下新的路由和波长分配算法.算法引入了波长相关性的概念,用波长关联权值定量描述了各路由的前后链路上不同波长之间的相互依赖关系.在建立连接时首先使用那些依赖性强,对其他路由影响小的波长,从全局的角度出发选择最优的路由和波长分配方案.计算机仿真表明,本文算法能够适用于稀疏网络和网状网,在均匀业务强度或者大部分业务量来自于长跳路由的情况下,本文算法能够显著降低网络阻塞概率和使用的波长转换器数目,有效提高系统性能.     

基于SVM的电力通信网络路由均衡方法研究

路由均衡过程存在负载开销，导致路由分配风险概率增加，提出基于SVM的电力通信网络路由均衡方法。构建路由均衡模型，通过能量函数分配网络业务路由，基于粒子群优化算法改进最小支持向量机的路由算法，求解均衡模型；通过最小支持向量机估算网络节点剩余能量，选用负载开销最小的路径路由数据，实现电力通信网络全局路由均衡分配。实验结果表明：该方法可均衡电力通信网络中存在的风险，且噪声大小对电力通信网络覆盖率、节点平均剩余能量以及业务中断影响不明显，在均衡电力通信网络业务方面具有可靠性与有效性。     

一种新型的动态路由和波长分配算法

本文讨论了WDM光网中，在动态业务流量和有限范围波长变换情况下的动态路由和波长分配（RWA）问题，基于Moone-Dijkstra算法，考虑到动态波长变换的可能和限制，提出了一种新型的、可实现动态最小代价路由和最佳虚波长通道的综合启发式算法（DMC－OVMP）。该算法对路由子问题和波长分配子问题既相互独立，又相互结合，优化了RWA，保证了网络信息传输的安全性。对中国教育和科研计算机网（CERNET）基于本算法进行了计算机仿真，实现了低的网络阻塞率。     

网络路由技术综述

本从路由的概念，网关，路由的有关协议，路由类型，路由表，路由选择算法，路由方式以及路由的设置等方面，详细地介绍了网络路由的有关技术。     

视频、语音和高速数据三项业务的会聚

随着新兴业务的出现,对附加路由网的需求量不断上升,超过了常用前端的容量。前端一般由直接负责模拟视频和音频信号广播的设备组成。新业务和新技术的出现(如:高速数据,切换电路电话,因特网电话和数字音、视频)虽促使大多数公司去另建一个新的商业实体,却未曾考虑过改造现有网络中的路由网。进一步讲,独立开展各项业务所建的路由网会尽可能地占用了空间,致使间距已达到了规定的极限。     

基于异构无线网络的多路径传输

针对异构无线网络环境中,大容量业务传输质量不可靠、网络资源利用率低的问题,提出了一种基于异构无线自组织网络的多路径传输路由算法。该算法有效避免了单路通信方式下的传输链路拥塞、吞吐量低等问题,并结合大容量业务的特点,通过一定的法则合理表征网络环境信息,依据表征结果提出发端到终端的多路径策略,使得重要性不同的业务可选择相应链路质量的路径进行并行传输,避免了网络中的每个自组网节点独立寻找路由导致的源节点难以获得中间节点路由信息的现象。仿真结果表明,该算法可实现整个网络负载均衡,缓解网络链路拥塞,有效降低传输中的丢包率,降低传输时延。     

A novel passive protected SONET bidirectional self-healing ringarchitecture

Among SONET ring alternatives, the four-fiber bidirectional self-healing ring architecture (BSHR/4) has the highest available capacity and can work with today's systems with minimum change. A cost-effective implementation for a BSHR/4 which uses a totally passive ring as the protection ring of the BSHR/4 is presented. The ring uses a SONET ring to carry working traffic and a passive ring to carry protection traffic in case of network component failures. The passive ring, which is composed of optical switches and optical amplifiers, is essentially an optical add-drop protection ring. The optical signal add-drop is controlled by SONET add-drop multiplexers using existing SONET self-healing protocols. A SONET control scheme for this implementation is also discussed. The proposed BSHR/4 not only has a significant cost advantage over conventional implementations, but also can easily evolve from any two-fiber ring, with a minimum capital investment and offering twice the capacity     

一种新的SDH双向复用段保护环(BMSPR)的容量分配优化算法

容量优化分配是ＳＤＨ／ＳＯＮＥＴ双向自愈环规划的重要方面，但是目前国内外尚无一种有效的ＳＤＨ／ＳＯＮＥＴ双向环的容量分配优化算法，为此，本文提出了一种基于最短路径电路矩阵的ＳＤＨ／ＳＯＮＥＴ双向复用段保护环（ＢＭＳＰＲ）的容量分与优化算法，模拟结果表明，该算法非常有效且运行时间≤５０ｍｓ，通过该算法的优化，使得容量需求可节约４０％左右，这将会给工程投资带来巨大的节约。     

Matching algorithms for three-stage bufferless Clos network switches

Three-stage Clos network switches are an attractive solution for future broadband packet routers due to their modularity and scalability. Most three-stage Clos network switches assume either all modules are space switches without memory (bufferless), or employ shared memory modules in the first and third stages (buffered). The former is also referred to as the space-space-space (S/sup 3/) Clos network switch, while the latter is referred to as the memory-space-memory (MSM) Clos network switch. We provide a survey of recent literature concerning switching schemes in the S/sup 3/ Clos network switch. The switching problem in the S/sup 3/ Clos network switch can be divided into two major parts, namely port-to-port matching (scheduling) and route assignment between the first and third stages. Traditionally, researchers have proposed algorithms to solve these issues separately. Recently, a new class of switching algorithms, called matching algorithms for Clos (MAC), has been proposed to solve scheduling and route assignment simultaneously. We focus on the MAC schemes and show that the new class of algorithms can achieve high performance and maintain good scalability.     

Ad Hoc网络三种功率监控算法的研究

分别介绍BASIC、PARO和PALM三种Ad Hoc网络功率监控算法,对这三种算法进行全面分析,从节能路由发现、节能路由维护、移动节点在网络中移动对节能路由的影响,以及移动节点对新节能路由的发现维护等方面的性能进行比较,研究结果表明PALM算法比其他两种算法更适合于MANET网络.     

SDH传输网中的光电路路由算法

根据目前在SDH传输网管中存在的快速开通光路和电路的具体需求,针对由若干环构成的网络拓扑较为复杂的SDH传输网提出了光电路路由算法和电路路由算法,算法以光电路分层模型为基础进行,能迅速进行光路和电路的路由调度。最后对算法进行了简单的分析。     

From network design to dynamic provisioning and restoration inoptical cross-connect mesh networks: an architectural and algorithmicoverview

This article presents a broad overview of the architectural and algorithmic aspects involved in deploying an optical cross-connect mesh network, starting from the network design and capacity planning phase to the real-time network operation phase involving dynamic provisioning and restoration of lightpaths and online algorithms for route computation. Frameworks for offline design and capacity planning of optical networks based on projected future lightpath demands are discussed. The essential components of an IP-centric control architecture for dynamic provisioning and restoration of lightpaths in optical networks are outlined. These include neighbor discovery, topology discovery, route computation, lightpath establishment, and lightpath restoration. Online algorithms for route computation of unprotected, 1+1 protected and mesh-restored lightpaths are discussed in both the centralized and distributed scenarios     

SDH/ATM双向自愈环的生存性定量分析方法

本文推导出了ＳＤＨ／ＡＴＭ双向自愈环在链路失效、节点失效及链球节点混合失效、节点失效及链路节点混合失效三种模型情况下的网络生存性函数,从导出的网络生存性函数可以方便地求出生存率的均值、最坏生存率、ｒ百分比生存率及零生存率等单个生存性测度。同时对导出的生存性函数结果进行了分析,结果表明本文的分析方法符合实际情况,是切实可行的,为分析和设计高生存性通信网络提出了统一的实现的方法。     

MULTICAST ROUTING SCHEMES IN ATM

In this study, we investigate the problem of accommodating multicast traffic in ATM networks, with emphasis on the virtual path (VP) environment. We propose a network structure called “virtual copy network” that is suitable for multicast communication and connection setup scheme, taking into account the VP environment. With our technique, we can expect statistical multiplexing gain in accommodating multiple multicast traffic streams over a VP. Also, we propose two multicast routing algorithms (the CNR-LH algorithm and the improved CNR-LH algorithm) for an ATM network environment. In these algorithms, in addition to determining an adequate route, the exact corresponding VPs on the route are also obtained. We examine the efficiency of the algorithms by demonstrating their basic characteristics using computer simulations.     

高性能安全路由器中快速路由查找算法的研究与实现

设计快速的路由查找算法是提高路由器整体性能的关键之一.文章在一种基于RAM快速路由查找算法的基础上,根据高性能安全路由器的设计要求,进一步融入Hash链式表以及Trie树查找算法的设计思想,提出了一种可配置的路由查找算法.通过动态配置算法中的评价函数系数,该算法可以适用于多种网络应用环境.     

Minimizing Wavelength Conversions in WDM Path Establishment*

This paper studies algorithms for connection establishment in wavelength division multiplexing networks. Although wavelength conversion capabilities are assumed at each node in the network, the goal of this research is to minimize or impose an upper bound on the number of wavelength conversions on the established path. Two types of schemes are investigated and compared. In the first scheme, the wavelengths are selected adaptively during path establishment on a given route, and in the second scheme, both the route and the wavelength assignment are selected optimally based on global information about path costs and wavelength availability in the network. We present two efficient algorithms for globally selecting routes and wavelengths, one finds the least cost route for a maximum number of wavelength conversions, and the other selects from among the shortest routes, the one with a minimum number of wavelength conversions. The results of comparing the two path establishment schemes show that, for dynamically changing traffic, the adaptive selection of wavelengths on a fixed route during path establishment is more beneficial than the optimal selection of the route and wavelengths prior to path establishment.