Connection-Based vs. Connectionless Telephone: operator sets up connection between the caller and the receiver –Once the connection is established, conversation.

Slides:



Advertisements
Similar presentations
The Network Layer Functions: Congestion Control
Advertisements

ENGS 116 Lecture 201 Interconnection Networks Cont’d Vincent H. Berk November 16, 2005 Reading for Friday: Reading for Monday: Homework.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
Lecture 2 Protocol Layers CPE 401 / 601 Computer Network Systems slides are modified from Dave Hollinger.
JR.S00 1 Lecture 25: Networks & Interconnect Networks on a Chip Prepared by: Professor David A. Patterson Professor Bill Dally (Stanford) Edited and presented.
Chapter 8: Local Area Networks: Internetworking. 2 Objectives List the reasons for interconnecting multiple local area network segments and interconnecting.
1 Chapter 9 Computer Networks. 2 Chapter Topics OSI network layers Network Topology Media access control Addressing and routing Network hardware Network.
Department of Computer Engineering University of California at Santa Cruz Networking Systems (1) Hai Tao.
CPSC614:Graduate Computer Architecture Network 2: Protocols, Routing, Wireless Prof.Lawrence Rauchwerger Based on lectures by Prof. David A. Patterson.
1 Version 3 Module 8 Ethernet Switching. 2 Version 3 Ethernet Switching Ethernet is a shared media –One node can transmit data at a time More nodes increases.
ENGS 116 Lecture 191 Interconnection Networks Vincent H. Berk November 24, 2008 Reading for today: Sections 6.1 – 6.4 Reading for Monday: Sections 6.5.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
1 Chapter 8 Local Area Networks - Internetworking.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
DAP Spr.‘98 ©UCB 1 Lecture 16: Networks & Interconnect (Routing, Examples, Protocols) + Intro to Parallel Processing Professor David A. Patterson Computer.
1 Chapter 8 Local Area Networks - Internetworking Data Communications and Computer Networks: A Business User’s Approach.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
COMPUTER NETWORKS.
Switching, routing, and flow control in interconnection networks.
CS211 - Fernandez - 1 CS211 Graduate Computer Architecture Network 2: Protocols, Routing, Wireless.
Chapter 6 High-Speed LANs Chapter 6 High-Speed LANs.
Chapter 4: Managing LAN Traffic
Chapter 2 The Infrastructure. Copyright © 2003, Addison Wesley Understand the structure & elements As a business student, it is important that you understand.
LECTURE 9 CT1303 LAN. LAN DEVICES Network: Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and.
Midterm Review - Network Layers. Computer 1Computer 2 2.
Brierley 1 Module 4 Module 4 Introduction to LAN Switching.
Chapter 2 – X.25, Frame Relay & ATM. Switched Network Stations are not connected together necessarily by a single link Stations are typically far apart.
1 Lecture 7: Interconnection Network Part I: Basic Definitions Part II: Message Passing Multicomputers.
Repeaters and Hubs Repeaters: simplest type of connectivity devices that regenerate a digital signal Operate in Physical layer Cannot improve or correct.
1 Next Few Classes Networking basics Protection & Security.
Chapter 6 – Connectivity Devices
Module 8: Ethernet Switching
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
William Stallings Data and Computer Communications 7 th Edition Chapter 1 Data Communications and Networks Overview.
UNDERSTANDING THE HOST-TO-HOST COMMUNICATIONS MODEL - OSI LAYER & TCP/IP MODEL 1.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
CCNA 3 Week 4 Switching Concepts. Copyright © 2005 University of Bolton Introduction Lan design has moved away from using shared media, hubs and repeaters.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
Computer Security Workshops Networking 101. Reasons To Know Networking In Regard to Computer Security To understand the flow of information on the Internet.
Cisco 3 - Switching Perrine. J Page 16/4/2016 Chapter 4 Switches The performance of shared-medium Ethernet is affected by several factors: data frame broadcast.
Sem1 - Module 8 Ethernet Switching. Shared media environments Shared media environment: –Occurs when multiple hosts have access to the same medium. –For.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Anshul Kumar, CSE IITD ECE729 : Advanced Computer Architecture Lecture 27, 28: Interconnection Mechanisms In Multiprocessors 29 th, 31 st March, 2010.
William Stallings Data and Computer Communications
STORE AND FORWARD & CUT THROUGH FORWARD Switches can use different forwarding techniques— two of these are store-and-forward switching and cut-through.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
Lecture 22 Interconnection Networks Computer Architecture COE 501.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Copyright 2002Cisco Press: CCNA Instructor’s Manual Year 2 - Chapter 16/Cisco 4 - Module 9 CCNA Certification Exam Review By Your Name.
CCNA Guide to Cisco Networking Chapter 2: Network Devices.
Data Communications and Networks Chapter 1 - Classification of network topologies Data Communications and Network.
CS10 L17 Internet II (1) Garcia © UCB Senior Lecturer SOE Dan Garcia cs10.berkeley.edu CS10 : Beauty and Joy of Computing.
Rehab AlFallaj.  Network:  Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and do specific task.
WAN Transmission Media
Networks: Routing, Deadlock, Flow Control, Switch Design, Case Studies Alvin R. Lebeck CPS 220.
CCNA3 Module 4 Brierley Module 4. CCNA3 Module 4 Brierley Topics LAN congestion and its effect on network performance Advantages of LAN segmentation in.
1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.
Lecture (2).
Packet Switching Datagram Approach Virtual Circuit Approach
Switching, routing, and flow control in interconnection networks
Practical Issues for Commercial Networks
Interconnection Network Design
PRESENTATION COMPUTER NETWORKS
Networks Networking has become ubiquitous (cf. WWW)
Based on lectures by Prof. David A. Patterson UC Berkeley
CS 6290 Many-core & Interconnect
Networking.
Switching, routing, and flow control in interconnection networks
Presentation transcript:

Connection-Based vs. Connectionless Telephone: operator sets up connection between the caller and the receiver –Once the connection is established, conversation can continue for hours Share transmission lines over long distances by using switches to multiplex several conversations on the same lines –“Time division multiplexing” divide B/W transmission line into a fixed number of slots, with each slot assigned to a conversation Problem: lines busy based on number of conversations, not amount of information sent Advantage: reserved bandwidth

Connection-Based vs. Connectionless Connectionless: every package of information must have an address => packets –Each package is routed to its destination by looking at its address –Analogy, the postal system (sending a letter) –also called “Statistical multiplexing” –Note: “Split phase buses” are sending packets

Routing Messages Shared Media –Broadcast to everyone Switched Media needs real routing. Options: –Source-based routing: message specifies path to the destination (changes of direction) –Virtual Circuit: circuit established from source to destination, message picks the circuit to follow –Destination-based routing: message specifies destination, switch must pick the path »deterministic: always follow same path »adaptive: pick different paths to avoid congestion, failures »Randomized routing: pick between several good paths to balance network load

mesh: dimension-order routing –(x 1, y 1 ) -> (x 2, y 2 ) –first  x = x 2 - x 1, –then  y = y 2 - y 1, hypercube: edge-cube routing –X = x o x 1 x 2... x n -> Y = y o y 1 y 2... y n –R = X xor Y –Traverse dimensions of differing address in order tree: common ancestor Deterministic Routing Examples

Store and Forward vs. Cut-Through Store-and-forward policy: each switch waits for the full packet to arrive in switch before sending to the next switch (good for WAN) Cut-through routing or worm hole routing: switch examines the header, decides where to send the message, and then starts forwarding it immediately –In worm hole routing, when head of message is blocked, message stays strung out over the network, potentially blocking other messages –Cut through routing lets the tail continue when head is blocked, accordioning the whole message into a single switch. (Requires a buffer large enough to hold the largest packet).

Store and Forward vs. Cut-Through Advantage –Latency reduces from function of: number of intermediate switches X by the size of the packet to time for 1st part of the packet to negotiate the switches + the packet size ÷ interconnect BW

Congestion Control Packet switched networks do not reserve bandwidth; this leads to contention (connection based limits input) Solution: prevent packets from entering until contention is reduced (e.g., freeway on-ramp metering lights) Options: –Packet discarding: If packet arrives at switch and no room in buffer, packet is discarded (e.g., UDP) –Flow control: between pairs of receivers and senders; use feedback to tell sender when allowed to send next packet »Back-pressure: separate wires to tell to stop »Window: give original sender right to send N packets before getting permission to send more; overlaps latency of interconnection with overhead to send & receive packet (e.g., TCP), adjustable window –Choke packets: aka “rate-based”; Each packet received by busy switch in warning state sent back to the source via choke packet. Source reduces traffic to that destination by a fixed % (e.g., ATM)

Practical Issues for Inteconnection Networks Standardization advantages: –low cost (components used repeatedly) –stability (many suppliers to chose from) Standardization disadvantages: –Time for committees to agree –When to standardize? »Before anything built? => Committee does design? »Too early suppresses innovation Perfect interconnect vs. Fault Tolerant? –Will SW crash on single node prevent communication? (MPP typically assume perfect) Reliability (vs. availability) of interconnect

Practical Issues InterconnectionMPPLANWAN ExampleCM-5EthernetATM StandardNoYesYes Fault Tolerance?NoYesYes Hot Insert?NoYesYes Standards: required for WAN, LAN! Fault Tolerance: Can nodes fail and still deliver messages to other nodes? required for WAN, LAN! Hot Insert: If the interconnection can survive a failure, can it also continue operation while a new node is added to the interconnection? required for WAN, LAN!

Cross-Cutting Issues for Networking Efficient Interface to Memory Hierarchy vs. to Network –SPEC ratings => fast to memory hierarchy –Writes go via write buffer, reads via L1 and L2 caches Example: 40 MHz SPARCStation(SS)-2 vs 50 MHz SS-20, no L2$ vs 50 MHz SS-20 with L2$ I/O bus latency; different generations SS-2: combined memory, I/O bus => 200 ns SS-20, no L2$: 2 busses +300ns => 500ns SS-20, w L2$: cache miss+500ns => 1000ns

Protocols: HW/SW Interface Internetworking: allows computers on independent and incompatible networks to communicate reliably and efficiently; –Enabling technologies: SW standards that allow reliable communications without reliable networks –Hierarchy of SW layers, giving each layer responsibility for portion of overall communications task, called protocol families or protocol suites Transmission Control Protocol/Internet Protocol (TCP/IP) –This protocol family is the basis of the Internet –IP makes best effort to deliver; TCP guarantees delivery –TCP/IP used even when communicating locally: NFS uses IP even though communicating across homogeneous LAN

Protocol Key to protocol families is that communication occurs logically at the same level of the protocol, called peer-to- peer, but is implemented via services at the lower level Danger is each level increases latency if implemented as hierarchy (e.g., multiple check sums)

TCP/IP packet Application sends message TCP breaks into 64KB segements, adds 20B header IP adds 20B header, sends to network If Ethernet, broken into 1500B packets with headers, trailers Header, trailers have length field, destination, window number, version,... TCP data (Š 64KB) TCP Header IP Header IP Data Ethernet

Example Networks Ethernet: shared media 10 Mbit/s proposed in 1978, carrier sensing with expotential backoff on collision detection Multiple Ethernets with devices to allow Ethernets to operate in parallel! 10 Mbit Ethernet successors? –ATM (too late?) –Switched Ethernet –100 Mbit Ethernet (Fast Ethernet) –Gigabit Ethernet

Connecting Networks Bridges: connect LANs together, passing traffic from one side to another depending on the addresses in the packet. –operate at the Ethernet protocol level –usually simpler and cheaper than routers Routers or Gateways: these devices connect LANs to WANs or WANs to WANs and resolve incompatible addressing. –Generally slower than bridges, they operate at the internetworking protocol (IP) level –Routers divide the interconnect into separate smaller subnets, which simplifies manageability and improves security Cisco is major supplier; basically special purpose computers

Example Networks Length (meters) Number data lines Clock Rate Switch? Nodes (N) Material Bisection BW (Mbit/s) Peak Link BW (Mbits/s) Measured Link BW IBM SP MHz Yes Š512 copper 320xNodes Mb Ethernet MHz No Š254 copper MPPLAN ATM 100/ /622… Yes ­10000 copper/fiber 155xNodes WAN

Example Networks (cont’d) Latency (µsecs) Send+Receive Ovhd (µsecs) Topology Connectionless? Store & Forward? Congestion Control Standard Fault Tolerance IBM SP Fat tree Yes No Back- pressure No Yes 100 Mb Ethernet Line Yes No Carrier Sense Yes ATM ­ Star No Yes Choke packets Yes MPPLANWAN

Examples: Interface to Processor

Packet Formats Fields: Destination, Checksum(C), Length(L), Type(T) Data/Header Sizes in bytes: (4 to 20)/4, (0 to 1500)/26, 48/5

Example Switched LAN Performance Network InterfaceSwitchLink BW AMD Lance EthernetBaynetworks10 Mb/s EtherCell Fore SBA-200 ATMFore ASX Mb/s Myricom MyrinetMyricom Myrinet 640 Mb/s On SPARCstation-20 running Solaris 2.4 OS Myrinet is example of “System Area Network”: networks for a single room or floor: 25m limit –shorter => wider faster, less need for optical –short distance => source-based routing => simpler switches –Compaq-Tandem/Microsoft also sponsoring SAN, called “ServerNet”

Example Switched LAN Performance (1995) SwitchSwitch Latency Baynetworks 52.0 µsecs EtherCell Fore ASX-200 ATM 13.0 µsecs Myricom Myrinet 0.5 µsecs –Measurements taken from “LogP Quantyified: The Case for Low-Overhead Local Area Networks”, K. Keeton, T. Anderson, D. Patterson, Hot Interconnects III, Stanford California, August 1995.

UDP/IP performance NetworkUDP/IP roundtrip, N=8BFormula Bay. EtherCell 1009 µsecs +2.18*N Fore ASX-200 ATM 1285 µsecs +0.32*N Myricom Myrinet 1443 µsecs +0.36*N Formula from simple linear regression for tests from N = 8B to N = 8192B Software overhead not tuned for Fore, Myrinet; EtherCell using standard driver for Ethernet

NFS performance NetworkAvg. NFS response LinkBW/EtherUDP/E. Bay. EtherCell 14.5 ms11.00 Fore ASX-200 ATM 11.8 ms Myricom Myrinet 13.3 ms Last 2 columns show ratios of link bandwidth and UDP roundtrip times for 8B message to Ethernet

Estimated Database performance (1995) NetworkAvg. TPS LinkBW/E.TCP/E. Bay. EtherCell 77 tps11.00 Fore ASX-200 ATM 67 tps Myricom Myrinet 66 tps Number of Transactions per Second (TPS) for DebitCredit Benchmark; front end to server with entire database in main memory (256 MB) –Each transaction => 4 messages via TCP/IP –DebitCredit Message sizes < 200 bytes Last 2 columns show ratios of link bandwidth and TCP/IP roundtrip times for 8B message to Ethernet

Summary: Networking Protocols allow hetereogeneous networking –Protocols allow operation in the presense of failures –Internetworking protocols used as LAN protocols => large overhead for LAN Integrated circuit revolutionizing networks as well as processors –Switch is a specialized computer –Faster networks and slow overheads violate of Amdahl’s Law