shortest path routing problem
A New Approach For Solving Dynamic Shortest Path Routing Problem In MANET Using Swarm Intelligence Algorithm
... Dynamic Shortest Path Routing Problem utilizing Genetic Algorithm (GA- DSPRP), Dynamic Shortest Path Routing Problem utilizing Particle Swarm Optimization Algorithm ...
8
A reduced uncertainty hybrid evolutionary algorithm for solving dynamic shortest path routing problem
... total path costs of 327) finds a better result or fitness value compared to GA (with total path costs of 349), and thus PSO shares its information with ...optimal path A-C-H-N-T and its estimated ...
39
Conditional Shortest Path Routing in Delay Tolerant Networks
... on routing protocols [13-15] and metrics [16, 17] for this ...on routing problem in DTN’s have focused on the analysis of real mobility traces (human [11], vehicular [18] ...of routing ...
5
VPN STIPULATION BASED VIBRANT DEVELOPMENT
... K-optimal path have been implemented in ...their shortest path thus minimizing the packet loss and delay compared to the existing static ...VPN routing. For example: (1) The problem of ...
7
Vehicle routing with shortest path system based Floyd Warshall Technique
... Vehicle routing plays an important role in courier ...this problem and have a good routing procedure can save the industry millions of dollars per year through cost-effective movement and delivery of ...
9
An Efficient Algorithm for Finding Top-K Shortest Simple Path
... The shortest-path distance between vertices in a network is a fundamental concept in graph theory and is widely applied in the AI and Web ...K shortest paths (KSP) problem has been extensively ...
6
Entropy Maximization Problem in Network using Dijkstra’s Floyd Warshall Algorithm
... The shortest path problem is to find a path between two vertices on a given graph, such that the sum of the weights on its constituent edges is ...source shortest path ...
5
Lucrative Reserve Allotment of Superimpose Steering Spread Knobs
... the shortest path based routing designed for delay tolerant ...Conditional Shortest Path Routing (CSPR) protocol that routes the messages over conditional shortest paths ...
8
The On-Line Shortest Path Problem Under Partial Monitoring
... Our model of the label-efficient bandit problem for shortest paths is motivated by an application to a particular packet switched network model. This model, called the cognitive packet network, was ...
35
Modelling dynamic routing for 3D shortest path analysis
... SSSP problem if the edge e is part of an existing shortest path, thus e ...their shortest path might be affected by this ...the shortest paths form the sink to the affected ...
18
A Review on Self Controllable Routing Protocol with Shortest Path in VANET
... The VANET is a type of ad hoc networks which are self-organizing and decentralized. In city environment, cars move in a particular range or a regular pattern. During a short period of time, the movement ranges and ...
6
Efficient Cluster Elimination Protocol (ECEP) for Ad Hoc Networks
... The routing protocol must have the ability to manage the frequent topology changes caused by the mobility of nodes and these need to be efficient as compared on basis of efficiency in terms of bandwidth and power ...
5
Complement of Type-2 Fuzzy Shortest Path Using Possibility Measure
... the shortest path problem is the problem of finding a path between source node to destination node on a ...communication, routing and scheduling. In real world problem the ...
9
IMPLEMENTATION OF SHORTEST PATH ALGORITHM FOR RECTILINEAR STEINER TREE PROBLEM
... (RSMT) problem is one of the fundamental problems in ...Steiner problem. Since timing consideration require routing path of minimal length these tree have been often used in placement and ...
12
An Analysis of Foraging and Echolocation Behavior of Swarm Intelligence Algorithms in Optimization: ACO, BCO and BA
... DOI: 10.4236/ijis.2018.81001 2 International Journal of Intelligence Science as of late risen as a bunch of nature driven, population based algorithm that are equipped for delivering minimal effort, quick, and strong ...
27
An Extended Shortest Path Problem with Switch Cost Between Arcs
... Computing the shortest path is a classic graph prob- lem. It has many applications in real word such as in- ternet routing, transportation, games and so on. Many researches relating to it have been ...
6
EFFICIENT COST-EFFECTIVE RESOURCE IN RESILIENT OVERLAY ROUTING RELAY NODE NETWORKS
... overlay routing .The shortest path routing over the Internet, BGP- based routing: to make the routing between a group of autonomous systems (ASs) use the underlying ...
6
Novel Approach to Fuzzy Shortest Path Problem
... The Shortest Path (SP) problem has accustomed abundant absorption in the ...and routing, in which, Shortest Path (SP) is applied ...
8
On a New Notation of Fuzzy Subgroup
... The idea of a fuzzy subset (FS) was first mathematically formulated by Zadeh [1]. Nowadays it has become an important area of research in many applied as well as and pure fields. It was based on the belief that, in ...
6
A Fine Tuned Hybrid Implementation for Solving Shortest Path Problems using Bellman Ford
... contain shortest path length from source to all the other vertices in set ...contain shortest path length from ‘s’ to ‘v’ going through atmost ‘k’ intermediate ...
5