Analysis will be provided for static as well as dynamic versions of these algorithms. Development of a mathematical framework for the analysis of routing algorithms. However, these methods fail to provide a framework under which the proof of correctness and analysis of simple greedy routing algorithms can be carried out. The investigator believes that such a framework will be based on potential functions and for this reason all of the developed algorithms for routing on trees will be analyzed using arguments involving potential functions. Computational aspects of packet routing.
Nothing is known regarding the computational complexity of packet routing.
It is believed that the problem is NP-complete but no proof has appeared in the literature. As part of this project we try to settle this question. While it is very likely that a proof of NP-completeness will be obtained for the case of general graphs, we are more excited with the aspect that the problem can be solved in polynomial for special forms of graphs as meshed and trees. Our belief is supported by experimental studied we have contacted. To appear in Information Processing Letters .