Results 201 to 210 of about 2,266 (237)

Improved Route Selection Strategy Based on K Shortest Path

2019 International Symposium on Networks, Computers and Communications (ISNCC), 2019
LEO satellite networks have many advantages, such as global coverage and short latency, which play a crucial role in the future global communications. Under the tide of the Internet of Things, LEO satellite networks, as an effective means of connecting remote regions, will become indispensable pillars in the integrated system of the Internet of Things.
Guanghao Huang, Wei Lu, Xie Jidong, Gengxin Zhang   +3 more
openaire   +1 more source

Transmission Line Route Selection: An Application of K-Shortest Paths and Goal Programming

IEEE Power Engineering Review, 1984
A two-stage solution procedure is developed as a managerial decision making tool in the transmission line route selection process. In stage one, the K least costly alternatives are found, based strictly on monetary considerations. In stage two, the alternative which causes the least amount of social and environmental disruption is selected from the ...
F. Choobineh, T. Burgman
openaire   +1 more source

Widest K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks

2008 International Conference on Computer Science and Software Engineering, 2008
Actually, various kinds of sources (such as voice, video or data) with diverse traffic characteristics and quality of service requirements (QoS), which are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks.
Alireza Esfahani, Morteza Analoui
openaire   +1 more source

Ak-SHORTEST PATHS ROUTING HEURISTIC FOR STOCHASTIC NETWORK EVACUATION MODELS

Engineering Optimization, 1984
Stochastic-network evacuation models require an optimization process to determine the best evacuation routes for a building's occupants. The optimization process developed and applied below is a heuristic based on the K-th Shortest Path Algorithm.
C. J. KARBOWICZ, J. MACGREGOR SMITH
openaire   +1 more source

Multi-tiers route design coordinating QoS-specific K shortest paths over optical network

2015 IEEE International Conference on Communication Workshop (ICCW), 2015
In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection.
Hideki Tode, Masashi Takada, Yosuke Tanigawa   +2 more
openaire   +1 more source

Comparison of k-shortest paths and maximum flow routing for network facility restoration

IEEE Journal on Selected Areas in Communications, 1994
In the development of technologies for span failure restoration, a question arises about the restoration rerouting characteristics to be specified. In theory, maximal rerouting capacity is obtained with a maximum flow (Max Flow) criterion. However, rerouting that realizes the k-successively shortest link disjoint paths (KSP) may be faster, easier, and,
D.A. Dunn, W.D. Grover, M.H. MacGregor
openaire   +1 more source

A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations

Annals of Operations Research, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadjiconstantinou, Eleni, Christofides, Nicos, Mingozzi, Aristide   +2 more
openaire   +1 more source

Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming

2011
In this paper, we describe a Constraint Programming (CP) route finding application for a container transportation company. Mathematically, this amounts to finding the k shortest paths in a directed graph. However the nature of the business constraints rule out known algorithms such as Dijkstra's.
Michel P. Lefebvre, Jean-François Puget, Petr Vilím   +2 more
openaire   +1 more source

K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks

2005
Actually, various kinds of sources (such as voice, video, or data) with diverse traffic characteristics and Quality of Service Requirements (QoS), which are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks.
S. Hoceini, A. Mellouk, Y. Amirat
openaire   +1 more source

A k shortest path algorithm for adaptive routing in communications networks

IEEE Transactions on Communications, 1988
The problem of finding k shortest loopless paths with distinct initial links from one node to each other node arises in several important contexts for adaptive routing in communication networks. One context is the construction or adaptive reconstruction of routing tables where a sequential routing algorithm is used, and another context is ``delta ...
openaire   +2 more sources