60 likes | 180 Views
A View of the AS Hierarchy. Provider - customer. A View of the AS Hierarchy. No transitivity No SP concatenation. Provider - customer. Data path. A View of the AS Hierarchy. Provider - customer. Data path. Peer to peer. BGP Operations (Simplified). Establish session on
E N D
A View of the AS Hierarchy Provider - customer
A View of the AS Hierarchy No transitivity No SP concatenation Provider - customer Data path
A View of the AS Hierarchy Provider - customer Data path Peer to peer
BGP Operations (Simplified) Establish session on TCP port 179 AS1 BGP session Exchange all active routes AS2 While connection is ALIVE exchange route UPDATE messages Exchange incremental updates
Two Types of BGP Neighbor Relationships • External Neighbor (eBGP) in a different Autonomous Systems • Internal Neighbor (iBGP) in the same Autonomous System AS1 iBGP is routed (using IGP!) eBGP iBGP AS2
Home AssignmentShortest Path algorithm The input graph: Lines of the format <ASi> <ASj> <type> An EOF indication, e.g.: 0 Where: <ASi> :- integer <type> :- The program: Reads v and u and outputs a shortest path from v to u with BGP constraints Please print the program code and an example execution. A test case will be placed in the course web site