Distributed Spanning Tree Center for Information Security Department of Computer Science University of Tulsa, Tulsa, OK 74104.

Slides:



Advertisements
Similar presentations
Networks: Bridges1 Bridges. Networks: Bridges2 Repeater S1S2 S3 LAN1LAN2 S4 A repeater operates at the physical layer and forwards everything between.
Advertisements

Bridges Advanced Computer Networks.
Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan Mohammad Reza Akhavan.
Spanning Tree Protocol STP STP A broadcast storm occurs when there are so many broadcast frames caught in a Layer 2 loop that all available.
1 Distributed Computing Algorithms CSCI Distributed Computing: everything not centralized many processors.
Internetworking Different networks –Different bit rates –Frame lengths –Protocols.
Computer Networks: Bridges 1 Bridges. Computer Networks: Bridges 2 Repeater S1S2 S3 LAN1LAN2 S4 A repeater operates at the physical layer and forwards.
Chapter 5 Trees PROPERTIES OF TREES 3 4.
Purdue University Pag. 1 CS 397 Dongyan Xu Department of Computer Science and CERIAS Purdue University Office:
Sept 14, 2004CS573: Network Protocols and Standards1 Spanning Tree Algorithm Network Protocols and Standards Autumn
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—1-1 Configuring Catalyst Switch Operations Introducing Spanning Tree Protocol.
CSC 336 Data Communications and Networking Lecture 7d: Interconnecting LAN Dr. Cheer-Sun Yang Spring 2001.
Wireless Networks CS 442 Department of Computer Science Dr. Yaser Khamayseh.
1 Spanning Tree Algorithm Advanced Computer Networks.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 LAN Switching and Wireless Implement Spanning Tree Protocols (STP) Chapter.
computer
Minimum Routing Cost Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan.
Extending LANs Fiber modems Repeaters Bridges Switches.
1 Kyung Hee University Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
Computer Networks 15-1 Chapter 15. Connecting LANs, Backbone Networks, and Virtual LANs 15.1 Connecting devices 15.2 Backbone networks 15.3 Virtual LANs.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
Connecting LANs, Backbone Networks, and Virtual LANs : Data Communication and Computer Networks Asst. Prof. Chaiporn Jaikaeo, Ph.D.
New Mexico State University Information Engineering Technology Bachelor of Science Engineering Technology.
ENGM 732 Formalization of Network Flows Network Flow Models.
Virtual Machines Created within the Virtualization layer, such as a hypervisor Shares the physical computer's CPU, hard disk, memory, and network interfaces.
BridgesBridges Advanced Computer Networks D12. Bridges Outline  Repeaters  Bridges –Backward learning  Bridge Loops –Spanning trees (transparent bridges)
McGraw-Hill©The McGraw-Hill Companies, Inc., Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs.
M. Veeraraghavan (originals by J. Liebeherr) 1 Need for Routing in Ethernet switched networks What do bridges do if some LANs are reachable only in multiple.
M. Veeraraghavan 1 Bridge 55 Bridge 41 Bridge LAN A LAN B LAN C EXAMPLE.
Graph Theory Trees. WHAT YOU WILL LEARN Trees, spanning trees, and minimum-cost spanning trees.
Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs
David Stotts Computer Science Department UNC Chapel Hill.
Ch. 15 Connecting LANs.
Cluster Analysis Data Mining Experiment Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.
Department of Computer Science 1 Some Practice Let’s practice for the final a little bit. OK?
Copyright 2003 CCNA 3 Chapter 8 Spanning Tree Protocol By Your Name.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter.
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
CCNA1 v3 Module 8 v3 CCNA 1 Module 8 JEOPARDY S Dow.
Information Services José A. Domínguez UO Information Services Creation of a Science DMZ New 10G connectivity to Oregon Gigapop and Internet2.
Sender frame Receiver datagram frame Adapter Link layer protocol.
Planning & System installation
Lab 2 – Hub/Switch Data Link Layer
A Distributed Algorithm for Minimum-Weight Spanning Trees
Spanning Tree Algorithm
Lab 2 – Hub/Switch Data Link Layer
International Conference on Computer and Applications (CCA 2012), Proceedings Abstract: An Efficient Layer 2 Routing Algorithm in a Dual-ring Bridged.
Connecting LANs, Backbone Networks, and Virtual LANs
Connecting LANs, Backbone Networks, and Virtual LANs
NT2640 Unit 9 Activity 1 Handout
Connecting LANs, Backbone Networks,
Learning About Operating Systems
CCNA 1 v3.1 Module 8 Ethernet Switching
UOBPRM: A Uniformly Distributed Obstacle-Based PRM
Physics-based simulation for visual computing applications
Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs
Topology Control and Its Effects in Wireless Networks
Department of Computer Science University of York
Communication and Electronic Engineering Department
4-4 Graph Theory Trees.
computer languages and ms office
Spanning Tree Algorithms
Distributed Computing:
Chapter 15. Connecting Devices
CCNA 1 v3.1 Module 8 Ethernet Switching
CS60002: Distributed Systems
Bridges Computer Networks.
offers for junior researchers in its research teams
Presentation transcript:

Distributed Spanning Tree Center for Information Security Department of Computer Science University of Tulsa, Tulsa, OK 74104

mac 1 mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 The network...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Bridges: Network segments: The network...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! (1, 0, 1)

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (1, 0, 1) (2, 0, 2) I AM ROOT!

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (3, 0, 3) (1, 0, 1) (2, 0, 2) I AM ROOT!

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) I AM ROOT!

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (5, 0, 5) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) I AM ROOT!

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (5, 0, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) I AM ROOT!

(5, 0, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (7, 0, 7) I AM ROOT!

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! (5, 0, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) (7, 0, 7) Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 5... Bridge 1... I AM ROOT! (5, 0, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) (7, 0, 7)

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (1, 1, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) (7, 0, 7) 1 IS ROOT! Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 7... I AM ROOT! (1, 1, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) (7, 0, 7) Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (1, 1, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) (1, 1, 7) 1 IS ROOT! Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 4... I AM ROOT! (1, 1, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) (1, 1, 7) Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (1, 1, 5) (6, 0, 6) (3, 0, 3) (1, 1, 4) (1, 0, 1) (2, 0, 2) (1, 1, 7) 1 IS ROOT! Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 6... I AM ROOT! (1, 1, 5) (6, 0, 6) (3, 0, 3) (1, 1, 4) (1, 0, 1) (2, 0, 2) (1, 1, 7) Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (1, 1, 5) (1, 1, 6) (3, 0, 3) (1, 1, 4) (1, 0, 1) (2, 0, 2) (1, 1, 7) 1 IS ROOT! Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 2... I AM ROOT! (1, 1, 5) (1, 1, 6) (3, 0, 3) (1, 1, 4) (1, 0, 1) (2, 0, 2) (1, 1, 7) Bridge 1...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (1, 1, 5) (1, 1, 6) (3, 0, 3) (1, 1, 4) (1, 0, 1) (1, 1, 2) (1, 1, 7) 1 IS ROOT! Bridge 1...

(1, 0, 1) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! (5, 0, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (2, 0, 2) (7, 0, 7) Bridge 2...

(1, 0, 1) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 2... I AM ROOT! (5, 0, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (2, 0, 2) (7, 0, 7) Bridge 2...

(1, 0, 1) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 2 < 3... I AM ROOT! (5, 0, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (2, 0, 2) (7, 0, 7) Bridge 2...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (5, 0, 5) (6, 0, 6) (2, 1, 3) (4, 0, 4) (1, 0, 1) (2, 0, 2) (7, 0, 7) 2 IS ROOT! Bridge 2...

(1, 0, 1) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! (1, 1, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 1, 2) (7, 0, 7) Bridge 3...

(1, 0, 1) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 3... I AM ROOT! (1, 1, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 1, 2) (7, 0, 7) Bridge 3...

(1, 0, 1) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 3... I AM ROOT! (1, 1, 5) (6, 0, 6) (3, 0, 3) (4, 0, 4) (1, 1, 2) (7, 0, 7) Bridge 3...

(1, 0, 1) (5, 0, 5) (1, 1, 6) (3, 0, 3) (4, 0, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! Bridge 4...

(1, 0, 1) (5, 0, 5) (1, 1, 6) (3, 0, 3) (4, 0, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 4... I AM ROOT! Bridge 4...

(1, 0, 1) (5, 0, 5) (1, 1, 6) (3, 0, 3) (4, 0, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 4... I AM ROOT! Bridge 4...

(1, 0, 1) (5, 0, 5) (1, 1, 6) (3, 0, 3) (4, 0, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! Bridge 4...

(1, 0, 1) (5, 0, 5) (6, 0, 6) (2, 1, 3) (4, 0, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! Bridge 5...

(1, 0, 1) (5, 0, 5) (6, 0, 6) (2, 1, 3) (4, 0, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 2 < 5... I AM ROOT! Bridge 5...

(1, 0, 1) (5, 0, 5) (6, 0, 6) (2, 1, 3) (4, 0, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 5... I AM ROOT! Bridge 5...

(1, 0, 1) (5, 0, 5) (6, 0, 6) (2, 1, 3) (4, 0, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 5... I AM ROOT! Bridge 5...

(1, 0, 1) (5, 0, 5) (6, 0, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! Bridge 6...

(1, 0, 1) (5, 0, 5) (6, 0, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 6... I AM ROOT! Bridge 6...

(1, 0, 1) (5, 0, 5) (6, 0, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 6... I AM ROOT! Bridge 6...

(1, 0, 1) (1, 1, 5) (6, 0, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! Bridge 7...

(1, 0, 1) (1, 1, 5) (6, 0, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 7... I AM ROOT! Bridge 7...

(1, 0, 1) (1, 1, 5) (6, 0, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 I AM ROOT! Bridge 7...

(1, 0, 1) (1, 1, 5) (6, 0, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (7, 0, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Because 1 < 7... I AM ROOT! Bridge 7...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 The situation so far...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (2, 1, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT! Because 1 < 2...

mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 0, 1) (1, 1, 2) (1, 1, 7) All bridges now agree that 1 is root...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT! Because 5 < 7...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT! Because 5 < 7...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT!

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT! Because 4 < 6...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT! Because 4 < 6...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT!

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT! Because 2 < 5...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 1 IS ROOT! Because 2 < 5...

(1, 0, 1) (1, 1, 5) (1, 1, 6) (1, 2, 3) (1, 1, 4) (1, 1, 2) (1, 1, 7) mac mac 2 mac 3 mac 4 mac 5 mac 6 mac 7 Final state.

mac 1 mac 5 mac 6 The network. mac 2 mac 3 mac 4 mac 7

Sources Spanning tree algorithm simulation © 2000 by Eric LesageSpanning tree algorithm simulation © 2000 by Eric Lesage Power point by David SchwalenbergPower point by David Schwalenberg

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.