Avaya Configuring Bridging Services Instrukcja Użytkownika Strona 62

  • Pobierz
  • Dodaj do moich podręczników
  • Drukuj
  • Strona
    / 210
  • Spis treści
  • BOOKMARKI
  • Oceniono. / 5. Na podstawie oceny klientów
Przeglądanie stron 61
Configuring Bridging Services
2-2 114060 Rev. A
Each LAN segment has a unique network-wide identification number, or ring ID.
Each source routing bridge also has an identification number, or bridge ID, and a
unique network-wide internal or virtual LAN identification number, called an
internal LAN ID.
For each Bay Networks source routing bridge in the network, you assign an
additional routing identifier called a group LAN ID. The group LAN ID serves as
a routing information field (RIF) placeholder and Bay Networks identifier.
How Source Routing Differs from Transparent Bridging
The Bay Networks source routing bridge differs from the Bay Networks
transparent bridge (described in Chapter 1) in two ways:
Source routing bridges can tolerate multiple paths between endstations in an
extended network; transparent bridges require loop-free topologies.
Source routing bridges require endstations to supply the bridging information
needed to deliver a frame to a destination; transparent bridges use forwarding
tables.
How Endstations on a Source Routing Network Discover Routes
The following sections describe the three processes that endstations on a source
routing network use to learn the routes to destinations: all-paths broadcast routing,
spanning tree broadcast routing, and specific routing.
All-Paths Broadcast Routing
An endstation that is configured for all-paths broadcast routing generates multiple
frames that traverse all paths between source and destination endstations. These
frames are all-routes explorer (ARE) or all-paths explorer (APE) frames.
When an endstation receives an ARE frame, a bridge within the source routing
network appends a routing designator that identifies the incoming ring ID, internal
LAN ID/bridge ID, and outgoing ring ID (Figure
2-2). For information on the
spanning tree algorithm, refer to Chapter
1.
Przeglądanie stron 61
1 2 ... 57 58 59 60 61 62 63 64 65 66 67 ... 209 210

Komentarze do niniejszej Instrukcji

Brak uwag