Results 201 to 210 of about 2,334 (242)
Some of the next articles are maybe not open access.

Related searches:

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   +3 more
openaire   +1 more source

An Efficient K-Shortest Paths Based Routing Algorithm

Advanced Materials Research, 2012
We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm.
Jian Lian, Yan Zhang, Cheng Jiang Li
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

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. Anthony Dunn   +2 more
openaire   +1 more source

A new solution to the K-shortest paths problem and its application in wavelength routed optical networks

Photonic Network Communications, 2006
In communication networks, traffic carried over long paths suffers from a higher call blocking probability (CBP) than those carried over short paths. This is a well-known fairness problem. Such a problem becomes more serious in wavelength-routed optical networks (WRONs) due to the wavelength continuity constraint.
Junjie Li, Hanyi Zhang
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

Home - About - Disclaimer - Privacy