In partial fulfillment of the Requirements for the Degree of
Master of Science


Muhammad A. Khan
will defend his thesis

A Dynamic Group Routing Protocol



Abstract

A dynamic group routing protocol for a network of processes is presented here. The purpose of this protocol is to route data messages among the members of the network. To construct the routing tree, the unicast routing protocol is used. It is ensured that every member of the group is included in the tree. The overhead of the processes in the tree consists of child/parent and flip/fack messages between child and parent processes of the tree. The root of the tree is dynamic and decides to make a new root of the tree whenever the structure of the network is changed. The protocol is proven correct by proving the properties of the protocol to be correct.

Date: Wednesday, November 08, 2000
Time: 10:00 AM
Place: 550-PGH



Faculty, students, and the general public are invited.
Thesis Advisor: Dr. Ernst L. Leiss