<x:xmpmeta tsc:version="2.0.1" xmlns:x="adobe:ns:meta/" xmlns:tsc="http://www.techsmith.com/xmp/tsc/">
   <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:xmp="http://ns.adobe.com/xap/1.0/" xmlns:xmpDM="http://ns.adobe.com/xmp/1.0/DynamicMedia/" xmlns:xmpG="http://ns.adobe.com/xap/1.0/g/" xmlns:xmpMM="http://ns.adobe.com/xap/1.0/mm/" xmlns:tscDM="http://www.techsmith.com/xmp/tscDM/" xmlns:tscIQ="http://www.techsmith.com/xmp/tscIQ/" xmlns:tscHS="http://www.techsmith.com/xmp/tscHS/" xmlns:stDim="http://ns.adobe.com/xap/1.0/sType/Dimensions#" xmlns:stFnt="http://ns.adobe.com/xap/1.0/sType/Font#" xmlns:exif="http://ns.adobe.com/exif/1.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
      <rdf:Description dc:date="2020-02-24 10:40:56 PM" dc:source="Camtasia,9.1.4,enu" dc:title="i_5nlc2" tscDM:firstFrame="i_5nlc2_First_Frame.png" tscDM:originId="2DF50D87-BA53-475F-A514-C98B82A26F05" tscDM:project="i_5nlc2.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="3508433"/>
         <xmpDM:videoFrameSize stDim:unit="pixel" stDim:h="1080" stDim:w="1440"/>
         <tsc:langName>
            <rdf:Bag>
               <rdf:li xml:lang="en-US">English</rdf:li></rdf:Bag>
         </tsc:langName>
         <xmpDM:Tracks>
            <rdf:Bag>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="ScreenText" xmpDM:frameRate="f1000" xmpDM:trackName="Screen Text">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm Notation: u = Source node c(i,j) = link cost from i to j h = Number of hops" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="being considered Du(n) = Cost of h-hop path from u to n Method: Initialize: Du(n) =  for all n" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" u; Du(u) = 0 For each node: Du(n) = minj [Du(j) +c(j,n)] If any costs change, repeat step 2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 7 ∞ ∞ ∞ ∞ ∞ ∞ from cost to from from" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 3 from cost to x y z x y z 0 2" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3 from cost to x y z x y z ∞ ∞ ∞ ∞ ∞ cost to x y z" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z 0 2 7 from cost to x y z x y z 0 2 3 from cost" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to x y z x y z 0 2 3 from cost to x y z x y z 0" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 7 from cost to x y z x y z ∞ ∞ ∞ 7 1 0 cost to ∞" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 0 1 ∞ ∞ ∞ 2 0 1 7 1 0 2 0 1 7 1 0 2 0" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 0 time x z 1 2 7 y node x table node y table node z table Bellman Ford" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 1" xmpDM:startTime="51200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm Notation: u = Source node c(i,j) = link cost from i to j h = Number of hops" xmpDM:startTime="53533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="being considered Du(n) = Cost of h-hop path from u to n Method: Initialize: Du(n) =  for all n" xmpDM:startTime="53533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" u; Du(u) = 0 For each node: Du(n) = minj [Du(j) +c(j,n)] If any costs change, repeat step 2" xmpDM:startTime="53533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="53533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 7 ∞ ∞ ∞ ∞ ∞ ∞ from cost to from from" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 3 from cost to x y z x y z 0 2" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3 from cost to x y z x y z ∞ ∞ ∞ ∞ ∞ cost to x y z" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z 0 2 7 from cost to x y z x y z 0 2 3 from cost" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to x y z x y z 0 2 3 from cost to x y z x y z 0" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 7 from cost to x y z x y z ∞ ∞ ∞ 7 1 0 cost to ∞" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 0 1 ∞ ∞ ∞ 2 0 1 7 1 0 2 0 1 7 1 0 2 0" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 0 time x z 1 2 7 y node x table node y table node z table Bellman Ford" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 1" xmpDM:startTime="127333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2 0      5 2 1 2 3 3 1 1 5 2 x" xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="y z w v 0 2 5  1  5 2 1 2 3 3 1 1 5 2" xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z w v 0 2 4 2 1 10 5 2 1 2 3 3 1 1 5" xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 x y z w v 0 2 3 2 1 4 5 2 1 2 3 3 1 1" xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 2 x y z w v A." xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="B." xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="C." xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="D." xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u u u u" xmpDM:startTime="354967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method 5 2 1 2 3 3 1 1 5 2 x y z w v u If" xmpDM:startTime="356367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cost changes Þ Recompute the costs to all neighbors" xmpDM:startTime="356367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2 0      5 2 1 2 3 3 1 1 5 2 x" xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="y z w v 0 2 5  1  5 2 1 2 3 3 1 1 5 2" xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z w v 0 2 4 2 1 10 5 2 1 2 3 3 1 1 5" xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 x y z w v 0 2 3 2 1 4 5 2 1 2 3 3 1 1" xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 2 x y z w v A." xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="B." xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="C." xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="D." xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u u u u" xmpDM:startTime="359533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 7 ∞ ∞ ∞ ∞ ∞ ∞ from cost to from from" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 3 from cost to x y z x y z 0 2" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3 from cost to x y z x y z ∞ ∞ ∞ ∞ ∞ cost to x y z" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z 0 2 7 from cost to x y z x y z 0 2 3 from cost" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to x y z x y z 0 2 3 from cost to x y z x y z 0" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 7 from cost to x y z x y z ∞ ∞ ∞ 7 1 0 cost to ∞" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 0 1 ∞ ∞ ∞ 2 0 1 7 1 0 2 0 1 7 1 0 2 0" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 0 time x z 1 2 7 y node x table node y table node z table Bellman Ford" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 1" xmpDM:startTime="360033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2 0      5 2 1 2 3 3 1 1 5 2 x" xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="y z w v 0 2 5  1  5 2 1 2 3 3 1 1 5 2" xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z w v 0 2 4 2 1 10 5 2 1 2 3 3 1 1 5" xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 x y z w v 0 2 3 2 1 4 5 2 1 2 3 3 1 1" xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 2 x y z w v A." xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="B." xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="C." xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="D." xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u u u u" xmpDM:startTime="428000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method 5 2 1 2 3 3 1 1 5 2 x y z w v u If" xmpDM:startTime="635967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cost changes Þ Recompute the costs to all neighbors" xmpDM:startTime="635967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem Time 0 A 1 R1 1 A 2 R1 1.5" xmpDM:startTime="935500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A 16 R1 2 A 3 R2 A 2 R1 3 A 4 R1 4 A 5 R2 5 A" xmpDM:startTime="935500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 R1 6 A 7 R2 … … 14 A 15 R2 15 A 16 R1 16 A 16 R2" xmpDM:startTime="935500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R1 R2 A R1 loses A R1 hears from R2 (Before it tells R2)" xmpDM:startTime="935500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary Distance Vectors: Distance to all nodes in the network sent to neighbors." xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Small # of large messages." xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State: Cost of link to neighbors sent to entire network." xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Large # of small messages." xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s algorithm is used to compute shortest path using link state Bellman Ford’s algorithm is used to compute shortest paths" xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="using distance vectors Distance Vector algorithms suffer from the count-to-infinity problem Ref: Read Section 5.2" xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook and try review questions R3-R6." xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="935867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem Time 0 A 1 R1 1 A 2 R1 1.5" xmpDM:startTime="936733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A 16 R1 2 A 3 R2 A 2 R1 3 A 4 R1 4 A 5 R2 5 A" xmpDM:startTime="936733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 R1 6 A 7 R2 … … 14 A 15 R2 15 A 16 R1 16 A 16 R2" xmpDM:startTime="936733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R1 R2 A R1 loses A R1 hears from R2 (Before it tells R2)" xmpDM:startTime="936733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method 5 2 1 2 3 3 1 1 5 2 x y z w v u If" xmpDM:startTime="937533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cost changes Þ Recompute the costs to all neighbors" xmpDM:startTime="937533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2 0      5 2 1 2 3 3 1 1 5 2 x" xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="y z w v 0 2 5  1  5 2 1 2 3 3 1 1 5 2" xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z w v 0 2 4 2 1 10 5 2 1 2 3 3 1 1 5" xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 x y z w v 0 2 3 2 1 4 5 2 1 2 3 3 1 1" xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 2 x y z w v A." xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="B." xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="C." xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="D." xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u u u u" xmpDM:startTime="938867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 7 ∞ ∞ ∞ ∞ ∞ ∞ from cost to from from" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 3 from cost to x y z x y z 0 2" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3 from cost to x y z x y z ∞ ∞ ∞ ∞ ∞ cost to x y z" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z 0 2 7 from cost to x y z x y z 0 2 3 from cost" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to x y z x y z 0 2 3 from cost to x y z x y z 0" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 7 from cost to x y z x y z ∞ ∞ ∞ 7 1 0 cost to ∞" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 0 1 ∞ ∞ ∞ 2 0 1 7 1 0 2 0 1 7 1 0 2 0" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 0 time x z 1 2 7 y node x table node y table node z table Bellman Ford" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 1" xmpDM:startTime="939400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm Notation: u = Source node c(i,j) = link cost from i to j h = Number of hops" xmpDM:startTime="939867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="being considered Du(n) = Cost of h-hop path from u to n Method: Initialize: Du(n) =  for all n" xmpDM:startTime="939867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" u; Du(u) = 0 For each node: Du(n) = minj [Du(j) +c(j,n)] If any costs change, repeat step 2" xmpDM:startTime="939867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="939867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5A [12 points] Prepare the routing calculation table for node 1 in the following network using Dijkstra’s algorithm." xmpDM:startTime="940800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Explain how you computed new entries in each row." xmpDM:startTime="940800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 4 3 2 1 6 1 4 3 1 1 2 4 1" xmpDM:startTime="940800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Complexity and Oscillations Algorithm complexity: n nodes Each iteration: need to check all nodes, w, not in N n(n+1)/2 comparisons:" xmpDM:startTime="941333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="O(n2) More efficient implementations possible: O(n log n) Oscillations Possible: e.g.," xmpDM:startTime="941333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="support link cost equals amount of carried traffic" xmpDM:startTime="941333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm: Example u y x w v z 2 2 1 3 1 1 2 5 3 5" xmpDM:startTime="941833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm Goal: Find the least cost paths from a given node to all other nodes in the network Notation:" xmpDM:startTime="942333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="c(i,j) = Link cost from i to j if i and j are connected D(k) = Total path cost from" xmpDM:startTime="942333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s to k N’ = Set of nodes so far for which the least cost path is known Method: Initialize:" xmpDM:startTime="942333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="N’={u}, D(v) = c(u,v) for all neighbors of u Repeat until N includes all nodes: Find node w  N’," xmpDM:startTime="942333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="whose D(w) is minimum Add w to N’" xmpDM:startTime="942333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Distance Vector vs." xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State Distance Vector: Vector of distances to all nodes, e.g.," xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u: {u:0, v:2, w:5, x:1, y:2, z:4} Sent to neighbors, e.g.," xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u will send to v, w, x Large vectors to small # of nodes Tell about the world to neighbors" xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Older method." xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Used in RIP." xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State: Vector of link cost to neighbors, e.g," xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u: {v:2, w:5, x:1} Sent to all nodes, e.g.," xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u will send to v, w, x, y, z Small vectors to large # of nodes Tell about the neighbors" xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to the world Newer method." xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Used in OSPF." xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u y x w v z 2 2 1 3 1 1 2 5 3 5" xmpDM:startTime="943167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm Goal: Find the least cost paths from a given node to all other nodes in the network Notation:" xmpDM:startTime="977333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="c(i,j) = Link cost from i to j if i and j are connected D(k) = Total path cost from" xmpDM:startTime="977333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s to k N’ = Set of nodes so far for which the least cost path is known Method: Initialize:" xmpDM:startTime="977333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="N’={u}, D(v) = c(u,v) for all neighbors of u Repeat until N includes all nodes: Find node w  N’," xmpDM:startTime="977333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="whose D(w) is minimum Add w to N’" xmpDM:startTime="977333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm: Example u y x w v z 2 2 1 3 1 1 2 5 3 5" xmpDM:startTime="977733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Complexity and Oscillations Algorithm complexity: n nodes Each iteration: need to check all nodes, w, not in N n(n+1)/2 comparisons:" xmpDM:startTime="978833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="O(n2) More efficient implementations possible: O(n log n) Oscillations Possible: e.g.," xmpDM:startTime="978833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="support link cost equals amount of carried traffic" xmpDM:startTime="978833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5A [12 points] Prepare the routing calculation table for node 1 in the following network using Dijkstra’s algorithm." xmpDM:startTime="979600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Explain how you computed new entries in each row." xmpDM:startTime="979600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 4 3 2 1 6 1 4 3 1 1 2 4 1" xmpDM:startTime="979600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm Notation: u = Source node c(i,j) = link cost from i to j h = Number of hops" xmpDM:startTime="980200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="being considered Du(n) = Cost of h-hop path from u to n Method: Initialize: Du(n) =  for all n" xmpDM:startTime="980200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" u; Du(u) = 0 For each node: Du(n) = minj [Du(j) +c(j,n)] If any costs change, repeat step 2" xmpDM:startTime="980200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="980200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 7 ∞ ∞ ∞ ∞ ∞ ∞ from cost to from from" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z x y z 0 2 3 from cost to x y z x y z 0 2" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3 from cost to x y z x y z ∞ ∞ ∞ ∞ ∞ cost to x y z" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z 0 2 7 from cost to x y z x y z 0 2 3 from cost" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to x y z x y z 0 2 3 from cost to x y z x y z 0" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 7 from cost to x y z x y z ∞ ∞ ∞ 7 1 0 cost to ∞" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 0 1 ∞ ∞ ∞ 2 0 1 7 1 0 2 0 1 7 1 0 2 0" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 0 time x z 1 2 7 y node x table node y table node z table Bellman Ford" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 1" xmpDM:startTime="983400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2 0      5 2 1 2 3 3 1 1 5 2 x" xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="y z w v 0 2 5  1  5 2 1 2 3 3 1 1 5 2" xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="x y z w v 0 2 4 2 1 10 5 2 1 2 3 3 1 1 5" xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 x y z w v 0 2 3 2 1 4 5 2 1 2 3 3 1 1" xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 2 x y z w v A." xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="B." xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="C." xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="D." xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="u u u u" xmpDM:startTime="984600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method 5 2 1 2 3 3 1 1 5 2 x y z w v u If" xmpDM:startTime="986233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cost changes Þ Recompute the costs to all neighbors" xmpDM:startTime="986233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem Time 0 A 1 R1 1 A 2 R1 1.5" xmpDM:startTime="988167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A 16 R1 2 A 3 R2 A 2 R1 3 A 4 R1 4 A 5 R2 5 A" xmpDM:startTime="988167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 R1 6 A 7 R2 … … 14 A 15 R2 15 A 16 R1 16 A 16 R2" xmpDM:startTime="988167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R1 R2 A R1 loses A R1 hears from R2 (Before it tells R2)" xmpDM:startTime="988167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary Distance Vectors: Distance to all nodes in the network sent to neighbors." xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Small # of large messages." xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State: Cost of link to neighbors sent to entire network." xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Large # of small messages." xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s algorithm is used to compute shortest path using link state Bellman Ford’s algorithm is used to compute shortest paths" xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="using distance vectors Distance Vector algorithms suffer from the count-to-infinity problem Ref: Read Section 5.2" xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook and try review questions R3-R6." xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1284633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5B [10 points] Prepare the routing calculation table for node 1 in the following network using the Bellman-Ford Algorithm." xmpDM:startTime="1370100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Explain how you computed new entries in each row." xmpDM:startTime="1370100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 4 3 2 1 6 1 4 3 1 1 2 4 1" xmpDM:startTime="1370100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary Distance Vectors: Distance to all nodes in the network sent to neighbors." xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Small # of large messages." xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State: Cost of link to neighbors sent to entire network." xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Large # of small messages." xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s algorithm is used to compute shortest path using link state Bellman Ford’s algorithm is used to compute shortest paths" xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="using distance vectors Distance Vector algorithms suffer from the count-to-infinity problem Ref: Read Section 5.2" xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook and try review questions R3-R6." xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1386433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem Time 0 A 1 R1 1 A 2 R1 1.5" xmpDM:startTime="1386767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A 16 R1 2 A 3 R2 A 2 R1 3 A 4 R1 4 A 5 R2 5 A" xmpDM:startTime="1386767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 R1 6 A 7 R2 … … 14 A 15 R2 15 A 16 R1 16 A 16 R2" xmpDM:startTime="1386767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R1 R2 A R1 loses A R1 hears from R2 (Before it tells R2)" xmpDM:startTime="1386767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method 5 2 1 2 3 3 1 1 5 2 x y z w v u If" xmpDM:startTime="1387267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cost changes Þ Recompute the costs to all neighbors" xmpDM:startTime="1387267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem Time 0 A 1 R1 1 A 2 R1 1.5" xmpDM:startTime="1405733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A 16 R1 2 A 3 R2 A 2 R1 3 A 4 R1 4 A 5 R2 5 A" xmpDM:startTime="1405733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 R1 6 A 7 R2 … … 14 A 15 R2 15 A 16 R1 16 A 16 R2" xmpDM:startTime="1405733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R1 R2 A R1 loses A R1 hears from R2 (Before it tells R2)" xmpDM:startTime="1405733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary Distance Vectors: Distance to all nodes in the network sent to neighbors." xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Small # of large messages." xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State: Cost of link to neighbors sent to entire network." xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Large # of small messages." xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s algorithm is used to compute shortest path using link state Bellman Ford’s algorithm is used to compute shortest paths" xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="using distance vectors Distance Vector algorithms suffer from the count-to-infinity problem Ref: Read Section 5.2" xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook and try review questions R3-R6." xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1406733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5B [10 points] Prepare the routing calculation table for node 1 in the following network using the Bellman-Ford Algorithm." xmpDM:startTime="1407633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Explain how you computed new entries in each row." xmpDM:startTime="1407633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 4 3 2 1 6 1 4 3 1 1 2 4 1" xmpDM:startTime="1407633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Autonomous Systems (AS) Open Shortest Path First (OSPF) OSPF Areas Border Gateway Protocol (BGP) Overview" xmpDM:startTime="1408300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems An internet connected by homogeneous routers under the administrative control of a single entity Fig 16.10" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R2 R7 R4 R1 R6 R8 R5 R3 Interior Exterior Ref: Section 5.3" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1473767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="1655467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="1655467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="1655467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="1655467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="1655467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1655467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="1800300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="1800300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="1800300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="1859467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="1859467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="1859467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="1859467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="1859467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1859467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems An internet connected by homogeneous routers under the administrative control of a single entity Fig 16.10" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R2 R7 R4 R1 R6 R8 R5 R3 Interior Exterior Ref: Section 5.3" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1859900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="1871300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="1871300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="1871300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="1871300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="1871300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1871300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="1872367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="1872367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="1872367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="1908167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="1908167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="1908167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="1908167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="1908167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1908167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems An internet connected by homogeneous routers under the administrative control of a single entity Fig 16.10" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R2 R7 R4 R1 R6 R8 R5 R3 Interior Exterior Ref: Section 5.3" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1908833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="1987267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="1987267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="1987267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="1987267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="1987267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1987267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="1987900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="1987900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="1987900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="2089567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="2089567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="2089567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="2089567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="2089567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="2089567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="2089567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="2201067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="2201067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="2201067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="2201067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="2201067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="2201067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2201067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="2202633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="2202633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="2202633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="2202633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="2202633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="2202633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="2202633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="2281200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="2281200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="2281200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="2281200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="2281200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="2281200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2281200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="2282600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="2282600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="2282600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="2282600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="2282600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="2282600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="2282600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="2379067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="2379067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="2379067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="2379067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="2379067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="2379067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2379067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations BGP systems initially exchange entire routing tables." xmpDM:startTime="2682733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Afterwards, only updates are exchanged." xmpDM:startTime="2682733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP messages have the following information: Origin of path information: RIP, OSPF, … AS_Path: List of ASs on the path" xmpDM:startTime="2682733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to reach the dest Next_Hop: IP address of the border router to be used as the next hop to reach" xmpDM:startTime="2682733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the dest Unreachable: If a previously advertised route has become unreachable BGP speakers generate update messages to all peers when" xmpDM:startTime="2682733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="it selects a new route or some route becomes unreachable." xmpDM:startTime="2682733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2682733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="2686267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="2686267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="2686267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="2686267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="2686267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="2686267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2686267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations BGP systems initially exchange entire routing tables." xmpDM:startTime="2732400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Afterwards, only updates are exchanged." xmpDM:startTime="2732400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP messages have the following information: Origin of path information: RIP, OSPF, … AS_Path: List of ASs on the path" xmpDM:startTime="2732400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to reach the dest Next_Hop: IP address of the border router to be used as the next hop to reach" xmpDM:startTime="2732400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the dest Unreachable: If a previously advertised route has become unreachable BGP speakers generate update messages to all peers when" xmpDM:startTime="2732400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="it selects a new route or some route becomes unreachable." xmpDM:startTime="2732400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2732400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="2806533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="2806533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="2806533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="2806533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="2806533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="2806533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2806533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="2807000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="2807000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="2807000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="2807000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="2807000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="2807000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="2807000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="2807433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="2807433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="2807433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="2807867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="2807867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="2807867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="2807867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="2807867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2807867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems An internet connected by homogeneous routers under the administrative control of a single entity Fig 16.10" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R2 R7 R4 R1 R6 R8 R5 R3 Interior Exterior Ref: Section 5.3" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2808300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="2819633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="2819633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="2819633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="2819633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="2819633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2819633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="2820133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="2820133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="2820133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="2820533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="2820533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="2820533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="2820533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="2820533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="2820533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="2820533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="2821433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="2821433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="2821433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="2821433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="2821433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="2821433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2821433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations BGP systems initially exchange entire routing tables." xmpDM:startTime="2822367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Afterwards, only updates are exchanged." xmpDM:startTime="2822367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP messages have the following information: Origin of path information: RIP, OSPF, … AS_Path: List of ASs on the path" xmpDM:startTime="2822367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to reach the dest Next_Hop: IP address of the border router to be used as the next hop to reach" xmpDM:startTime="2822367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the dest Unreachable: If a previously advertised route has become unreachable BGP speakers generate update messages to all peers when" xmpDM:startTime="2822367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="it selects a new route or some route becomes unreachable." xmpDM:startTime="2822367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2822367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example A,B,C are provider networks X,W,Y are customer (of provider networks) X is dual-homed: attached to two" xmpDM:startTime="2896967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="networks X does not want to route from B via X to C .." xmpDM:startTime="2896967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="so X will not advertise to B a route to C A B C W X Y legend: customer network:" xmpDM:startTime="2896967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="provider network" xmpDM:startTime="2896967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example (Cont) A advertises path A-W to B B advertises path B-A-W to X Should B advertise" xmpDM:startTime="3032500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="path B-A-W to C? No way! B gets no “revenue” for routing C-B-A-W since neither W nor C are B’s" xmpDM:startTime="3032500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="customers B wants to force C to route to w via A B wants to route only to/from its customers!" xmpDM:startTime="3032500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B C W X Y legend: customer network: provider network" xmpDM:startTime="3032500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra- vs." xmpDM:startTime="3222167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Inter-AS Routing Policy: Inter-AS: admin wants control over how its traffic routed, who routes through its net." xmpDM:startTime="3222167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra-AS: single admin, so no policy decisions needed Scale: Hierarchical routing saves table size, reduced update traffic Performance: Intra-AS: can" xmpDM:startTime="3222167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="focus on performance Inter-AS: policy may dominate over performance" xmpDM:startTime="3222167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols: Summary OSPF uses link-state routing and divides the autonomous systems into multiple areas." xmpDM:startTime="3322733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Area border router, AS boundary router, designated router BGP is an inter-AS protocol Þ Policy driven Ref: Read Section 5.3" xmpDM:startTime="3322733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and 5.4" xmpDM:startTime="3322733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook and try review questions R7-R13." xmpDM:startTime="3322733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3322733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SDN Control Plane" xmpDM:startTime="3354200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Controller Example: OpenDaylight DLUX GUI OpenStack Neutron AAA Authentication Filter REST APIs Topology Mgr Stats Mgr Switch Mgr FRM Host" xmpDM:startTime="3354767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tracker AAA OVSDB Neutron OpenFlow OVSDB CAPWEB CoAP NETCONF PCMM/COPS USC HTTP SNMP SXP ALTO OPFLEX PCEP SNBI LISP BGP" xmpDM:startTime="3354767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Abstraction Layer (SAL) Plugin Mgr, Capability Abstractions, Flow Programming, Inventory, etc." xmpDM:startTime="3354767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Neutron Northbound LISP Svc GBP Svc DOCSIS Svc Reservation VPN LACP SFC L2 Switch SDNI Aggregator DIDM Topo Processing USC" xmpDM:startTime="3354767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mgr VTN Mgr NIC TSDR Network Service Functions Southbound Protocol Plugins Network Element Network Element Network Element Network Elements Overlay" xmpDM:startTime="3354767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tunnels (VxLAN, NVGRE, …) Northbound APIs OSGi Frameork" xmpDM:startTime="3354767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OpenDaylight SDN Controller Multi-company collaboration under Linux foundation Many projects including OpenDaylight Controller Dynamically linked in to a Service Abstraction" xmpDM:startTime="3355400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Layer (SAL) Þ SAL figures out how to fulfill the service requested by higher layers irrespective of the southbound protocol" xmpDM:startTime="3355400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Modular design A rich set of North-bound APIs via RESTful (Web page like) services Ref: Read Section 5.5" xmpDM:startTime="3355400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and try review questions R14-R18." xmpDM:startTime="3355400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3355400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ICMP Internet Control Message Protocol Required companion to IP." xmpDM:startTime="3355933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Provides feedback from the network." xmpDM:startTime="3355933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ICMP: Used by IP to send error and control messages ICMP uses IP to send its messages (Not UDP) ICMP" xmpDM:startTime="3355933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="does not report errors on ICMP messages." xmpDM:startTime="3355933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ICMP reports error only on the first fragment ICMP Header ICMP Data IP Header IP Data Datalink Header Datalink Data" xmpDM:startTime="3355933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3355933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OpenDaylight SDN Controller Multi-company collaboration under Linux foundation Many projects including OpenDaylight Controller Dynamically linked in to a Service Abstraction" xmpDM:startTime="3357067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Layer (SAL) Þ SAL figures out how to fulfill the service requested by higher layers irrespective of the southbound protocol" xmpDM:startTime="3357067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Modular design A rich set of North-bound APIs via RESTful (Web page like) services Ref: Read Section 5.5" xmpDM:startTime="3357067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and try review questions R14-R18." xmpDM:startTime="3357067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3357067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Controller Example: OpenDaylight DLUX GUI OpenStack Neutron AAA Authentication Filter REST APIs Topology Mgr Stats Mgr Switch Mgr FRM Host" xmpDM:startTime="3357333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tracker AAA OVSDB Neutron OpenFlow OVSDB CAPWEB CoAP NETCONF PCMM/COPS USC HTTP SNMP SXP ALTO OPFLEX PCEP SNBI LISP BGP" xmpDM:startTime="3357333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Abstraction Layer (SAL) Plugin Mgr, Capability Abstractions, Flow Programming, Inventory, etc." xmpDM:startTime="3357333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Neutron Northbound LISP Svc GBP Svc DOCSIS Svc Reservation VPN LACP SFC L2 Switch SDNI Aggregator DIDM Topo Processing USC" xmpDM:startTime="3357333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mgr VTN Mgr NIC TSDR Network Service Functions Southbound Protocol Plugins Network Element Network Element Network Element Network Elements Overlay" xmpDM:startTime="3357333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tunnels (VxLAN, NVGRE, …) Northbound APIs OSGi Frameork" xmpDM:startTime="3357333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SDN Control Plane" xmpDM:startTime="3357733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols: Summary OSPF uses link-state routing and divides the autonomous systems into multiple areas." xmpDM:startTime="3358200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Area border router, AS boundary router, designated router BGP is an inter-AS protocol Þ Policy driven Ref: Read Section 5.3" xmpDM:startTime="3358200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and 5.4" xmpDM:startTime="3358200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook and try review questions R7-R13." xmpDM:startTime="3358200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3358200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra- vs." xmpDM:startTime="3358300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Inter-AS Routing Policy: Inter-AS: admin wants control over how its traffic routed, who routes through its net." xmpDM:startTime="3358300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra-AS: single admin, so no policy decisions needed Scale: Hierarchical routing saves table size, reduced update traffic Performance: Intra-AS: can" xmpDM:startTime="3358300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="focus on performance Inter-AS: policy may dominate over performance" xmpDM:startTime="3358300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example (Cont) A advertises path A-W to B B advertises path B-A-W to X Should B advertise" xmpDM:startTime="3358500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="path B-A-W to C? No way! B gets no “revenue” for routing C-B-A-W since neither W nor C are B’s" xmpDM:startTime="3358500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="customers B wants to force C to route to w via A B wants to route only to/from its customers!" xmpDM:startTime="3358500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B C W X Y legend: customer network: provider network" xmpDM:startTime="3358500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example A,B,C are provider networks X,W,Y are customer (of provider networks) X is dual-homed: attached to two" xmpDM:startTime="3358700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="networks X does not want to route from B via X to C .." xmpDM:startTime="3358700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="so X will not advertise to B a route to C A B C W X Y legend: customer network:" xmpDM:startTime="3358700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="provider network" xmpDM:startTime="3358700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations BGP systems initially exchange entire routing tables." xmpDM:startTime="3359100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Afterwards, only updates are exchanged." xmpDM:startTime="3359100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP messages have the following information: Origin of path information: RIP, OSPF, … AS_Path: List of ASs on the path" xmpDM:startTime="3359100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to reach the dest Next_Hop: IP address of the border router to be used as the next hop to reach" xmpDM:startTime="3359100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the dest Unreachable: If a previously advertised route has become unreachable BGP speakers generate update messages to all peers when" xmpDM:startTime="3359100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="it selects a new route or some route becomes unreachable." xmpDM:startTime="3359100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3359100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="3359500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="3359500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="3359500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="3359500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="3359500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="3359500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3359500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="3360067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="3360067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="3360067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="3360067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="3360067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="3360067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="3360067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="3360467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="3360467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="3360467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="3361600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="3361600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="3361600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="3361600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="3361600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3361600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems An internet connected by homogeneous routers under the administrative control of a single entity Fig 16.10" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R2 R7 R4 R1 R6 R8 R5 R3 Interior Exterior Ref: Section 5.3" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3362033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="3380267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="3380267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="3380267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="3380267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="3380267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3380267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="3380733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="3380733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="3380733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="3381133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="3381133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="3381133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="3381133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="3381133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="3381133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="3381133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="3389300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="3389300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="3389300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="3389700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="3389700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="3389700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="3389700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="3389700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3389700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems An internet connected by homogeneous routers under the administrative control of a single entity Fig 16.10" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R2 R7 R4 R1 R6 R8 R5 R3 Interior Exterior Ref: Section 5.3" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3390100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols Interior Router Protocol (IRP): Used for passing routing information among routers internal to an autonomous system." xmpDM:startTime="3433433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as IGP." xmpDM:startTime="3433433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: RIP, OSPF, IGRP Exterior Router Protocol (ERP): Used for passing routing information among routers between autonomous systems." xmpDM:startTime="3433433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Also known as EGP." xmpDM:startTime="3433433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: EGP, BGP, IDRP Note: EGP is a class as well as an instance in that class." xmpDM:startTime="3433433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3433433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF) Uses true metrics (not just hop count) Uses subnet masks Allows load balancing across equal-cost" xmpDM:startTime="3433733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="paths Supports type of service (ToS) Allows external routes (routes learnt from other autonomous systems) Authenticates route exchanges Quick convergence" xmpDM:startTime="3433733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Direct support for multicast Link state routing Þ Each router broadcasts its connectivity with neighbors to entire network" xmpDM:startTime="3433733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas Large networks are divided into areas to reduce routing traffic." xmpDM:startTime="3433933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="LSAs are flooded throughout the area Area border routers (ABRs) summarize the topology and transmit it to the backbone area" xmpDM:startTime="3433933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Backbone routers forward it to other areas ABRs connect an area with the backbone area." xmpDM:startTime="3433933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs contain OSPF data for two areas." xmpDM:startTime="3433933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABRs run OSPF algorithms for the two areas." xmpDM:startTime="3433933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there is only one area in the AS, there is no backbone area and there are no ABRs." xmpDM:startTime="3433933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ABR ABR ABR Backbone Area 1 Area 2 Area n" xmpDM:startTime="3433933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol Inter-autonomous system protocol [RFC 1267] Used since 1989 but not extensively until recently Runs on TCP (segmentation," xmpDM:startTime="3434100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="reliable transmission) Advertises all transit ASs on the path to a destination address A router may receive multiple paths to" xmpDM:startTime="3434100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a destination Þ Can choose the best path iBGP used to forward paths inside the AS." xmpDM:startTime="3434100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP used to exchange paths between ASs." xmpDM:startTime="3434100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="eBGP iBGP AS1 AS2 Ref: Section 5.4" xmpDM:startTime="3434100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook." xmpDM:startTime="3434100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3434100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations BGP systems initially exchange entire routing tables." xmpDM:startTime="3434467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Afterwards, only updates are exchanged." xmpDM:startTime="3434467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP messages have the following information: Origin of path information: RIP, OSPF, … AS_Path: List of ASs on the path" xmpDM:startTime="3434467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to reach the dest Next_Hop: IP address of the border router to be used as the next hop to reach" xmpDM:startTime="3434467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the dest Unreachable: If a previously advertised route has become unreachable BGP speakers generate update messages to all peers when" xmpDM:startTime="3434467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="it selects a new route or some route becomes unreachable." xmpDM:startTime="3434467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3434467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example A,B,C are provider networks X,W,Y are customer (of provider networks) X is dual-homed: attached to two" xmpDM:startTime="3434867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="networks X does not want to route from B via X to C .." xmpDM:startTime="3434867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="so X will not advertise to B a route to C A B C W X Y legend: customer network:" xmpDM:startTime="3434867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="provider network" xmpDM:startTime="3434867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example (Cont) A advertises path A-W to B B advertises path B-A-W to X Should B advertise" xmpDM:startTime="3435300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="path B-A-W to C? No way! B gets no “revenue” for routing C-B-A-W since neither W nor C are B’s" xmpDM:startTime="3435300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="customers B wants to force C to route to w via A B wants to route only to/from its customers!" xmpDM:startTime="3435300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A B C W X Y legend: customer network: provider network" xmpDM:startTime="3435300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra- vs." xmpDM:startTime="3435667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Inter-AS Routing Policy: Inter-AS: admin wants control over how its traffic routed, who routes through its net." xmpDM:startTime="3435667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra-AS: single admin, so no policy decisions needed Scale: Hierarchical routing saves table size, reduced update traffic Performance: Intra-AS: can" xmpDM:startTime="3435667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="focus on performance Inter-AS: policy may dominate over performance" xmpDM:startTime="3435667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols: Summary OSPF uses link-state routing and divides the autonomous systems into multiple areas." xmpDM:startTime="3436567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Area border router, AS boundary router, designated router BGP is an inter-AS protocol Þ Policy driven Ref: Read Section 5.3" xmpDM:startTime="3436567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and 5.4" xmpDM:startTime="3436567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of the textbook and try review questions R7-R13." xmpDM:startTime="3436567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3436567" xmpDM:duration="1000"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="TableOfContents" xmpDM:frameRate="f1000" xmpDM:trackName="Table of Contents">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm" xmpDM:startTime="0" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman Ford Example 1" xmpDM:startTime="51200" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm" xmpDM:startTime="53533" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman Ford Example 1" xmpDM:startTime="127333" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2" xmpDM:startTime="354967" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method" xmpDM:startTime="356367" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2" xmpDM:startTime="359533" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman Ford Example 1" xmpDM:startTime="360033" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2" xmpDM:startTime="428000" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method" xmpDM:startTime="635967" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem" xmpDM:startTime="935500" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary" xmpDM:startTime="935867" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem" xmpDM:startTime="936733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method" xmpDM:startTime="937533" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2" xmpDM:startTime="938867" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman Ford Example 1" xmpDM:startTime="939400" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm" xmpDM:startTime="939867" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5A" xmpDM:startTime="940800" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Complexity and Oscillations" xmpDM:startTime="941333" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm: Example" xmpDM:startTime="941833" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm" xmpDM:startTime="942333" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Distance Vector vs. Link State" xmpDM:startTime="943167" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm" xmpDM:startTime="977333" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm: Example" xmpDM:startTime="977733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Complexity and Oscillations" xmpDM:startTime="978833" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5A" xmpDM:startTime="979600" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Algorithm" xmpDM:startTime="980200" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="26" tscDM:imageoffset="0" tscDM:imagerect="1950, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman Ford Example 1" xmpDM:startTime="983400" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="27" tscDM:imageoffset="0" tscDM:imagerect="2025, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford Example 2" xmpDM:startTime="984600" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="28" tscDM:imageoffset="0" tscDM:imagerect="2100, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method" xmpDM:startTime="986233" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="29" tscDM:imageoffset="0" tscDM:imagerect="2175, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem" xmpDM:startTime="988167" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="30" tscDM:imageoffset="0" tscDM:imagerect="2250, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary" xmpDM:startTime="1284633" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="31" tscDM:imageoffset="0" tscDM:imagerect="2325, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5B" xmpDM:startTime="1370100" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="32" tscDM:imageoffset="0" tscDM:imagerect="2400, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary" xmpDM:startTime="1386433" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="33" tscDM:imageoffset="0" tscDM:imagerect="2475, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem" xmpDM:startTime="1386767" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="34" tscDM:imageoffset="0" tscDM:imagerect="2550, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bellman-Ford: Tabular Method" xmpDM:startTime="1387267" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="35" tscDM:imageoffset="0" tscDM:imagerect="2625, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Counting to Infinity Problem" xmpDM:startTime="1405733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="36" tscDM:imageoffset="0" tscDM:imagerect="2700, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms: Summary" xmpDM:startTime="1406733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="37" tscDM:imageoffset="0" tscDM:imagerect="2775, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5B" xmpDM:startTime="1407633" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="38" tscDM:imageoffset="0" tscDM:imagerect="2850, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="1408300" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="39" tscDM:imageoffset="0" tscDM:imagerect="2925, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems" xmpDM:startTime="1473767" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="40" tscDM:imageoffset="0" tscDM:imagerect="3000, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="1655467" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="41" tscDM:imageoffset="0" tscDM:imagerect="3075, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="1800300" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="42" tscDM:imageoffset="0" tscDM:imagerect="3150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="1859467" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="43" tscDM:imageoffset="0" tscDM:imagerect="3225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems" xmpDM:startTime="1859900" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="44" tscDM:imageoffset="0" tscDM:imagerect="3300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="1871300" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="45" tscDM:imageoffset="0" tscDM:imagerect="3375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="1872367" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="46" tscDM:imageoffset="0" tscDM:imagerect="3450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="1908167" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="47" tscDM:imageoffset="0" tscDM:imagerect="3525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems" xmpDM:startTime="1908833" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="48" tscDM:imageoffset="0" tscDM:imagerect="3600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="1987267" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="49" tscDM:imageoffset="0" tscDM:imagerect="3675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="1987900" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="50" tscDM:imageoffset="0" tscDM:imagerect="3750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="2089567" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="51" tscDM:imageoffset="0" tscDM:imagerect="3825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="2201067" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="52" tscDM:imageoffset="0" tscDM:imagerect="3900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="2202633" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="53" tscDM:imageoffset="0" tscDM:imagerect="50, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="2281200" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="54" tscDM:imageoffset="0" tscDM:imagerect="125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="2282600" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="55" tscDM:imageoffset="0" tscDM:imagerect="200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="2379067" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="56" tscDM:imageoffset="0" tscDM:imagerect="275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations" xmpDM:startTime="2682733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="57" tscDM:imageoffset="0" tscDM:imagerect="350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="2686267" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="58" tscDM:imageoffset="0" tscDM:imagerect="425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations" xmpDM:startTime="2732400" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="59" tscDM:imageoffset="0" tscDM:imagerect="500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="2806533" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="60" tscDM:imageoffset="0" tscDM:imagerect="575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="2807000" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="61" tscDM:imageoffset="0" tscDM:imagerect="650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="2807433" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="62" tscDM:imageoffset="0" tscDM:imagerect="725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="2807867" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="63" tscDM:imageoffset="0" tscDM:imagerect="800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems" xmpDM:startTime="2808300" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="64" tscDM:imageoffset="0" tscDM:imagerect="875, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="2819633" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="65" tscDM:imageoffset="0" tscDM:imagerect="950, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="2820133" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="66" tscDM:imageoffset="0" tscDM:imagerect="1025, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="2820533" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="67" tscDM:imageoffset="0" tscDM:imagerect="1100, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="2821433" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="68" tscDM:imageoffset="0" tscDM:imagerect="1175, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations" xmpDM:startTime="2822367" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="69" tscDM:imageoffset="0" tscDM:imagerect="1250, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example" xmpDM:startTime="2896967" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="70" tscDM:imageoffset="0" tscDM:imagerect="1325, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example (Cont)" xmpDM:startTime="3032500" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="71" tscDM:imageoffset="0" tscDM:imagerect="1400, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra- vs. Inter-AS Routing " xmpDM:startTime="3222167" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="72" tscDM:imageoffset="0" tscDM:imagerect="1475, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols: Summary" xmpDM:startTime="3322733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="73" tscDM:imageoffset="0" tscDM:imagerect="1550, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SDN Control Plane" xmpDM:startTime="3354200" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="74" tscDM:imageoffset="0" tscDM:imagerect="1625, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Controller Example: OpenDaylight" xmpDM:startTime="3354767" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="75" tscDM:imageoffset="0" tscDM:imagerect="1700, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OpenDaylight SDN Controller " xmpDM:startTime="3355400" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="76" tscDM:imageoffset="0" tscDM:imagerect="1775, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ICMP" xmpDM:startTime="3355933" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="77" tscDM:imageoffset="0" tscDM:imagerect="1850, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OpenDaylight SDN Controller " xmpDM:startTime="3357067" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="78" tscDM:imageoffset="0" tscDM:imagerect="1925, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Controller Example: OpenDaylight" xmpDM:startTime="3357333" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="79" tscDM:imageoffset="0" tscDM:imagerect="2000, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SDN Control Plane" xmpDM:startTime="3357733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="80" tscDM:imageoffset="0" tscDM:imagerect="2075, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols: Summary" xmpDM:startTime="3358200" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="81" tscDM:imageoffset="0" tscDM:imagerect="2150, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra- vs. Inter-AS Routing " xmpDM:startTime="3358300" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="82" tscDM:imageoffset="0" tscDM:imagerect="2225, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example (Cont)" xmpDM:startTime="3358500" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="83" tscDM:imageoffset="0" tscDM:imagerect="2300, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example" xmpDM:startTime="3358700" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="84" tscDM:imageoffset="0" tscDM:imagerect="2375, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations" xmpDM:startTime="3359100" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="85" tscDM:imageoffset="0" tscDM:imagerect="2450, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="3359500" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="86" tscDM:imageoffset="0" tscDM:imagerect="2525, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="3360067" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="87" tscDM:imageoffset="0" tscDM:imagerect="2600, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="3360467" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="88" tscDM:imageoffset="0" tscDM:imagerect="2675, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="3361600" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="89" tscDM:imageoffset="0" tscDM:imagerect="2750, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems" xmpDM:startTime="3362033" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="90" tscDM:imageoffset="0" tscDM:imagerect="2825, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="3380267" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="91" tscDM:imageoffset="0" tscDM:imagerect="2900, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="3380733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="92" tscDM:imageoffset="0" tscDM:imagerect="2975, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="3381133" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="93" tscDM:imageoffset="0" tscDM:imagerect="3050, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="3389300" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="94" tscDM:imageoffset="0" tscDM:imagerect="3125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="3389700" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="95" tscDM:imageoffset="0" tscDM:imagerect="3200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Autonomous Systems" xmpDM:startTime="3390100" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="96" tscDM:imageoffset="0" tscDM:imagerect="3275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols" xmpDM:startTime="3433433" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="97" tscDM:imageoffset="0" tscDM:imagerect="3350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Open Shortest Path First (OSPF)" xmpDM:startTime="3433733" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="98" tscDM:imageoffset="0" tscDM:imagerect="3425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="OSPF Areas" xmpDM:startTime="3433933" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="99" tscDM:imageoffset="0" tscDM:imagerect="3500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Border Gateway Protocol" xmpDM:startTime="3434100" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="100" tscDM:imageoffset="0" tscDM:imagerect="3575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Operations" xmpDM:startTime="3434467" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="101" tscDM:imageoffset="0" tscDM:imagerect="3650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example" xmpDM:startTime="3434867" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="102" tscDM:imageoffset="0" tscDM:imagerect="3725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="BGP Routing Policy Example (Cont)" xmpDM:startTime="3435300" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="103" tscDM:imageoffset="0" tscDM:imagerect="3800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Intra- vs. Inter-AS Routing " xmpDM:startTime="3435667" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="104" tscDM:imageoffset="0" tscDM:imagerect="3875, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Protocols: Summary" xmpDM:startTime="3436567" tscDM:image="i_5nlc2_Thumbnails.png" tscDM:imageindex="105" tscDM:imageoffset="0" tscDM:imagerect="25, 112, 75, 56"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
            </rdf:Bag>
         </xmpDM:Tracks>
         <tscDM:controller>
            <rdf:Description xmpDM:name="tscplayer">
               <tscDM:parameters>
                  <rdf:Bag>
                     <rdf:li xmpDM:name="autohide" xmpDM:value="false"/><rdf:li xmpDM:name="autoplay" xmpDM:value="true"/><rdf:li xmpDM:name="loop" xmpDM:value="false"/><rdf:li xmpDM:name="searchable" xmpDM:value="true"/><rdf:li xmpDM:name="captionsenabled" xmpDM:value="false"/><rdf:li xmpDM:name="sidebarenabled" xmpDM:value="false"/><rdf:li xmpDM:name="unicodeenabled" xmpDM:value="false"/><rdf:li xmpDM:name="backgroundcolor" xmpDM:value="000000"/><rdf:li xmpDM:name="sidebarlocation" xmpDM:value="left"/><rdf:li xmpDM:name="endaction" xmpDM:value="stop"/><rdf:li xmpDM:name="endactionparam" xmpDM:value="true"/><rdf:li xmpDM:name="locale" xmpDM:value="en-US"/></rdf:Bag>
               </tscDM:parameters>
               <tscDM:controllerText>
                  <rdf:Bag>
                  </rdf:Bag>
               </tscDM:controllerText>
            </rdf:Description>
         </tscDM:controller>
         <tscDM:contentList>
            <rdf:Description>
               <tscDM:files>
                  <rdf:Seq>
                     <rdf:li xmpDM:name="0" xmpDM:value="i_5nlc2.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="i_5nlc2_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="i_5nlc2_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>