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. Shanmugapriya},
  journal={International Journal of Mathematical Archive},
  year={2016},
  volume={7}
}
  • M. Muthulakshmi, M. Shanmugapriya
  • Published 2016
  • Mathematics
  • International Journal of Mathematical Archive
  • 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… CONTINUE READING

    Figures from this paper

    References

    SHOWING 1-10 OF 23 REFERENCES
    PATH IDENTIFICATION IN MULTIPATH ROUTING
    • 4
    • PDF
    The fuzzy shortest path problem and its most vital arcs
    • 126
    A new algorithm for the discrete fuzzy shortest path problem in a network
    • 50
    Fuzzy shortest paths
    • 167
    Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
    • 195
    • PDF
    Finding the K Shortest Loopless Paths in a Network
    • 781
    QoS based routing in networks with inaccurate information: theory and algorithms
    • 334
    A fuzzy shortest path with the highest reliability
    • 35
    Finding the k Shortest Paths
    • D. Eppstein
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1998
    • 916
    • PDF
    The k Shortest Paths Problem
    • 54