Email this article 
Open Access
Subscription or Fee Access
A Effective Edge Replacement Technique for Packet Distribution System using V-LAN
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
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. Distributed Computing (DISC), pp. 268-282,
M. Bui, F. Butelle, and C. Lavault, “A Distributed Algorithm for
Constructing 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.
, 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.
Y. Afek, M. ricklin. Sparser: a paradigm for running distributed
algorithms. Journal of Algorithms, 14:316-328,1993.
M. Thorup and U.Zwick, Compact routing schemes, In SPAA 2001, 1-
Bonaventure, O., Filsflis, C., and Francois. P Achieving Sub-50
Milliseconds Recovery upon BGP Peering Link Failures.
Sean Rooney, Christian Hortnagal Jens Krause., Automatic VLAN
creation based on-line measurement.
D.Passmore and J. Freeman, “ The Virtual LAN Technology Report
COM White paper , 1996.
R.Tan and J. van Leeuwen. Compact routing methods: a survey . In
proc, 1st Coll. On Structural information and Communication
Complexity (SIROCCO’94), Carleton Unprocess, pages 99-109, 1995.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.