1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.

Slides:



Advertisements
Similar presentations
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Advertisements

Traffic Shaping Why traffic shaping? Isochronous shaping
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
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.
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.
The Design Philosophy of the DARPA Internet Protocols D. D. Clark.
Teknik Routing Pertemuan 20 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
Design Philosophy of the DARPA Internet Protocols CSCI 634, Fall 2010.
CS335 Networking & Network Administration Tuesday, May 18, 2010.
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 5 – TCP/IP: Part 4 Dr. V.T. Raja Oregon State University.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
EEC-484/584 Computer Networks Lecture 9 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
EEC-484/584 Computer Networks Lecture 9 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Routing.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 1 v3.0 Module 10 Routing Fundamentals and Subnets.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
EEC-484/584 Computer Networks Lecture 9 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
The Future of the Internet Jennifer Rexford ’91 Computer Science Department Princeton University
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Introduction to Routing and Routing Protocols By Ashar Anwar.
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network Chapter 12: Routing.
Network Layer4-1 Chapter 4: Network Layer Chapter goals: r understand principles behind network layer services: m network layer service models m forwarding.
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
CCNA 1 Module 10 Routing Fundamentals and Subnets.
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Network Layer introduction.
EEC-484/584 Computer Networks Lecture 9 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
The Network Layer Introduction  functionality and service models Theory  link state and distance vector algorithms  broadcast algorithms  hierarchical.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
CCNA 1 v3.0 Module 10 Routing Fundamentals and Subnets.
Routing and Routing Protocols
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 1 v3.0 Module 10 Routing Fundamentals and Subnets.
Network Layer (OSI and TCP/IP) Lecture 9, May 2, 2003 Data Communications and Networks Mr. Greg Vogl Uganda Martyrs University.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Section #7: Getting Data from Point A to Point B.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
Static Routing Technique. What is Routing   the act of moving information across an internetwork from a source to a destination   Bridge   the mid-1980s.
Release 16/7/2009 Internetworking Devices Chapter 10 Jetking Infotrain Ltd.
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.
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.
Day 13 Intro to MANs and WANs. MANs Cover a larger distance than LANs –Typically multiple buildings, office park Usually in the shape of a ring –Typically.
Multiprotocol Label Switching (MPLS) Routing algorithms provide support for performance goals – Distributed and dynamic React to congestion Load balance.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Working at a Small-to-Medium Business or ISP – Chapter 6
Chapter 4 Network Layer All material copyright
COMP 3270 Computer Networks
EEC-484/584 Computer Networks
Chapter 5 Network and Transport Layers
Network Core and QoS.
EEC-484/584 Computer Networks
Dynamic Routing and OSPF
ECE453 – Introduction to Computer Networks
EEC-484/584 Computer Networks
Routing Fundamentals and Subnets
Chapter 4 Network Layer Computer Networking: A Top Down Approach 5th edition. Jim Kurose, Keith Ross Addison-Wesley, April Network Layer.
Working at a Small-to-Medium Business or ISP – Chapter 6
Network Core and QoS.
Chapter 4 Network Layer A note on the use of these ppt slides:
Presentation transcript:

1 Scalability is King

2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence is in the outskirts of the network

3 Internet: Design Goals The goal: to interconnect multiple existing networks and technologies Packet switching over circuit switching Reasons:  the applications were suited for this: rlogin  Packet switching was well understood  More flexible, less committal “The design philosophy of the DARPA Internet protocol”, SIGCOMM 88

4 Internet Design: Secondary Level Goals Fault-tolerance (DARPA is the army) Support multiple communication services Accommodate various technologies & networks Allow distributed management Enable cost effective resource Ease of interconnection: adding a host Resources used in the Internet must be accountable (less attention)

5 Fault Tolerance: The Internet Premise: One Robust Connected Network Robust to random, sensitive to focused failures The network tends to stay as one connected component Size of LargestConnectedComponent #Deleted nodes

6 I. State: The Enemy of Scalability Routing state: the information that a router needs to keep in order to route Large routing state is bad Consumes memory Makes look-up slow State = information = intelligence The trade-off: intelligent vs scalable behavior

7 I. An Interesting Antithesis Telephone network: End devices are stupid Core is intelligent Internet: End devices are intelligent Core is stupid (forward packets, no guarantees) Telephone network: Circuit switching Ultra reliable, guarantee quality(real-time) Centralized control Difficult to add new users Cumbersome to new apps Internet: Packet switching Unreliable: no guarantees Decentralized Easy to add new users Easy to add new applications

8 I. Internet: Routing State What does a router know? Routing table: IP prefix -> outgoing link What is an IP prefix? Scalability: IP prefixes aggregate many IPs to one entry Routers do not* keep per connection information * Some exceptions exist.

9 I. State Per Flow: pros and cons What would state per flow give us? Differentiate our behavior per flow Provide QoS Be fair: share resources accordingly Monitor and measure: accountability - costing Ensure that packets follow the same path

10 II. Centralized vs Decentralized Routing Centralized All information exists in one place Decisions are taken there The decision involves the whole path OSPF: all routes have all the info: Decentralized Each router makes a decision in isolation Each router knows partial/aggregated information RIP, BGP are some protocols

11 III. Dynamic vs. Static Routing Routing is an optimization problem What are we trying to optimize? Static metrics (non time varying) Number of hops (hopcount) Link capacity Buffer space Dynamic metrics (time varying) End2end (e2e) Delay Link delay Link utilization Available buffer space

12 III. Dynamic or Static Routing? Static routing Stable Arguably: utilizes resources well in the long run Dynamic routing Flexible - adaptable Better performance (short term at least)

13 IV. QoS Aware Routing Quality of Service is tightly coupled with Reservations I need 10Mb/s with at most 100msec e2e delay Problems: Find a suitable path  Centrally easier,  Distributed: start reserving, then backtrack Reserving resources along the path Protecting resources from future flows

14 For next time Refresh your memory: Kurose - Ross Textbook: chapter 1: intro Textbook: chapter 4: Network Layer and routing Read: Clark’s sigcomm ‘88 paper Case study: How stable is Internet routing: Run traceroute (linux) and see what happens