Lecture 18: Network Layer Link State and Distance Vector Routing
|
|
- Sylvia Austin
- 5 years ago
- Views:
Transcription
1 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: , J.F Kurose and K.W. Ross, All Rights Reserved as well as slides b Abraham Matta at Boston Universit, and some material Computer Networks b Tannenbaum and Wetherall.
2 . Announcements homework 6 due toda b :59p homework 7 posted but will likel make minor clarifications to programming part. Control plane link state routing distance vector routing compare link state vs. distance vector 3. Network programming raw sockets and bte packing vumanfredi@weslean.edu
3 Control Plane 3
4 Link state: i.e., network topolog, link costs known to all nodes, accomplished via link state broadcast msg sent to ever other node in network all nodes have same global info Computes least cost paths one source node to all other nodes obtain forwarding table for that node Given path, put st hop router for each dst in forwarding table Iterative after k iterations, know least cost path to k destinations if n nodes, loop n times vumanfredi@weslean.edu 4
5 c(,): link cost node to D(v): current cost source u to dst node v p(v): predecessor node along path source u to v N': set of nodes whose least cost path definitivel known Step N' u D(v),p(v),u D(w),p(w) 5,u D(),p(),u D(),p() D(),p() Source node u 5 v 3 3 w 5 Initialiation N' = {u} for all nodes v if v adjacent to u then D(v) = c(u,v) else D(v) = 5
6 c(,): link cost node to D(v): current cost source u to dst node v p(v): predecessor node along path source u to v N': set of nodes whose least cost path definitivel known Step Source node u N' D(v),p(v) D(w),p(w) D(),p() D(),p() D(),p() u,u 5,u,u u,u 4,, u,u 3, 4, uv 3, 4, uvw 4, uvw 5 v 3 3 w 5 Loop Find w N' s.t. D(w) is min Add w to N' Update D(v) for all neighbors v N' of w D(v) = min( D(v), D(w)+c(w,v) ) Until all nodes in N' 6
7 Step N' D(v),p(v) D(w),p(w) D(),p() D(),p() D(),p() u,u 5,u,u u,u 4,, u,u 3, 4, uv 3, 4, uvw 4, uvw Source node u Resulting shortest path tree 5 v 3 3 w 5 Forwarding table at u dst v w link (u,v) (u,) (u,) (u,) (u,) 7
8 Each iteration: need to check all nodes not in N n(n+)/ comparisons: O(n ), more efficient implementations possible Network is dnamic link goes down: link state broadcast router goes down: remove link and all nodes recompute Oscillations possible when congestion or dela-based link cost initiall w +e e e recompute routing w +e 0 0 +e 0, detect better path recompute w 0 +e 0 0 +e,, detect better path Need to prevent routers snchroniing computations: Have routers randomie when the send out link advertisements 8
9 Control Plane 9
10 Distance vector (DV) vector of best known costs router to each dst and link to use Each node maintains Link cost to each neighbor v c(,v) s own DV D (): estimate of least cost path to node D = [D (): є N ] DV for each nbr v D v (): estimate of least cost path neighbor v to node D v = [D v (): є N ] Each node periodicall sends its own DV to neighbors rather than link state costs vumanfredi@weslean.edu 0
11 Uses dnamic programming break problem into simpler sub-problems solve each sub-problem once and store solution Bellman-Ford equation D () := cost of least-cost path to D () = min { c(,v) + D v () } for each node N v cost neighbor v to destination neighbor v min taken over all neighbors v of When receives new DV estimate neighbor updates its own DV using B-F equation vumanfredi@weslean.edu
12 Bellman-Ford equation u 5 v 3 3 w 5 D u () = min { c(u,v) + D v (), c(u,) + D (), c(u,w) + D w () } = min { + 5, + 3, 5 + 3} = 4 Where D v () = 5, D () = 3, D w () = 3 Node achieving minimum is net hop in shortest path put in forwarding table vumanfredi@weslean.edu
13 Initialiation For all dst є N if is nbr of D () = c(, ) else D () = For each nbr w and dst є N: D w () = Send s DV to all nbrs w D = [D () : є N] Loop waits for change in local link cost or DV msg neighbor recompute estimates D () = min v { c(,v) + D v () } if s DV to an dst has changed, notif neighbors Q: when does loop terminate? When no more changes 3
14 D () = min{c(,)+d (), c(,)+d ()} = min{+0, 7+} = D () = min{c(,)+d (), c(,)+d ()} = min{+, 7+0} = 3 Node Node Node 7 0 vumanfredi@weslean.edu 4 time
15 D () = min{c(,)+d (), c(,)+d ()} = min{+0, 7+} = D () = min{c(,)+d (), c(,)+d ()} = min{+, 7+0} = 3 Node Node Node D () = min{c(,)+d (), c(,)+d ()} = min{7+0, +} = 3 7 vumanfredi@weslean.edu 5 time
16 Node Node Node No 0 change: 7 don t 0 send 7 out DV vumanfredi@weslean.edu 6 time
17 Node Node No 0 change: 7 don t 0 send 7 out DV0 No 0 change: 3 don t 0 send 3 out DV 0 No 0 change: 3 don t 0 send 3 out DV0 7 Node No 0 change: 3 don t 0 send 3 out DV 0 DONE vumanfredi@weslean.edu 7 time
18 . Updates routing info. Recalculates DV 3. If DV changes, notif neighbors 4 50 Good news travels fast t 0 : detects link-cost change, updates its DV, informs its neighbors t : receives update, updates its table, computes new least, sends its neighbors its DV t : receives s update, updates its distance table. Y s least costs do not change, so does not send a message to vumanfredi@weslean.edu 8
19 Count to infinit problem 44 iterations before algorithm stabilies Intuitivel when tells it has a path to, has no wa of knowing that is using on its path 60 Y Y D () = min{c(,)+d (), c(,) + D ()} = min{60+0, +5} = 6 Problem arises because Routing Loop still epects can get to with cost of 5 D () = min{c(,) + D (), c(,) + D ()} = min{50+0, +6} = 7 Count-to-infinit 9
20 If Z routes through Y to get to X Z tells Y its (Z s) distance to X is infinite (so Y won t route to X via Z) Y D () = min{c(,)+d (), c(,)+d ()} = min{60+0, + } = 60 Q: Will this completel solve count to infinit problem? no, onl for node loops Another proposed solution: hold time don t process route updates for period of time after route retraction ameliorates problem but does not solve vumanfredi@weslean.edu 0
21 Eas to implement likel ou will implement for hw8 :-) Distributed doesn t compute paths in isolation requires route info (path costs) computed b neighbors Iterative updates its DV whenever local link costs change DV update received nbr Asnchronous updates, echanges happen asnchronousl Self-terminating stops updating DV when no more changes received
22 Control Plane
23 Link state O(nE) messages sent ever node floods its link state message out over ever link in network to reach ever node smaller messages message sie depends on the number of neighbors a node has an link change requires a broadcast n nodes E links Distance vector # of messages depends on convergence time which varies nodes onl echange messages between neighbors larger routing update messages message sie is proportional to the number of nodes in the network if link changes don't affect shortest path, no message echange vumanfredi@weslean.edu 3
24 Link state n- Σ i= = n(n+)/ = O(n ) search through n- nodes to find min, recompute routes search through n- nodes to find min, recompute routes converges quickl but ma have oscillations route computation is centralied a node stores a complete view of the network n nodes E links Distance vector slow to converge and convergence time varies route computation is distributed ma be routing loops, count-to-infinit problem vumanfredi@weslean.edu 4
25 Link state node can advertise incorrect link cost each node computes onl its own table n nodes E links Distance vector DV node can advertise incorrect path cost each node s DV used b others: errors propagate through network Both have strengths and weaknesses. One or the other is used in almost ever network vumanfredi@weslean.edu 5
26 6
27 Network Programming 7
28 Take btes put into socket and push out of network interface no IP or transport laer headers added b operating sstem! Lets ou create our own transport and network laer headers set field values as ou choose e.g., time-to-live fields vumanfredi@weslean.edu 8
29 9
30 30
Routing 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 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 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 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 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 Routing. Stefano Vissicchio UCL Computer Science CS 3035/GZ01
Link State Routing Stefano Vissicchio UCL Computer Science CS 335/GZ Reminder: Intra-domain Routing Problem Shortest paths problem: What path between two vertices offers minimal sum of edge weights? Classic
More informationChapter 5: outline. Network-layer functions. Chapter 5: outline. Routing protocols. data plane. Logically centralized control plane
Chapter : otline. introdction. roting protocols distance ector. intra-as roting in the Netork-laer fnctions Recall: to netork-laer fnctions: forarding: moe packets roter s inpt to appropriate roter otpt
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 informationLink 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCSE 123: Computer Networks
Total Points = 27 CSE 123: Computer Networks Homework 3 Solutions Out: 5/11, Due: 5/18 Problems 1. Distance Vector Routing [9 points] For the network shown below, give the global distance vector tables
More informationAchieving Network Consistency. Octav Chipara
Achieving Network Consistency Octav Chipara Reminders Homework is postponed until next class if you already turned in your homework, you may resubmit Please send me your peer evaluations 2 Next few lectures
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 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 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 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 informationEnergy-Efficient Data Management for Sensor Networks
Energy-Efficient Data Management for Sensor Networks Al Demers, Cornell University ademers@cs.cornell.edu Johannes Gehrke, Cornell University Rajmohan Rajaraman, Northeastern University Niki Trigoni, Cornell
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 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 informationStructure of the Lecture. Radio Waves. Frequencies for Mobile Communication. Frequencies (MHz) and Regulations
Structure of the Lecture Chapter 2 Technical Basics: Laer Methods for Medium Access: Laer 2 Representation of digital signals on an analogous medium Signal propagation Characteristics of antennas Chapter
More informationOpportunistic Routing in Wireless Mesh Networks
Opportunistic Routing in Wireless Mesh Networks Amir arehshoorzadeh amir@ac.upc.edu Llorenç Cerdá-Alabern llorenc@ac.upc.edu Vicent Pla vpla@dcom.upv.es August 31, 2012 Opportunistic Routing in Wireless
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 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 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 informationCooperative Transmission Techniques on Ad Hoc, Multi-Hop Wireless Networks
UNIVERSITY OF PADOVA Cooperative Transmission Techniques on Ad Hoc, Multi-Hop Wireless Networks Student: Cristiano Tapparello Master of Science in Computer Engineering Advisor: Michele Rossi Bio Born in
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 informationAlgorithms and Data Structures: Network Flows. 24th & 28th Oct, 2014
Algorithms and Data Structures: Network Flows 24th & 28th Oct, 2014 ADS: lects & 11 slide 1 24th & 28th Oct, 2014 Definition 1 A flow network consists of A directed graph G = (V, E). Flow Networks A capacity
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 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 informationWireless Network Security Spring 2011
Wireless Network Security 14-814 Spring 2011 Patrick Tague Mar 22, 2011 Class #19 Cross-layer attacks and defenses Announcements Homework #3 is due March 24 Exam in class March 31 Agenda Cross-layer attacks
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 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 informationA GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS
A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS C. COMMANDER, C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE ABSTRACT. Ad hoc networks are composed of a set of wireless
More informationA GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks
MIC2005: The Sixth Metaheuristics International Conference??-1 A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks Clayton Commander Carlos A.S. Oliveira Panos M. Pardalos Mauricio
More informationAdvanced Modeling and Simulation of Mobile Ad-Hoc Networks
Advanced Modeling and Simulation of Mobile Ad-Hoc Networks Prepared For: UMIACS/LTS Seminar March 3, 2004 Telcordia Contact: Stephanie Demers Robert A. Ziegler ziegler@research.telcordia.com 732.758.5494
More informationIntroduction. Introduction ROBUST SENSOR POSITIONING IN WIRELESS AD HOC SENSOR NETWORKS. Smart Wireless Sensor Systems 1
ROBUST SENSOR POSITIONING IN WIRELESS AD HOC SENSOR NETWORKS Xiang Ji and Hongyuan Zha Material taken from Sensor Network Operations by Shashi Phoa, Thomas La Porta and Christopher Griffin, John Wiley,
More informationLecture 04 CSE 40547/60547 Computing at the Nanoscale Interconnect
Lecture 04 CSE 40547/60547 Computing at the Nanoscale Interconnect Introduction - So far, have considered transistor-based logic in the face of technology scaling - Interconnect effects are also of concern
More informationLocalization in Wireless Sensor Networks
Localization in Wireless Sensor Networks Part 2: Localization techniques Department of Informatics University of Oslo Cyber Physical Systems, 11.10.2011 Localization problem in WSN In a localization problem
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 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 informationCS649 Sensor Networks IP Lecture 9: Synchronization
CS649 Sensor Networks IP Lecture 9: Synchronization I-Jeng Wang http://hinrg.cs.jhu.edu/wsn06/ Spring 2006 CS 649 1 Outline Description of the problem: axes, shortcomings Reference-Broadcast Synchronization
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 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 informationSurvey of MANET based on Routing Protocols
Survey of MANET based on Routing Protocols M.Tech CSE & RGPV ABSTRACT Routing protocols is a combination of rules and procedures for combining information which also received from other routers. Routing
More informationParsimony II Search Algorithms
Parsimony II Search Algorithms Genome 373 Genomic Informatics Elhanan Borenstein Raw distance correction As two DNA sequences diverge, it is easy to see that their maximum raw distance is ~0.75 (assuming
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 informationA Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information
A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information Jun Zhou Department of Computer Science Florida State University Tallahassee, FL 326 zhou@cs.fsu.edu Xin Yuan
More informationLecture 13 Register Allocation: Coalescing
Lecture 13 Register llocation: Coalescing I. Motivation II. Coalescing Overview III. lgorithms: Simple & Safe lgorithm riggs lgorithm George s lgorithm Phillip. Gibbons 15-745: Register Coalescing 1 Review:
More informationOverview: Routing and Communication Costs
Overview: Routing and Communication Costs Optimizing communications is non-trivial! (Introduction to Parallel Computing, Grama et al) routing mechanisms and communication costs routing strategies: store-and-forward,
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 informationPhysics 1502: Lecture 26 Today s Agenda
Phsics 1502: Lecture 26 Toda s Agenda Announcements: Midterm 2: NOT Nov. 6 About Monda Nov. 16 Homework 07: due Frida this week Electromagnetic Waves Mawell s Equations - Revised Energ and Momentum in
More informationWireless Sensor Networks 17th Lecture
Wireless Sensor Networks 17th Lecture 09.01.2007 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Goals of this chapter Means for a node to determine its physical position (with respect to
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 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 informationIntroduc)on to Computer Networks
Introduc)on to Computer Networks COSC 4377 Lecture 20 Spring 2012 April 4, 2012 Announcements HW9 due this week HW10 out HW11 and HW12 coming soon! Student presenta)ons HW9 Capture packets using Wireshark
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 informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 32, NO. 7, JULY
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 32, NO. 7, JULY 2014 1425 Network Coordinated Power Point Tracking for Grid-Connected Photovoltaic Systems Xudong Wang, Senior Member, IEEE, Yibo
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 informationGeoMAC: Geo-backoff based Co-operative MAC for V2V networks.
GeoMAC: Geo-backoff based Co-operative MAC for V2V networks. Sanjit Kaul and Marco Gruteser WINLAB, Rutgers University. Ryokichi Onishi and Rama Vuyyuru Toyota InfoTechnology Center. ICVES 08 Sep 24 th
More informationCS 354R: Computer Game Technology
CS 354R: Computer Game Technology http://www.cs.utexas.edu/~theshark/courses/cs354r/ Fall 2017 Instructor and TAs Instructor: Sarah Abraham theshark@cs.utexas.edu GDC 5.420 Office Hours: MW4:00-6:00pm
More informationChapter 9: Localization & Positioning
hapter 9: Localization & Positioning 98/5/25 Goals of this chapter Means for a node to determine its physical position with respect to some coordinate system (5, 27) or symbolic location (in a living room)
More informationMobile Ad Hoc Networks Theory of Interferences, Trade-Offs between Energy, Congestion and Delay
Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between Energy, Congestion and Delay 5th Week 14.05.-18.05.2007 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Unit Disk Graphs
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 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 informationLow-Latency Multi-Source Broadcast in Radio Networks
Low-Latency Multi-Source Broadcast in Radio Networks Scott C.-H. Huang City University of Hong Kong Hsiao-Chun Wu Louisiana State University and S. S. Iyengar Louisiana State University In recent years
More informationCS-184: Computer Graphics. Today
CS-84: Computer Graphics Lecture 5: Projection Prof. James O Brien Universit of California, Berkele V25-5-.3 Toda Windowing and Viewing Transformations Windows and viewports Orthographic projection Perspective
More informationTrip Assignment. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1. 2 Link cost function 2
Trip Assignment Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Overview 1 2 Link cost function 2 3 All-or-nothing assignment 3 4 User equilibrium assignment (UE) 3 5
More informationHeuristics, and what to do if you don t know what to do. Carl Hultquist
Heuristics, and what to do if you don t know what to do Carl Hultquist What is a heuristic? Relating to or using a problem-solving technique in which the most appropriate solution of several found by alternative
More informationMobile & Wireless Networking. Lecture 4: Cellular Concepts & Dealing with Mobility. [Reader, Part 3 & 4]
192620010 Mobile & Wireless Networking Lecture 4: Cellular Concepts & Dealing with Mobility [Reader, Part 3 & 4] Geert Heijenk Outline of Lecture 4 Cellular Concepts q Introduction q Cell layout q Interference
More informationAd hoc and Sensor Networks Chapter 9: Localization & positioning
Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Means for a node to determine its physical position (with
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 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 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 informationInterlayer routing issues for wireless networks
NRL Cross-Layer Workshop Interlayer routing issues for wireless networks June 2, 2004 Tom Henderson Marcelo Albuquerque Phil Spagnolo Jae H. Kim Boeing Phantom Works 1 Report Documentation Page Form Approved
More informationAntonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis.
Study of Two-Hop Message Spreading in DTNs Antonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis WiOpt 2007 5 th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless
More informationVulnerability modelling of ad hoc routing protocols a comparison of OLSR and DSR
5 th Scandinavian Workshop on Wireless Ad-hoc Networks May 3-4, 2005 Vulnerability modelling of ad hoc routing protocols a comparison of OLSR and DSR Mikael Fredin - Ericsson Microwave Systems, Sweden
More informationAndrew Clinton, Matt Liberty, Ian Kuon
Andrew Clinton, Matt Liberty, Ian Kuon FPGA Routing (Interconnect) FPGA routing consists of a network of wires and programmable switches Wire is modeled with a reduced RC network Drivers are modeled as
More informationNovel Hardware-Software Architecture for the Recursive Merge Filtering Algorithm
Novel Hardware-Software Architecture for the Recursive Merge Filtering Algorithm Piush S Jamkhandi, Amar Mukherjee, Kunal Mukherjee, and Robert Franceschini* School of Computer Science, Universit of Central
More informationStudy Guide for Exam 4
Math A Intermediate Algebra Fall 0 Stud Guide for Eam Eam is scheduled for Thursda, October th. You ma use a " " note card (both sides) and a scientific calculator. You are epected to know (or have written
More informationHomework #3 Water Distribution Pipe Systems
Page 1 of 7 CEE 371 Fall 009 Homework #3 Water istribution Pipe Systems 1. For the pipe system shown below (Figure 1), determine the length of a single equivalent pipe that has a diameter of 8 inches.
More informationPellissippi State Middle School Mathematics Competition
Pellissippi State Middle School Mathematics Competition 8 th Grade Eam Scoring Format: 3 points per correct response - each wrong response 0 for blank answers Directions: For each multiple-choice problem
More informationA marathon is a race that lasts for 26.2 miles. It has been a very popular race
The Man Who Ran from Marathon to Athens Graphing Direct Proportions Learning Goals In this lesson, you will: Graph relationships that are directly proportional. Interpret the graphs of relationships that
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 informationChannel Assignment with Route Discovery (CARD) using Cognitive Radio in Multi-channel Multi-radio Wireless Mesh Networks
Channel Assignment with Route Discovery (CARD) using Cognitive Radio in Multi-channel Multi-radio Wireless Mesh Networks Chittabrata Ghosh and Dharma P. Agrawal OBR Center for Distributed and Mobile Computing
More informationChannel Coding/Decoding. Hamming Method
Channel Coding/Decoding Hamming Method INFORMATION TRANSFER ACROSS CHANNELS Sent Received messages symbols messages source encoder Source coding Channel coding Channel Channel Source decoder decoding decoding
More information