Abstract: The construction of multicast tree within given constraints, such as delay and capacity, is becoming a major problem in many wireless multicast networks. The paper’s contributions are to investigate the computational complexity of solving the Shortest path problem among different network shortest path algorithms and network simplex method and revised network simplex method .The network simplex algorithm is one of the most popular algorithms in practice for solving the minimum cost flow problem. This algorithm is an adaptation for the minimum cost flow problem of the well-known simplex method of linear programming. This result permits us to restrict our search for an optimal solution among spanning tree. The algorithm is flexible in the sense that we can select the entering arc in a variety of ways and obtain algorithms with different worst-case and empirical attributes tree solutions.
Keywords: Multicast, Shortest Path, Network Simplex Algorithms.
Title: Computation of Shortest path using Network Simplex Algorithm in Wireless Multicast Network
Author: Deepa V B, UshaDevi M B
International Journal of Computer Science and Information Technology Research
ISSN 2348-120X (online), ISSN 2348-1196 (print)
Research Publish Journals
