Open Access Open Access  Restricted Access Subscription or Fee Access

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

P.R. Nirmal Binu, S. Karthikeyan

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 spanning 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 rooting 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 rooting node using round trip time. Finding the minimum diameter tree in a graph with edge weights. 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 were attached to the same wire, when in fact they are located on a number of different LAN segments. Because VLANs are based on logical instead of physical connections, it is very flexible for user/host management, bandwidth allocation and resource optimization.

Keywords


RTT, Swap Edge MDST, VlAN, SPT, MST

Full Text:

PDF

References


Gfeller, N. Santoro, and P. Widmayer, “A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree,” Proc. 21st Int’l Symp. DistributedComputing (DISC), pp. 268-282, 2007.

M. Bui, F. Butelle, and C. Lavault, “A Distributed Algorithm forConstructing a Minimum Diameter Spanning Tree,” J. Parallel and Distributed Computing, vol. 64, pp. 571-577, 2004.

H. Ito, K. Iwama, Y. Okabe, and T. Yoshihiro, “Single Backup Table Schemes for Shortest-Path Routing,” Theoretical Computer Science, vol. 333, no. 3, pp. 347-353, 2005.

E. Nardelli, G. Proietti, and P. Widmayer, “Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures,” J. Graph Algorithms and Applications, vol. 5, no. 5, pp. 39-57, 2001.

E. Nardelli, G. Proietti, and P. Widmayer, “Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Rerouting: Computing the Optimal Swap Edges Distributively,” IEICE Transactions.

A.D. Salvo and G. Proietti, “Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor,” Theoretical Computer Science, vol. 383, no. 1, pp. 23-33, 2007.[7] P. Flocchini, A. Mesa Enriques, L. Pagli, G. Prencipe, and N. Santoro, “Point-of-Failure Shortest-Path.

P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, and P. Widmayer, “Computing All the Best Swap Edges Distributively,” J. Parallel and Distributed Computing, vol. 68, no. 7, pp. 976-983, 2008


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.