Open Access Open Access  Restricted Access Subscription Access

Fast Recovery and Privacy Preservation against Global Eavesdropper in Ethernet Network

J. Hemalatha, 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 the
forwarding 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 the
protection 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


Protocol (IP) layer, VLAN, ESCAP, Quality-of-Service (QoS)

Full Text:

PDF

References


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

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

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

Xue G, Chen L, Thulasiraman K. Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees. IEEE J. Sel. Areas Commun. 2003; 21(8): 1332–1345p.

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

Gopalan A. Graph Algorithms for Network Tomography and Fault Tolerance. Ph.D. dissertation, Dept. of Electrical and Computer Engineering, Univ. Arizona, Tuscan, AZ, USA. 2013.

Xi K, Chao HJ. IP fast rerouting for single-link/node failure recovery. in Proc. 4th Int. Conf. Broadband Commun., Netw. Syst. (BROADNETS 2007). 2007: 142–151p.

Farkas J et al. Fast failure handling in ethernet networks. in Proc. IEEE Int. Conf. Commun. (ICC’06). 2006; 2: 841–846p.

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

Qiu J, Gurusamy M, Chua KC, Liu Y. Local restoration with multiple spanning trees in metro Ethernet networks. IEEE/ACMTrans. Netw. 2011; 19(2): 602–614p.


Refbacks

  • There are currently no refbacks.