14-06-2013, 03:35 PM
efficient and dynamic routing topology
efficient and dynamic.ppt (Size: 820.5 KB / Downloads: 14)
MODULES DESCRIPTION
CLIENT MODULE:
This module will select the path to receive the file from server. Then the file sent from the server will be stored in the path selected by the client itself.
ENDTOENDMEASUREMENT:
This module will select the particular routing path and check error nodes. If any errors exists, then the particular link will be discarded. Then starts the process. This module also provides the Cost of Transfer, Accuracy of transfer, Time taken to transfer the file from server to client
SERVER MODULE:
This module will selects a file to send to client. Then it transfers the file through the route selected by EndToEndMeasurement module.
RNJ (ROOTED NEIGHBOUR-JOINING) ALGORITHM
This algorithm begins with a leaf set including all the destination nodes.
In each step, it selects a group of nodes that are likely to be neighbours (i.e., siblings, nodes with the same parent on the tree).
Deletes them from the leaf set.
Creates a new node a their parent, and adds that node to the leaf set.
This process is iterated until there is only one node left in the leaf set, which will be the child of the root(source node).
This algorithm is efficient when we use multicast routing method.
SEQUENTIAL TOPOLOGY INFERENCE ALGORITHM
For a source node s and a set of destination nodes D, we can apply the add_node() procedure for the nodes in D, in sequential construct the routing tree topology incrementally.
add_node(): It is a recursive procedure that adds a new destination node j to the routing tree via an existing node k on the tree, with the initial condition that j is a sibling of node k.
This algorithm also uses another procedure delete_node() deletes a destination node j from routing tree T.
It will first remove node j and link from the tree. If the node i has only one child left after deleting j, it will then further removes node i and connect the child of i to the parent i.