Flood frequency and routing processes at a confluence of the middle Yellow River in China

Floods cause environmental hazards and influence on socio‐economic activities. In this study, we evaluated the historic flood frequency at a confluence in the middle Yellow River, China. A non‐parametric, multivariate, empirical, orthogonal function matrix model, which consists of time correlation coefficients of flood discharge at different gauge stations and flood events was used for the analysis of flood frequency. The model addresses the characteristics of confluent floods such as frequency and the probability in multiple tributary rivers. Flood frequency analysis is often coupled with studies of hydrological routing processes that reduce the flood capacity of the rivers. Flood routing to the confluence were simulated using kinematic wave theory. Results of this flood frequency analysis showed that flooding frequency has intensified in the past 500 years, especially during the 19th century. Flooding in streams above the confluence was more frequent than in streams below the confluence. Over the last 2000 years, concurrent flooding in multiple tributary rivers accounted for 67.5% of the total flooding in the middle Yellow River. Simulation of flood routing processes shows that the decreased flooding capacity and elevated river bed of the shrunken main channel leads to an increased flood wave propagation time (24–52.3 h) in the study area after 1995. The model indicates that human activities, such as constructions of the Sanmenxia Dam, have changed flood routing boundary conditions and have contributed to the increased flood frequency at the confluence. Copyright © 2007 John Wiley & Sons, Ltd.     

A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal

This is the last part of a four-part survey of optimization models and solution algorithms for winter road maintenance planning. The two first parts of the survey address system design problems for winter road maintenance. The third part concentrates mainly on vehicle routing problems for spreading operations. The aim of this paper is to provide a comprehensive survey of optimization models and solution methodologies for the routing of vehicles for plowing and snow disposal operations. We also review models for the fleet sizing and fleet replacement problems.     

无线移动自组网络的动态源路由策略

文章介绍无线移动自组网中动态源路由策略的路由发现和路由维护,并提出改进思路和今后研究的方向。     

Increasing Reliability in Cable-Free Radio LANs Low Level Forwarding in HIPERLAN

Radio LANs are emerging in the computing world. They are supported by distinct configurations: on the one hand radio LANs with base stations and a wired backbone, on the other hand radio LANs implementing Intra-forwarding. Adding a new node in a radio LAN with Intra-forwarding, increases the reliability, while this reliability decreases with ad hoc or hub configurations. This advantage of Intra-forwarding is quantified. Intra-forwarding, as defined in the HIPERLAN standard, is based on a hop-by-hop policy and link check procedures. It is shown how point-to-point packets and broadcast packets are forwarded. The three basic components of Intra-forwarding needed to build and update the Intra-forwarding database are described. The originality of this approach is the use of multipoint relays which enable better scalability. The correctness of the Intra-forwarding protocol is proved and its cost is evaluated.     

Time-Space Label Switching Protocol (TSL-SP)—A New Paradigm of Network Resource Assignment

In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering.     

Power Management Based Grid Routing Protocol for IEEE 802.11 Based MANET

MANET(Mobile Ad Hoc Network)is a collection of wireless mobile nodes forming a temporary communica-tion network without the aid of any established infrastructure or centralized administration.The lifetime of a MANETdepends on the battery resources of the mobile nodes.So energy consumption may one of important design criterions forMANET.With changing the idle model to sleep model in the grid environment,this paper proposes a new energy-awarerouting protocol.Performance simulation results show that the proposed strategy can dynamic balance the traffic load in-side the whole network,extend the lifetime of a MANET,and without decreasing the throughput ratio.     

A routing framework for providing robustness to node failures in mobile ad hoc networks

Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes.     

北电网络安全路由技术

北电网络提供的Contivity解决方案不仅可以使用户建立各种类型的VPN，而且还可以把这些VPN集成到未来的融合话音和数据的网络中。该方案已实现了安全路由选择；可通过多种技术支持鉴权功能，从而实现安全接入；允许用户使用其各自的安全性配置文件设置；其设计中没有“后门”，重点介绍了Contivity 2700网关的主要特征及其优势。     

Compact and localized distributed data structures

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.Received: August 2001, Accepted: May 2002, Supported in part by a grant from the Israel Science Foundation.     

Treatment of Natural Geometry in Finite Volume River Flow Computations

A method is proposed for the treatment of irregular bathymetry in one-dimensional finite volume computations of open-channel flow. The strategy adopted is based on a reformulation of the Saint-Venant equations. In contrast with the usual treatment of topography effects as source terms, the method accounts for slope and nonprismaticity by modifying the momentum flux. This makes it possible to precisely balance the hydrostatic pressure contributions associated with variations in valley geometry. The characteristic method is applied to the revised equations, yielding topographic corrections to the numerical fluxes of an upwind scheme. Further adaptations endow the scheme with an ability to capture transcritical sections and wetting fronts in channels of abrupt topography. To test the approach, the scheme is first applied to idealized benchmark problems. The method is then used to route a severe flood through a complex river system: the Tanshui in Northern Taiwan. Computational results compare favorably with gauge records. Discrepancies in water stage represent no more than a fraction of the magnitude of typical bathymetry variations.