<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-18 05:56:30 PM" dc:source="Camtasia,9.1.4,enu" dc:title="i_5nlc1" tscDM:firstFrame="i_5nlc1_First_Frame.png" tscDM:originId="2DF50D87-BA53-475F-A514-C98B82A26F05" tscDM:project="i_5nlc1.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="1157466"/>
         <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="The Network Layer: Control Plane Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@wustl.edu" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Audio/Video recordings of this lecture are available on-line at: http://www.cse.wustl.edu/~jain/cse473-20/" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Subnet 1.2" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="R2 R7 R4 R1 R6 R8 R5 R3 Interior Exterior" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview Routing Algorithms: Link-State, Distance Vector Dijkstra’s algorithm, Bellman-Ford Algorithm Routing Protocols: OSPF, BGP SDN Control Plane ICMP SNMP Note:" xmpDM:startTime="12400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This class lecture is based on Chapter 5 of the textbook (Kurose and Ross) and the figures provided by the" xmpDM:startTime="12400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="authors." xmpDM:startTime="12400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="12400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Network Layer Functions Forwarding: Deciding what to do with a packet using a routing table Þ Data plane Routing: Making" xmpDM:startTime="57800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the routing table Þ Control Plane" xmpDM:startTime="57800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms Graph abstraction Distance Vector vs." xmpDM:startTime="81100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State Dijkstra’s Algorithm Bellman-Ford Algorithm Overview" xmpDM:startTime="81100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rooting or Routing Rooting is what fans do at football games, what pigs do for truffles under oak trees in" xmpDM:startTime="100167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the Vaucluse, and what nursery workers intent on propagation do to cuttings from plants." xmpDM:startTime="100167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing is how one creates a beveled edge on a table top or sends a corps of infantrymen into full" xmpDM:startTime="100167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="scale, disorganized retreat Ref: Piscitello and Chapin, “Open Systems Networking: TCP/IP and OSI,” Adison-Wesley, 1993, p413" xmpDM:startTime="100167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routeing or Routing Routeing: British Routing: American Since Oxford English Dictionary is much heavier than any other dictionary of American" xmpDM:startTime="160200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="English, British English generally prevails in the documents produced by ISO and CCITT; wherefore, most of the international standards for" xmpDM:startTime="160200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="routing standards use the routeing spelling." xmpDM:startTime="160200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ref: Piscitello and Chapin, “Open Systems Networking: TCP/IP and OSI,” Adison-Wesley, 1993, p413" xmpDM:startTime="160200" 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 Graph abstraction Graph: G" xmpDM:startTime="237400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= (N,E) N = Set of routers = { u, v, w, x, y, z } E = Set of" xmpDM:startTime="237400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) } Each link has a cost, e.g.," xmpDM:startTime="237400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="c(w,z) = 5 Cost of path (x1, x2,…, xp) = c(x1,x2) + c(x2,x3) + … + c(xp-1,xp) Routing Algorithms find" xmpDM:startTime="237400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the least cost path We limit to “Undirected” graphs, i.e.," xmpDM:startTime="237400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cost is same in both directions" xmpDM:startTime="237400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Distance Vector vs." xmpDM:startTime="410500" 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="410500" 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="410500" 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="410500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Older method." xmpDM:startTime="410500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Used in RIP." xmpDM:startTime="410500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Link State: Vector of link cost to neighbors, e.g," xmpDM:startTime="410500" 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="410500" 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="410500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to the world Newer method." xmpDM:startTime="410500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Used in OSPF." xmpDM:startTime="410500" 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="410500" 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="583633" 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="583633" 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="583633" 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="583633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="whose D(w) is minimum Add w to N’" xmpDM:startTime="583633" 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="683533" 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="914567" 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="914567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="support link cost equals amount of carried traffic" xmpDM:startTime="914567" 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="917100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Explain how you computed new entries in each row." xmpDM:startTime="917100" 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="917100" 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="923567" 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="923567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="support link cost equals amount of carried traffic" xmpDM:startTime="923567" 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="934300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Explain how you computed new entries in each row." xmpDM:startTime="934300" 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="934300" 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="1006500" 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="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="support link cost equals amount of carried traffic" xmpDM:startTime="1006500" 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="The Network Layer: Control Plane" xmpDM:startTime="0" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview" xmpDM:startTime="12400" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Network Layer Functions" xmpDM:startTime="57800" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routing Algorithms" xmpDM:startTime="81100" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rooting or Routing" xmpDM:startTime="100167" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Routeing or Routing" xmpDM:startTime="160200" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Graph abstraction" xmpDM:startTime="237400" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Distance Vector vs. Link State" xmpDM:startTime="410500" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm" xmpDM:startTime="583633" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dijkstra’s Algorithm: Example" xmpDM:startTime="683533" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Complexity and Oscillations" xmpDM:startTime="914567" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5A" xmpDM:startTime="917100" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Complexity and Oscillations" xmpDM:startTime="923567" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 5A" xmpDM:startTime="934300" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Complexity and Oscillations" xmpDM:startTime="1006500" tscDM:image="i_5nlc1_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 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_5nlc1.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="i_5nlc1_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="i_5nlc1_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>