|
| RRSTP: A Spanning Tree Protocol for Obviating Count-to-Infinity from Switched Ethernet Networks
|
|
Full
text: |
 PDF(165.8KB) |
|
|
Source |
International Journal of Computer Networks (IJCN) |
|
Table of Contents |
|
|
Download
Complete Issue PDF(850.25KB) |
|
Volume: 3 Issue: 1 |
| |
Pages: 1-42 |
|
Publication
Date: March / April 2011 |
|
ISSN
(Online): 1985-4129 |
|
|
|
|
|
Pages |
17 - 36 |
|
Author(s) |
|
|
|
Published
Date |
04-04-2011 |
|
Publisher |
CSC
Journals, Kuala Lumpur,
Malaysia |
|
ADDITIONAL
INFORMATION |
| Keywords Abstract References Cited by Related Articles Collaborative
Colleague |
| |
|
| |
KEYWORDS: Network Reliability, Count-to-Infinity, Network Convergence |
|
|
| |
|
|
| This Manuscript is indexed in the following databases/websites:- |
|
| 1. Directory of Open Access Journals (DOAJ) |
| 2. Scribd |
| 3. Socol@r |
| 4. Docstoc |
| 5. Google Scholar |
| 6. WorldCat |
| |
|
| |
|
|
| This paper will presents a highly reliable and rapidly converging spanning tree protocol named as Reliable Rapid Spanning Tree Protocol. The need of this spanning tree protocol is felt because reliability of switched Ethernet networks is heavily dependent upon that of spanning tree protocol. But current standard spanning tree protocol – Rapid Spanning Tree Protocol – is well known for its susceptibility to classical count-to-infinity problem. Because of this problem the protocol has extremely variable and unexpectedly high convergence time even in small networks. As a result network wide congestion, frame loss and frame delay may occur. Even forwarding loops may be induced into the network under certain circumstances. It is expected that the new protocol – RRSTP – will significantly increase the dependability of switched Ethernet networks by providing guaranteed protection against the count-to-infinity problem. |
| |
|
| |
|
| |
| 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 |
Myers, T. E. Ng, and H. Zhang. “Rethinking the Service Model: Scaling Ethernet to a Million Nodes”. In Proceedings of the 3rd Workshop on Hot Topics in networks, San Diego,.CA, USA, 2004
|
|
|
| 3 |
K. Elmeleegy, A. L. Cox and T. S. E. Ng. “On Count-to-Infinity Induced Forwarding Loops in Ethernet Networks”. In Proceedings of the 25th IEEE Infocom, Barcelona, Catalunya, Spain, 2006.
|
|
|
| 4 |
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, 17(1):186-199, 2009.
|
|
|
| 5 |
S M Atif. “DRSTP: A Simple Technique for Preventing Count-to-Infinity in RSTP Controlled Switched Ethernet Networks”. International Journal of Computer Networks, 2(6):278-296, 2011.
|
|
|
| 6 |
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.
|
|
|
| 7 |
M Seaman. “High Availability Spanning Tree”. [online] Available at: www.ieee802.org/1/files/public/docs1998/hasten7.pdf. [Accessed 21 March 2011].
|
|
|
| 8 |
M. Seaman. “Speedy Tree Protocol”. [online] Available at: www.ieee802.org/1/files/public/docs1999/speedy_tree_protocol_10.pdf. [Accessed 21 March 2011].
|
|
|
| 9 |
M. Seaman. “Truncating Tree Timers”. [online] Available at: www.ieee802.org/1/files/public/docs1999/truncating_tree_timing_10.pdf. [Accessed 21 March 2011].
|
|
|
| 10 |
V. Jain and M. Seaman. “Faster flushing with fewer addresses”. [online] Available at: www.ieee802.org/1/files/public/docs1999/fast_flush_10.pdf. [Accessed 21 March 2011].
|
|
|
| 11 |
LAN/MAN Standards Committee of the IEEE Computer Society. “IEEE Standard for Information technology – Telecommunications and information exchange between systems – Local and metropolitan area networks – common specifications, Part 3: Media Access Control (MAC) Bridges” , ISO/IEC 15802-3, ANSI/IEEE Std 802.1D, 1998.
|
|
|
| 12 |
Cisco Systems, Inc. “Spanning Tree Protocol Problems and Related Design Considerations”. [online] Available at: www.cisco.com/en/US/tech/tk389/tk621/technologies_tech_note09186a00800951ac.shtml [Accessed 21 March 2011].
|
|
|
| 13 |
C. E. Perkins and P. Bhagwat. “Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”. In Proceedings of the ACM SIGCOMM 1994, London, UK, 1994.
|
|
|
| 14 |
R. Perlman. “Rbridges: Transparent routing”. In Proceedings of the 23rd IEEE Infocom, Hong Kong, 2004.
|
|
|
| 15 |
R. Garcia, J. Duato and F. Silla. “LSOM: A link state protocol over MAC addresses for metropolitan backbones using optical Ethernet switches”. In Proceedings of the 2nd IEEE International Symposium on Network Computing and Applications, Cambridge, MA, USA, 2003.
|
|
|
| 16 |
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.
|
|
|
| 17 |
D. Starobinski, G. Karpovsky, F. Zakrevsky. “Applications of network calculus to general topologies”, IEEE/ACM Transactions on Networking, 11(3):411–422, 2003.
|
|
|
| 18 |
F. D. Pellegrini, D. Starobinski, M. G. Karpovsky and L. B. Levitin. “Scalable cycle-breaking algorithms for gigabit Ethernet backbones”. In Proceedings of the 23rd IEEE Infocom, Hong Kong, 2004.
|
|
|
| 19 |
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.
|
|
|
| 20 |
C. Kim, M. Caesar, and J. Rexford. “Floodless in SEATTLE: A Scalable Ethernet Architecture for Large Enterprises”. In Proceedings of the ACM SIGCOMM. 2008, Seattle, WA, USA, 2008.
|
|
|
| 21 |
S. Sharma, K. Gopalan, S. Nanda, and T. Chiueh. “Viking: A multispanning tree Ethernet architecture for metropolitan area and cluster networks”. In Proceedings of the 23rd IEEE Infocom, Hong Kong,. 2004.
|
|
|
| 22 |
T. L. Rodeheffer, C. A. Thekkath, and D. C. Anderson. “SmartBridge: A scalable bridge architecture”. In Proceedings of the ACM SIGCOMM. 2000, Stockholm, Sweden, 2000.
|
|
|
| 23 |
E. W. Dijkstra, C. S. Scholten. “Termination detection for diffusing computations”. Information Processing Letters, 11(1):1-4, 1980.
|
|
|
| 24 |
K. Elmeleegy, A. L. Cox and T. S. E. Ng. “EtherFuse: An Ethernet Watchdog”. In Proceedings of the ACM SIGCOMM 2007, Kyoto, Japan, 2007.
|
|
|
| |
|
| |
|
| |
| |
|
| |
|
| |
| |
|
| |
|
| |
|
| Syed Muhammad Atif : Colleagues
|
|
