Self-learning route selection scheme using multipath searching packets in an OBS network

2005 ◽  
Vol 4 (7) ◽  
pp. 432 ◽  
Author(s):  
Daisuke Ishii ◽  
Naoaki Yamanaka ◽  
Iwao Sasase
Keyword(s):  
Route Selection ◽  
Selection Scheme ◽  
Self Learning

A Reliable Route Selection Scheme Based on Caution Zone and Nodes' Arrival Angle

2011 ◽  
Vol 15 (11) ◽  
pp. 1252-1255 ◽  
Author(s):  
D. G. Reina ◽  
S. L. Toral ◽  
P. Jonhson ◽  
F. Barrero
Keyword(s):  
Route Selection ◽  
Arrival Angle ◽  
Selection Scheme

Calculation of Carrying Capacity at High-Speed Railway Stations Based on Route Selection

2015 ◽  
Vol 744-746 ◽  
pp. 1786-1791
Author(s):  
Qian Rui Zhao ◽  
Qi Zhang ◽  
Pei Liu
Keyword(s):  
Carrying Capacity ◽  
High Speed ◽  
Operation Time ◽  
Route Selection ◽  
High Speed Railway ◽  
Railway Stations ◽  
Selection Scheme ◽  
Capacity Calculation ◽  
The Relationship

Carrying capacity calculation at high-speed railway stations is closely related to the trains with different types and arriving rules. Traditional method is not feasible to calculate and evaluate carrying capacity at high-speed railway stations efficiently and accurately. Therefore, a method to calculate carrying capacity at high-speed railway stations was presented by establishing a route selection optimization model and designing corresponding algorithm. In the method, the integration concept of calculating carrying capacity was introduced by establishing the relationship between receiving dispatching route and arrival-departure track. An approach was provided to the solution of route selection scheme and calculating carrying capacity at high-speed railway stations efficiently and accurately by considering the differences of trains with different operation modes and operation time. Case study of Jinan West railway station verifies the feasibility of the method. The presented method can provide a technical support for calculating and evaluating carrying capacity at high-speed railway stations in different scenarios.

A Route Selection Scheme for Multi-Route Coding in Multihop Cellular Networks

2007 ◽  
Author(s):  
Hiraku Okada ◽  
Hitoshi Imai ◽  
Takaya Yamazato ◽  
Masaaki Katayama ◽  
Kenichi Mase
Keyword(s):  
Cellular Networks ◽  
Route Selection ◽  
Selection Scheme ◽  
Multihop Cellular

scholarly journals Capacitated Refuge Assignment for Speedy and Reliable Evacuation

2020 ◽  
Vol 9 (7) ◽  
pp. 442
Author(s):  
Takanori Hara ◽  
Masahiro Sasabe ◽  
Taiki Matsuda ◽  
Shoji Kasahara
Keyword(s):  
Assignment Problem ◽  
Large Scale ◽  
Linear Program ◽  
Actual Data ◽  
Integer Linear Program ◽  
Route Selection ◽  
Selection Scheme ◽  
Route Length ◽  
Assignment Scheme ◽  
Route Reliability

When a large-scale disaster occurs, each evacuee should move to an appropriate refuge in a speedy and safe manner. Most of the existing studies on the refuge assignment consider the speediness of evacuation and refuge capacity while the safety of evacuation is not taken into account. In this paper, we propose a refuge assignment scheme that considers both the speediness and safety of evacuation under the refuge capacity constraint. We first formulate the refuge assignment problem as a two-step integer linear program (ILP). Since the two-step ILP requires route candidates between evacuees and their possible refuges, we further propose a speedy and reliable route selection scheme as an extension of the existing route selection scheme. Through numerical results using the actual data of Arako district of Nagoya city in Japan, we show that the proposed scheme can improve the average route reliability among evacuees by 13.6% while suppressing the increase of the average route length among evacuees by 7.3%, compared with the distance-based route selection and refuge assignment. In addition, we also reveal that the current refuge capacity is not enough to support speedy and reliable evacuation for the residents.

Sign in / Sign up

Export Citation Format

Share Document