Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(189.25KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
DRSTP: A Simple Technique for Preventing Count-to-Infinity in RSTP Controlled Switched Ethernet Networks
Syed Muhammad Atif
Pages - 278 - 296     |    Revised - 31-01-2011     |    Published - 08-02-2011
Volume - 2   Issue - 6    |    Publication Date - January / February  Table of Contents
MORE INFORMATION
KEYWORDS
Network reliability, Count-to-Infinity, Network Convergence, RSTP
ABSTRACT
Ethernet is a dominant local area network (LAN) technology from last three decades. Today most LANs are switched Ethernet networks. Spanning tree protocol is a vital protocol for smooth operation of switched Ethernet networks. However the current standard of spanning tree protocol for Ethernet – commonly known as Rapid Spanning Tree Protocol or in short RSTP – is highly susceptible to classical count-to-infinity problem. This problem adversely effects the network convergence time, depending upon how long count-to-infinity situation persists in the network, and thus leads to network congestion and packet loss. In the worst case, even forwarding loops may be induced that further enhances the network congestion. Thus, the dependability of RSTP controlled Ethernet networks are highly questionable due to its vulnerability against the count-to-infinity problem. This paper first discusses the count-to-infinity problem in spanning tree controlled Ethernet networks, in general and in RSTP controlled Ethernet networks, in particular. Then this paper proposes a simple solution to overwhelm this problem efficiently.
CITED BY (2)  
1 Lopes, J., Sargento, S., & Zúquete, A. (2013). A Dependable Alternative to the Spanning Tree Protocol. In Dependable Computing (pp. 148-164). Springer Berlin Heidelberg.
2 Atif, S. M. (2011). RRSTP: A Spanning Tree Protocol for Obviating Count-to-Infinity from Switched Ethernet Networks. international journal of computer networks (ijcn), 17.
1 Google Scholar
2 CiteSeerX
3 refSeek
4 Socol@r
5 Scribd
6 WorldCat
7 SlideShare
8 PdfSR
1 LAN/MAN Standards Committee of the IEEE Computer Society. “IEEE Standard for Local and metropolitan area networks: Media Access Control (MAC) Bridges - 802.1D”. 2004.
2 Cisco Systems, Inc. “Spanning Tree Protocol Problems and Related Design Considerations”.Available:www.cisco.com/en/US/tech/tk389/tk621/technologies_tech_note09186a00800951ac.shtml
3 Cisco Systems, Inc. “Spanning-Tree Protocol Enhancements using Loop Guard and BPDU Skew Detection Features”. Available: www.cisco.com/warp/public/473/84.html
4 Cisco Systems, Inc. “Understanding and Configuring the Unidirectional Link Detection Protocol Feature”. Available:www.cisco.com/en/US/tech/tk389/tk621/technologies_tech_note09186a008009477b.shtml.
5 K. Elmeleegy, A. L. Cox and T. S. E. Ng. “On Count-to-Infinity Induced Forwarding Loops in Ethernet Networks”. In IEEE Infocom 2006.
6 K. Elmeleegy, A. L. Cox and T. S. E. Ng. “EtherFuse: An Ethernet Watchdog”. In ACM SIGCOMM 2007.
7 R. Perlman. “An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN”. In the proceedings of 9th ACM Data Communications Symposium. New York, USA,1985.
8 M Seaman. “High Availability Spanning Tree”. Available:www.ieee802.org/1/files/public/docs1998/hasten7.pdf.
9 M. Seaman. “Speedy Tree Protocol”. Available:www.ieee802.org/1/files/public/docs1999/speedy_tree_protocol_10.pdf.
10 M. Seaman. “Truncating Tree Timers”. Available:www.ieee802.org/1/files/public/docs1999/truncating_tree_timing_10.pdf.
11 V. Jain and M. Seaman. “Faster flushing with fewer addresses”. Available:www.ieee802.org/1/files/public/docs1999/faster_flush_10.pdf.
12 G. Malkin. “RIP version 2”. RFC 2453. Nov 1998.
13 Cisco Systems, Inc. “Enhanced Interior Gateway Routing” Available www.cisco.com/en/US/tech/tk365/technologies_white_paper09186a0080094cb7.shtml.
14 Myers, T. E. Ng, and H. Zhang. “Rethinking the Service Model: Scaling Ethernet to a Million Nodes”. In 3rd Workshop on Hot Topics in networks. 2004.
15 K. Elmeleegy, A. L. Cox and T. S. E. Ng. “Understanding and Mitigating the Effects of Count to Infinity in Ethernet Networks”. IEEE/ACM Transactions on Networking, February 2009.
16 R. Perlman. “Rbridges: Transparent routing”. In IEEE Infocom 2004.
17 R. Garcia, J. Duato and F. Silla. “LSOM: A link state protocol over MAC addresses for metropolitan backbones using optical Ethernet switches”. In 2nd IEEE International Symposium on Network Computing and Applications. 2003.
18 M. Schroeder, A. Birrell, M. Burrows, H. Murray, R. Needham, T. Rodeheffer, E.Satterthwaite, C. Thacker. “Autonet: A High-Speed, Self–Configuring Local Area Network Using Point–to–Point Links”. IEEE Journal on Selected Areas in Communications,9(8):1318–1335, 1991.
19 D. Starobinski, G. Karpovsky, F. Zakrevsky. “Applications of network calculus to general topologies”, IEEE/ACM Transactions on Networking, 11(3):411–422, 2003.
20 F. D. Pellegrini, D. Starobinski, M. G. Karpovsky and L. B. Levitin. “Scalable cycle-breaking algorithms for gigabit Ethernet backbones”. In IEEE Infocom 2004.
21 Guillermo Ibáñez, Alberto García-Martínez, Juan A. Carral, Pedro A. González, Arturo Azcorra, José M. Arco. “HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks”, Computer Networks, 54(1):41-56,2010.
22 C. Kim, M. Caesar, and J. Rexford. “Floodless in SEATTLE: A Scalable Ethernet Architecture for Large Enterprises”. In ACM SIGCOMM. 2008.
23 S. Sharma, K. Gopalan, S. Nanda, and T. Chiueh. Viking: “A multispanning tree Ethernet architecture for metropolitan area and cluster networks”. In IEEE Infocom. 2004
24 T. L. Rodeheffer, C. A. Thekkath, and D. C. Anderson. “SmartBridge: A scalable bridge architecture”. In ACM SIGCOMM. 2000.
25 E. W. Dijkstra, C. S. Scholten. “Termination detection for diffusing computations”.Information Processing Letters, 11(1):14, 1980.
Mr. Syed Muhammad Atif
PIMSAT - Pakistan
syed.muhammad.atif@gmail.com