规则全光分组网络中偏射路由算法的分析

就在ShuffleNet和Manhattan Street Network两种规则网络中使用偏射路由算法后的网络性能以及允许一个时隙插入多个数据包对该算法的影响进行了分析。结果说明，偏射路由算法不仅能使网络得到较高的性能，而且发挥了网状网具有迂回路由的能力。当采用允许插入多个数据包的策略时，网络的吞吐量和平均跳转次数都有小幅度的增加。     

基于数据融合的无线传感器网络路由算法

在分簇协议LEACH和链状协议PEGASIS的基础上,提出一种新的基于数据融合的分簇路由算法.簇首节点采用多跳方式传输数据,并根据周围节点的密集程度构造不同大小的簇;簇内节点计算上行和下行节点构造数据融合树,采用时分复用调度算法进行多跳路由.NS2仿真结果表明该路由算法均衡了各个节点的能量消耗,延长了网络存活时间,并降低了网络延迟.     

折射路由法在光分组交换网络中的运用

就OTDM(光时分复用)光分组交换网络的交换节点功能和关键技术进行了分析和探讨。对无缓冲折射路由法在街区网络上的应用和路由算法进行了深入研究，并根据概率分析模型，求得在稳定状态下吞吐量和平均时延的计算公式，最后与有缓冲区的存储转发网络的性能进行了比较。     

用电路级联技术设计光互连网络高速路由结点

用高性能数字交叉开关设计了具有路由功能的8通道数据交换结点,可实现10Gbit／s的数据交换;采用时分复用(TDM)技术设计了具有10Gbit／s交换能力的光互连网络。以8通道路由结点为基本单元,利用电路级联技术对路由结点进行扩展,设计了64通道、512通道以及1024通道路由结点,吞吐率分别达到90Gbit／s、700Gbit／s和1．5Tbit／s,最大路由延迟仅为0．94μs。     

WDM-TDM光网络中的动态波长路由与时隙分配算法研究

在WDM光网络中,为了进一步提高波长资源的利用率,多个业务连接可以通过时分复用(TDM)技术共享一个波长的容量。在这种基于WDM-TDM技术的光网络中建立业务连接,需要解决的核心问题之一是波长路由与时隙分配(RWTA)问题。该文研究了WDM-TDM光网络中的动态RWTA问题,提出了一种基于最大使用率方法的RWTA算法(MUB)和一种改进的MUB算法(EMUB),并对它们的性能进行了计算机仿真分析。结果表明:EMUB算法的阻塞率性能优于MUB算法,能有效地优化WDM-TDM光网络的资源利用率。     

一种安全网络路由算法研究

路由算法是路由协议中的重要组成部分,采用何种算法往往决定了最终寻径结果的优劣。路由算法除了能够对信息进行正确路由外还应使路由器具有抵抗恶意攻击的能力。文章在介绍了安全的网络路由算法的设计目标以及几种采用加密技术的安全网络路由算法的基础上,提出了一种安全网络路由算法,该算法通过公开密钥机制,保证了Internet网络中扩散路由算法的安全性。     

光无线混合宽带接入网的路由技术研究

文章研究了光无线混合宽带接入网(HOW BAN)后端无源光网络(PON)采用的多点控制协议以及前端无线网状网(WMN)中的各种路由机制,重点研究了几种适用于HOW BAN前端WMN的路由算法:最小跳路由算法、最短路径路由算法、风险和时延感知的路由算法、感知时延路由算法、预测吞吐量路由算法、容量和时延感知的路由算法、能量感知的路由算法、流量限制路由算法、时延区分路由算法。对HOW BAN中的传输协议,文章指出保持服务公平性、保证健壮性、提高服务质量(QoS)、节约能源、保障安全性、适应多频道网络等问题值得深入研究。     

基于位置信息的自组织网络路由算法研究

定位技术的快速发展使得获取位置信息的成本越来越低,此外利用位置信息可以有效降低路由开销,因此,基于位置信息的路由算法逐渐成为自组织网络路由算法的热点。在对现有基于位置信息的路由算法进行分析的基础上,对单播路由算法中贪婪转发算法及空洞处理算法进行研究,并对基于位置信息的多播路由算法及地理区域路由算法作了简要概述。     

低开销的MANET网络按需路由协议

针对简单泛洪效率低的问题,提出了一个限制洪泛的高效的路由广播算法,通过Euclidean距离来限制路由发现过程中请求分组被转发的次数;研究了减少路由维护开销,并降低路由发现的频率的方法,提出了一个基于节点高度的路由修复与优化算法,该算法使用节点监听来对链路断裂的路由进行修复与优化.基于限制泛洪的高效的路由广播算法和路由修复优化算法,提出了一种新的低开销的MANET网络按需路由协议LOOR(low overhead on-demand routing).仿真结果表明,新协议增强了路由的顽健性,减少了路由跳数,降低了路由发现的频率,提高了数据分组递送率,并显著地降低了路由控制开销.     

因特网路由技术及发展

本文对目前主要使用的因特网路由算法按其工作方式进行简单的分类。介绍了两种基本的路由算法：距离矢量路由算法和链路状态路由算法。依据各算法协议的演进发展,对当前正使用的各种路由协议进行简单的说明。     

BanyanNet-a bidirectional equivalent of ShuffleNet

A multihop, wavelength division multiplex (WDM) based network, BanyanNet, is proposed for the realization of terabit lightwave networks, BanyanNet can he considered as a the bidirectional equivalent of the popular ShuffleNet. Exploiting its representation, we developed a fast, decentralized, bidirectional routing algorithm for BanyanNet. The performance of BanyanNet is compared to that of the ShuffleNet and bilayered ShuffleNet. For N=p^m×k networks, the p=2 BanyanNet provides better performance in channel efficiency, total and user throughput than the corresponding ShuffleNet, and offers more flexible network configurations than the bilayered and p=4 ShuffleNet     

Performance Evaluation of an All-Optical ShuffleNet using Optical Buffering and Deflection Routing

All-optical multihop networks, where the data portion of a packet is maintained in an optically encoded format from the source to the destination, can be achieved by augmenting optical switching nodes with optical buffering. Topologically, the ShuffleNet network is a strong contender for implementing such networks ranging from cluster networks to metropolitan area networks. The performance of a regular multihop network whose nodes are augmented with optical buffering and use deflection routing is evaluated. Using the ShuffleNet network as an example, we show that performance, in terms of throughput, average delay, and loss probability, can be improved as multiple fiber delay loops are added for a large range of network parameters. We then compare the performance of ShuffleNet with the Manhattan Street networks with similar features.     

Approach to the scalability of a European multiwavelength multihop optical network

The multihop transmission technique has many promising features for large-scale multiwavelength optical networking. This paper proposes an approach to the flexibility in designing scalable multihop networks and suggests the deployment of this approach in an ongoing European research project. The general features of the ShuffleNet, an important example of multihop networks, are reviewed. It is shown that the ShuffleNet has certain inherent limitations. A new architecture, the Multi-ShuffleNet, is proposed to get around these limitations. The approach introduced thereby is that a multihop network, based on a standard interconnection pattern, such as the ShuffleNet, can be designed more easily and can perform better if broken down into a set of smaller subnetworks. These subnetworks, taken together, may have the same overall size as that of the original network. Each of them, however, may not necessarily have the same interconnection pattern. This concept is suitable for the realization of the European ultra-high capacity network, being envisioned through the framework of the COST 239 project. ©1997 by John Wiley & Sons, Ltd.     

GEMNET: a generalized, shuffle-exchange-based, regular, scalable,modular, multihop, WDM lightwave network

GEMNET is a generalization of shuffle-exchange networks and it can represent a family of network structures (including ShuffleNet and de Bruijn graph) for an arbitrary number of nodes. GEMNET employs a regular interconnection graph with highly desirable properties such as small nodal degree, simple routing, small diameter, and growth capability (viz. scalability). GEMNET can serve as a logical (virtual), packet-switched, multihop topology which can be employed for constructing the next generation of lightwave networks using wavelength-division multiplexing (WDM). Various properties of GEMNET are studied     

Modified ShuffleNet for Multihop All-Optical WDM Networks Employing Wavelength Reuse

A modified multihop ShuffleNet configuration for WDM all-optical networks is described which is rearrangeable and allows wavelength reuse at each node as it expands. This configuration does not require any rearrangement of preceding node and wavelength assignments when new nodes and wavelengths are added and it can function with fewer overall number of nodes. By comparison, the traditional Perfect ShuffleNet requires a large number of nodes to be available for any updating of the configuration. Most of these nodes remain idle during the normal signal routing process leading to reduced network link capacity. Furthermore, to facilitate wavelength reuse when updating, the Perfect ShuffleNet necessitates the rearrangement of preceding node and wavelength assignments. This leads to generalized forms of ShuffleNet where wavelength reuse forces network architecture into irregular topologies. The modified ShuffleNet proposed here is capable of facilitating wavelength reuse without the modification of initial node and wavelength assignments and could be realised by using a star topology.     

Multistar implementation of expandable ShuffleNets

ShuffleNet is one of the many architectures proposed for multihop lightwave networks. Its advantages include low mean-internodal distance and simple routing. Modular growth of ShuffleNets, however, is generally difficult and requires many hardware and software reconfigurations. The authors consider a multistar implementation of ShuffleNet and discuss how a (p,k) ShuffleNet can be expanded to a (p,k+1) ShuffleNet in modular phases, where each phase increases the number of nodes by only a small fraction and requires only minor hardware and software reconfigurations     

Network Lifetime Maximization for Estimation in Multihop Wireless Sensor Networks

We consider the distributed estimation by a network consisting of a fusion center and a set of sensor nodes, where the goal is to maximize the network lifetime, defined as the estimation task cycles accomplished before the network becomes nonfunctional. In energy-limited wireless sensor networks, both local quantization and multihop transmission are essential to save transmission energy and thus prolong the network lifetime. The network lifetime optimization problem includes three components: i) optimizing source coding at each sensor node, ii) optimizing source throughput of each sensor node, and iii) optimizing multihop routing path. Fortunately, source coding optimization can be decoupled from source throughput and multihop routing path optimization, and is solved by introducing a concept of equivalent 1-bit MSE function. Based on the optimal source coding, the source throughput and multihop routing path optimization is formulated as a linear programming (LP) problem, which suggests a new notion of character-based routing. The proposed algorithm is optimal and the simulation results show that a significant gain is achieved by the proposed algorithm compared with heuristic methods.     

The scalable lightwave network

In principle, an optical network employing wavelength routing, wavelength reuse, and multihop packet switching is modularly scalable to very large configurations in both the hardware and software sense. As such, it is a viable architecture for a new ATM-based telecommunications infrastructure The network architecture considered for a new, scalable, broadband telecommunications infrastructure is based on (1) the use of wavelength division multiplexing (WDM) and wavelength routing; (2) the translation of signals from one wavelength to another at the access stations; and (3) the use of multihop ATM packet switching. These principles permit networks to be built whose size is essentially unlimited     

A Virtual Topology Based Routing Protocol for Multihop Dynamic Wireless Networks

In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are intoduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully.