Abstract: PIM-DM is a multicast routing protocol that uses the underlying unicast routing information base to flood multicast datagrams to all multicast routers. Prune messages are used to prevent future messages from propagating to routers without group membership information. There are several polynomial-time algorithms for the maximum flow problem. One inherent drawback of these augmenting path algorithms is the computationally expensive operation of sending flows along paths. These algorithms might repeatedly augment flows along common path segments. The pre flow-push algorithms that we described in this paper overcome this drawback; we can conceive of them as sending flows along several paths simultaneously in PIM-DM wireless multicast.
Keywords: Mulicast, Maximum Flow, Pre Flow, PIM-DM.
Title: Computation of Maximum Flow Using PreFlow Push Algorithm in PIM-DM Wireless Multicast
Author: Deepa V B, UshaDevi M B
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
