transparent interconnection of lots of links(trill) speaker: hui-hsiung chung date:2011/12/28 1

14
Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Upload: samuel-montgomery

Post on 04-Jan-2016

214 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Transparent Interconnection of Lots of Links(TRILL)Speaker: Hui-Hsiung Chung

Date:2011/12/28

1

Page 2: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Introduction

Spanning Tree Protocol(STP) A protocol that ensures a loop-free topology for

any bridged Ethernet local area network. Bridge

TRILL A protocol to perform Layer 2 bridging using

Intermediate System to Intermediate System(IS-IS) link state routing.

Routing Bridge(RBridge)

2

Page 3: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

STP

3

I think that I shall never see A graph more lovely than a tree.A tree whose crucial property Is loop-free connectivity.A tree which must be sure to span So packets can reach every LAN.First the Root must be selected By ID it is elected.Least cost paths from Root are traced In the tree these paths are placed.A mesh is made by folks like me. Then bridges find a spanning tree.

Radia Perlman

Page 4: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

STP Cont.

4

P.S. lowest root bridge id, lowest path cost, lowest sender bridge id

2

3

5

4

67

14

11

10

9

A

X

2,2,11

2,3,3

2,2,4

2,2,4

2,1,14

2,1,5

2,0,2

2,0,2

2,1,6

2,1,7

Page 5: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Introduction

Spanning Tree Protocol(STP) A protocol that ensures a loop-free topology for

any bridged Ethernet local area network. Bridge

TRILL A protocol to perform Layer 2 bridging using

Intermediate System to Intermediate System(IS-IS) link state routing.

Routing Bridge(RBridge)

5

Page 6: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

IS-IS

A link state routing protocol Developed by DECnet Phase V

6

Routing Protocol

OSPF IS-IS

Algorithm Dijkstra Dijkstra

Classless(VLSM) Support Support

Network Original for IP Original for CLNS

Address IP NSAP

Topology Point-to-pointPoint-to-multicastBroadcastNonbroadcast

Point-to-pointBroadcast

Page 7: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

RBridge

Compatible with existing bridges and routers Like routers, terminate bridges’ spanning

tree Like bridges, glue LANs together a IP subnet Like routers, optimal path, fast convergence Like bridges, plug-and-play Link state protocol among RBridges Like bridges, learn location of end-nodes

from receiving data traffic

7

Page 8: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

TRILL

TRILL Header V (Version): 2-bit R (Reserved): 2 –bit M (Multi-destination): 1 bit Op-Lng (Options Length): 5-bit Hop Count: 6-bit Egress RBridge Nickname: 16-bit identifier Ingress RBridge Nickname: 16-bit identifier

8Egress RBridge Nickname

Ingress RBridges Nickname

V R M OPLng HopTRILL Ethertype

Page 9: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

RBridging

9

BR4

BR3

BR2

BR1

BR5

BR6

BR7

LAN

Page 10: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Comparison

Bridges with STP

10

B1

B2 B3

:end-node

Page 11: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Comparison Cont.

RBridges with TRILL

11

B1

B2 B3

Page 12: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Conclusion

12

I hope that we shall one day see A graph more lovely than a tree.A graph to boost efficiency While still configuration-free.A network where RBridges can Route packets to their target LAN.The paths they find, to our elation, Are least cost paths to destination!With packet hop counts we now see, The network need not be loop-free!RBridges work transparently, Without a common spanning tree.

Ray Perlner

Page 13: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Reference

RFC 5556 RFC 6325 Tutorial on Bridges, Routers, Switches, Oh

My! Bridges and the TRILL protocol

13

Page 14: Transparent Interconnection of Lots of Links(TRILL) Speaker: Hui-Hsiung Chung Date:2011/12/28 1

Network Devices

14

Device Repeater Hub Bridge Switch

OSI Layer Layer 1 Layer 1 Layer 2 Layer 2

Number of port

2 >2 2 > 2

Back