Irregular network
In Irregular network each node hasn’t the same number of links. There is abnormal shape for this network as shown in figure. Routing is also more complex in irregular network
Up/Down routing in single spanning tree
Single spanning tree contains only root node. Up/down routing algorithm is proposed aiming to better utilize all the available channels in the network. First of all, root node is selected and the network is partitioned into two sub-networks: up sub-network and down sub-network. The up sub network consists of unidirectional channels directed towards the root node while the down sub network consists of unidirectional channels directed away from root node.
Most of the packets pass through this root node only. So congestion occurs at root node. As shown in figure, A is the root node. All up links are towards A and downlinks are away from A.
Up / Down routing in a single spanning tree
Up/Down routing in multiple spanning trees
Multiple spanning tree contains more than one root node. The root is not the destination of a packet, but only acts as an intermediate node for the packets in most cases based on the up*/down* routing scheme.
Packets, which belong to different pairs of source/destination, can be delivered across different roots in their own spanning trees. The benefit introduced by this scheme is that different trees hold their own roots, and the packets can be delivered across different roots in their own trees. This technique can equally distribute all packets in the irregular network and directly improve the congestion produced by the routing scheme with a single spanning tree.
EXISTING SYSTEM
The Existing system consists of multiple spanning tree construction for static irregular network. Here at first single spanning tree which contains single root is constructed. Up/Down routing algorithm is used in which all packets are routed via root node only from source to destination. All links are to and from root node. So congestion occurs at root node when the size of network increases. There may be loss of packets at root node.
Spanning tree constructed for irregular network
The Figure is example for single spanning tree. If we start routing packets from node 5 to node 7 and from node 6 to node 2 at the same time, all packets pass via root node 1.So congestion occurs at node 1.
To overcome this, multiple spanning tree is constructed which contains more than one root. Packets that belong to different pairs of source/destination can be delivered across different roots in their own spanning trees.
Multiple spanning trees in an irregular network
In figure root nodes are 1 or 8.If we want to pass packets from node 5 to node 7 and node 6 to node 2,firstly it checks the availability of root node 1.If it is busy, it will pass through root node 8.It will take the shortest path from source to destination. In large networks we can calculate more than two root nodes.
Disadvantages of existing system:
In Irregular network each node hasn’t the same number of links. There is abnormal shape for this network as shown in figure. Routing is also more complex in irregular network
An irregular network
Up/Down routing in single spanning tree
Single spanning tree contains only root node. Up/down routing algorithm is proposed aiming to better utilize all the available channels in the network. First of all, root node is selected and the network is partitioned into two sub-networks: up sub-network and down sub-network. The up sub network consists of unidirectional channels directed towards the root node while the down sub network consists of unidirectional channels directed away from root node.
Most of the packets pass through this root node only. So congestion occurs at root node. As shown in figure, A is the root node. All up links are towards A and downlinks are away from A.
Up / Down routing in a single spanning tree
Up/Down routing in multiple spanning trees
Multiple spanning tree contains more than one root node. The root is not the destination of a packet, but only acts as an intermediate node for the packets in most cases based on the up*/down* routing scheme.
Packets, which belong to different pairs of source/destination, can be delivered across different roots in their own spanning trees. The benefit introduced by this scheme is that different trees hold their own roots, and the packets can be delivered across different roots in their own trees. This technique can equally distribute all packets in the irregular network and directly improve the congestion produced by the routing scheme with a single spanning tree.
The Existing system consists of multiple spanning tree construction for static irregular network. Here at first single spanning tree which contains single root is constructed. Up/Down routing algorithm is used in which all packets are routed via root node only from source to destination. All links are to and from root node. So congestion occurs at root node when the size of network increases. There may be loss of packets at root node.
Spanning tree constructed for irregular network
The Figure is example for single spanning tree. If we start routing packets from node 5 to node 7 and from node 6 to node 2 at the same time, all packets pass via root node 1.So congestion occurs at node 1.
To overcome this, multiple spanning tree is constructed which contains more than one root. Packets that belong to different pairs of source/destination can be delivered across different roots in their own spanning trees.
Multiple spanning trees in an irregular network
In figure root nodes are 1 or 8.If we want to pass packets from node 5 to node 7 and node 6 to node 2,firstly it checks the availability of root node 1.If it is busy, it will pass through root node 8.It will take the shortest path from source to destination. In large networks we can calculate more than two root nodes.
Disadvantages of existing system:
- Here topology is static.
- Once the root nodes are calculated, they are fixed.
- This will not work when topology becomes dynamic where the nodes are added or removed.
PROPOSED SYSTEM
We propose a system that consists of construction of multiple spanning trees for dynamic irregular network. Here Up/Down routing is used. If nodes are added or removed, we have to construct multiple spanning tree where the root nodes will change. If any node is removed, then packets should take an alternate shortest path to reach the destination.
If root node is removed, then immediately another node should be taken as root node. If node is added, then automatically connections between nodes should be established.
PROJECT SCOPE
We present construction of multiple spanning tree for irregular networks. With this construction, performance of irregular network increases. We construct multiple spanning trees for Dynamic networks where nodes are added or removed. Packets are transmitted in a shortest path from source to destination. Up/Down routing algorithm is used in multiple spanning tree. This routing algorithm improves the adaptivity, and provides more load balancing routing. By constructing multiple spanning tree we can avoid congestion in the traffic when the size of network increases. Understanding of this network construction is also simple.
We propose a system that consists of construction of multiple spanning trees for dynamic irregular network. Here Up/Down routing is used. If nodes are added or removed, we have to construct multiple spanning tree where the root nodes will change. If any node is removed, then packets should take an alternate shortest path to reach the destination.
If root node is removed, then immediately another node should be taken as root node. If node is added, then automatically connections between nodes should be established.
PROJECT SCOPE
We present construction of multiple spanning tree for irregular networks. With this construction, performance of irregular network increases. We construct multiple spanning trees for Dynamic networks where nodes are added or removed. Packets are transmitted in a shortest path from source to destination. Up/Down routing algorithm is used in multiple spanning tree. This routing algorithm improves the adaptivity, and provides more load balancing routing. By constructing multiple spanning tree we can avoid congestion in the traffic when the size of network increases. Understanding of this network construction is also simple.
Awesome dude!
ReplyDeleteThank you because you have been willing to share information with us. we will always appreciate all you have done here because I know you are very concerned with our. Best IPTV USA
ReplyDelete