Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"k-shortest"”.
-
Quality-of-service provisioning in high speed networks : routing perspectives
… approach is to convert this problem into a shortest path or k-shortest path problem and solve it by using existing algorithms such as Bellman-Ford and Dijkstra algorithms. However, this approach suffers from either high computational complexity or low success ratio in finding the feasible …
-
High throughput path selection for unstructured data center networks
… in most topologies than the previously used k-shortest paths. We also show that one can positively impact network throughput by varying the number of paths according to network density.
-
Low probability-high consequence considerations in a multiobjective approach to risk management
… and is prompted by the solution to the shortest path problem which minimizes the expected risk. Two approaches are investigated. First, we apply a suitable k-shortest path algorithm to rank the extreme points for which the objective function value remains lesser than or equal to v. This …
-
Scalable data analytics techniques for summarizing spatial network-based observations
… crime reports) and the goal is to find k shortest paths that summarize the activities. SNAS is important for applications where observations occur along linear paths such as roadways, train tracks, etc. Previous work has focused on either geometry or subgraph-based approaches (e.g., only …
-
Bridging Methodological Gaps in Network-Based Systems Biology
… Linker combines teleporting random walks and k-shortest path computations to discover connections from a set of source proteins to a set of target proteins. We demonstrate the efficacy of Linker through two applications: proposing extensions to an existing model of cell cycle regulation in …
-
Mechanisms for quality-of-service provisioning in networks with extended services
… which is known to be NP-hard. An improved k-shortest path QoS routing algorithm is proposed to solve this problem.
-
Routing Algorithms for Dynamic, Intelligent Transportation Networks
… to analyze the effectiveness of time-dependent shortest path (TDSP) algorithms and k-shortest path (k-SP) algorithms as a practical routing tool in such intelligent transportation networks. Similar algorithms have been used to solve routing problems in computer networks. The similarities and …
-
Multi-objective Network Virtualization and its Applicability to Industrial Networks
… heuristics based on a reliability-aware k-shortest path algorithm and compare them using a typical factory topology. We then integrate these algorithms with a Frame Replication and Elimination for Reliability (FRER) simulator to realize reliability policies by the autonomic and efficient …
-
Mathematical modelling of blood spatter with optimization and other numerical methods
The current methods used by forensic experts to analyse blood spatter neglects the influence of gravitation and drag on the trajectory of the droplet. This research attempts to suggest a more accurate method to determine the trajectory of a blood droplet using multi-target tracking. The …