Path switching-a quasi-static routing scheme for large-scale ATM packet switches

1997 ◽  
Vol 15 (5) ◽  
pp. 914-924 ◽  
Author(s):  
T.T. Lee ◽  
C.H. Lam
2020 ◽  
Vol 16 (4) ◽  
pp. 155014772091381
Author(s):  
Buri Ban ◽  
Xuan Li ◽  
Miao Jin

We design a greedy routing scheme specifically for GPS-free large-scale wireless sensor networks deployed on surfaces of complex-connected three-dimensional settings. Compared with other greedy embedding–based surface network routing scheme, the proposed one is cut free such that no pair of nodes suffers a long detour to reach each other. The routing scheme is designed to be resilient to node or link failures especially under random node or link failure model where each node in a network has an equal and independent probability of failure during some time interval. The proposed algorithm is fully distributed and scalable to both the size and the topological complexity of a network. Each sensor node requires only limited and constant storage. Simulation results show the proposed routing scheme with a higher successful delivery ratio, a lower average stretch factor, and a lower normalized communication cost compared with other resilient routing methods.


2016 ◽  
Vol 20 (5) ◽  
pp. 2047-2061 ◽  
Author(s):  
Sebastiano Piccolroaz ◽  
Michele Di Lazzaro ◽  
Antonio Zarlenga ◽  
Bruno Majone ◽  
Alberto Bellin ◽  
...  

Abstract. We present HYPERstream, an innovative streamflow routing scheme based on the width function instantaneous unit hydrograph (WFIUH) theory, which is specifically designed to facilitate coupling with weather forecasting and climate models. The proposed routing scheme preserves geomorphological dispersion of the river network when dealing with horizontal hydrological fluxes, irrespective of the computational grid size inherited from the overlaying climate model providing the meteorological forcing. This is achieved by simulating routing within the river network through suitable transfer functions obtained by applying the WFIUH theory to the desired level of detail. The underlying principle is similar to the block-effective dispersion employed in groundwater hydrology, with the transfer functions used to represent the effect on streamflow of morphological heterogeneity at scales smaller than the computational grid. Transfer functions are constructed for each grid cell with respect to the nodes of the network where streamflow is simulated, by taking advantage of the detailed morphological information contained in the digital elevation model (DEM) of the zone of interest. These characteristics make HYPERstream well suited for multi-scale applications, ranging from catchment up to continental scale, and to investigate extreme events (e.g., floods) that require an accurate description of routing through the river network. The routing scheme enjoys parsimony in the adopted parametrization and computational efficiency, leading to a dramatic reduction of the computational effort with respect to full-gridded models at comparable level of accuracy. HYPERstream is designed with a simple and flexible modular structure that allows for the selection of any rainfall-runoff model to be coupled with the routing scheme and the choice of different hillslope processes to be represented, and it makes the framework particularly suitable to massive parallelization, customization according to the specific user needs and preferences, and continuous development and improvements.


2012 ◽  
Vol 30 (16) ◽  
pp. 2637-2645 ◽  
Author(s):  
Jun Luo ◽  
Harm J. S. Dorren ◽  
Nicola Calabretta

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Zhuhua Liao ◽  
Guoqiang Zhang ◽  
Aiping Yi ◽  
Guoqing Zhang ◽  
Wei Liang

Performing complex semantic queries over large-scale distributed media contents is a challenging task for rich media applications. The dynamics and openness of data sources make it uneasy to realize a query scheme that simultaneously achieves precision, scalability, and reliability. In this paper, a novelrelation routing scheme (RRS)is proposed by renovating the routing model of Content Centric Network (CCN) for directly querying large-scale semantic media content. By using proper query model and routing mechanism, semantic queries with complex relation constrains from users can be guided towards potential media sources throughsemantic guider nodes. The scattered and fragmented query results can be integrated on their way back for semantic needs or to avoid duplication. Several new techniques, such as semantic-based naming, incomplete response avoidance, timeout checking, and semantic integration, are developed in this paper to improve the accuracy, efficiency, and practicality of the proposed approach. Both analytical and experimental results show that the proposed scheme is a promising and effective solution for complex semantic queries and integration over large-scale networks.


2013 ◽  
Vol 479-480 ◽  
pp. 783-787
Author(s):  
Yih Chuan Lin ◽  
Jia Hong Zhong

This paper addresses the problem of how to make efficient energy consumption on routing communications among the set of wireless sensor nodes deployed randomly in a large-scale manner. Tree-based routing topology is considered in the study with regarding to its simplicity of routing process. To minimize the energy dissipation of tree-routing, centralized coordination schemes are usually used to construct an optimal tree routing topology. In this paper, a distributed-based tree routing protocol is proposed not only to improve the scalability of the centralized tree routing schemes but also handle the balance consumption among the sensor nodes. With computer simulation, the effectiveness of the proposed routing scheme is verified and shown to be useful in large-scale wireless sensor networks.


2008 ◽  
Vol 18 (04) ◽  
pp. 589-608 ◽  
Author(s):  
DARREN J. KERBYSON ◽  
MIKE LANG ◽  
GREGORY JOHNSON

The achievable performance on Infiniband networks is governed by the latencies and bandwidths of communication channels as well as by contention within the network. Currently Infiniband uses static routing to transfer messages and thus does not take into account dynamic loading of the channels. By interrogating the network routing tables we quantify the contention that occurs for a number of communication patterns using a large-scale (1024 processor) system. Empirical data confirms our contention calculation almost exactly. Custom routing tables are defined that provide both optimum and worst-case performance for a large-range of communication patterns. Performance differences can be as large as 12× (from optimum to worst-case). Two large-scale applications show a run-time improvement of between 10-20% and up to a 40% improvement in just their communication time when using optimized routing tables. The approach taken is applicable to many Infiniband systems, and we expect the performance improvements to be even greater on larger-scale systems.


2013 ◽  
Vol 21 (1) ◽  
pp. 469 ◽  
Author(s):  
Toshinori Ban ◽  
Hiroshi Hasegawa ◽  
Ken-ichi Sato ◽  
Toshio Watanabe ◽  
Hiroshi Takahashi

Sign in / Sign up

Export Citation Format

Share Document