Open Access Open Access  Restricted Access Subscription or Fee Access

Fast Recovery and Privacy Preservation Against Global Eavesdropper in Ethernet Network

J. Hemalatha, Dhamothiran *

Abstract


Abstract Fast-recovery from link failures may be a well-studied topic in informatics networks using fast-recovery in LAN networks is sophisticated because the forwarding relies on destination Macintosh addresses, that don't have the class-conscious nature the same as those exhibited in Layer three within the sort of IP-prefixes. Moreover, switches use backward learning to populate the forwarding table entries. Thus, any quick recovery mechanism in LAN networks should be supported planless spanning trees. Develop a chic technique to cypher the protection graphs at a node such every link connected to the node is removed in a minimum of one in all the protection graphs, and each protection graph is two-edge connected. The highlight of our approach is that prove that each node needs at the most 3 protection graphs, therefore 3 protection addresses. Once a tunneled packet encounters multiple link failures connected to constant next-hop node. Conclude that the next-hop node has unsuccessful. The packet is then forwarded to the first destination from the last smart node within the protection graph on a path that doesn't contain the unsuccessful node. Keywords: LAN, RTF, STF

Full Text:

PDF

References


Gopalan A., Ramasubramanian S. Fast recovery from link failures in ethernet networks. Proc. 9th Int. Conf. Design Rel. Commun. Netw.; 2013 March; Budapest, Hungary: 1–10p.

Qiu J., Gurusamy M., Chua K.C., et al. Local restoration with multiple spanning trees in metro ethernet networks. IEEE/ACM Trans. Netw. 2011April; 19(2): 602–14p.

Sofia R. A survey of advanced ethernet forwarding approaches. IEEE Commun. Surveys Tutorials. 2009; 11(1): 91–115p.

Ali M., Chiruvolu G., Ge A. Traffic engineering in metro Ethernet. IEEE Netw. 2005 March–April; 19(2): 10–7p.

Xi K., Chao H.J. Ip fast rerouting for single-link/node failure recovery. Proc. 4th Int. Conf. Broadband Commun., Netw. Syst.; 2007; 142–51p.

Farkas J., Antal C., Westberg L., et al. Fast failure handling in ethernet networks. Proc. IEEE Int. Conf. Commun. (ICC’06); 2006 June. 841–6p.

Huynh M., Mohapatra M., Goose S. Spanning tree elevation protocol: Enhancing metro ethernet performance and qos. Comput. Commun. 2009 March; 32(4): 750–65p. Available: http://dx.doi.org/10.1016/j.comcom.2008.12.001

Sofia R. A survey of advanced ethernet forwarding approaches. IEEE Commun. Surveys Tutorials. 2009; 11(1): 91–115p.

Jayavelu G., Ramasubramanian S., Younis O. Maintaining colored trees for disjoint multipath routing under node failures. IEEE/ACM Trans. Netw. 2009 Feb; 17(1): 346–59p.

Gopalan A. Graph Algorithms for Network Tomography and Fault Tolerance. USA: Univ. Arizona, Tuscan, AZ; 2013.




DOI: https://doi.org/10.37628/ijowns.v1i1.36

Refbacks

  • There are currently no refbacks.