Results 211 to 220 of about 2,334 (242)
Some of the next articles are maybe not open access.
A k shortest path algorithm for adaptive routing in communications networks
IEEE Transactions on Communications, 1988The 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 ...
openaire +2 more sources
Annals of Operations Research, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eleni Hadjiconstantinou +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eleni Hadjiconstantinou +2 more
openaire +1 more source
Multi-tiers route design coordinating QoS-specific K shortest paths over optical network
2015 IEEE International Conference on Communication Workshop (ICCW), 2015In 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 +1 more source
K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks
2005Actually, 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.
Said Hoceini +2 more
openaire +1 more source
Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming
2011In 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 +1 more source
2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), 2018
k-shortest path problem (KSP) is a more general form of the classical shortest path problem in graph. Its task is no longer to find the shortest path between two vertices, but to find the shortest k paths. So far, the reported KSP-algorithms only considers finding shortest k paths with regard to a single criterion, while far more application scenarios ...
Yang Wang +6 more
openaire +1 more source
k-shortest path problem (KSP) is a more general form of the classical shortest path problem in graph. Its task is no longer to find the shortest path between two vertices, but to find the shortest k paths. So far, the reported KSP-algorithms only considers finding shortest k paths with regard to a single criterion, while far more application scenarios ...
Yang Wang +6 more
openaire +1 more source
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
openaire +1 more source
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
openaire +1 more source
Eur. J. Oper. Res., 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Claudia Bode, Stefan Irnich
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Claudia Bode, Stefan Irnich
openaire +2 more sources
TENCON 2014 - 2014 IEEE Region 10 Conference, 2014
For finding all-pairs shortest paths in a digraph of n nodes, the well-known Floyd-Warshall method yields a particular best path between each pair of nodes efficiently in running time O(n3) when there is no negative-cost cycle (and all ties are ignored). Such a digraph may be a model of a real-world transportation, communication, or road network; then,
openaire +1 more source
For finding all-pairs shortest paths in a digraph of n nodes, the well-known Floyd-Warshall method yields a particular best path between each pair of nodes efficiently in running time O(n3) when there is no negative-cost cycle (and all ties are ignored). Such a digraph may be a model of a real-world transportation, communication, or road network; then,
openaire +1 more source
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.
openaire +1 more source
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.
openaire +1 more source