Results 181 to 190 of about 47,653 (229)
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
openalex +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).
Xinyou Cui +4 more
openalex +2 more sources
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.
Saïd Hoceini +2 more
openalex +3 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, 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
openalex +3 more sources
Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>$k$</tex>-Shortest-Paths
IEEE Transactions on Automatic Control, 2006 The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC is NP-complete. Many heuristic methods have been proposed for it.
Zhenhua Jia, Pravin Varaiya
openalex +3 more sources
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 +2 more
openalex +3 more sources
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 ...
Donald M. Topkis
openalex +4 more sources
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
openalex +3 more sources
Random Regular Graph and Generalized De Bruijn Graph with k-Shortest Path Routing
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016 Random regular graph (RRG) has recently beenproposed as an interconnect topology for future large scaledata centers and HPC clusters. While various studies havebeen performed, this topology is still not well understood. RRGis a special case of directed regular graph (DRG) where eachlink is unidirectional and all nodes have the same number ofincoming ...
Peyman Faizian +4 more
openalex +2 more sources
International Journal of Operational Research, 2018 The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event times for each activity.
Trust Tawanda
+5 more sources