STM Journals Peer-reviewed research from Consortium e-Learning Network

Journal of Advances in Shell Programming

Fast Recovery and Privacy Preservation against Global Eavesdropper in Ethernet Network

  1. J. Hemalatha
  2. Mr. Dhamothiran

Abstract

Fast recovery from link failures is a well-studied topic in IP networks. Employing fast recovery in Ethernet networks is complicated as the forwarding is based on destination MAC addresses, which do not have the hierarchical nature similar to those exhibited in Layer 3 in the form of IP-prefixes. Moreover, switches employ backward learning to populate theforwarding table entries. Thus, any fast recovery mechanism in Ethernet networks must be based on undirected spanning trees. Develop an elegant technique to compute the protection graphs at a node such that each link connected to the node is removed in at least one of theprotection graphs, and every protection graph is two-edge connected. The highlight of our approach is that prove that every node requires at most three protection graphs, hence three protection addresses. When a tunneled packet encounters multiple link failures connected to the same next-hop node. Conclude that the next-hop node has failed. The packet is then forwarded to the original destination from the last good node in the protection graph along a path, which does not contain the failed node.

Keywords

Support