• Corpus ID: 126232127

SHORTEST PATH IDENTIFICATION USING THE MINIMUM HOP COUNT AND MAXIMUM BANDWIDTH CONSTRAINED BASED ALGORITHM IN NOC

@article{Muthulakshmi2016SHORTESTPI,
  title={SHORTEST PATH IDENTIFICATION USING THE MINIMUM HOP COUNT AND MAXIMUM BANDWIDTH CONSTRAINED BASED ALGORITHM IN NOC},
  author={M. Muthulakshmi and M. M. Shanmugapriya},
  journal={International Journal of Mathematical Archive},
  year={2016},
  volume={7}
}
The Shortest path problems are one of the network flow optimization problems with large number of applications in various fields. Conventional techniques cannot be used for solving the shortest paths in a large network as they are too slow and require large number of storage. Finding the multiple shortest path gives the optimal solution in case of any fault occurred in a single shortest path in the run-time dimension. The proposed algorithm uses the fuzzy, shortest path algorithm and widest… 

Figures from this paper

References

SHOWING 1-10 OF 23 REFERENCES
PATH IDENTIFICATION IN MULTIPATH ROUTING
TLDR
Some multipath routing approaches considering path construction and selection criteria are discussed, which can be effectively used for maximum utilization of network resources and ways to minimize delay and increased throughput.
The fuzzy shortest path problem and its most vital arcs
A new algorithm for the discrete fuzzy shortest path problem in a network
Fuzzy shortest paths
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
QoS based routing in networks with inaccurate information: theory and algorithms
TLDR
The main focus is to determine the impact of inaccurate information about the actual state of a node or network on the path selection process, whose goal is to identify the path that is most likely to satisfy the QoS requirements.
Finding the k Shortest Paths
  • D. Eppstein
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1998
TLDR
K shortest paths are given for finding the k shortest paths connecting a pair of vertices in a digraph, and applications to dynamic programming problems including the knapsack problem, sequence alignment, and maximum inscribed polygons are described.
A fuzzy shortest path with the highest reliability
The k Shortest Paths Problem
TLDR
The unconstrained ranking shortest paths problem is viewed as a generalization of the classical shortest path problem; conditions for niteness and for the optimality principle being satissed are studied as well as labeling shortest path algorithms are generalized.
An empirical investigation of some bicriterion shortest path algorithms
...
...