Lecture on Computer Networks
|
|
- Marion Melton
- 5 years ago
- Views:
Transcription
1 Lecture on Computer Networks Historical Development Copyright (c) 28 Dr. Thomas Haenselmann (Saarland University, Germany). Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. time
2 Local Area Networks Overview 5. Packet Switching 5.2 Virtual Circuits vs. Datagrams 5.3 Routing in Unicast Networks 5.4 Routing in Multicast Networks 5.5 Congestion Control 5.6 Examples: IP Version 4, IP Version 6, ATM
3 The Network Layer in the OSI reference model Application Presentation Session Transport Network Data Link Physical router physical medium A physical medium B
4 ISO Definition for the Network Layer The network layer provides the ability to establish, operate and terminate network connections between open systems over intermediate systems. The network layer provides independence from routing and switching decisions.
5 Functions of the Network Layer Routing and switching of packets Multiplexing of end-to-end connections over a layer-2 connection Packet segmentation ( fragmentation") In connection-oriented communication the network layer additionally provides connection establishment and termination error detection and error correction (end-to-end) guaranteeing the order of the packets flow control (end-to-end) Heterogeneous subnetworks can be interconnected by a network layer instance ("Internetworking").
6 Overview of routing- and addressing schemes (from Wikipedia) Unicast: The most common concept of an IP address is a unicast address. It normally refers to a single sender or a single receiver, and can be used for both sending and receiving. Usually, a unicast address is associated with a single device or host, but it is not a one-to-one correspondence. Some individual PCs have several distinct unicast addresses, each for its own distinct purpose. Sending the same data to multiple unicast addresses requires the sender to send all the data many times over, once for each recipient.
7 Overview of routing- and addressing schemes (from Wikipedia) Broadcast: Sending data to all possible destinations (an "all-hosts broadcast") permits the sender to send the data only once, and all receivers can copy it. In the IP protocol, represents a limited local broadcast. In addition, a directed (limited) broadcast can be made by combining the network prefix with a host suffix composed entirely of binary s. For example, to send to all addresses within a network with the prefix 92..2, the directed broadcast IP address is (assuming the netmask is ).
8 Overview of routing- and addressing schemes Multicast: A multicast address is associated with a group of interested receivers. According to RFC 37, addresses to are designated as multicast addresses. This range was formerly called "Class D." The sender sends a single datagram (from the sender's unicast address) to the multicast address, and the intermediary routers take care of making copies and sending them to all receivers that have registered their interest in data from that sender.
9 Overview of routing- and addressing schemes Anycast: Like broadcast and multicast, anycast is a one-to-many routing topology. However, the data stream is not transmitted to all receivers, just the one which the router decides is the "closest" in the network. Anycast is useful for global load balancing, operating via the shortest-path metric of BGP routing. It is most commonly used in DNS, but does not take into account congestion or other nonpath metrics.
10 Virtual Circuits vs. Datagrams Virtual Circuit The path through the network is determined when the connection is established, i.e., for each new virtual connection a routing decision takes place in each node only once. The entire traffic flowing over this virtual connection takes the same path through the network. Datagram Every packet contains the full address of the destination host. When a packet arrives at an intermediate node the destination address is used to determine the outgoing link for the next hop.
11 Virtual Circuit "Perfect" channel through the network Error control (bit errors, lost and duplicated packets) Flow control Order of the messages maintained Phases Connection establishment Data transmission Connection termination Advantages Low overhead for addresses in the data transmission phase Low computational overhead for routing in the data phase High quality of the arriving packet stream
12 Implementation of Virtual Circuits Tables with status information on all existing virtual circuits are maintained in each node. (a) Example of a subnetwork: H H H o s t H B C H A D E F (b) Eight virtual connections through this subnetwork: H Starting from A Starting from B ABCD AEFD 2 ABFD 3 AEC 4 AECDFB BCD BAE 2 BF H
13 Status Information in the Nodes (c) Routing tables in the nodes Wide Area Networks and Routing H B H H H H B E E B E E 2 3 Input Output A B Incoming IMP or Host Incoming virtual connection 2 C C A F F H A H H A H F C 2 D D H D B B E E F D D H B E B B D E 2 3 F H C C A A A A D H H H H F C C F F C
14 The Datagram Every packet (datagram) is considered an isolated unit (like a telegram): Full destination address contained in every packet Packets can arrive out of order No error control, no flow control in layer 3 Advantages Simpler than virtual circuits, therefore easier to implement No connection establishment and termination phases: low overhead for short-lived connections More reliable since there are no status clean-up and recovery problems when a node or link fails Better suitable for internetworking of heterogeneous subnetworks
15 Routing in Unicast Networks Topology We assume that the network topology is a graph (note that in LANs with a broadcast topology (bus, ring) routing is not required!).
16 Routing Algorithms () Task To route the packets through the network from the source end system to the destination end system. The routing algorithm decides to which outgoing link of each router an in-coming packet is transferred. Desirable characteristics of a routing algorithm Correct Simple Robust in case of node or link loss Fair Optimal (finds the best route, causes minimal overhead)
17 Routing Algorithms (2) These design criteria are in conflict. In practice a good approximation is: minimization of hops from the source to the destination.
18 Classification of Routing Algorithms. Static (non-adaptive) Routing No consideration of the current network conditions For all i, j the routes between i and j are determined before the start-up of the network. No change during operation 2. Adaptive Routing Decisions are based on the current network topology (and sometimes load) Continuous measurement of the topology and the traffic Can be further classified into - centralized routing algorithms - isolated routing algorithms - distributed routing algorithms
19 Static Routing In static routing the entire topology of the network is known to a central node. It computes the optimal paths for each pair (i,j) of nodes, generates routing tables for the individual nodes and sends them out. Static routing is only possible if the network is relatively small and changes to the topology are rare. Multipath Routing Alternative routes are computed for each pair of nodes (i,j). The probability of use depends on the relative weights. Multipath routing is more reliable in case of node or link failures and balances the load better. However it is more complex than single-path routing.
20 Multipath Routing () Every node contains a routing table with one row for every destination: D O W O 2 W 2 O n W n D O i destination i th best outgoing link W i weight for O i W i is the probability that O i is used. n W i i= =
21 Multipath Routing (2) Selection of an alternative: generate a random number z ( <= z <= ) choose O if <= z < W choose O 2 if W <= z < W + W 2... choose O n if (W + W W n- ) <= z <=
22 Static Routing: Example Topology Topology of the example network A B C D E F G H I J K L We consider the paths beginning at node J.
23 Static Routing: Example Table Static routing table with alternative paths for node j Des. st choice 2 nd choice 3 rd choice A A.63 I.2 H.6 B A.46 H.3 I.23 C A.34 I.33 H.33 D H.5 A.25 I.25 E A.4 I.4 H.2 F A.34 H.33 I.33 G H.46 A.3 K.23 H H.63 K.2 A.6 I I.65 A.22 H.3 - K K.67 H.22 A. L K.42 H.42 A.6
24 Determination of Routing Tables For static routing the routing tables are precomputed by the network operator. Before network start-up they are loaded into the nodes and not changed anymore. Characteristics simple good results for a constant topology and constant network traffic But: inappropriate for strongly varying traffic and changes in topology inappropriate for large networks (does not scale well) Still occasionally used in practice. The network operator always knows the entire topology. He/she can use Dijkstra s shortest path" algorithm once for each node for the construction of the routing tables.
25 Centralized Adaptive Routing () Principle There is a Routing Control Center (RCC) in the network. Each node periodically sends status information to the RCC, for example - the list of immediate neighbors - current queue lengths - the current utilization of its links. The RCC collects the information and computes the optimal path for each pair of nodes, computes the individual routing tables and distributes them to the nodes.
26 Centralized Adaptive Routing (2) Characteristics The RCC has complete information => decisions are optimal. The individual nodes don t have to do the routing computation. But: Route computation has to take place frequently (say, once per minute). There will be a traffic concentration in the proximity of the RCC, thus a performance bottleneck. The technology is not robust: the RCC is a single point of failure. The algorithm fails when the network gets partitioned. The individual nodes receive new routing tables at different times => inconsistencies and thus "routing loops" will occur.
27 Centralized Adaptive Routing: (side effect of asym. metrics) recv from x, y, z w recv from x, y, z w send z +e x send send z +e 2+e x send e y y send e send e send recv from x, y, z w z y send e 2+e +e x send send recv from x, y, z w z +e 2+e y send e x send
28 Centralized Adaptive Routing: Algorithm (performed by node u) D(v)=cost(u,v) INIT N'={u} for all nodes v if v is a neighbor of u then D(v)=cost(u,v) else D(v)=infinity LOOP find w not in N' such that D(w) is a minimum add w to N' update D(v) for each neighbor v of w not in N': D(v)=min(D(v), D(w)+c(w,v)) UNTIL N'=N
29 Isolated Adaptive Routing Principle No exchange of routing information between nodes Decisions are based on local information only Examples of algorithms Backward Learning Flooding
30 Algorithm "Backward Learning" A node "learns" from the arriving packets: packet (..., S, H,... ) with S = source node, H = hop counter, the packet is received on link L => S is reachable over L in H hops. Routing table in the node: Each entry is a triple (destination node, outgoing link, H min ) Updating of the routing table: Node receives packet (..., S, H...) on link L if not(s in table) then add(s,l,h) else if H < H min then update(s,l,h)
31 Backward Learning: Example P L S L 2 D P2 P(..., S,4,...) -> add(s,l,4) P2(..., S,3,...) -> update(s,l2,3)
32 Backward Learning: Path Degradation Problem Algorithm does not adapt to path degradations. Solution Periodic deletion of routing tables. A new learning period begins. But: how often? too often: network is in the learning phase most of the time too seldom: slow reaction to degradations Also: We cannot send data to a node from which we have never seen a packet. Approach used by routers and LAN bridges (empty entry => flood packet)
33 Algorithm "Flooding" An incoming packet is forwarded on all outgoing links except the one it came from. A B C
34 Flooding: Stopping the Packet Flow Problem: explosion of the number of packet copies in the network Mitigating the problem add a hop counter to the packet header initialize it with the diameter of the network (= longest path in the network (worst case)) decrement the hop counter on each hop counter = : packet is dropped by the router Characteristics of Flooding very robust, very simple, but large number of copies, heavy network load => employed only for special applications or in a first phase of other routing algorithms to establish initial status information
35 Flooding example in sensor networks: Directed Diffusion Aim: Get measurements from the nodes of a sensor network Therefore, the sink node sends out a so-called interest by flooding Every node stores an interest and forwards it to its neighbors As the diameter of the network is unknown: keep track which neighbor got or sent a copy of the interest and don't send twice struct interest type = walking moose // taken from an app. specific set frequency = s // time between 2 messages location = rect[(6,4),(8,8)] // only within this area timestamp = 4:25:35 // birth of this interest expiresat = 4:3: // no answers after this time
36 Flooding example in sensor networks: Directed Diffusion Answering an interest A node N that can satisfy the interest by its observations answers by flooding as well. Consequence: Huge network load, so answer in large intervals only. One answer reaches the sink on the shortest link (why?). It then reinforces the interest via the node reporting first. This node does so as well. So the reinforcement gets to N on the optimal path P. From now on, N will answer via P until timeout. + approach for routing by content, not by identities - lots of status information, feasible for dedicated applications only.
37 Distributed Routing () Principle The nodes explicitly exchange routing information with their neighbors: Each node knows its distance to each neighbor: - number of hops (= ) - delay (round-trip time) - queue length, etc. Each node periodically sends a list with his estimated distances to all known destination nodes to his neighbors. node X receives a list E from neighbor Y distance (X, Y) = e distance (Y, Z) = E(Z) => distance (X, Z) over Y is E(Z) + e The table with these distances is called distance vector. The algorithm is thus called distance vector routing.
38 Distributed Routing (2) Example A B C D E F G H I J K L We consider the distances known to node J.
39 Distributed Routing (3) A B C D E F G H I J K L A JA delay=8 I JI delay= H JH delay=2 delay=6 Right column: newly determined distances at node J after receiving the distance vectors from the neighbors K JK new DV at J 8 A 2 A 28 I 2 H 7 I 3 I 8 H 2 H I - 6 K 5 K
40 Hierarchical Routing With no hierarchie, the size of the routing tables is proportional to the size of the network: large memory requirement in the nodes considerable CPU time for searching the tables much bandwidth for the exchange of routing information Hierarchical routing helps to solve these problems: Nodes are grouped into regions Each node knows - all details of his region - his routes to all other regions In the Internet a region is a subset of the IP address space. Disadvantage: globally optimal decisions are no longer possible.
41 Example for Hierarchical Routing B region region 2 2A 2B full table for node A A C 2C 2D 4B 5B 5C 3A 3B 5A 5D 4A 4C 5E region 3 region 4 region 5 hierarchical table for node A DES. LIN HOP A E- - B B C C 2 B 2 3 C 2 4 C 3 5 C 4 DES. A B C 2A 2B 2C 2D 3A 3B 4A 4B 4C 5A 5B 5C 5D 5E LINE - B C B B B B C C C C C C C B C C HOP
42 Routing in the Internet Distance Vector Routing In the early years of the Internet the most commonly used procedure was an adaptive distributed procedure on the basis of distance vectors (distance vector routing). The employed protocol is called RIP (Routing Information Protocol). With RIP all Internet routers periodically exchange distance vector messages and update their routing tables accordingly.
43 Routing in the Internet Algorithm (Distance Vector Routing) INIT (at node X) for all destinations y in N: Dx(y)=cost(x,y) // y not neighbor? cost=inf. for each neighbor w Dw(y) = infinity for all destinations y in N for each neighbor w send distance vector Dx=[Dx(y): y in N] to w LOOP FOREVER wait (until link cost changes or get new D) for each y in N: Dx(y)=min_v{c(x,v)+Dv(y)} if Dx(y) changed for any destination y send Dx=[Dx(y): y in N] to all neighbors
44 Example for Distance Vector Routing () A From A to B C D link ab ab ad ab cost 2 B From B to A C D link ab bc bc ad cost 2 bc (a) node E has just been added to the network C From C to A B D E D From D to A B C E cd link bc bc cd ce link ad cd cd de cost 2 cost 2 ce de E From E to C D link ce de cost
45 Example for Distance Vector Routing (2) B C A From A to B C D E link ab ab ad ad ab cost 2 2 From B to A C D E link cost From C to ab A bc bc B bc bc 2 2 D E ad (b) after an exchange of RIP messages D From D to A B C E cd link bc bc cd ce link ad cd cd de cost 2 cost 2 de ce E From E to A B C D link de ce ce de cost 2 2
46 Distance Vector Routing: Problems Good news travels fast: We learn quickly about better links Bad news travels slow: What happens with a deteriorated link? 4 y 6 y x 5 z x 5 z
47 OSPF Routing Another important and widely used routing algorithm on the Internet is OSPF (Open Shortest Path First). The basic idea is that all nodes know the entire network topology at all times and can thus compute all optimal paths locally. If the topology changes, the nodes exchange topology update messages. Each node maintains a local database of the entire topology, called the link state database. The optimal paths to all destinations can be computed locally with Dijkstra s Shortest Path algorithm (Shortest Path First = SPF). In the Internet slang the algorithm is thus called Open Shortest Path First. Algorithms of this class are called link state routing algorithms.
48 Example for OSPF Routing B C ab bc ce E A D cd de ad
49 Example for OSPF Routing Routing is done at layer 3, the Network Layer. At runtime a router forwards the incoming packets on the basis of a routing table. Hierachical routing helps to solve the scalablility problem for large networks. A routing algorithm computes the entries of the routing tables. Static routing can only be used for small networks with little change in topology and traffic. Adaptive routing with a centralized routing control center has the disadvantage of a central performance bottleneck and a central point of failure. The Internet uses adaptive distributed routing algorithms. The most popular ones are RIP (older, based on distance vectors) and OSPF (currently used, based on a link state database).
Routing. 4. Mar INF-3190: Switching and Routing
Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines
More informationLayer 3: Network Layer. 9. Mar INF-3190: Switching and Routing
Layer 3: Network Layer 9. Mar. 2005 1 INF-3190: Switching and Routing Network Layer Goal Enable data transfer from end system to end system End systems Several hops, (heterogeneous) subnetworks Compensate
More informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
More informationTelecommunication Protocols Laboratory Course. Lecture 3
Telecommunication Protocols Laboratory Course Lecture 3 Course map Last time: we discussed protocols of the Medium Access Control (MAC) sub-layer Deal with broadcast channels and their (multi-party) protocols
More informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
More informationCS 138: Communication I. CS 138 V 1 Copyright 2012 Thomas W. Doeppner. All rights reserved.
CS 138: Communication I CS 138 V 1 Copyright 2012 Thomas W. Doeppner. All rights reserved. Topics Network Metrics Layering Reliability Congestion Control Routing CS 138 V 2 Copyright 2012 Thomas W. Doeppner.
More informationETSF05/ETSF10 Internet Protocols Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet 2014, (ETSF05 Part 2), Lecture 1.1 Jens Andersson Circuit switched routing 2014 11 05 ETSF05/ETSF10 Internet Protocols 2 Packet switched Routing
More informationBLM6196 COMPUTER NETWORKS AND COMMUNICATION PROTOCOLS
BLM696 COMPUTER NETWORKS AND COMMUNICATION PROTOCOLS Prof. Dr. Hasan Hüseyin BALIK (7 th Week) 7. Routing 7.Outline Routing in Packet-Switching Networks Examples: Routing in ARPANET Internet Routing Protocols
More informationETSF05/ETSF10 Internet Protocols. Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet Circuit switched routing ETSF05/ETSF10 - Internet Protocols 2 Routing in Packet Switching Networks Key design issue for (packet) switched networks
More informationTop-Down Network Design
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic
More informationCourse Routing Classification Properties Routing Protocols 1/39
Course 8 3. Routing Classification Properties Routing Protocols 1/39 Routing Algorithms Types Static versus dynamic Single-path versus multipath Flat versus hierarchical Host-intelligent versus router-intelligent
More informationCOMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class
Computer Network Homework#2 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes
More informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 13 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of lecture 12 Routing Congestion
More informationRouting Algorithms. CS158a Chris Pollett Apr 4, 2007.
Routing Algorithms CS158a Chris Pollett Apr 4, 2007. Outline Routing Algorithms Adaptive/non-adaptive algorithms The Optimality Principle Shortest Path Routing Flooding Distance Vector Routing Routing
More informationLink-State Routing OSPF
CE Computer Networks Link-State Routing OSPF Behnam Momeni Computer Engineering Department Sharif University of Technology Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer
More informationProf. Shervin Shirmohammadi SITE, University of Ottawa. Internet Protocol (IP) Lecture 2: Prof. Shervin Shirmohammadi CEG
Lecture 2: Internet Protocol (IP) Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4185 2-1 Network Layer Provides the upper layers with independence from the data
More informationOutline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting
Outline Routing Fundamentals of Computer Networks Guevara Noubir Introduction Broadcasting and Multicasting Shortest Path Unicast Routing Link Weights and Stability F2003, CSG150 Fundamentals of Computer
More informationChapter 22 Network Layer: Delivery, Forwarding, and Routing 22.1
Chapter 22 Network Layer: Delivery, Forwarding, and Routing 22.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 22-3 UNICAST ROUTING PROTOCOLS 22.2 A routing
More informationRouting. Advanced Computer Networks: Routing 1
Routing Advanced Computer Networks: Routing 1 Gateway To internet or wide area network Metropolitan Area Network (MAN) s s Organization Servers Backbone R S R R Departmental Server s R S R s S R s s s
More informationChapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.
More informationFairness Example: high priority for nearby stations Optimality Efficiency overhead
Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency
More informationThe Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
More informationCHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL
CHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL Dr. Bhargavi Goswami, Associate Professor head, Department of Computer Science, Garden City College Bangalore. PACKET SWITCHED NETWORKS Transfer blocks
More informationInternetworking Terms. Internet Structure. Internet Structure. Chapter 15&16 Internetworking. Internetwork Structure & Terms
Chapter 15&16 Internetworking Internetwork Structure & Terms Internetworking Architecture Features Connection/Connectionless Architecture Fragmentation & Reassembly Internet Protocol & Services Addressing
More information5.2 Routing Algorithms
CEN445 Network Protocols and Algorithms Chapter 5 Network Layer 5. Routing Algorithms Dr. Mostafa Hassan Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud
More informationICMP, ARP, RARP, IGMP
Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols
More informationGrowth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs.
Internetworking Multiple networks are a fact of life: Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Fault isolation,
More informationIP Routing. Bharat S. Chaudhari International Institute of Information Technology Pune, India
IP Routing Bharat S. Chaudhari International Institute of Information Technology Pune, India June 21, 2005 Network Devices: Ø The networking and internetworking devices are divided in the following categories:
More informationThis Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network
This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information
More informationCourse 6. Internetworking Routing 1/33
Course 6 Internetworking Routing 1/33 Routing The main function of the network layer is routing packets from the source machine to the destination machine. Along the way, at least one intermediate node
More informationC13b: Routing Problem and Algorithms
CISC 7332X T6 C13b: Routing Problem and Algorithms Hui Chen Department of Computer & Information Science CUNY Brooklyn College 11/20/2018 CUNY Brooklyn College 1 Acknowledgements Some pictures used in
More informationCMSC 332 Computer Networks Network Layer
CMSC 332 Computer Networks Network Layer Professor Szajda CMSC 332: Computer Networks Where in the Stack... CMSC 332: Computer Network 2 Where in the Stack... Application CMSC 332: Computer Network 2 Where
More informationChapter 12. Routing and Routing Protocols 12-1
Chapter 12 Routing and Routing Protocols 12-1 Routing in Circuit Switched Network Many connections will need paths through more than one switch Need to find a route Efficiency Resilience Public telephone
More informationComputer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ Lecture 5: Network Layer Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall, 2003. Contents The
More informationCN1047 INTRODUCTION TO COMPUTER NETWORKING CHAPTER 5 OSI MODEL NETWORK LAYER
CN1047 INTRODUCTION TO COMPUTER NETWORKING CHAPTER 5 OSI MODEL NETWORK LAYER Network Layer Network layer manages options pertaining to host and network addressing, managing subnetworks, and internetworking.
More informationLast time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access
Last time Wireless link-layer Introduction Wireless hosts, base stations, wireless links Characteristics of wireless links Signal strength, interference, multipath propagation Hidden terminal, signal fading
More informationOSI Network Layer. Chapter 5
OSI Network Layer Network Fundamentals Chapter 5 Objectives Identify the role of the Network Layer, as it describes communication from one end device to another end device. Examine the most common Network
More informationIP - The Internet Protocol. Based on the slides of Dr. Jorg Liebeherr, University of Virginia
IP - The Internet Protocol Based on the slides of Dr. Jorg Liebeherr, University of Virginia Orientation IP (Internet Protocol) is a Network Layer Protocol. IP: The waist of the hourglass IP is the waist
More informationIntroduction to Internetworking
Introduction to Internetworking Introductory terms Communications Network Facility that provides data transfer services An internet Collection of communications networks interconnected by bridges and/or
More informationCOMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class
Computer Network Homework#3 COMPUTER NETWORK Homework #3 Due Date: May 22, 2017 in class Question 1 Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes
More informationRouting. Information Networks p.1/35
Routing Routing is done by the network layer protocol to guide packets through the communication subnet to their destinations The time when routing decisions are made depends on whether we are using virtual
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed
More informationTop-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features
More informationLecture (08, 09) Routing in Switched Networks
Agenda Lecture (08, 09) Routing in Switched Networks Dr. Ahmed ElShafee Routing protocols Fixed Flooding Random Adaptive ARPANET Routing Strategies ١ Dr. Ahmed ElShafee, ACU Fall 2011, Networks I ٢ Dr.
More informationWhat is the difference between unicast and multicast? (P# 114)
1 FINAL TERM FALL2011 (eagle_eye) CS610 current final term subjective all solved data by eagle_eye MY paper of CS610 COPUTER NETWORKS There were 30 MCQs Question no. 31 (Marks2) Find the class in 00000001.001011.1001.111
More informationCSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes
CSE 46 Routing Routing Focus: How to find and set up paths through a network Distance-vector and link-state Shortest path routing Key properties of schemes Application Transport Network Link Physical Forwarding
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationNetworking: Network layer
control Networking: Network layer Comp Sci 3600 Security Outline control 1 2 control 3 4 5 Network layer control Outline control 1 2 control 3 4 5 Network layer purpose: control Role of the network layer
More informationIntroduction to routing in the Internet
Introduction to routing in the Internet Internet architecture IPv4, ICMP, ARP Addressing, routing principles (Chapters 2 3 in Huitema) Internet-1 Internet Architecture Principles End-to-end principle by
More informationChapter 7 Routing Protocols
Chapter 7 Routing Protocols Nonroutable Protocols In the early days of networking, networks were small collections of computers linked together For the purposes of sharing information and expensive peripherals
More informationCSE 3214: Computer Network Protocols and Applications Network Layer
CSE 314: Computer Network Protocols and Applications Network Layer Dr. Peter Lian, Professor Department of Computer Science and Engineering York University Email: peterlian@cse.yorku.ca Office: 101C Lassonde
More informationComputer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS
Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,
More informationIntroduction to routing in the Internet
Introduction to routing in the Internet Internet architecture IPv4, ICMP, ARP Addressing, routing principles (Chapters 2 3 in Huitema) Internet-1 Internet Architecture Principles End-to-end principle by
More informationWilliam Stallings Data and Computer Communications. Chapter 10 Packet Switching
William Stallings Data and Computer Communications Chapter 10 Packet Switching Principles Circuit switching designed for voice Resources dedicated to a particular call Much of the time a data connection
More informationRouting in Switched Data Networks
in Switched Data Networks ITS323: Introduction to Data Communications Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 23 May 2012 ITS323Y12S1L10, Steve/Courses/2012/s1/its323/lectures/routing.tex,
More informationRouting Overview for Firepower Threat Defense
Path Determination This chapter describes underlying concepts of how routing behaves within the Cisco Firepower Threat Defense, and the routing protocols that are supported. Routing is the act of moving
More informationSEMESTER 1 Chapter 5 OSI Network Layer V What services does the network layer provide?
SEMESTER 1 Chapter 5 OSI Network Layer V 4.0 5.1.1.1 What services does the network layer provide? What are the 4 basic processes used at the network layer? What is the PDU of the network layer? What information
More informationList of groups known at each router. Router gets those using IGMP. And where they are in use Where members are located. Enhancement to OSPF
Multicast OSPF OSPF Open Shortest Path First Link State Protocol Use Dijkstra s algorithm (SPF) Calculate shortest path from the router to every possible destination Areas Limit the information volume
More informationNetwork Layer: Routing
Network Layer: Routing The Problem A B R 1 R 2 R 4 R 3 Goal: for each destination, compute next hop 1 Lecture 9 2 Basic Assumptions Trivial solution: Flooding Dynamic environment: links and routers unreliable:
More informationTo contain/reduce broadcast traffic, we need to reduce the size of the network (i.e., LAN).
2.3.3 Routers 2.3.3.1 Motivation Bridges do not stop broadcast traffic. This can lead to broadcast storms (e.g., more than 100 nonunicast frames/sec) which can be catastrophic. This can bring the network
More informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationChapter 6. The Network Layer
Chapter 6 The Network Layer 1 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented
More informationPART X. Internetworking Part 1. (Concept, IP Addressing, IP Routing, IP Datagrams, Address Resolution)
PART X Internetworking Part 1 (Concept, IP Addressing, IP Routing, IP Datagrams, Address Resolution) CS422 Part 10 1 Spring 1999 Motivation For Internetworking LANs Low cost Limited distance WANs High
More informationHierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
More informationCSCD 330 Network Programming Spring 2018
CSCD 330 Network Programming Spring 018 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 017 1 Network
More informationBTEC Level 3 Extended Diploma
BTEC Level 3 Extended Diploma Unit 9 Computer Network Routing and Routing Protocols BTEC Level 3 Extended Diploma Introduction to Routing Routing is the process that a router uses to forward packets toward
More informationCSCD 330 Network Programming Spring 2017
CSCD 330 Network Programming Spring 017 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-007
More informationEECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.
EECS 122, Lecture 16 Kevin Fall kfall@cs.berkeley.edu edu Link Costs and Metrics Routing protocols compute shortest/cheapest paths using some optimization criteria Choice of criteria has strong effect
More informationEEC-684/584 Computer Networks
EEC-684/584 Computer Networks Lecture 14 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Internetworking
More informationNetwork Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture
Network Routing Packet Routing, Routing Algorithms, Routers, Router Architecture Routing Routing protocol Goal: determine good path (sequence of routers) thru network from source to dest. Graph abstraction
More informationRouting Basics. What is Routing? Routing Components. Path Determination CHAPTER
CHAPTER 5 Routing Basics This chapter introduces the underlying concepts widely used in routing protocols Topics summarized here include routing protocol components and algorithms In addition, the role
More informationChapter 09 Network Protocols
Chapter 09 Network Protocols Copyright 2011, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Outline Protocol: Set of defined rules to allow communication between entities Open Systems
More informationLecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 4 The Network Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Network layer functions Transport packet from sending to receiving hosts Network layer protocols in every
More informationChapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet
Chapter 2 - Part 1 The TCP/IP Protocol: The Language of the Internet Protocols A protocol is a language or set of rules that two or more computers use to communicate 2 Protocol Analogy: Phone Call Parties
More informationModule 1. Introduction. Version 2, CSE IIT, Kharagpur
Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical
More informationDistributed Queue Dual Bus
Distributed Queue Dual Bus IEEE 802.3 to 802.5 protocols are only suited for small LANs. They cannot be used for very large but non-wide area networks. IEEE 802.6 DQDB is designed for MANs It can cover
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11 1 Midterm exam Midterm this Thursday Close book but one-side 8.5"x11" note is allowed (must
More informationEECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
More informationETSF05/ETSF10 Internet Protocols Network Layer Protocols
ETSF05/ETSF10 Internet Protocols Network Layer Protocols 2016 Jens Andersson Agenda Internetworking IPv4/IPv6 Framentation/Reassembly ICMPv4/ICMPv6 IPv4 to IPv6 transition VPN/Ipsec NAT (Network Address
More informationCS610 Computer Network Final Term Papers Solved MCQs with reference by Virtualians Social Network
CS610 Computer Network Final Term Papers Solved MCQs with reference by Virtualians Social Network Question No: 1( M a r k s: 1 ) A ---------- Relies on the hardware manufacturer to assign a unique physical
More informationGeneric Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture
Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,
More informationIntroduction to Routing
1 Introduction to Routing Session 2 Presentation_ID.scr 1 Agenda Addressing Concepts Routing Protocols Statics and Defaults 3 ISO OSI Reference Model Routing Information Protocol (RIP and RIPv2) L7 L6
More informationinterface Question 1. a) Applications nslookup/dig Web Application DNS SMTP HTTP layer SIP Transport layer OSPF ICMP IP Network layer
TDTS06 Computer networks, August 23, 2008 Sketched answers to the written examination, provided by Juha Takkinen, IDA, juhta@ida.liu.se. ( Sketched means that you, in addition to the below answers, need
More informationLecture 4 Wide Area Networks - Routing
DATA AND COMPUTER COMMUNICATIONS Lecture 4 Wide Area Networks - Routing Mei Yang Based on Lecture slides by William Stallings 1 ROUTING IN PACKET SWITCHED NETWORK key design issue for (packet) switched
More informationWe will discuss about three different static routing algorithms 1. Shortest Path Routing 2. Flooding 3. Flow Based Routing
In this lecture we will discuss about Routing algorithms Congestion algorithms Lecture 19 The routing algorithm is that part of the network layer software, which is responsible for deciding which output
More informationLecture 5 The Network Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 5 The Network Layer part II Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it IP datagram format IP protocol version number header length (bytes) type of data max number remaining
More informationET4254 Communications and Networking 1
Topic 9 Internet Protocols Aims:- basic protocol functions internetworking principles connectionless internetworking IP IPv6 IPSec 1 Protocol Functions have a small set of functions that form basis of
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More informationChapter 4 Network Layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. Network Layer 4-1 Chapter 4: Network Layer Chapter
More informationIntegrated t Services Digital it Network (ISDN) Digital Subscriber Line (DSL) Cable modems Hybrid Fiber Coax (HFC)
Digital Local Loop Technologies Integrated t Services Digital it Network (ISDN) Handles voice and data Relatively l high h cost for low bandwidth (Skip) Digital Subscriber Line (DSL) Cable modems Hybrid
More informationThe Network Layer. Network Layer Design Objectives
1 next CITS3002 help3002 CITS3002 schedule The Network Layer The Data Link Layer had the responsibility of reliably transmitting frames across along a single wire (or wireless,...) link. The Network Layer's
More information9.1. Routing Protocols
9.1. Routing Protocols Each organization that has been assigned a network address from an ISP is considered an autonomous system (AS). That organization is free to create one large network, or divide the
More informationInternetwork Protocols
Internetwork Protocols Background to IP IP, and related protocols Internetworking Terms (1) Communications Network Facility that provides data transfer service An internet Collection of communications
More informationComputer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)
Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP
More informationECE 435 Network Engineering Lecture 11
ECE 435 Network Engineering Lecture 11 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 11 October 2018 Midterm on Tues Announcements 1 HW#4 Review maine.edu created? What is a
More informationLecture 16: Network Layer Overview, Internet Protocol
Lecture 16: Network Layer Overview, Internet Protocol COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
More informationCOMP/ELEC 429/556 Introduction to Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks Let s Build a Scalable Global Network - IP Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene
More informationARP, IP. Chong-Kwon Kim. Each station (or network interface) should be uniquely identified Use 6 byte long address
ARP, IP Chong-Kwon Kim Routing Within a LAN MAC Address Each station (or network interface) should be uniquely identified Use 6 byte long address Broadcast & Filter Broadcast medium Signals are transmitted
More informationNetworking and Internetworking 1
Networking and Internetworking 1 Today l Networks and distributed systems l Internet architecture xkcd Networking issues for distributed systems Early networks were designed to meet relatively simple requirements
More informationReview for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30
Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30 R1. Let s review some of the terminology used in this textbook. Recall that
More information