LEO卫星移动通信系统空间网络技术分析

在分析LEO卫星星座移动通信系统空间段网络功能和特点的基础上,进行了星座网络路由和交换技术体制的分析和论证,提出了以支持话音业务为主的LEO卫星移动通信系统星座网络路由和交换技术方案。星座网络采用定长信元格式交换体制,采用动态拓扑离散化的拓扑快照静态路由策略。这种静态路由离线计算方式和定长信元交换相结合,提高了网络交换的效率和转发速率。     

无线mesh网中最小编码代价低时延多播路由

提出了一种无线mesh网中最小网络编码代价低时延多播路由协议(MNCLDMR, minimal network coding and low delay multicast routing)。MNCLDMR的目标是选择合适的网络编码节点,最小化网络编码代价,降低网络时延。MNCLDMR主要思想是引入拓扑关键节点和网络编码关键节点的概念,以下一跳的节点是否是网络编码关键节点或拓扑关键节点作为路由判据,采用MNCLD算法构造多播树。仿真结果表明,MNCLDMR可以达到预定目标,合理形成网络编码机会,能实现最小网络编码代价低时延多播路由。     

基于链路状态的多约束路由预计算算法

作为下一代高速网络的核心问题之一,多约束的服务质量路由(QoSR)至今尚无有效算法,为此基于线性能量函数设计了预计算算法MEFPA.该算法将每个QoS度量的重要性均匀分成若干个等级,从而在多维QoS度量空间中构造出多个均匀分布的线性能量函数;算法通过能量函数将QoS链路状态转化成单一能量值,再使用Dijkstra算法计算最小能量树,最终产生QoS路由表.文章分析了多约束下的线性能量函数对算法性能的影响,给出了判定多维空间中QoS约束的可行区域和不可行区域的方法,最后基于这些理论为多约束QoSR问题给出了预计算算法.广泛深入的实验结果表明,高可扩展性、高性能、易实现的预计算算法MEFPA是一种值得在下一代网络中考虑的路由算法.     

追踪洋葱包的高级标记方案与实现

洋葱路由技术是实现信息隐藏而提出的一种新的匿名连接技术，使攻击者既不能进行窃听，也不能实施流量分析。然而攻击者一旦利用此技术进行拒绝服务式攻击，受害者无法追踏出攻击者。为此本文提出一种可追踪洋葱数据包的高级标记方案，使洋葱路由技术在保持原有隐匿性的同时受害者还可以近似地追踪出攻击者，本方案有很低的网络和路由器开销，也容易扩充到IPV6和未来的主干网。     

Performance evaluation of adaptive routing algorithms in packet‐switched intersatellite link networks

This paper addresses the performance evaluation of adaptive routing algorithms in non‐geostationary packet‐switched satellite communication systems. The dynamic topology of satellite networks and variable traffic load in satellite coverage areas, due to the motion of satellites in their orbit planes, pose stringent requirements to routing algorithms. We have limited the scope of our interest to routing in the intersatellite link (ISL) segment. In order to analyse the applicability of different routing algorithms used in terrestrial networks, and to evaluate the performance of new algorithms designed for satellite networks, we have built a simulation model of a satellite communication system with intersatellite links. In the paper, we present simulation results considering a network‐uniform source/destination distribution model and a uniform source–destination traffic flow, thus showing the inherent routing characteristics of a selected Celestri‐like LEO satellite constellation. The updates of the routing tables are centrally calculated according to the Dijkstra shortest path algorithm. Copyright © 2002 John Wiley & Sons, Ltd.     

A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience

In this paper, we study the problem of designing motion strategies for a team of mobile agents, required to fulfill request for on-site service in a given planar region. In our model, each service request is generated by a spatio-temporal stochastic process; once a service request has been generated, it remains active for a certain deterministic amount of time, and then expires. An active service request is fulfilled when one of the mobile agents visits the location of the request. Specific problems we investigate are the following: what is the minimum number of mobile agents needed to ensure that a certain fraction of service requests is fulfilled before expiration? What strategy should they use to ensure that this objective is attained? This problem can be viewed as the stochastic and dynamic version of the well-known vehicle routing problem with time windows. We also extend our analysis to the case in which the time service requests remain active is itself a random variable, describing customer impatience. The customers’ impatience is only known to the mobile agents via prior statistics. In this case, it is desired to minimize the fraction of service requests missed because of impatience. Finally, we show how the routing strategies presented in the paper can be executed in a distributed fashion.     

Distributed Borrowing Addressing Scheme for ZigBee/IEEE 802.15.4 Wireless Sensor Networks

This paper proposes a distributed borrowing addressing (DIBA) scheme to solve problems of failure in address assignments resulting from limited tree depth and width when the distributed address assignment mechanism is used in a ZigBee/IEEE 802.15.4 wireless sensor network. DIBA is a method of borrowing addresses from neighbor nodes for newly entering nodes and assigning the borrowed addresses. Its network or sensing coverage can increase with almost the same overhead as the existing method. DIBA is a simple and lightweight means of addressing and routing, making it suitable for wireless sensor networks. Simulations showed that DIBA is a distributed addressing scheme with consistently excellent performance.     

A concurrent two-layer restoration scheme for GMPLS WDM networks

Next generation backbone networks will likely consist of IP routers as well as optical cross connects (OXCs) and will deploy an optical control plane protocol. Generalized Multi Protocol Label Switching (GMPLS) has been proposed as the candidate of choice for the control plane. Optical fibers may carry large volumes of traffic and therefore adequate mechanisms must exist to enable the network to automatically recover from failures of fiber. In mission critical networks survivability becomes very important. We investigate the problem of autonomous recovery in such networks. The literature contains work in this area that investigates the problem of multilayer recovery. Such recovery had only been sequential in the sense that the published work recovers first in the optical domain, assuming the availability of redundant resources, and then proceeds to recover packet label switched paths. We report a recovery procedure for recovering packet label switch paths (packet LSPs) and lambda label switch paths (λLSP) concurrently. We have conducted an OPNET-based simulation study that compares the performance of the concurrent scheme with the previously published sequential two-layer recovery scheme. The study shows that the concurrent two-layer recovery scheme performs as much as forty-four percent faster than the sequential two-layer recovery scheme.     

IP网流量工程的一种权值设置方法

提出一种新的基于传统路由协议的流量控制方法。该方法首先在不限制总流量条件下求解最小化最大连接利用率。然后在固定最大连接利用率条件下最小化总流量。由此求得最优流量分配方案并从其对偶问题中求出各连接的权值配置。实验结果显示，文中算法较现有算法明显降低最大连接利用率，并且增加了稳定性。     

Integrated Routing Algorithms for Provisioning “Sub-Wavelength” Connections in IP-Over-WDM Networks

This work focuses on developing and implementing comprehensive unified constraint-based routing algorithms within the generalized multi-protocol label switching framework (GMPLS) to provision sub-wavelength circuits (low-rate traffic streams). Constraint-based routing is further augmented in this work by dynamically routing both an active and another alternate link/node-disjoint backup path at the same time in order to provision a given connection request. This new integrated approach combines both IP routing and optical resource allocation to setup end-to-end connections.