Results 231 to 240 of about 50,964 (251)
A new solution to the K-shortest paths problem and its application in wavelength routed optical networks [PDF]
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.
Hanyi Zhang, Junjie Li
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An Efficient K-Shortest Paths Based Routing Algorithm
Advanced Materials Research, 2012We 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.
Cheng Jiang Li, Yan Zhang, Jian Lian
openaire +2 more sources
Improved Route Selection Strategy Based on K Shortest Path
2019 International Symposium on Networks, Computers and Communications (ISNCC), 2019LEO 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.
Gengxin Zhang +3 more
openaire +2 more sources
Transmission Line Route Selection: An Application of K-Shortest Paths and Goal Programming
IEEE Power Engineering Review, 1984A 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 ...
T. Burgman, F. Choobineh
openaire +3 more sources
Performance optimization of intelligent optical networks by multiple alternate routes based on the K-shortest path algorithm [PDF]
SPIE Proceedings, 2006 Blocking probability is one of the key factors to evaluate the routing and wavelength algorithms for intelligent optical network. Two kinds of Dynamic K-Shortest Path (DKSP) Algorithms were designed. One is based on Linear Link Weight Function (LW) and the other is based on Piecewise Linear Link Weight Function (PLW).
Yili Guo +4 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, 1994In 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,
Wayne D. Grover +2 more
openaire +2 more sources
Widest K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks
2008 International Conference on Computer Science and Software Engineering, 2008Actually, 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 +2 more sources
Ak-SHORTEST PATHS ROUTING HEURISTIC FOR STOCHASTIC NETWORK EVACUATION MODELS
Engineering Optimization, 1984Stochastic-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.
J. MacGregor Smith, C. J. Karbowicz
openaire +2 more sources
A k shortest path algorithm for adaptive routing in communications networks
IEEE Transactions on Communications, 1988An efficient and flexible algorithm is presented for finding a k shortest loopless path with distinct initial links from one node to each other node. Low-order polynomial bounds are established for the worst-case time complexity of the algorithm, showing it to offer a substantial improvement over applying known algorithms to the problem.
openaire +2 more sources