Link State Routing. Stefano Vissicchio UCL Computer Science CS 3035/GZ01
|
|
- Gary Booth
- 6 years ago
- Views:
Transcription
1 Link State Routing Stefano Vissicchio UCL Computer Science CS 335/GZ
2 Reminder: Intra-domain Routing Problem Shortest paths problem: What path between two vertices offers minimal sum of edge weights? Classic graph algorithms find single-source shortest paths when the entire graph is known centrally Dijkstra s Algorithm, Bellman-Ford Algorithm Typically, no central knowledge of entire graph Each router only knows its own interfaces addresses
3 Reminder: Distance Vector (DV) Approach Shortest paths problem: What path between two vertices offers minimal sum of edge weights? but turned into a distributed algorithm Classic graph algorithms find single-source shortest paths when the entire graph is known centrally Dijkstra s Algorithm, Bellman-Ford Algorithm Typically, no central knowledge of entire graph Each router only knows its own interfaces addresses 3
4 Link State (LS) Approach Shortest paths problem: What path between two vertices offers minimal sum of edge unmodified, weights? but run on every router Classic graph algorithms find single-source shortest paths when the entire graph is known centrally Dijkstra s Algorithm, Bellman-Ford Algorithm Typically, no central knowledge of entire graph Each router only knows its own interfaces addresses 4
5 Link State Approach: Share the Map! Dijkstra s algorithm takes a weighted graph as input it is a centralized algorithm Link State routing protocols instruct routers to collectively build a map of the whole network each router shares its local information each router stores the map in a link state database each router runs Dijkstra s algorithm locally 5
6 Comparison between LS and DV principles Distance Vector principle: tell everything you know to your neighbours dump routing tables to neighbours Link State principle: tell everybody what you know about your neighbourhood flood local information network-wide 6
7 Agenda We deepen how Link State routing protocols work. Sharing the map Finding links: Hello protocol Building the map: Flooding protocol Dealing with failures and partitions. Computing paths 3. Properties of Link State Routing 7
8 Routers periodically say hello Each router runs a Hello Protocol transmits a hello packet on each interface, every time period P A hello packet contains: sender ID a list of neighbours from which sender has heard hello on that interface during period D > P e.g., D=3P 8
9 Routers establish adjacencies Routers need to know who to share the map with they establish logical links called adjacencies used to exchange LS messages Hello messages enable adjacencies to be built between neighbouring routers the adjacency is up if each of the two routers has received a hello message with its own ID, in the last period D the adjacency is down otherwise 9
10 Routers spread news on their neighbourhood Goal: build a map and keep it updated whenever a link in the LS map comes up or goes down, the map should be changed To this end, information is flooded LS routers run a Flooding Protocol a router detecting a topology change sends a link state advertisement (LSA) to all its neighbours over the established adjacencies
11 Flooding enables to build the network map An LSA contains: ID of the advertising router a sequence number information on every local link, including router ID of the other endpoint and link metric message parameters: LS age, type, etc. Routers store received LSAs in a link-state database the LSDB keeps all the most recent LSAs routers flood new LSAs in the database
12 Routers flood information about adjacencies If link was not previously in database or LSA seq. no. > stored seq. no then:. store the LSA in the database. send the LSA out of all interfaces except the one it arrived on else if LSA seq. no. < stored seq. no then: send the stored LSA back to that neighbour (it s out of date) else ignore the LSA (we ve already heard it).
13 Agenda We deepen how Link State routing protocols work. Sharing the map Finding links: Hello protocol Building the map: Flooding protocol Dealing with failures and partitions. Computing paths 3. Properties of Link State Routing 3
14 LS: No bouncing after link failures LS distributes complete information on the network no ambiguity on valid paths à no bouncing When a link fails, the network map is updated flood that link is down, everyone recalculates paths A D B E C 4
15 LS: No count to infinity Flooding also implies no count to infinity When the network partitions, each router will end up with a map of its connected component computes paths on that sub-map A D B E C 5
16 Can LS always heal partitions efficiently? Consider flooding behavior when partition heals Link D-E is restored Link C-E fails nearly at the same time A D B E C 6
17 Some cases seem tricky D detects link (D, E) is now up, and floods LSAs to A but A and D may still think link (C, E) exists! If this is the first time link (D, E) comes up, how will A and D learn about links (B, E) and (B, C)? A D B E C 7
18 Periodic state refreshes are inadequate OSPF sends new LSAs every 3 mins, even for unmodified links sent often à too much overhead sent not so often à too slow A D B E C 8
19 Let s think about the real problem Problem: A, D do not know the state of remote links think about (B,C) Root cause: flooding news for neighbouring links is not always sufficient A D B E C 9
20 Routers briefly sync on new adjacencies! Solution: Routers exchange LS database summaries when they form new adjacencies upon new adjacency, routers exchange lists of (link endpoints, sequence numbers) LS databases contain much more information à summaries save bandwidth each router then requests missing or newer entries anything new is flooded to all the other neighbours
21 Agenda We deepen how Link State routing protocols work. Sharing the map Finding links: Hello protocol Building the map: Flooding protocol Dealing with failures and partitions. Computing paths 3. Properties of Link State Routing
22 Link State Database à Routing Table After flooding, routers need to transform their map into a routing table How? Single-source shortest paths algorithm Given a graph, the algorithm computes path with least cost from s to all other vertices In LS, each router views itself as source s, and all other routers as destinations
23 Shortest Paths: Definitions Each router is a vertex, v V Each link is an edge, e E, also written (u, v) Each link metric maps to an edge weight, w(u, v) A path is a sequence of edges Path cost is sum of edges weights 3
24 Shortest Paths: Definitions Data structures: π[v] is predecessor of v: π[v] is vertex before v along current shortest path from s to v d[v] is shortest path estimate: least cost found from s to v so far 4
25 Shortest Paths: Initialization When we start, we know little: no cost estimate for any path from s to any other vertex no predecessor of v along shortest path from s to any v ini#alize-single-source(v, s) for each vertex v V do d[v] ß π[v] ß NULL d[s] = 5
26 Shortest Paths Building Block: Relaxation Relaxation of an edge: Suppose we have current estimates d[u], d[v] of shortest path cost from s to u and v Does it reduce the cost of the shortest path from s to v to reach v via edge (u, v)? relax(u, v, w) if d[v] > d[u] + w(u, v): d[v] ß d[u] + w(u, v) π[v] ß u 6
27 Relaxation: Example Suppose d[u] = 5 d[v] = 9 w(u, v) = relax(u, v, w) computes: is d[v] > d[u] + w(u, v)? is 9 > 5 +? u v 5 9 relax(u, v) u v 5 7 Yes, so reaching v via (u, v) reduces path cost d[v] ß d[u] + w(u, v) π[v] ß u 7
28 Dijkstra s Algorithm: Overall Strategy. Maintain running estimates of costs of shortest paths to all vertices (initially all infinity). Keep a set S of vertices that are finished ; shortest paths to these vertices already found (initially empty) 3. Pick the unfinished vertex v with smallest shortest path cost estimate 4. Add v to set S 5. Relax all edges leaving v 6. Repeat from 3. [Note: only correct for graphs where edge weights are not negative!] 8
29 Dijkstra s Algorithm: Pseudocode Dijkstra(V, E, w, s) ini#alize-single-source(v, s) S ß extract-min(q): Q ß V return vertex v from Q while Q do that has minimal shortestpath estimate d[v]; u ß extract-min(q) S ß S {u} remove v from Q for each vertex v that neighbors u relax(u, v, w) 9
30 Dijkstra s Algorithm: Example s 5 u 3 x v y 6 s 5 u 3 5 x v y 6 s: source d[i]: number inside of vertex i π[b]: if (a, b) is red, then π[b] = a members of set S: blue vertices members of priority queue Q: grey vertices 3
31 Dijkstra s Algorithm Example (cont d) 3 5 u v y x v y x u u v y x s v y x u s s s 7 8 9
32 Dijkstra s Algorithm Example (cont d) s 5 u x v 9 7 y 6 s 5 u x v 9 7 y 6 At termination, we know shortest-path routes from s to all other routers Shortest-path tree, rooted at s 3
33 Dijkstra s Algorithm: Pseudocode Dijkstra(V, E, w, s) ini#alize-single-source(v, s) S ß extract-min(q): Q ß V return vertex v from Q while Q do that has minimal shortestpath estimate d[v]; u ß extract-min(q) S ß S {u} remove v from Q for each vertex v that neighbors u relax(u, v, w) 33
34 Dijkstra s Algorithm: Efficiency Implement Q with binary heap total cost to insert V entries into Q: O(V) Cost of all extract-min() calls is O(V log V) cost of single call: O(log N), if N items in Q V calls, since the initial size of Q is V Cost of all relax() is O(E log V) cost of single call: O(log V) each call reduces d[] value for one vertex in Q at most E calls 34
35 Dijkstra s Algorithm: Efficiency (cont d) Total algorithm cost: O((V + E) log V) or O(E log V) when all vertices are reachable from the source Dijsktra runs in POLYNOMIAL time! fast in practice Also, note that most networks are sparse graphs E << V à Dijkstra algorithm is almost linear 35
36 Agenda We deepen how Link State routing protocols work. Sharing the map Finding links: Hello protocol Building the map: Flooding protocol Dealing with failures and partitions. Computing paths 3. Properties of Link State Routing 36
37 Link State Routing: Properties At first glance, flooding status of all links seems costly cost reasonable for hundreds of routers vanilla LS doesn t scale indefinitely e.g., for thousands of nodes yet, scalability can be improved with hierarchy In practice, LS has won over DV LS is more commonly used, especially in large (ISP) networks, where routing is critical DV rarely used except in small networks e.g., enterprise ones 37
38 Performance Comparison with Distance Vector LS has more guarantees and better performance than DV no loops after flooding, provided all nodes have consistent link state databases flooding à faster convergence after topology changes However, LS is also more complex to implement than DV sequence numbers crucial to protect against stale announcements adjacencies have to be established and maintained link state database is needed 38
39 Disclaimer: The real world is more complex Yet, LS does not solve all problems e.g., transient loops during convergence Such problems are relevant in practice connectivity is of utmost relevance: % uptime à max downtime: 5.6 minutes / year They attracted many industrial and research efforts Loop Free Alternate (LFA) and all its variants progressive metric increment 39
40 Disclaimer: The real world is more complex Also, network operators face more requirements avoid congestion, enforce firewall traversal, Routers primitives and Traffic Engineering (TE) techniques enable routing on non-shortest paths Big players started to develop their own routing systems even centralized: Google B4 [3], Microsoft SWAN [3], Google BwE [5], and this seems just an interesting beginning! 4
Link State Routing. Brad Karp UCL Computer Science. CS 3035/GZ01 3 rd December 2013
Link State Routing Brad Karp UCL Computer Science CS 33/GZ 3 rd December 3 Outline Link State Approach to Routing Finding Links: Hello Protocol Building a Map: Flooding Protocol Healing after Partitions:
More informationOSPF Fundamentals. Agenda. OSPF Principles. L41 - OSPF Fundamentals. Open Shortest Path First Routing Protocol Internet s Second IGP
OSPF Fundamentals Open Shortest Path First Routing Protocol Internet s Second IGP Agenda OSPF Principles Introduction The Dijkstra Algorithm Communication Procedures LSA Broadcast Handling Splitted Area
More informationOSPF - Open Shortest Path First. OSPF Fundamentals. Agenda. OSPF Topology Database
OSPF - Open Shortest Path First OSPF Fundamentals Open Shortest Path First Routing Protocol Internet s Second IGP distance vector protocols like RIP have several dramatic disadvantages: slow adaptation
More informationCS 457 Lecture 16 Routing Continued. Spring 2010
CS 457 Lecture 16 Routing Continued Spring 2010 Scaling Link-State Routing Overhead of link-state routing Flooding link-state packets throughout the network Running Dijkstra s shortest-path algorithm Introducing
More informationLecture 8 Link-State Routing
6998-02: Internet Routing Lecture 8 Link-State Routing John Ioannidis AT&T Labs Research ji+ir@cs.columbia.edu Copyright 2002 by John Ioannidis. All Rights Reserved. Announcements Lectures 1-5, 7-8 are
More informationNetwork Layer (Routing)
Network Layer (Routing) Where we are in the ourse Moving on up to the Network Layer! Application Transport Network Link Physical SE 61 University of Washington Topics Network service models Datagrams (packets),
More informationIntroduction to OSPF. ISP Workshops. Last updated 11 November 2013
Introduction to OSPF ISP Workshops Last updated 11 November 2013 1 OSPF p Open Shortest Path First p Open: n Meaning an Open Standard n Developed by IETF (OSPF Working Group) for IP RFC1247 n Current standard
More informationCSE/EE 461. Link State Routing. Last Time. This Lecture. Routing Algorithms Introduction Distance Vector routing (RIP)
CSE/EE 46 Link State Routing Last Time Routing Algorithms Introduction Distance Vector routing (RIP) Application Presentation Session Transport Network Data Link Physical This Lecture Routing Algorithms
More informationROUTING PROTOCOLS. Dr. Ahmed Khattab. EECE Department Cairo University Fall 2012 ELC 659/ELC724
ROUTING PROTOCOLS Dr. Ahmed Khattab EECE Department Cairo University Fall 2012 ELC 659/ELC724 Dr. Ahmed Khattab Fall 2012 2 Routing Network-wide process the determine the end to end paths that packets
More informationLink-state protocols and Open Shortest Path First (OSPF)
Fixed Internetworking Protocols and Networks Link-state protocols and Open Shortest Path First (OSPF) Rune Hylsberg Jacobsen Aarhus School of Engineering rhj@iha.dk 0 ITIFN Objectives Describe the basic
More informationDistance-Vector Routing
Distance-Vector Routing Antonio Carzaniga Faculty of Informatics University of Lugano June 8, 2007 c 2005 2007 Antonio Carzaniga 1 Recap on link-state routing Distance-vector routing Bellman-Ford equation
More informationConfiguring OSPF. Information About OSPF CHAPTER
CHAPTER 22 This chapter describes how to configure the ASASM to route data, perform authentication, and redistribute routing information using the Open Shortest Path First (OSPF) routing protocol. The
More informationComputer Networks II
ipartimento di Informatica e Sistemistica omputer Networks II Routing protocols Overview Luca Becchetti Luca.Becchetti@dis.uniroma.it.. 2009/200 Goals escribe approaches and give overview of mechanisms
More informationLink State Routing. In particular OSPF. dr. C. P. J. Koymans. Informatics Institute University of Amsterdam. March 4, 2008
Link State Routing In particular OSPF dr. C. P. J. Koymans Informatics Institute University of Amsterdam March 4, 2008 dr. C. P. J. Koymans (UvA) Link State Routing March 4, 2008 1 / 70 1 Link State Protocols
More informationIntroduction to Local and Wide Area Networks
Introduction to Local and Wide Area Networks Lecturers Amnach Khawne Jirasak Sittigorn Chapter 1 1 Routing Protocols and Concepts Chapter 10 : Link-State Routing Protocols Chapter 11 : OSPF Chapter 1 2
More informationConfiguring the maximum number of external LSAs in LSDB 27 Configuring OSPF exit overflow interval 28 Enabling compatibility with RFC Logging
Contents Configuring OSPF 1 Overview 1 OSPF packets 1 LSA types 1 OSPF areas 2 Router types 4 Route types 5 Route calculation 6 OSPF network types 6 DR and BDR 6 Protocols and standards 8 OSPF configuration
More informationOSPF Domain / OSPF Area. OSPF Advanced Topics. OSPF Domain / OSPF Area. Agenda
OSPF Domain / OSPF Area OSPF Advanced Topics Areas,, Backbone, Summary-LSA, ASBR, Stub Area, Route Summarization, Virtual Links, Header Details OSPF domain can be divided in multiple OSPF areas to improve
More informationJunos Intermediate Routing
Junos Intermediate Routing Chapter 4: Open Shortest Path First 2012 Juniper Networks, Inc. All rights reserved. www.juniper.net Worldwide Education Services Chapter Objectives After successfully completing
More information4.4 Shortest Paths in a Graph Revisited
4.4 Shortest Paths in a Graph Revisited shortest path from computer science department to Einstein's house Algorithm Design by Éva Tardos and Jon Kleinberg Slides by Kevin Wayne Copyright 2004 Addison
More informationOSPF for IPv6. ISP Workshops
OSPF for IPv6 ISP Workshops These materials are licensed under the Creative Commons Attribution-NonCommercial 4.0 International license (http://creativecommons.org/licenses/by-nc/4.0/) Last updated 17
More informationInternet Routing Protocols Lecture 02 Intra-domain Routing
Internet Routing Protocol Lecture Intra-domain Routing dvanced Sytem Topic Lent Term, 8 Timothy G. Griffin Computer Lab Cambridge UK Shortet Path Generalize ditance to weighted etting igraph G = (V,E)
More informationKillTest *KIJGT 3WCNKV[ $GVVGT 5GTXKEG Q&A NZZV ]]] QORRZKYZ IUS =K ULLKX LXKK [VJGZK YKX\OIK LUX UTK _KGX
KillTest Q&A Exam : JN0-643 Title : Enterprise Routing and Switching, Professional (JNCIP-ENT) Version : Demo 1 / 10 1.Which connection method do OSPF routers use to communicate with each other? A. IP
More informationTable of Contents. OSPF Configuration 1
Table of Contents OSPF Configuration 1 Introduction to OSPF 1 Basic Concepts 2 Area Based OSPF Network Partition 3 Router Types 7 Classification of OSPF Networks 9 DR and BDR 9 OSPF Packet Formats 11 Supported
More informationITE PC v4.0. Chapter Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF Routing Protocols and Concepts Chapter 11 1 Objectives Describe the background and basic features of OSPF Identify and apply the basic OSPF configuration commands Describe, modify and calculate l
More informationLecture 18: Network Layer Link State and Distance Vector Routing
Lecture 8: Network Laer Link State and Distance Vector Routing COMP 33, Spring 08 Victoria Manfredi Acknowledgements: materials adapted Computer Networking: A Top Down Approach 7 th edition: 996-06, J.F
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Josh Broch, David Maltz, David Johnson, Yih-Chun Hu and Jorjeta Jetcheva Computer Science Department Carnegie Mellon University
More informationLink State Routing. In particular OSPF. Karst Koymans. Informatics Institute University of Amsterdam. (version 16.3, 2017/03/09 11:25:31)
Link State Routing In particular OSPF Karst Koymans Informatics Institute University of Amsterdam (version 16.3, 2017/03/09 11:25:31) Tuesday, March 7, 2017 Karst Koymans (UvA) Link State Routing Tuesday,
More informationLink State Routing. In particular OSPF. Karst Koymans. Informatics Institute University of Amsterdam. (version 17.4, 2017/11/30 12:33:57)
Link State Routing In particular OSPF Karst Koymans Informatics Institute University of Amsterdam (version 17.4, 2017/11/30 12:33:57) Tuesday, November 28, 2017 Karst Koymans (UvA) Link State Routing Tuesday,
More informationCCNA Routing and Switching Study Guide Chapters 5 & 19: Multi-Area OSPF
CCNA Routing and Switching Study Guide Chapters 5 & 19: Multi-Area OSPF Instructor & Todd Lammle Chapter 20 objectives The ICND2 topics covered in this chapter include: IP Routing Technologies Configure
More informationQuestion No: 2 In an OSPF Hello packet, which of the following fields must match for all neighbor routers on the segment? Choose three answers.
Volume: 335 Questions Question No: 1 What is the default preference value for a static route in the Alcatel-Lucent 7750 SR? A. 0 B. 5 C. 10 D. 15 Answer: B Question No: 2 In an OSPF Hello packet, which
More informationGuide to OSPF Application on the CSS 11000
Guide to OSPF Application on the CSS 11000 Document ID: 12638 Contents Introduction Before You Begin Conventions Prerequisites Components Used Description OSPF Configuration Task List Configuration Global
More informationOSPF. Routing Protocols and Concepts Chapter 11. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved. Cisco Public
OSPF Routing Protocols and Concepts Chapter 11 1 Objectives Describe the background and basic features of OSPF Identify and apply the basic OSPF configuration commands Describe, modify and calculate the
More informationLink State Routing. Link state routing principles Dijkstra s shortest-path-first algorithm The OSPF protocol. (Chapter 6 in Huitema) E7310/Comnet 1
Link State Routing Link state routing principles Dijkstra s shortest-path-first algorithm The OSPF protocol (Chapter 6 in Huitema) 7310/Comnet 1 Link State Routing Principles 7310/Comnet 2 Link state routing
More informationConfiguring OSPF. The Cisco OSPF Implementation
Configuring OSPF This chapter describes how to configure Open Shortest Path First (OSPF). For a complete description of the OSPF commands in this chapter, refer to the OSPF s chapter of the Cisco IOS IP
More informationOSPF. Routing Protocols and Concepts Chapter 11
OSPF Routing Protocols and Concepts Chapter 11 Objectives Describe the background and basic features of OSPF Identify and apply the basic OSPF configuration commands Describe, modify and calculate the
More informationScalable Routing Protocols for Mobile Ad Hoc Networks
Helsinki University of Technology T-79.300 Postgraduate Course in Theoretical Computer Science Scalable Routing Protocols for Mobile Ad Hoc Networks Hafeth Hourani hafeth.hourani@nokia.com Contents Overview
More informationRouting Algorithm Classification. A Distance Vector Routing Algorithm
Routing lgorithm lassification Global or decentralied information? Global: ll routers have complete topolog, link cost info Link state algorithms Decentralied: Router knows phsicallconnected neighbors,
More informationEnergy-Efficient MANET Routing: Ideal vs. Realistic Performance
Energy-Efficient MANET Routing: Ideal vs. Realistic Performance Paper by: Thomas Knuz IEEE IWCMC Conference Aug. 2008 Presented by: Farzana Yasmeen For : CSE 6590 2013.11.12 Contents Introduction Review:
More informationmaterial. For more information on how to get additional questions, please see a.
Review Questions The following questions are designed to test your understanding of this chapter s material. For more information on how to get additional questions, please see www.lammle.com/ccn a. You
More informationSimulative Comparison of MPLS Protection Switching vs. OSPF Re-routing
C O R P O R A T E T E C H N O L O Y Simulative Comparison of MPLS Protection Switching vs. OSPF Re-routing nformation & Sandrine PASQUALINI Antoine FROT Andreas Iselt Andreas Kirstädter C O R P O R A T
More informationA Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks
A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks Elisabeth M. Royer, Chai-Keong Toh IEEE Personal Communications, April 1999 Presented by Hannu Vilpponen 1(15) Hannu_Vilpponen.PPT
More informationRouting and Wavelength Assignment in All-Optical DWDM Transport Networks with Sparse Wavelength Conversion Capabilities. Ala I. Al-Fuqaha, Ph.D.
Routing and Wavelength Assignment in All-Optical DWDM Transport Networks with Sparse Wavelength Conversion Capabilities Ala I. Al-Fuqaha, Ph.D. Overview Transport Network Architectures: Current Vs. IP
More informationBabel A flexible routing protocol
Babel A flexible routing protocol Juliusz Chroboczek PPS Université Paris-Diderot (Paris 7) 11 March 2014 1/33 The story In December 2006, I started on a quest to bring wifi to the Ph.D. students couch:
More informationolsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra
olsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra www.scii.nl/~elektra Introduction Olsr.org is aiming to an efficient opensource routing solution for wireless networks Work
More informationCSS 343 Data Structures, Algorithms, and Discrete Math II. Balanced Search Trees. Yusuf Pisan
CSS 343 Data Structures, Algorithms, and Discrete Math II Balanced Search Trees Yusuf Pisan Height Height of a tree impacts how long it takes to find an item Balanced tree O(log n) vs Degenerate tree O(n)
More informationFoundations of Distributed Systems: Tree Algorithms
Foundations of Distributed Systems: Tree Algorithms Stefan Schmid @ T-Labs, 2011 Broadcast Why trees? E.g., efficient broadcast, aggregation, routing,... Important trees? E.g., breadth-first trees, minimal
More informationIP Routing: OSPF Configuration Guide, Cisco IOS Release 12.2SX
IP Routing: OSPF Configuration Guide, Cisco IOS Release 12.2SX Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS
More informationM U LT I C A S T C O M M U N I C AT I O N S. Tarik Cicic
M U LT I C A S T C O M M U N I C AT I O N S Tarik Cicic 9..08 O V E R V I E W One-to-many communication, why and how Algorithmic approach: Steiner trees Practical algorithms Multicast tree types Basic
More informationIP Routing: OSPF Configuration Guide, Cisco IOS XE Release 2
IP Routing: OSPF Configuration Guide, Cisco IOS XE Release 2 Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS
More informationGrundlagen der Rechnernetze. Introduction
Grundlagen der Rechnernetze Introduction Overview Building blocks and terms Basics of communication Addressing Protocols and Layers Performance Historical development Grundlagen der Rechnernetze Introduction
More informationData Dissemination in Wireless Sensor Networks
Data Dissemination in Wireless Sensor Networks Philip Levis UC Berkeley Intel Research Berkeley Neil Patel UC Berkeley David Culler UC Berkeley Scott Shenker UC Berkeley ICSI Sensor Networks Sensor networks
More informationEnergy Saving Routing Strategies in IP Networks
Energy Saving Routing Strategies in IP Networks M. Polverini; M. Listanti DIET Department - University of Roma Sapienza, Via Eudossiana 8, 84 Roma, Italy 2 june 24 [scale=.8]figure/logo.eps M. Polverini
More informationSemiring Pruning for Information Dissemination in Mobile Ad Hoc Networks
2009 First International Conference on Networks & Communications Semiring Pruning for Information Dissemination in Mobile Ad Hoc Networks Kiran K. Somasundaram, John S. Baras Institute of Systems Research
More informationIP Routing: OSPF Configuration Guide, Cisco IOS XE Release 3SE (Catalyst 3650 Switches)
IP Routing: OSPF Configuration Guide, Cisco IOS XE Release 3SE (Catalyst 3650 Switches) First Published: dd, yyyy Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706
More informationOSPF. OSPF Areas. BSCI Module Cisco Systems, Inc. All rights reserved. Cisco Public. Review of OSPF area characteristics:
OSPF BSCI Module 3 1 Minimizes routing table entries Localizes impact of a topology change within an area Detailed LSA flooding stops at the area boundary Requires a hierarchical network design OSPF Areas
More informationSemiring Pruning for Information Dissemination in Mobile Ad Hoc Networks
The InsTITuTe for systems research Isr TechnIcal report 2009-8 Semiring Pruning for Information Dissemination in Mobile Ad Hoc Networks Kiran K. Somasundaram, John S. Baras Isr develops, applies and teaches
More informationIP Routing: OSPF Configuration Guide, Cisco IOS Release 12.4
IP Routing: OSPF Configuration Guide, Cisco IOS Release 12.4 Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS
More informationSybex ICND Chapter 4 and 18: OSPF. Instructor & Todd Lammle
Sybex ICND2 200-105 Chapter 4 and 18: OSPF Instructor & Todd Lammle Chapter 4 objectives The ICND2 topics covered in this chapter include: 2 OSPF design example. An OSPF hierarchical design minimizes routing
More informationStanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011 Lecture 9 In which we introduce the maximum flow problem. 1 Flows in Networks Today we start talking about the Maximum Flow
More informationVolume 5, Issue 3, March 2017 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) e-isjn: A4372-3114 Impact Factor: 6.047 Volume 5, Issue 3, March 2017 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey
More informationFrom Shared Memory to Message Passing
From Shared Memory to Message Passing Stefan Schmid T-Labs / TU Berlin Some parts of the lecture, parts of the Skript and exercises will be based on the lectures of Prof. Roger Wattenhofer at ETH Zurich
More informationWireless Internet Routing. IEEE s
Wireless Internet Routing IEEE 802.11s 1 Acknowledgments Cigdem Sengul, Deutsche Telekom Laboratories 2 Outline Introduction Interworking Topology discovery Routing 3 IEEE 802.11a/b/g /n /s IEEE 802.11s:
More informationAIMA 3.5. Smarter Search. David Cline
AIMA 3.5 Smarter Search David Cline Uninformed search Depth-first Depth-limited Iterative deepening Breadth-first Bidirectional search None of these searches take into account how close you are to the
More informationRev a. Single-Area OSPF. c cnac o okbook.com
Rev. 00.00 a. Single-Area OSPF c cnac o okbook.com C O N F I G U R A T I O N Technically, we're using OSPFv for IPv, but that only matters because IPv uses OSPFv. Wildcard a bitmask controlling address
More informationOSPF Inbound Filtering Using Route Maps with
OSPF Inbound Filtering Using Route Maps with a Distribute List Finding Feature Information OSPF Inbound Filtering Using Route Maps with a Distribute List Last Updated: July 19, 2011 The OSPF Inbound Filtering
More informationWireless Network Security Spring 2014
Wireless Network Security 14-814 Spring 2014 Patrick Tague Class #5 Jamming 2014 Patrick Tague 1 Travel to Pgh: Announcements I'll be on the other side of the camera on Feb 4 Let me know if you'd like
More informationBBS: Lian et An al. Energy Efficient Localized Routing Scheme. Scheme for Query Processing in Wireless Sensor Networks
International Journal of Distributed Sensor Networks, : 3 54, 006 Copyright Taylor & Francis Group, LLC ISSN: 1550-139 print/1550-1477 online DOI: 10.1080/1550130500330711 BBS: An Energy Efficient Localized
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture : Graph Problems and Dijkstra s algorithm Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More informationRouting Messages in a Network
Routing Messages in a Network Reference : J. Leung, T. Tam and G. Young, 'On-Line Routing of Real-Time Messages,' Journal of Parallel and Distributed Computing, 34, pp. 211-217, 1996. J. Leung, T. Tam,
More informationLab Topology R16 R12 R15. Lo R /32 R /32 R /32 R /32 R / /
Lab Topology R16 So-5/0/0 So-4/2/0 100.3.0/30 100.5.0/30 So-1/3/0 100.0/30 So-1/0/0 So-2/0/0 So-2/1/0 Ge-2/3/0 Ge-1/2/0 R6 So-0/3/0 100.0/30 So-4/0/0 R12 So-3/0/0 100.4.0/30 So-1/0/0 R15 100.6.0/30 R7
More informationOSPF Enhanced Traffic Statistics for OSPFv2 and OSPFv3
OSPF Enhanced Traffic Statistics for OSPFv2 and OSPFv3 This document describes new and modified commands that provide enhanced OSPF traffic statistics for OSPFv2 and OSPFv3. The ability to collect and
More informationCisco IOS IP Routing: OSPF Command Reference
Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 THE SPECIFICATIONS AND INFORMATION
More informationData Gathering. Chapter 4. Ad Hoc and Sensor Networks Roger Wattenhofer 4/1
Data Gathering Chapter 4 Ad Hoc and Sensor Networks Roger Wattenhofer 4/1 Environmental Monitoring (PermaSense) Understand global warming in alpine environment Harsh environmental conditions Swiss made
More informationBasics of Routing and Link-State Routing
Basics of Routing and Link-State Routing Antonio Carzaniga Faculty of Informatics Università della Svizzera italiana December 6, 206 Outline Routing problem Graph model Classes of routing algorithms Broadcast
More informationMITOCW R18. Quiz 2 Review
MITOCW R18. Quiz 2 Review The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To
More informationLectures: Feb 27 + Mar 1 + Mar 3, 2017
CS420+500: Advanced Algorithm Design and Analysis Lectures: Feb 27 + Mar 1 + Mar 3, 2017 Prof. Will Evans Scribe: Adrian She In this lecture we: Summarized how linear programs can be used to model zero-sum
More informationUMBC 671 Midterm Exam 19 October 2009
Name: 0 1 2 3 4 5 6 total 0 20 25 30 30 25 20 150 UMBC 671 Midterm Exam 19 October 2009 Write all of your answers on this exam, which is closed book and consists of six problems, summing to 160 points.
More informationProblem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1
Solutions for Homework 2 Networked Life, Fall 204 Prof Michael Kearns Due as hardcopy at the start of class, Tuesday December 9 Problem (5 points: Graded by Shahin) Recall the network structure of our
More informationUNIVERSITY of PENNSYLVANIA CIS 391/521: Fundamentals of AI Midterm 1, Spring 2010
UNIVERSITY of PENNSYLVANIA CIS 391/521: Fundamentals of AI Midterm 1, Spring 2010 Question Points 1 Environments /2 2 Python /18 3 Local and Heuristic Search /35 4 Adversarial Search /20 5 Constraint Satisfaction
More informationOverview. Ad Hoc and Wireless Mesh Networking. Ad hoc network. Ad hoc network
Ad Hoc and Wireless Mesh Networking Laura Marie Feeney lmfeeney@sics.se Datakommunikation III, HT 00 Overview Ad hoc and wireless mesh networks Ad hoc network (MANet) operates independently of network
More informationThe Pennsylvania State University. The Graduate School. College of Engineering PERFORMANCE ANALYSIS OF END-TO-END
The Pennsylvania State University The Graduate School College of Engineering PERFORMANCE ANALYSIS OF END-TO-END SMALL SEQUENCE NUMBERS ROUTING PROTOCOL A Thesis in Computer Science and Engineering by Jang
More informationWireless Mesh Networks
Wireless Mesh Networks Renato Lo Cigno www.disi.unitn.it/locigno/teaching Part of this material (including some pictures) features and are freely reproduced from: Ian F.Akyildiz, Xudong Wang,Weilin Wang,
More informationPERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR P INCLUDING PROPAGATION MODELS
PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR 802.11P INCLUDING PROPAGATION MODELS Mit Parmar 1, Kinnar Vaghela 2 1 Student M.E. Communication Systems, Electronics & Communication Department, L.D. College
More informationA Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information
A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information Xin Yuan Wei Zheng Department of Computer Science, Florida State University, Tallahassee, FL 330 {xyuan,zheng}@cs.fsu.edu
More informationGAME THEORY MANET ROUTING FOR JAMMING ENVIRONMENT. Yi Zhu
GAME THEORY MANET ROUTING FOR JAMMING ENVIRONMENT by Yi Zhu A thesis submitted to the Faculty of the University of Delaware in partial fulfillment of the requirements for the degree of Master of Science
More informationOutline for today s lecture Informed Search Optimal informed search: A* (AIMA 3.5.2) Creating good heuristic functions Hill Climbing
Informed Search II Outline for today s lecture Informed Search Optimal informed search: A* (AIMA 3.5.2) Creating good heuristic functions Hill Climbing CIS 521 - Intro to AI - Fall 2017 2 Review: Greedy
More informationPRIORITY QUEUES AND HEAPS
PRIORITY QUEUES AND HEAPS Lecture 1 CS2110 Fall 2014 Reminder: A4 Collision Detection 2 Due tonight by midnight Readings and Homework 3 Read Chapter 2 A Heap Implementation to learn about heaps Exercise:
More informationLink-State Routing in Networks with Unidirectional Links
Link-State Routing in Networks with Unidirectional Links LICHUN BAO Computer Science Department University of California Santa Cruz, CA 95064 baolc@cse.ucsc.edu J. J. GARCIA-LUNA-ACEVES Computer Engineering
More informationPapers. Ad Hoc Routing. Outline. Motivation
CS 15-849E: Wireless Networks (Spring 2006) Ad Hoc Routing Discussion Leads: Abhijit Deshmukh Sai Vinayak Srinivasan Seshan Dave Andersen Papers Outdoor Experimental Comparison of Four Ad Hoc Routing Algorithms
More informationPerformance comparison of AODV, DSDV and EE-DSDV routing protocol algorithm for wireless sensor network
Performance comparison of AODV, DSDV and EE-DSDV routing algorithm for wireless sensor network Mohd.Taufiq Norhizat a, Zulkifli Ishak, Mohd Suhaimi Sauti, Md Zaini Jamaludin a Wireless Sensor Network Group,
More informationLecture 20: Combinatorial Search (1997) Steven Skiena. skiena
Lecture 20: Combinatorial Search (1997) Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Give an O(n lg k)-time algorithm
More informationTravel time uncertainty and network models
Travel time uncertainty and network models CE 392C TRAVEL TIME UNCERTAINTY One major assumption throughout the semester is that travel times can be predicted exactly and are the same every day. C = 25.87321
More informationGlobal State and Gossip
Global State and Gossip CS 240: Computing Systems and Concurrency Lecture 6 Marco Canini Credits: Indranil Gupta developed much of the original material. Today 1. Global snapshot of a distributed system
More informationQuality-of-Service Provisioning for Multi-Service TDMA Mesh Networks
Quality-of-Service Provisioning for Multi-Service TDMA Mesh Networks Petar Djukic and Shahrokh Valaee 1 The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto
More informationCMPUT 396 Tic-Tac-Toe Game
CMPUT 396 Tic-Tac-Toe Game Recall minimax: - For a game tree, we find the root minimax from leaf values - With minimax we can always determine the score and can use a bottom-up approach Why use minimax?
More informationCOMP Online Algorithms. Paging and k-server Problem. Shahin Kamali. Lecture 11 - Oct. 11, 2018 University of Manitoba
COMP 7720 - Online Algorithms Paging and k-server Problem Shahin Kamali Lecture 11 - Oct. 11, 2018 University of Manitoba COMP 7720 - Online Algorithms Paging and k-server Problem 1 / 19 Review & Plan
More informationRobonet - MANET for Robot Communication
Robonet - MANET for Robot Communication Authors: Stiven Andre Supervisor: Aram Movsisian Motivation Robotic developers need a way for robots to communicate. Swarm of robots want to communicate in a constantly
More informationMonitoring Churn in Wireless Networks
Monitoring Churn in Wireless Networks Stephan Holzer 1 Yvonne-Anne Pignolet 2 Jasmin Smula 1 Roger Wattenhofer 1 {stholzer, smulaj, wattenhofer}@tik.ee.ethz.ch, yvonne-anne.pignolet@ch.abb.com 1 Computer
More informationOSPF Nonstop Routing. Finding Feature Information. Prerequisites for OSPF NSR
The feature allows a device with redundant Route Processors (RPs) to maintain its Open Shortest Path First (OSPF) state and adjacencies across planned and unplanned RP switchovers. The OSPF state is maintained
More informationConnected Identifying Codes
Connected Identifying Codes Niloofar Fazlollahi, David Starobinski and Ari Trachtenberg Dept. of Electrical and Computer Engineering Boston University, Boston, MA 02215 Email: {nfazl,staro,trachten}@bu.edu
More information