1 / 4

The Need of Spanning Tree Algorithm

This article provides an overview of the Spanning Tree Algorithm and the concept of Virtual Connections in ATM Networks. It explains the different types of connections and switching hardware used in ATM networks and discusses the design goals and terminology associated with them.

stephenljones
Télécharger la présentation

The Need of Spanning Tree Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Need of Spanning Tree Algorithm Spring 2004

  2. ATM is called a layer 2.5 protocol Spring 2004

  3. Virtual Connections in ATM Networks • Virtual channel/circuit connections (VCC) : Basic unit of switching between two end users • Virtual path connection (VPC): Bundle of VCC with same end points (e.g. company sites) Spring 2004

  4. Switching Hardware: Overview • Terminology: n x m switch has n inputs and m outputs • Design Goals • throughput (depends on traffic model) • Ports and Fabrics: reading assignment P212-P220 • ports • circuit management (e.g., map VCIs, route datagrams) • buffering (input and/or output) • fabric • as simple as possible, “self routing” • sometimes do buffering (internal) Spring 2004

More Related