A Logical Topology Based Network Compositor for Packet Distribution System with Effective Edge Replacement

Abstract: Abstract---A typical failure in communication networks is disconnection of link between two nodes. When communication link fails, failed links can be replaced by a single swap link. But selecting the best possible link can be very crucial. The edge is chosen from the minimum diameter tree that has been communication overhead and minimizes the time required to adopt routing in case of failure. Spanning tree is based on the labeling and collections of systems in a network using logical topology networks this allows deciding in constant time whether node is leaf node or routing node using round trip time. The selection of high quality swap links is essential for a reliable communication and it must follow the same objective as the originally chosen communication sub networks. A distributed algorithm that efficiently computes all of these swap links, and how to route messages across swap edges with a compact routing scheme. Spanning tree is based on the labeling and collections of systems in a network using logical topology networks. This allows deciding in constant time whether node is leaf node or routing node (using round trip time). This will minimize the maximum travel time of messages. Hence, each swap link must minimize among all possible swaps) the diameter of the tree when swapping the edge. We propose a distributed algorithm that efficiently computes all of these swap links, and how to route messages across swap edges with a compact routing scheme. Virtual LAN (VLAN) refers to a group of logically networked devices on one or more LANs that are configured so that they can communicate as if they are based on the same wire, when in fact they are located on a number of different LAN segments. Because VLANs are resource optimization. it is very flexible for user/host management, bandwidth allocation and minimizes a largest distance between any pair of node thus minimizing the worst-case length of any transmission path if edges lengths are not uniform. An compact routing scheme for a tree which are quickly and inexpensively adapt routing when a failing edge is replaced by a best swap edge. The selection of high quality swap links is essential for a reliable communication and must follow the same objective as the originally chosen communication sub network using an algorithm to find redundant links in the LAN and selecting the best paths. Its initial goal is to put all links in either Forwarding or Blocking. In the end, the links without a redundant link and the best links with a redundant link would be in the forwarding state. The redundant links that weren't as good as the selected links would be in blocking state. Spanning Tree cannot use multiple links to the same destination. There is no load-sharing feature with Spanning Tree. Any redundant link with Spanning Tree is blocked (essentially shut down) until the primary link goes down.

Keywords: RTT, Swap Edge MDST, VIAN, SPT, MST.