COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.

Slides:



Advertisements
Similar presentations
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Advertisements

What is “Routing”? Routing algorithm that part of the network layer responsible for deciding on which output line to transmit an incoming packet Adaptive.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets, 5e By Douglas E. Comer Lecture PowerPoints.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 15 Introduction to Networks and the Internet.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.
CSCI 4550/8556 Computer Networks Comer, Chapter 13: WAN Technologies and Routing.
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—4-1 LAN Connections Exploring the Functions of Routing.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Connecting Networks © 2004 Cisco Systems, Inc. All rights reserved. Exploring How Routing Works INTRO v2.0—4-1.
WAN Technologies & Topologies Lecture 8 October 4, 2000.
Chapter 13: WAN Technologies and Routing 1. LAN vs. WAN 2. Packet switch 3. Forming a WAN 4. Addressing in WAN 5. Routing in WAN 6. Modeling WAN using.
CECS 474 Computer Network Interoperability WAN Technologies & Routing
1 Chapter Wide Area Networks (WANs), Routing, and Shortest Paths.
WAN technologies and routing Packet switches and store and forward Hierarchical addresses, routing and routing tables Routing table computation Example.
Day 12 Chapter 13 WAN Technologies and Routing. Classification of Networks LAN – spans a single building or campus MAN – Spans a city WAN – Spans multiple.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
Routers. What is a Router? A multi-port connectivity device Can connect different types of LANs as well as WANS Works at Layer 3 – Network Layer using.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
1 WAN Technologies and Routing. 2 Motivation Connect multiple computers Span large geographic distance Cross public right-of-way –Streets –Buildings –Railroads.
The Network Layer Introduction  functionality and service models Theory  link state and distance vector algorithms  broadcast algorithms  hierarchical.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
Chapter 12(13) - WAN Technologies and Routing Route computation with a graph Redundant routing information Default routes Building routing tables Computation.
The Network Layer.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved. © The McGraw-Hill Companies, Inc. Internetworking, WANs, and Dynamic Routing.
Networking and internetworking devices. Repeater.
1 Version 3.1 Module 6 Routed & Routing Protocols.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Describe basic routing concepts. Routers Interconnect Networks Router is responsible for forwarding packets from network to network, from the original.
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
WAN Technologies. 2 Large Spans and Wide Area Networks MAN networks: Have not been commercially successful.
COMPUTER NETWORKS CS610 Lecture-17 Hammad Khalid Khan.
Configuration for routing example
Advanced Computer Networks
Network Layer.
COMPUTER NETWORKS CS610 Lecture-15 Hammad Khalid Khan.
Working at a Small-to-Medium Business or ISP – Chapter 6
ROUTING PROTOCOLS By: Er. Amit Mahajan.
COMPUTER NETWORKS CS610 Lecture-40 Hammad Khalid Khan.
The Underlying Technologies
Ch 13 WAN Technologies and Routing
COMP 3270 Computer Networks
Link-State Routing Protocols
CprE 458/558: Real-Time Systems
WAN Technologies and Routing
THE NETWORK LAYER.
18-WAN Technologies and Dynamic routing
Intra-Domain Routing Jacob Strauss September 14, 2006.
ECE 544 Protocol Design Project 2016
Link-State Routing Protocols
COMPUTER NETWORKS CS610 Lecture-42 Hammad Khalid Khan.
Routing Protocols Charles Warren.
Link-State Routing Protocols
Distributed Systems CS
Working at a Small-to-Medium Business or ISP – Chapter 6
Ch. 12: WAN Technologies and Routing
Wide Area Networks (WANs), Routing, and Shortest Paths
COMPUTER NETWORKS CS610 Lecture-18 Hammad Khalid Khan.
COMPUTER NETWORKS CS610 Lecture-41 Hammad Khalid Khan.
Wide Area Networks (WANs), Routing, and Shortest Paths
Wide Area Networks (WANs), Routing, and Shortest Paths
COMPUTER NETWORKS CS610 Lecture-29 Hammad Khalid Khan.
Computer network technology
Network Layer.
Distributed Systems CS
OSPF Protocol.
Presentation transcript:

COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan

Review Lecture 15 Wide Area Networks Packet Switches Physical Addressing in a WAN Store and Forward Next Hop Forwarding

Choosing Next Hop Packet switch doesn't keep complete information about all possible destination Just keeps next hop So, for each packet, packet switch looks up destination in table and forwards through connection to next hop

Choosing Next Hop

Source Independence Next hop to destination does not depend on source of packet, called Source Independence Allows fast, efficient routing Packet switch need not have complete information, just next hop Reduces total information Increases dynamic robustness - network can continue to function even if topology changes without notifying entire network

Hierarchical Addressing and Routing The Process of forwarding the packets from one hop to the next is known as Routing

Hierarchical Addressing and Routing

Hierarchical Addressing and Routing In particular, all destinations on same switch have same next hop Thus, routing table can be collapsed:

Routing in a WAN More computers == more traffic Can add capacity to WAN by adding more links and packet switches Packet switches need not have computers attached Interior switch - No attached computers Exterior switch - Attached computers

Routing in a WAN Both Interior and Exterior switches: Forward Packets Need Routing Tables Must have: Universal Routing - Next hop for each possible destination Optimal Routes - Next hop in table must be on shortest path to destination

Modeling a WAN Use a graph: Nodes model switches Edges model direct connections between switches Captures essence of network, ignoring attached computers

Modeling a WAN

Route Computation with a Graph Can represent routing table with edges:   Graph algorithms can be applied to find routes

Redundant Routing Information Notice duplication of information in routing table for node 1: Switch 1 has only one outgoing connection; all traffic must traverse that connection

Default Routes Can collapse routing table entries with a Default Route If destination does not have an explicit routing table entry, use the default route:

Default Routes

Summary Source Independence Hierarchical Addressing and Routing Routing in a WAN Default Routes