Application of rapid spanning tree protocol for automatic hierarchical address assignment to bridges

Networks 2004 - 11th International Telecommunications Network Strategy and Planning Symposium

Volumn , Issue , 2004, Pages 435-440

  Azcorra, Arturo ^a  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM RECOVERY; HIERARCHICAL SYSTEMS; LOCAL AREA NETWORKS; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS; TREES (MATHEMATICS);

HIERARCHICAL ADDRESS ASSIGNMENT; RAPID SPANNING TREE PROTOCOL; SPANNING TREE LEVELS; VIRTUAL LOCAL AREA NETWORKS (VLAN);

INTERNET;

EID: 4644308365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/netwks.2004.241225     Document Type: Conference Paper

References (18)

1. 802 1w - Rapid Reconfiguration of Spanning Tree, http://www.ieee802.org/ 1/pages/802.1w .html
2. IEEE 802. IX Port based network access control. http-//www.ieee802.org/1/ pages/ 802.1x.html
3. Lui K.; Lee W.C.; Nahrstedt, K.: STAR: a transparent spanning tree bridge protocol with alternate routing. ACM SIGCOMM Computer Communication Review, vol. 32, no. 3, pp.3346, July 2002.
4. Rodeheffer, T.L.; Thekkath, C.A.; D.C. Anderson: SmartBridge: A Scalable Bridge Architecture. Proceedings of ACM SIGCOMM 2000, September 2000, Stockholm, Sweden.
5. Azcorra, A.; Ibáñez, G.: Adaptive Routing Bridges: Nuevos enfoques para redes conmutadas. Conf. submitted to MUNDO INTERNET March 2004.
6. Perlmann, R.; Williams, A: Design for a Routing Bridge. draft-perhnan-zerouter-rbridge-00.txt. Internet draft June 13, 2003.
7. Garcia, R.; Duato, J.; Silla, F.: LSOM: A Link State Protocol over Mac Addresses for Metropolitan Backbones Using Optical Ethernet Switches. Proceedings of the second IEEE International Symposium on Network Computing and Applications (NCA'03)
8. Shoreder, M. et al.: Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links. IEEE Journal on Selected Areas in Communications, Vol. 9, No. 8, pp. 1318-1335, October 1991.
9. Starobinski, D.; Karpovsky, G.; Zakrevsky, F.: Applications of Network Calculus to General Topologies, IEEE/ACM Transactions on Networking, June 2003, vol 11, No. 3, pp 411-422
10. Perlman, R.: An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN, in the proceedings of Ninth ACM Data Communications Symposium, Vol. 20, No. 7, pp. 44-52, September 1985, New York, USA.
11. Perlman, R.: Interconnections. Second Edition. Addison-Wesley, 2000.
12. Zakrevski, L.; Jaiswal, Sharad; Karpovsky, M.: Unicast message routing in communication networks with Irregular topology. Proc. of CAD-99 1999.
13. Kleinrock, L.; Kamoun, F. : Hierarchical routing for large networks, Computer sNetworks 1, 1977, pp. 155-174.
14. Chamlee, M.A.; Zegura, E.W.; Mankin, A: Design and Evaluation of a Protocol for Automated Hierarchical Address Assignment, Proceedings Ninth International Conference on Computer Communications and Networks, pp. 328-333, 2000.
15. Gigabit Campus networks Design. White Paper, Cisco Systems. 1999/2003. http://www.cisco.com.
16. Stojmenovic, I.: Position-Based Routing in Ad Hoc Networks. IEEE Communications Magazine, July 2002, pp. 128-134
17. Huang, Y.; McKinley, P.K.: Group Leader Election under Link-State Routing. IEEE G 1997 IEEE ISSN: 0-8186-8061-x/97
18. Zakrevski, L., Karpovsky, M. "Fault-tolerant message routing in computer networks". Proc. Of Int. Conf. on PDP-A-99, 1999.