Results 241 to 250 of about 80,592 (300)
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 +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
+4 more sources
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 +2 more
openaire +2 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
openaire +2 more sources
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 +2 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
openaire +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
+4 more sources
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 +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.
S. Hoceini, A. Mellouk, Y. Amirat
openaire +2 more sources
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 +2 more sources