Ambulance route optimization in a mobile ambulance dispatch system using deep neural network (DNN). [PDF]
Sci RepSelvan C, Anwar BH, Naveen S, Bhanu ST.
europepmc +1 more source
Optimal routing and end-to-end entanglement distribution in quantum networks. [PDF]
Sci RepHalder J +4 more
europepmc +1 more source
Anticollision communication ontology technique implementation with MANET networking. [PDF]
Sci RepWielgosz M +2 more
europepmc +1 more source
Adaptive Extended Kalman Prediction-Based SDN-FANET Segmented Hybrid Routing Scheme. [PDF]
Sensors (Basel)Sun K, Liu M, Yin C, Wang Q.
europepmc +1 more source
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
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 +2 more sources
The Journal of The Korea Institute of Intelligent Transport Systems, 2018 Inwoo Jeon +3 more
openalex +2 more sources
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
openalex +2 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 +3 more sources
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 +2 more sources