4: Network Layer4b-1 Router Architecture Overview Two key router functions: r run routing algorithms/protocol (RIP, OSPF, BGP) r switching datagrams from.

Slides:

Advertisements

Similar presentations

1 Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2002.

Advertisements

Lecture 8 – IP Packets, Routers

1 ELEN 602 Lecture 18 Packet switches Traffic Management.

What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.

Chapter 4 Network Layer A note on the use of these ppt slides:

ECE506/2 #1Spring 2009 © , Richard A. Stanley ECE537 Advanced and High Performance Networks 1: Network Layer Review Professor Richard A. Stanley,

4: Network Layer4b-1 IP datagram format ver length 32 bits data (variable length, typically a TCP or UDP segment) 16-bit identifier Internet checksum time.

4: Network Layer4b-1 Network Layer Protocols CSIT435 Spring 2002.

1 Routing Protocols and Forwarding  The IP protocol  Routing Protocols o Intra-domain (inside an AS) o Inter-domain (between ASes)  Forwarding: inside.

4-1 Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving side, delivers.

High-Speed Router Design. Content Classes of Routers Components of a Router High-Speed Router Lookup Advances in Switching Fabrics Speeding Up Output.

Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 14.

10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.

Network Layer4-1 Chapter 4: Network Layer Chapter goals: r understand principles behind network layer services: m network layer service models m forwarding.

Routing - II Important concepts: Hierarchical Routing, Intra-domain routing, inter- domain routing, RIP, OSPF, BGP, Router Architecture.

EE 122: Router Design Kevin Lai September 25, 2002.

Network Layer4-1 Router Architecture Overview Two key router functions: r run routing algorithms/protocol (RIP, OSPF, BGP) r switching datagrams from incoming.

Data Center Networks and Basic Switching Technologies Hakim Weatherspoon Assistant Professor, Dept of Computer Science CS 5413: High Performance Systems.

Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 15.

CS 640: Introduction to Computer Networks

12-1 Last time □ BGP policy □ Broadcast / multicast routing ♦ Spanning trees Source-based, group-shared, center-based ♦ Reverse path forwarding, pruning.

Chapter 4 Queuing, Datagrams, and Addressing

CS 6401 Routing, Routers, Switching Fabrics Outline Link state routing Link weights Router Design / Switching Fabrics.

Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 All material copyright

1 Wide Area Networks and Internet CT1403 Lecture-8: Internet Network Layer (Part-3) By : Najla Al-Nabhan.

Network Layer – part 31 Customer-Provider Routing Relationships  The Global Internet consists of Autonomous Systems (AS) interconnected with each other:

Lecture 10 Overview. Border Gateway Protocol(BGP) De facto standard for Internet inter-AS routing allows subnet to advertise its existence to rest of.

Network Layer4-1 Chapter 4 Network Layer Part 1: network layer overview datagram networks routers Computer Networking: A Top Down Approach 6 th edition.

What’s inside a router. Router architecture overview two key router functions:  run routing algorithms/protocol (RIP, OSPF, BGP)  forwarding datagrams.

Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:

Network Layer —— the core of networking. The Network Core  mesh of interconnected routers  the fundamental question: how is data transferred through.

CS 1652 The slides are adapted from the publisher’s material All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Jack Lange.

Network Layer4-1 Chapter 4: Network Layer Chapter goals: r understand principles behind network layer services: m routing (path selection) m dealing with.

1 John Magee 24 February 2014 CS 280: Network Layer: Virtual Circuits / Datagram Networks and What’s inside a Router? Most slides adapted from Kurose and.

Router Architecture Overview

EEC-484/584 Computer Networks Lecture 9 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.

Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.

Network Layer4-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley,

Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.

CSE 5346 – Networks II: High Performance Networks and Quality of Service Spring 2016 Mike O’Dell Senior Lecturer 1.

Network Layer4-1 Chapter 4: Network Layer Chapter goals: r Understand principles behind network layer services: m Routing (path selection) m dealing with.

Network Layer4-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley,

Network Layer4-1 Chapter 4: Network Layer Chapter goals: r Understand principles behind network layer services: m Routing (path selection) m dealing with.

Network Layer4-1 Chapter 4: Network Layer Chapter goals: r understand principles behind network layer services: m routing (path selection) m dealing with.

CS 640: Introduction to Computer Networks Aditya Akella Lecture 9 - ARP, IP Packets and Routers.

Network Layer4-1 Chapter 4 Network Layer All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down.

Application Layer 2-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A.

Computer Networking Lecture 10 – IP Packets, Routers.

Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.

Network Layer4-1 Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol – Datagram.

Chapter 4: Network Layer

Chapter 3 Part 3 Switching and Bridging

Chapter 4 Network Layer All material copyright

Data Center Networks and Basic Switching Technologies

Chapter 4: Network Layer

CS/ECE 438: Communication Networks

CS4470 Computer Networking Protocols

Chapter 4: Network Layer

Chapter 3 Part 3 Switching and Bridging

CS 1652 The slides are adapted from the publisher’s material

Chapter 4-1 Network layer

What’s “Inside” a Router?

October 26th, 2010 CS1652/Telcom2310 Jack Lange

Chapter 4 Network Layer Computer Networking: A Top Down Approach 5th edition. Jim Kurose, Keith Ross Addison-Wesley, April Network Layer.

CS 5565 Network Architecture and Protocols

Chapter 3 Part 3 Switching and Bridging

Chapter 4: Network Layer

Chapter 4: Network Layer

Presentation transcript:

4: Network Layer4b-1 Router Architecture Overview Two key router functions: r run routing algorithms/protocol (RIP, OSPF, BGP) r switching datagrams from incoming to outgoing link

4: Network Layer4b-2 Input Port Functions Decentralized switching: r given datagram dest., lookup output port using routing table in input port memory r goal: complete input port processing at ‘line speed’ r queuing: if datagrams arrive faster than forwarding rate into switch fabric Physical layer: bit-level reception Data link layer: e.g., Ethernet see chapter 5

4: Network Layer4b-3 Input Port Queuing r Fabric slower that input ports combined -> queueing may occur at input queues r Head-of-the-Line (HOL) blocking: queued datagram at front of queue prevents others in queue from moving forward r queueing delay and loss due to input buffer overflow!

4: Network Layer4b-4 Three types of switching fabrics

4: Network Layer4b-5 Switching Via Memory First generation routers: r packet copied by system’s (single) CPU r speed limited by memory bandwidth (2 bus crossings per datagram) Input Port Output Port Memory System Bus Modern routers: r input port processor performs lookup, copy into memory r Cisco Catalyst 8500

4: Network Layer4b-6 Switching Via Bus r datagram from input port memory to output port memory via a shared bus r bus contention: switching speed limited by bus bandwidth r 1 Gbps bus, Cisco 1900: sufficient speed for access and enterprise routers (not regional or backbone)

4: Network Layer4b-7 Switching Via An Interconnection Network r overcome bus bandwidth limitations r Banyan networks, other interconnection nets initially developed to connect processors in multiprocessor r Advanced design: fragmenting datagram into fixed length cells, switch cells through the fabric. r Cisco 12000: switches Gbps through the interconnection network

4: Network Layer4b-8 Output Ports r Buffering required when datagrams arrive from fabric faster than the transmission rate r Scheduling discipline chooses among queued datagrams for transmission

4: Network Layer4b-9 Output port queueing r buffering when arrival rate via switch exceeeds ouput line speed r queueing (delay) and loss due to output port buffer overflow!