Netprog: Routing and the Network Layer1 Routing and the Network Layer (ref: Interconnections by Perlman)

Slides:



Advertisements
Similar presentations
RIP V1 W.lilakiatsakun.
Advertisements

Routing Protocol.
Routing and the Network Layer (ref: Interconnections by Perlman.
Mod 10 – Routing Protocols
Data Communications Packet Switching.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
CS335 Networking & Network Administration Tuesday, May 11, 2010.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Routing and Routing Protocols
Routing.
COS 420 Day 17. Agenda Finished Grading Individualized Projects Very large disparity in student grading No two students had same ranking for other students.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
Institute of Technology Sligo - Dept of Computing Chapter 11 Layer 3 Protocols Paul Flynn.
Gursharan Singh Tatla Transport Layer 16-May
Data Communications and Networks Chapter 2 - Network Technologies - Circuit and Packet Switching Data Communications and Network.
Process-to-Process Delivery:
The Network Layer. Network Projects Must utilize sockets programming –Client and Server –Any platform Please submit one page proposal Can work individually.
Interior Gateway Protocols: RIP & OSPF
Introduction to Routing and Routing Protocols By Ashar Anwar.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
Routing -2 Dynamic Routing
Section 4 : The OSI Network Layer CSIS 479R Fall 1999 “Network +” George D. Hickman, CNI, CNE.
Cisco – Chapter 11 Routers All You Ever Wanted To Know But Were Afraid to Ask.
1 Routing. 2 Routing is the act of deciding how each individual datagram finds its way through the multiple different paths to its destination. Routing.
The Saigon CTT Semester 1 CHAPTER 11 Le Chi Trung.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 9 Basic Router Troubleshooting.
University of the Western Cape Chapter 12: The Transport Layer.
1 Flow Identification Assume you want to guarantee some type of quality of service (minimum bandwidth, maximum end-to-end delay) to a user Before you do.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
The Transmission Control Protocol (TCP) Application Services (Telnet, FTP, , WWW) Reliable Stream Transport (TCP) Connectionless Packet Delivery.
TCOM 515 IP Routing. Syllabus Objectives IP header IP addresses, classes and subnetting Routing tables Routing decisions Directly connected routes Static.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 6 Delivery and Routing of IP Packets.
The Network Layer Introduction  functionality and service models Theory  link state and distance vector algorithms  broadcast algorithms  hierarchical.
CS 453 Computer Networks Lecture 18 Introduction to Layer 3 Network Layer.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
The Network Layer.
CCNA 2 Week 9 Router Troubleshooting. Copyright © 2005 University of Bolton Topics Routing Table Overview Network Testing Troubleshooting Router Issues.
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
Lecture 4 Overview. Ethernet Data Link Layer protocol Ethernet (IEEE 802.3) is widely used Supported by a variety of physical layer implementations Multi-access.
Routing and Routing Protocols
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
1 Version 3.1 Module 6 Routed & Routing Protocols.
1 Kyung Hee University Chapter 6 Delivery Forwarding, and Routing of IP Packets.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.
McGraw-Hill Chapter 23 Process-to-Process Delivery: UDP, TCP Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Network Layer Lecture Network Layer Design Issues.
Computer Networks 0110-IP Gergely Windisch
Process-to-Process Delivery:
1 Layer 3: Protocols Honolulu Community College Cisco Academy Training Center Semester 1 Version
VCC Semester 1 CHAPTER 11. VCC  Content Layer 3 Devices ARP concept Network layer services Routed and routing protocols Protocol analyzer.
Fall, 2001CS 6401 Switching and Routing Outline Routing overview Store-and-Forward switches Virtual circuits vs. Datagram switching.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
Malathi Veeraraghavan (originals by Jörg Liebeherr) 1 Link State Routing Algorithm Use a routing protocol to collect the whole network topology Obtain.
Netprog Routing and the Network Layer1 Routing and the Network Layer (ref: Interconnections by Perlman)
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
Chapter 11 User Datagram Protocol
Chapter 4 Introduction to Network Layer
THE NETWORK LAYER.
Routing.
Chapter 4 Introduction to Network Layer
Delivery and Routing of IP Packets
Delivery and Routing of IP Packets
ECE453 – Introduction to Computer Networks
Network Architecture for Cyberspace
Routing and the Network Layer (ref: Interconnections by Perlman
Computer Networks Protocols
Routing.
Presentation transcript:

Netprog: Routing and the Network Layer1 Routing and the Network Layer (ref: Interconnections by Perlman)

Netprog: Routing and the Network Layer2 Network Service Types Two basic models of the services the network should provide: –Connectionless (datagram) –Connection-oriented (virtual circuit)

Netprog: Routing and the Network Layer3 Connectionless Network Each packet is independently routed. Each packet includes the destination address. No guarantee that packets are kept in order. No guarantee that packets are not lost or duplicated.

Netprog: Routing and the Network Layer4 Connection-Oriented Network A single path is first established for each new connection. The network guarantees that packets are delivered in order. No loss or duplication. If anything goes wrong the connection is broken. It is possible to limit the number of connections.

Netprog: Routing and the Network Layer5 Connection-Oriented (cont.) The network can guarantee bandwidth at connect time. The network can refuse new connections.

Netprog: Routing and the Network Layer6 Middle Ground It is possible to design service models that are somewhere in the middle: –connection-oriented, but without any bandwidth guarantee. –Routers take care of establishing a virtual circuit - hosts view the network as connectionless.

Netprog: Routing and the Network Layer7 Advantages of Connectionless Connection-oriented requires duplication of service at the transport layer (to handle broken connections). Host software is much simpler at the network layer. Many applications do not require sequential delivery of packets (example: packet voice).

Netprog: Routing and the Network Layer8 Advantages of Connectionless (cont.) Network traffic often comes in bursts, so reserving resources is wasteful. It is better to provide degraded service to everyone than to limit network access. Server (or router) could become overloaded managing too many connections.

Netprog: Routing and the Network Layer9 Advantages of Connection- Oriented Most applications requires sequential packet delivery - the network should handle the complexity. Faster Routers. Once a connection is established each router can reference the connection via a small number. It is better to provide uniform service to a few than to degrade while handling everyone.

Netprog: Routing and the Network Layer10 Advantages of Connection- Oriented (cont.) Life is easier for the Transport Layer –possible to calculate round-trip delay –possible to maximize packet size (it never needs to change).

Netprog: Routing and the Network Layer11 IP Routing IP is a connectionless network layer. Each host has a routing table: –routes to specific hosts –routes to specific networks –default route

Netprog: Routing and the Network Layer12 Host route determination Search for a matching host address Search for a matching network address Search for a default entry.

Netprog: Routing and the Network Layer13 Routing table creation Static routes - Unix “route” command. ICMP Router Discovery –broadcast protocol that discovers routers on the local network. ICMP redirects. Run a routing daemon.

Netprog: Routing and the Network Layer14 Dynamic Routing Routers need to tell each other about routes. Host routing tables can change over time by listening to routers. There are many dynamic IP routing protocols in use.

Netprog: Routing and the Network Layer15 RIP Routing Information Protocol UDP based messages Each router sends out a broadcast (possibly a series of broadcasts) that contains the entire routing table of the router. Typically routers do this every 30 seconds or when something changes.

Netprog: Routing and the Network Layer16 RIP routes Each RIP routing table entry includes: –IP address –metric (hop count 1-15). –timeout (seconds). directly connected networks have a metric of 1. If a route times-out the metric is set to 16 (no connection) and deleted after 1 minute.

Netprog: Routing and the Network Layer17 Convergence When something changes (for example when a link or router goes down), it takes a while before the change is propagated to all affected routers. RIP suffers from slow convergence - there is not enough information in RIP routing tables to avoid this problem.

Netprog: Routing and the Network Layer18 A’s Routing Table: B’s Routing Table: A is 1 hop away (directly connected) C is 1 hop away (directly connected) B is 1 hop away (directly connected) C is 2 hops away (via B). ABC What happens when C dies?

Netprog: Routing and the Network Layer19 OSPF vs. RIP Open Shortest Path First is an alternative IP routing protocol. RIP is a distance-vector protocol. OSPF is link-state protocol. –a router checks the condition of each of it’s connections (links) and reports this information to neighbors.

Netprog: Routing and the Network Layer20 OSPF advantages Each router has a picture of the network topology. Faster convergence. support for independent routes for each IP type-of-service. load balancing (distribute traffic among equal cost routes)

Netprog: Routing and the Network Layer21 X.25 - Connection-Oriented Network Layer DCE DTE DTE: Data Terminal Equipment (host). DCE: Data Circuit-Terminating Equipment (router)

Netprog: Routing and the Network Layer22 X.25 Network Service Allows a DTE to establish multiple simultaneous connections (over a single link to a DCE). Can also be used to connect 2 DTEs directly. Can support permanent connections.

Netprog: Routing and the Network Layer23 X.25 Switched Virtual Circuit DTE A tells DCE A that it wants a connection to DTE B. DCE B tells DTE B that a new connection has been requested. DCE A DCE A DCE B DCE B DTE A DTE A DTE B DTE B

Netprog: Routing and the Network Layer24 Virtual Circuit Numbers Each Virtual Circuit is assigned a number at setup time. A virtual circuit number identifies a connection between a DTE and its DCE only. The other end of the connection can use a different virtual circuit number.

Netprog: Routing and the Network Layer25 Virtual Circuit Numbers Each data packet includes a virtual circuit number rather than a destination address. 12 bit identifier. Virtual circuit numbers are smaller than addresses and much faster for a router to process (just a table lookup).

Netprog: Routing and the Network Layer26 Virtual Circuit Numbers 0 is reserved for control packets. non-overlapping ranges of numbers: –permanent virtual circuits –incoming connections –outgoing connections

Netprog: Routing and the Network Layer27 Connection request DTE A selects an unused outgoing vc number. DTE A creates a call request packet and sends to DCE A. DCE A contacts DCE B (via an unspecified mechanism) and requests the connection. DCE A notifies DTE A when the connection is established.

Netprog: Routing and the Network Layer28 Data Transfer Each connection (call) is full duplex. Each packet sent by a DTE includes: –virtual circuit number –sequence number (3 or 7 bits). –fragmentation information ( M bit). –ACK sequence number.

Netprog: Routing and the Network Layer29 Data Transfer Fragmentation can happen at DTE or DCE. Sequence numbers do not necessarily coincide at DTEs. Seq# 2Seq# 1 DCE A DTE A DCE B DTE B Seq# 1Seq# 2Seq# 3Seq# 4 M M MM

Netprog: Routing and the Network Layer30 Flow Control Each packet includes an acknowledgement number (ACK). The ack# indicates that the send has recieved all packets with sequence number <= ack#. Each sender has a window size w that determines how many unacknowledged packets can be outstanding.

Netprog: Routing and the Network Layer31 DCE The interface between DCE is not part of the X.25 standard. Thought Exercise: –How could you design a network to route based on circuit numbers ?