Properties and Analysis
If enough resources, REQUEST proceeds as in PIM
- no NACKs will be triggered
A feasible branch found is loop-free
- a searching “tree” is always maintained
After unsuccessful termination, all nodes not on tree are either in state I or F
- new receiver is in state F and so all nodes on searching tree
A feasible path is found if one exists
- in the worst-case, all possible paths are explored