The New Routing Algorithm for the ARPANET

The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations. In the new procedure, each node in the network maintains a database describing the complete network topology and the delays on all lines, and uses the database describing the network to generate a tree representing the minimum delay paths from a given root node to every other network node. Because the traffic in the network can be quite variable, each node periodically measures the delays along its outgoing lines and forwards this information to all other nodes. The delay information propagates quickly through the network so that all nodes can update their databases and continue to route traffic in a consistent and efficient manner. An extensive series of tests were conducted on the ARPANET, showing that line overhead and CPU overhead are both less than two percent, most nodes learn of an update within 100 ms, and the algorithm detects congestion and routes packets around congested areas.     

一种改进的多约束条件的路由算法

基于多约束条件的满足服务质量(QoS)路由选择问题是当前通信网络中的一个重要问题,满足一个或多个约束条件的路由问题都是非确定多项式的完全问题(NPC),因此解决此类问题通常是很困难的。文中针对此类问题提出一种改进的启发式算法,快速、准确地解决多约束条件的路由选择问题。     

ASON的一种路由算法

对ASON的路由进行了深入研究，在分析ASON网络的特点的基础上，提出了一种全新的适用于ASON路由的波长路由算法，在用链表方法表示网络结构的基础上，将波长信息加入链表内，找到符合波长连续的最短路径，或在增加波长变换器时，计算最小代价的路径。并对该算法进行了仿真实现，证实了该算法是可行的、有效的路由波长算法。     

一种以性能驱动为目标的路径选择算法

本文旨在对大规模并行系统和同步系统中的时延均衡性问题的解决作有益的探索，提出了一种有效的、以性能驱动为目标的全局布线算法，实验结果证明布线效果良好。     

A Performance Evaluation of a Novel Energy-Aware Data-Centric Routing Algorithm in Wireless Sensor Networks

In this paper, we present a novel Energy-Aware Data-Centric Routing algorithm for wireless sensor networks, which we refer to as EAD. We discuss the algorithm and its implementation, and report on the performance results of several workloads using the network simulator ns-2. EAD represents an efficient energy-aware distributed protocol to build a rooted broadcast tree with many leaves, and facilitate the data-centric routing in wireless micro sensor networks. The idea is to turn off the radios of all leaf nodes and let the non-leaf nodes be in charge of data aggregation and relaying tasks. The main contribution of this protocol is the introduction of a novel approach based on a low cost backbone provisioning within a wireless sensor network in order to turn off the non backbone nodes and save energy without compromising the connectivity of the network, and thereby extending the network lifetime. EAD makes no assumption on the network topology, and it is based on a residual power. We present an extensive simulation experiments to evaluate the performance of our EAD forwarding-to-parent routing scheme over a tree created by a single EAD execution, and compare it with the routing scheme over a regular Ad hoc On-Demand Distance Vector (AODV) Protocol. Last but not least, we evaluate the performance of our proposed EAD algorithm and compare it to the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, a cluster-based, energy-aware routing protocol specifically designed for sensor networks. Our results indicate clearly that EAD outperforms AODV and LEACH in energy conservation, throughput, and network lifetime extension.Dr. A. Boukerche was partially supported by NSERC, Canada Research Program, Canada Foundation for Innovation, and Ontario Innovation Funds/Ontario Distinguished Research Award.Azzedine Boukerche is a Full Professor and holds a Canada Research Chair Position at the University of Ottawa. He is also the Founding Director of PARADISE Research Laboratory at Ottawa U. Prior to this, he hold a faculty position at the University of North Texas, USA, and he was working as a Senior Scientist at the Simulation Sciences Division, Metron Corporation located in San Diego. He was also employed as a Faculty at the School of Computer Science McGill University, and taught at Polytechnic of Montreal. He spent a year at the JPL-California Institute of Technology where he contributed to a project centered about the specification and verification of the software used to control interplanetary spacecraft operated by JPL/NASA Laboratory.His current research interests include wireless networks, mobile and pervasive computing, wireless multimedia, QoS service provisioning, wireless ad hoc and sensor networks, distributed systems, distributed computing, large-scale distributed interactive simulation, and performance modeling. Dr. Boukerche has published several research papers in these areas. He was the recipient of the best research paper award at PADS’97, and the recipient of the 3rd National Award for Telecommunication Software 1999 for his work on a distributed security systems on mobile phone operations, and has been nominated for the best paper award at the IEEE/ACM PADS’99, and at ACM MSWiM 2001. Dr. A. Boukerche serves as an Associate Editor and on the editorial board for ACM/Springer Wireless Networks, the Journal of Parallel and Distributed Computing, The Wiley Journal of Wireless Communication and Mobile Computing. He served as a Founding and General Chair of the first Int’l Conference on Quality of Service for Wireless/Wired Heterogeneous Networks (QShine 2004), ACM/IEEE MASCOST 1998, IEEE DS-RT 1999-2000, ACM MSWiM 2000; Program Chair for ACM/IFIPS Europar 2002, IEEE/SCS Annual Simulation Symposium ANNS 2002, ACM WWW’02, IEEE/ACM MASCOTS 2002, IEEE Wireless Local Networks WLN 03-04; IEEE WMAN 04-05, ACM MSWiM 98–99, and TPC member of numerous IEEE and ACM conferences. He served as a Guest Editor for JPDC, and ACM/kluwer Wireless Networks and ACM/Kluwer Mobile Networks Applications, and the Journal of Wireless Communication and Mobile Computing.Dr. Boukerche serves as a Steering Committee Chair for ACM MSWiM, IEEE DS-RT, and ACM PE-WASUN Conferences.Xiuzhen Cheng is an Assistant Professor in the Department of Computer Science at the George Washington University. She received her MS and Ph.D. degrees in Computer Science from University of Minnesota—Twin Cities in 2000 and 2002, respectively. Her current research interests include localization, data aggregation services, and data storage in sensor networks, routing in mobile ad hoc networks, and approximation algorithm design and analysis. She is a member of the ACM and IEEE.Joseph Linus has recently graduated with a MSc Degree from the Department of Computer Sciences, University of North Texas. His current research interests include wireless sensors networks, and mobile ad hoc networks.     

A Multicast Routing Algorithm Reducing Congestion

A new multicast routing algorithm reducing congestion is presented in this article. The algorithm uses efficient routing by transmitting multicast packets across fewer links in the network. In addition, the algorithm balances the use of network nodes and links by reducing packet duplication in the nodes. © 1997 John Wiley & Sons, Ltd.     

一个实用的交互迷路布线算法

本文介绍了一个实用的交互迷路布线算法(UIMR).该算法采用提示信息层来允许用户安排一条连线的总路径,用预处理连线的方法来精确估计布线期间连线的完成代价,有效地修剪迷路方向的路径.此外,一个窗口式搜索方法用于布线过程中的路径选择.     

一种多约束服务质量路由算法

下一代网络服务质量要求解决多约束服务质量路由问题.在分析了服务质量路由特点及相关工作的基础上,提出服务质量路由新计算方法.方法基于路径计算,首先计算最少跳路径,然后利用非线性花费函数进行求解并判断约束路径,最后求出优化多约束路径.通过对网络拓扑状态仿真结果表明,该算法能快速求解在多约束条件下优化路径,约束参数扩展性好.     

一种时延受限、低代价的组播路由算法

在通信中,可靠性和效率始终是一对矛盾,因此通信工作者们往往在满足用户可靠性需求时,寻求一种效率较高的通信方式.文中基于单播时延受限的路由算法,提出一组播种算法,使用该算法能满足用户时延要求.仿真结果表明,和同类算法比较,该算法具有时间复杂度低、代价小,易于集成到现有因特网路由协议中.     

Performance Analysis of Optad-NoC: A Novel Optimized Routing Algorithm and Intelligent Router for 3D Network-on-Chip

Wireless Personal Communications - Nowadays System-on-Chip (SoC) is an emerging technology in the world of Integrated Chip manufacturers. In SoC, many IP cores are integrated inside a chip. The...     

一种基于MANET的多路径优化路由算法

针对AOMDV协议的多路径路由机制和特点,提出一种基于带宽、时延与链路拥塞度约束的多路径优化路由算法。仿真实验结果表明,对于中低速动态的MANET网络环境,算法能在一定程度上延长网络生存时间以及提高分组投递率。     

A Routing Algorithm for Computer Communication Networks

A new algorithm for routing data packets in networks of computers connected by communication links is given. It is shown that considerable savings in required storage capacity can be obtained by adopting the proposed algorithm as compared to earlier known algorithms.     

一种新的基于知识的四边通道布线算法

本文提出了一种新的基于知识的双层四边通道布线算法,该算法对四边通道的布线是通过以下四步完成的。首先,对四边通道的四个角布线,其次,对关键线网优先布线,接下来,利用线网间相互制约关系进行同步增长布线;最后,对仍然没有完成连接的线网,用李氏算法布线。由于使用了启发式规则,使得该算法具有较高的布通率和布线效率。     

一种非零偏差时钟网布线算法

特定的非零偏差时钟网比零偏差时钟网更具优势,它有助于提高时钟频率、降低偏差的敏感度.文章提出了一种新的非零偏差时钟树布线算法,它结合时钟节点延时和时钟汇点位置,得到一个最大节点延时次序合并策略,使时钟树连线长度变小.实验结果显示,这种算法与典型的最邻近选择合并策略相比较,可以减少20%～30%的总连线长度.     

一种基于Chord的缓存路由算法

根据small-world的研究发现,在实际的P2P拓扑结构中存在若干度数很高的节点。传统的Chord算法假定关键字的查询请求是随机分布的,没有考虑到节点之间的"短链"效应。提出一种基于Chord在一定程度上逐步找到系统节点的"短链"的方法。该方法根据关键字检索命中率动态调整路由表中记录的排序。仿真实验表明,该算法加快了关键字的查询时间,提高了路由表的查询效率。主要创新点在于针对实际P2P网络中查询请求的分布特性提出一种改进的Chord路由算法,该算法能有效改善系统的查询性能。     

一种可靠的无线传感器网络路由算法

在基于分簇的无线传感器网络中,为了有效地转发数据,研究者们提出了各种簇组织和簇首选举机制,但是这些机制缺少关注簇首与汇聚节点之间数据传输的可靠性.针对该问题,提出一种可靠的数据路由方案,通过链路代价函数和动态的簇首间路由,控制簇首到汇聚节点的数据转发.仿真结果表明,该方案不仅有效地增加数据包的投递率,也能够均衡网络的能量消耗.     

一种基于概率的QoS多播路由遗传算法

文章提出了一种基于概率的QoS多播路由遗传算法。该算法通过一种精度可控的次优化方法,解决了基于非精确状态延时带宽限制代价最小的QoS多播路由问题。仿真实验表明,该算法能有效地屏蔽网络状态的非精确性,忍受较大的网络更新触发门限值,并保持较好的路由性能。     

一种基于改进遗传算法的多播路由选择方法

遗传算法已经在多播路由优化问题中得到了广泛应用,但由于算法本身存在着收敛速度与全局收敛性之间的矛盾,使得在具体应用时经常顾此失彼,难以二者兼得,本文借鉴一种改进的遗传算法,在全局收敛的基础上提高收敛速度仿真表明,应用这种改进型遗传算法于多播路由问题,可以得到比现有启发式算法更好的结果.     

基于遗传算法的求解时延约束的选播QoS路由算法

选播是一种新型的网络服务，它使用户通过一个选播地址就能访问到该地址所表示的一组服务器，并且对用户来说是“最近’’的一个。实时性要求较高的业务传输过程中，保证信息传输时延尽可能小是非常重要的。本文研究有时延约束的选播QoS路由问题，提出一种改进的遗传算法以求解该问题。仿真实验表明，该算法是有效且切实可行的。     

EMD算法发展及应用综述

经验模态分解算法在各个领域都有广泛的应用,在工业领域中,对机械设备故障的机理研究,有助于监测机械运行状态,在医学领域中,准确的检测出患者与正常人数据的差异有助于疾病的分析和诊断,由于经验模态分解算法在非线性非平稳信号分析中具有显著优势,多年来深受学者的关注。文章总结了经验模态分解算法近年来的发展改进及应用。