Results 231 to 240 of about 53,951 (279)

Determining k-possible critical paths using Tawanda's non-iterative optimal tree algorithm for shortest route problems

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

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, Abdelhamid Mellouk, Yacine Amirat   +2 more
openalex   +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
openalex   +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
openalex   +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, Jean‐François Puget, Petr Vilím   +2 more
openalex   +2 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, Wei Lu, Xie Ji-dong, Gengxin Zhang   +3 more
openalex   +2 more sources

Routing and Spectrum Assignment in Elastic Optical Networks through a Hybrid Approach based on K-Shortest Paths and Q-Learning

2023 IEEE Latin American Conference on Computational Intelligence (LA-CCI), 2023
Ivan I. Ríos-Villalba, Santiago C. Arce, Luis Ayala Albertini, Diego P. Pinto-Roa   +3 more
openalex   +2 more sources

Finding all best ties by a K shortest paths method of Dreyfus in a general digraph for routing control

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,
Eiji Mizutani
openalex   +2 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, Masashi Takada, Yosuke Tanigawa   +2 more
openalex   +2 more sources

A new solution to the K-shortest paths problem and its application in wavelength routed optical networks

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
openalex   +2 more sources