Now Arriving at Layer 3. Packet Forwarding. Router Design. Network Layers and Routers. Switching and Forwarding. Forwarding
|
|
- Rhoda McCarthy
- 5 years ago
- Views:
Transcription
1 Now rriving at Layer Packet orwarding although layer switches and layer routers are similar in many ways and TM/Virtual are used at layer these days 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6 Layers and Routers Router esign pplication Presentation pplication Presentation Input Input Output Output Session Transport Router Session Transport Input Input abric Output Output ata Link ata Link ata Link Input Output Input Output 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6 4 orwarding ing and orwarding orwarding lgorithm onsult packet header onsult forwarding tables ecide on output port Three general types atagram forwarding Virtual Source Routing iffer by contents of header and tables orwarding The task of specifying an appropriate output port for a packet atagram Virtual ircuit ing Source Routing ach packet contains enough information for a switch to determine the correct output port Later uilding forwarding tables routing. Packet eader Output Specification 9/7/6 S/ 48 - UIU, all 6 5 9/7/6 S/ 48 - UIU, all 6 6
2 orwarding with atagrams orwarding with atagrams onnectionless ach packet travels independently Translates global address to output port Maintains table of translations Used in traditional data networks i.e., Internet α β γ δ 9/7/6 S/ 48 - UIU, all 6 7 9/7/6 S/ 48 - UIU, all 6 8 Routing Table orwarding with atagrams ach switch maintains a routing table that translates a host name to an output port α β δ γ α s Table β s Table γ s Table δ s Table α β δ γ What happens to the last packet? sends: sends: sends: sends: sends: T T T T T 9/7/6 S/ 48 - UIU, all 6 9 9/7/6 S/ 48 - UIU, all 6 orwarding with atagrams Traceroute xample nalogous to following signs Requires globally unique addresses Routing is decentralized router follows global routing algorithms Two packets usually take the same path but ach router can change its mind at any time rom W solutions traceroute traceroute to ( ), hops max, 4 byte packets uiuc-ewsl-vlan.gw.uiuc.edu (.6.6.).45 ms. ms.9 ms ae--.bbr.washington.level.net ( ).946 ms as--.bbr.washington.level.net (9.47..).5 ms.8 ms 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6
3 atagrams dvantages Routes around failures an send traffic immediately isadvantages eader requires full unique address Might not be possible to deliver packet Successive packets may not follow the same route lobal address to path translations requires significant storage onnection oriented Requires explicit setup and teardown Packets follow established route Why support connections in a network? Useful for service notions Important for telephony Translates virtual circuit I on incoming link to virtual circuit I on outgoing link ircuit Ids can be per-link or per-switch Used in TM 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6 4 Virtual Packet header stores: Virtual ircuit I Router stores: Table of how to forward packets for each virtual circuit Note: need not be global ssign a to a circuit for each linklink pair Set up virtual circuit identifier () is assigned to the circuit for each link it traverses is locally significant <incoming port, incoming > uniquely identifies V Maintains a translation table from <incoming port, incoming > to <outgoing port, outgoing > Permanent Virtual (PV) Long-lived Virtual (SV) Uses signaling to establish V 9/7/6 S/ 48 - UIU, all 6 5 9/7/6 S/ 48 - UIU, all 6 6 simple example setup protocol ach host and switch maintains per-link local variable for assignment When setup frame leaves host/switch ssign outgoing Increment assignment counter port and circuit id combination is unique switches maintain translation table from incoming port/ pair to outgoing port/ pair ssumptions are simplex On a duplex link, the same can be used for two circuits, one in each direction The same can be used on different ports of the same switch t setup, the lowest available is used 9/7/6 S/ 48 - UIU, all 6 7 9/7/6 S/ 48 - UIU, all 6 8
4 Set up circuit: Setup est =? α β γ Setup <,> <,?> Setup <,> est = <,?> est = δ Setup <,> <,?> est = 9/7/6 S/ 48 - UIU, all 6 9 Set up circuit: K = α β γ K <,> <,> K <,> = <,> = δ K <,> <,> = = 9/7/6 S/ 48 - UIU, all 6 α β γ δ Set up circuits: α β δ α γ δ β Table entries after connection is set 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6 Table entries after,, connection is set α δ β γ nalogous to a game of following a sequence of clues dvantages eader (for a data packet) requires only virtual circuit I onnection request contains global address an reserve resources at setup time isadvantages Typically must wait one RTT for setup annot dynamically avoid failures, must reestablish connection lobal address path information still necessary for connection setup 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6 4 4
5 orwarding with source routing orwarding with Source Routing Packet header specifies directions One direction per switch bsolute name Next switch name Relative Turn clockwise ports es may delete or rotate directions within packet headers No state stored at switch! α β δ What happens to the last packet? γ sends: T sends: T sends: T sends: T sends: T 9/7/6 S/ 48 - UIU, all 6 5 9/7/6 S/ 48 - UIU, all 6 6 orwarding with Source Routing TM nalogous to following directions dvantages Simple switches ast and cheap isadvantages s must know entire topology hanges must propagate to all hosts eaders might get large efined by the TM orum ormed October 99 Joint effort of the telephony and data network industry igh-level Overview Virtual circuit routing ixed length frames (aka cells) Standard define layers 9/7/6 S/ 48 - UIU, all 6 7 9/7/6 S/ 48 - UIU, all 6 8 TM TM etails TL daptation Layer (L) onvergence sub-layer (S) supports different application service models Segmentation and reassembly (SR) Supports variable-length frames TM Layer Virtual circuits maintenance ell header generation low control Layer Transmission convergence (T) rror detection, raming medium dependent (PM) sublayer encoding S SR T PM L TM phys. Where is TM used? ommon in WNs an also be used in LNs What is TM built on? Typically implemented on SONT esign onnection establishment Signaling (Q.9) Virtual circuits Virtual Paths undles of virtual circuits Share common route Optimizes forwarding 9/7/6 S/ 48 - UIU, all 6 9 9/7/6 S/ 48 - UIU, all 6 5
6 TM ells TM Rationale ell specification 5-bytes 48-byte payload -byte R 4-byte header Why hierarchical connections? Setup New virtual circuits can follow existing virtual path routes orwarding Virtual Path Identifier (VPI) Used between switches Virtual ircuit Identifier () Used for last hop Routing around failures Need only change virtual path once for 64K virtual circuits 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6 TM Rationale TM Rationale Public Why fixed-length frames? ardware Simpler processing for known frame sizes Parallelization of processing stages Is there an optimal length? Small cells igh header-to-data overhead Large frames must be fragmented Large cells Low utilization for small messages 9/7/6 S/ 48 - UIU, all 6 9/7/6 S/ 48 - UIU, all 6 4 TM Rationale TM Rationale Why short cells? etter queueing behavior Reduced granularity of preemption igh priority cell waits for one cell Long cell: potentially long wait Short cell: limited wait Limits end-to-end jitter (variance in latency) Shorted store-and-forward delay es typically store whole frame, then forward Short cells enable first part of a fragmented frame to be sent while the rest is still arriving Queueing ehavior xample onsider 4K vs. 5 cells, Mbps Link Preemption igh priority cell arrives just as switch starts sending low-priority cell 4K: high-priority cell must wait for 8µs 5: high priority cell must wait for 4µs Queueing Two 4K frames arrive simultaneously at time 4K: link is idle until all data arrives at time 8µs, 8K left to send 5: irst 5 is sent at time 4µs. t time 8µs, 4K left to send 9/7/6 S/ 48 - UIU, all 6 5 9/7/6 S/ 48 - UIU, all 6 6 6
7 TM Rationale TM and LNs Why 5-byte cells? US wanted 64-bytes igital encoding for voice frame = 64Kbps (8-bit samples, 8Khz) ollect one sample per frame With 64-byte cells, no need for echo cancellation Latency cell = 6msec Not detectable by humans urope wanted -byte Shorter distances, no need for echo cancellation ompromise 48-bytes of data! Problems with 5-byte (48-bytes of data) cells Not a power of! omments ed networks have better performance then shared media Shared media performance is increasing (-Mps and igabit thernet) TM in a LN TM doesn t look like a traditional LN Specifically, no native support for broadcast and multicast Solution Redesign protocols that require broadcast/multicast Make TM behave more like a shared medium LN mulation (LN) 9/7/6 S/ 48 - UIU, all 6 7 9/7/6 S/ 48 - UIU, all 6 8 Structure of LN TM Local rea mulation (LN) TM network can have multiple mulated LN s (LN s) ach LN corresponds to a single network s do not have to be geographically oriented s can move between buildings, but remain on the same network ccess ontrol Lists (L s) on LN servers ontrol which hosts can join which LN s TM LN TM LN LN- TM TM LN- LN/thernet daptor ard LN/thernet daptor ard ll same color hosts think they are on the same thernet thernet thernet 9/7/6 S/ 48 - UIU, all 6 9 9/7/6 S/ 48 - UIU, all 6 4 TM Local rea mulation (LN) TM/LN Protocol Layers TM LN/thernet daptor ard thernet igher Layer Protocols (IP, RP ) igher Layer Protocols (IP, RP ) TM LN/thernet daptor ard ll hosts think they are on the same thernet thernet Signaling and LN L 5 TM thernet-like Interface PY TM PY Signaling and LN L 5 TM 9/7/6 S/ 48 - UIU, all 6 4 9/7/6 S/ 48 - UIU, all 6 4 7
Switching and Forwarding
Switching and Forwarding Outline Store-and-Forward Switches ridges and Extended LNs ell Switching Segmentation and Reassembly Scalable Networks Switch forwards packets from input port to output port port
More informationResearch paper Measured Capacity of an Ethernet: Myths and Reality
Research paper Measured apacity of an Ethernet: Myths and Reality Theoretical work seems to suggest that Ethernet works saturate at 7%. Realistic networks can offer higher throughputs Lessons learnt Don
More informationLecture 6: Bridges and Switches. CS/ECE 438: Communication Networks Prof. Matthew Caesar February 19, 2010
Lecture 6: ridges and Switches CS/C 48: Communication Networks Prof. Matthew Caesar February 9, How can many hosts communicate? Naïve approach: full mesh Problem: doesn t scale How can many hosts communicate?
More informationCSE/EE 461 Lecture 7 Bridging LANs. Last Two Times. This Time -- Switching (a.k.a. Bridging)
S/ 461 Lecture 7 ridging LNs Last Two Times Medium ccess ontrol (M) protocols Part of the Link Layer t the heart of Local rea Networks (LNs) ow do multiple parties share a wire or the air? Random access
More informationOutline Computer Networking. Circuit Switching. Circuit Switching
line 5-5- omputer Networking 5-6 Lecture : Virtual ircuits Peter Steenkiste ircuit switching refresher Virtual ircuits - general Why virtual circuits? How virtual circuits? -- tag switching! Two modern
More informationSwitching and Forwarding - continued
Fall 9/7 CptS/EE 555 Fall 9/7 CptS/EE 555 4 Housekeeping Look at select system call See homework solutions on the Lecture Notes web page for answer to the probability difficulties we (I) had last time
More informationSwitching and Forwarding - continued
Fall 9/ CptS/EE 555 Fall 9/ CptS/EE 555 4 Housekeeping Look at select system call See homework solutions on the Lecture Notes web page for answer to the probability difficulties we (I) had last time No
More informationCell Switching (ATM) Commonly transmitted over SONET other physical layers possible. Variable vs Fixed-Length Packets
Cell Switching (ATM) Connection-oriented packet-switched network Used in both WAN and LAN settings Signaling (connection setup) Protocol: Q2931 Specified by ATM forum Packets are called cells 5-byte header
More informationRecap. Requirements of Networks. Overview of the lecture LAN. Types of Networks. Lecture 03: Networking
Lecture : Networking istributed Systems ehzad ordbar School of omputer Science, University of irmingham, UK Recap rchitecture, what? and why? Tiered rchitecture Various software layer: middleware client/server
More informationTOC: Switching & Forwarding
Walrand Lecture TO: Switching & Forwarding Lecture Switching & Forwarding EES University of alifornia Berkeley Why? Switching Techniques Switch haracteristics Switch Examples Switch rchitectures Summary
More informationThird Generation Routers
IP orwarding 5-5- omputer Networking 5- Lecture : Routing Peter Steenkiste all www.cs.cmu.edu/~prs/5-- The Story So ar IP addresses are structured to reflect Internet structure IP packet headers carry
More informationIP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing
IP orwarding - omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSP (Open Shortest Path irst) The Story So ar IP addresses are structure to reflect Internet structure
More informationAnnouncements. CS 5565 Network Architecture and Protocols. Ethernet. Ethernet. Ethernet Model. Ideal Multiple Access Protocol
nnouncements CS 5565 Network rchitecture and Protocols Lecture 4 odmar ack Project due in parts: pr 5 and May xtra Credit Opportunities: xpand simulator (and your implementation) to introduce multiple
More informationPrevious Lecture. Link Layer & Network Layer. Link Layer. This Lecture. Framing. Sending bits. Chapter 7.C and 7.D
hapter 7. and 7. Previous Lecture Layer & Network Layer The network is organized into layers Prof. ina Katabi Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari alakrishnan,
More informationHWP2 Application level query routing HWP1 Each peer knows about every other beacon B1 B3
HWP2 Application level query routing HWP1 Each peer knows about every other beacon B2 B1 B3 B4 B5 B6 11-Feb-02 Computer Networks 1 HWP2 Query routing searchget(searchkey, hopcount) Rget(host, port, key)
More informationThis Lecture. BUS Computer Facilities Network Management X.25. X.25 Packet Switch. Wide Area Network (WAN) Technologies. X.
This ecture BUS350 - Computer Facilities Network Management Wide rea Network (WN) Technologies. X.5 Frame Relay TM Faculty of Information Technology Monash University Faculty of Information Technology
More informationPacket Switching. Hongwei Zhang Nature seems to reach her ends by long circuitous routes.
Problem: not all networks are directly connected Limitations of directly connected networks: limit on the number of hosts supportable limit on the geographic span of the network Packet Switching Hongwei
More informationComputer Communication Networks
Contents ELL 785 Computer Communication Networks Introduction Lecture 1 Taxonomy of communication works Computer Communication Networks Building a work ed work architecture 1-1 Introduction PC server wireless
More informationBridges. Bridge Functions. Example of No-frills Bridge. No-frills Bridges. Example of Learning Bridge. Learning Bridges
ridge Functions To extend size of LNs either geographically or in terms number of users. Protocols that include collisions can be performed in a collision domain of limited size. In ring networks the number
More informationLast time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access
Last time Wireless link-layer Introduction Wireless hosts, base stations, wireless links Characteristics of wireless links Signal strength, interference, multipath propagation Hidden terminal, signal fading
More informationA Whirlwind Introduction to the Internet Overview
Overview What s the Internet What s a protocol? Network edge Network core ccess nets, media Performance: loss, delay Protocol layers, service models ackbones, NPs, ISPs local ISP company regional ISP queuing
More informationPacket Switching. Packet Switching What Issues Will We Focus On? COMP Jasleen Kaur. September 2, Networked and Distributed Systems
Networked and Distributed Systems Packet Switching Jasleen Kaur September, 9 Packet Switching What Issues Will We Focus On? Point-to-point links don t scale to large networks» Limited geographical coverage,
More informationSlides for Chapter 3: Networking and Internetworking
Slides for hapter 3: Networking and Internetworking From oulouris, ollimore and Kindberg istributed Systems: oncepts and esign dition 4, Networking Issues () Performance: Latency (time between send and
More information0!1. Overlaying mechanism is called tunneling. Overlay Network Nodes. ATM links can be the physical layer for IP
epartment of lectrical ngineering and omputer Sciences University of alifornia erkeley '!$$( network defined over another set of networks The overlay addresses its own nodes Links on one layer are network
More informationComputer Networks. More on Standards & Protocols Quality of Service. Week 10. College of Information Science and Engineering Ritsumeikan University
Computer Networks More on Standards & Protocols Quality of Service Week 10 College of Information Science and Engineering Ritsumeikan University Introduction to Protocols l A protocol is a set of rules
More informationIP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing
IP Forwarding 5-44 omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) The Story So Far IP addresses are structured to reflect Internet
More informationDSDV: Proactive. Distance Vector (Basic idea) Distance Vector. Distance Vector Algorithm: Tables 12/13/2016
estination Sequenced istance Vector (SV) Routing [Perkins94] SV: Proactive SV is a proactive protocol means it maintains up-to-date routing information for all available nodes in the network. No extra
More informationInternet: Best Effort. L11: Protocols and Network layer. Protocol. End hosts implement everything else
L: Protocols and Network layer Frans Kaashoek 6.0 Spring 0 http://web.mit.edu/6.0 Some slides are from lectures by Nick Mckeown, Ion Stoica,ina Katabi, Hari alakrishnan, Sam Madden, and Robert Morris Internet:
More informationAnnouncements. Ethernet. Goals of Today s Lecture. Three Ways to Share the Media. Random Access Protocols. Key Ideas of Random Access
Ethernet EE 1: Intro to ommunication Networks Fall 00 (WF -:0 in ory ) Vern Paxson Ts: Lisa Fowler, aniel Killebrew & Jorge Ortiz http://inst.eecs.berkeley.edu/~ee1/ nnouncements Solutions for Homework
More informationInternetworking Part 1
CMPE 344 Computer Networks Spring 2012 Internetworking Part 1 Reading: Peterson and Davie, 3.1 22/03/2012 1 Not all networks are directly connected Limit to how many hosts can be attached Point-to-point:
More informationCMSC 332 Computer Networks Network Layer
CMSC 332 Computer Networks Network Layer Professor Szajda CMSC 332: Computer Networks Where in the Stack... CMSC 332: Computer Network 2 Where in the Stack... Application CMSC 332: Computer Network 2 Where
More informationPacket Switching Techniques
Packet Switching Techniques 188lecture3.ppt Pasi Lassila 1 Problem Aim: Build larger networks connecting more users also spanning different network technologies Shared media networks limited number of
More informationCEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni
3/4/04 EN44 Network Protocols and lgorithms hapter Routing lgorithms Dr. Ridha Ouni Department of omputer Engineering ollege of omputer and Information Sciences King Saud University References Some slides
More informationSwitching and Forwarding Reading: Chapter 3 1/30/14 1
Switching and Forwarding Reading: Chapter 3 1/30/14 1 Switching and Forwarding Next Problem: Enable communication between hosts that are not directly connected Fundamental Problem of the Internet or any
More informationCS 43: Computer Networks. 23: Routing Algorithms November 14, 2018
S 3: omputer Networks 3: Routing lgorithms November, 08 Last class NT: Network ddress Translators: NT is mostly bad, but in some cases, it s a necessary evil. IPv6: Simpler, faster, better Tunneling: IPv6
More informationAdaptors Communicating. Link Layer: Introduction. Parity Checking. Error Detection. Multiple Access Links and Protocols
Link Layer: Introduction daptors ommunicating hosts and routers are nodes links connect nodes wired links wireless links layer-2 packet is a frame, encapsulates datagram datagram controller sending host
More informationDigital Communication Networks
Digital Communication Networks MIT PROFESSIONAL INSTITUTE, 6.20s July 25-29, 2005 Professor Muriel Medard, MIT Professor, MIT Slide 1 Digital Communication Networks Introduction Slide 2 Course syllabus
More informationDQDB. Distributed Queue Dual Bus (DQDB) DQDB is a MAN. Unlike FDDI, DQDB is an IEEE standard: 802.6
DQDB Distributed Queue Dual Bus (DQDB) DQDB is a MAN. Unlike FDDI, DQDB is an IEEE standard: 802.6 1 Topology: Dual Bus DQDB (cont d) Head End Host Host Host Host Head End 2 DQDB Frame Format 53-byte frame
More informationPart 5: Link Layer Technologies. CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross
Part 5: Link Layer Technologies CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross 1 Outline PPP ATM X.25 Frame Relay 2 Point to Point Data Link Control One sender, one receiver,
More informationDynamic Source Routing (DSR) [Johnson96] CSE 6811 : Lecture 5
ynamic Source Routing (SR) [Johnson96] S 6811 : Lecture 5 d Hoc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation Loop freedom
More informationNetwork service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to.
Netork Layer (part ) y the end of this lecture, you should be able to. xplain the operation of distance vector routing algorithm xplain shortest path routing algorithm escribe the major points of RIP and
More informationNetworking: Network layer
control Networking: Network layer Comp Sci 3600 Security Outline control 1 2 control 3 4 5 Network layer control Outline control 1 2 control 3 4 5 Network layer purpose: control Role of the network layer
More informationTCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS
TCOM 370 NOTES 99-1 NETWORKING AND COMMUNICATIONS Communication Networks Allow Exchange of Information between Users telephone network for voice communication interconnected computers and peripherals,
More informationLecture 22 Overview. Last Lecture. This Lecture. Next Lecture. Internet Applications. ADSL, ATM Source: chapter 14
Last Lecture Lecture 22 Overview Internet Applications This Lecture ADSL, ATM Source: chapter 14 Next Lecture Wireless Networking Source: chapter 15 COSC244 & TELE202 Lecture 22 - ADSL, ATM 1 Modem Enable
More informationLecture 4 - Network Layer. Transport Layer. Outline. Introduction. Notes. Notes. Notes. Notes. Networks and Security. Jacob Aae Mikkelsen
Lecture 4 - Network Layer Networks and Security Jacob Aae Mikkelsen IMADA September 23, 2013 September 23, 2013 1 / 67 Transport Layer Goals understand principles behind network layer services: network
More informationDynamic Source Routing (DSR) [Johnson96]
ynamic Source Routing (SR) [ohnson96] S 6811 : ecture 5 d oc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation oop freedom
More informationEthernet Switches (more)
Ethernet Switches layer 2 (frame) forwarding, filtering using LAN addresses Switching: A-to-B and A - to-b simultaneously, no collisions large number of interfaces often: individual hosts, star-connected
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department of Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Stephan Günther
More informationDeployment of IGRP/EIGRP
1 eployment of IGRP/EIGRP Session 2 Presentation_I.scr 1 Understanding EIGRP Understanding and deploying EIGRP is like driving a car 3 genda Fundamentals of EIGRP UL Summarization and Load alancing EIGRP/IGRP
More informationThe Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
More informationECE 435 Network Engineering Lecture 11
ECE 435 Network Engineering Lecture 11 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 5 October 2017 Announcements Back from Memsys. Related things: fast memories for network
More informationAdaptors Communicating. Link Layer: Introduction. Parity Checking. Error Detection. Multiple Access Links and Protocols
Link Layer: Introduction daptors ommunicating Terminology: hosts and routers are nodes communication channels that connect adjacent nodes along communication path are links wired links wireless links LNs
More information2. Modelling of telecommunication systems (part 1)
2. Modelling of telecommunication systems (part ) lect02.ppt S-38.45 - Introduction to Teletraffic Theory - Fall 999 2. Modelling of telecommunication systems (part ) Contents Telecommunication networks
More informationResource Control and Reservation
1 Resource Control and Reservation Resource Control and Reservation policing: hold sources to committed resources scheduling: isolate flows, guarantees resource reservation: establish flows 2 Usage parameter
More informationRSVP 1. Resource Control and Reservation
RSVP 1 Resource Control and Reservation RSVP 2 Resource Control and Reservation policing: hold sources to committed resources scheduling: isolate flows, guarantees resource reservation: establish flows
More informationName Student ID Department/Year. Final Examination. Introduction to Computer Networks Class#: Fall :50-11:30 Tuesday January 10, 2006
Name Student I epartment/year inal xamination Introduction to omputer Networks lass#: 901 31110 all 2005 9:50-11:30 Tuesday January 10, 2006 Prohibited 1. You are not allowed to write down the answers
More informationLinks. Error Detection. Link Layer. Multiple access protocols. Nodes Links Frame. Shared channel Problem: collisions How nodes share a channel
Link Layer Error Detection Nodes Links Frame R yclic Redundancy hecksum Parity its More about this in exercise! Data Link Layer -1 Data Link Layer -2 Links Two types of links : point-to-point broadcast
More informationEthernet Hub. Campus Network Design. Hubs. Sending and receiving Ethernet frames via a hub
Campus Network Design Thana Hongsuwan Ethernet Hub 2003, Cisco Systems, Inc. All rights reserved. 1-1 2003, Cisco Systems, Inc. All rights reserved. BCMSN v2.0 1-2 Sending and receiving Ethernet frames
More informationAdministrivia. Homework on class webpage If you are having problems following me in class (or doing the homework problems), please buy the textbook
Administrivia Homework on class webpage If you are having problems following me in class (or doing the homework problems), please buy the textbook Project Discussion class_ gotcha Reading finally on webpage
More informationArchitecture EECS 122. Network Architecture. Layer: Example. Internet Layers - Intro
rchitecture S rchitecture Introduction Layering xample Internet Layers First Look Layering Step by Step ownside of Layering Interconnecting s The Internet Introduction Issues: Inter-operability xtensibility
More informationWhat is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats
What is Routing? Routing implements the core function of a network: : Shortest Path Routing Ion Stoica Ts: Junda Liu, K Moon, avid Zats http://inst.eecs.berkeley.edu/~ee/fa9 (Materials with thanks to Vern
More informationOutline. Circuit Switching. Circuit Switching : Introduction to Telecommunication Networks Lectures 13: Virtual Things
8-5: Introduction to Telecommunication Networks Lectures : Virtual Things Peter Steenkiste Spring 05 www.cs.cmu.edu/~prs/nets-ece Outline Circuit switching refresher Virtual Circuits - general Why virtual
More informationChapter 4 Network Layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. Network Layer 4-1 Chapter 4: Network Layer Chapter
More informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
More informationICMP (Internet Control Message Protocol)
Today s Lecture ICMP (Internet Control Message Protocol) Internet Protocols CSC / C 573 I. ICMP Overview II. ICMP rror Reporting III. ICMP Query / Response Messages IV. ICMP Message Processing Fall, 2005
More informationBROADBAND AND HIGH SPEED NETWORKS
BROADBAND AND HIGH SPEED NETWORKS ATM SWITCHING ATM is a connection-oriented transport concept An end-to-end connection (virtual channel) established prior to transfer of cells Signaling used for connection
More informationChapter 4: Network Layer
hapter 4: Network Layer hapter goals: understand principles behind layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, multicast instantiation and implementation
More informationData Networks. Lecture 1: Introduction. September 4, 2008
Data Networks Lecture 1: Introduction September 4, 2008 Slide 1 Learning Objectives Fundamental aspects of network Design and Analysis: Architecture: layering, topology design, switching mechanisms Protocols:
More informationPacket Switching - Asynchronous Transfer Mode. Introduction. Areas for Discussion. 3.3 Cell Switching (ATM) ATM - Introduction
Areas for Discussion Packet Switching - Asynchronous Transfer Mode 3.3 Cell Switching (ATM) Introduction Cells Joseph Spring School of Computer Science BSc - Computer Network Protocols & Arch s Based on
More informationLecture 11: Fragmentation & Addressing. CSE 123: Computer Networks Stefan Savage
Lecture 11: Fragmentation & Addressing CSE 123: Computer Networks Stefan Savage So what does IP do? Addressing Fragmentation E.g. FDDI s maximum packet is 4500 bytes while Ethernet is 1500 bytes, how to
More informationCS519: Computer Networks
Lets start at the beginning : Computer Networks Lecture 1: Jan 26, 2004 Intro to Computer Networking What is a for? To allow two or more endpoints to communicate What is a? Nodes connected by links Lets
More informationPROBLEMS AND EXERCISES
Departamento de Tecnología Electrónica Computer Networking Unit 1: Computer Networks and Internet PROBLEMS AND EXERCISES Introduction 1-79 TDM How long does it take to send a file of 640,000 bits from
More information2 Network Basics. types of communication service. how communication services are implemented. network performance measures. switching.
2 Network Basics types of communication service how communication services are implemented switching multiplexing network performance measures 1 2.1 Types of service in a layered network architecture connection-oriented:
More informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2015 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński Network Layer The majority of slides presented in
More informationTDTS06: computer Networks
TDTS06: computer Networks Lecturer: Johannes Schmidt The slides are taken from the book s companion Web site with few modifications: Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith
More informationThis Lecture. BUS Computer Facilities Network Management. Information Sharing. Local Area Network
This Lecture US3150 - omputer Facilities Network Management Local rea Network (LN). LN applications. LN topologies: us, Tree, Ring, Faculty of Information Technology Monash University Star. LN protocol
More informationCommunication Networks
ommunication Networks Prof. Laurent Vanbever ommunication Networks Spring 08 Roland Meier / Thomas Holterbach Slides: Laurent Vanbever nsg.ee.ethz.ch TH ürich (-ITT) pril 9 08 Materials inspired from Scott
More informationIntroduction to Networks and the Internet
Introduction to Networks and the Internet CMPE 80N Winter 2004 Lecture 18 Announcements Fourth quiz on Monday, March 1 st. Third HTML discussion session today by Kiran (before class). Summary posted on
More informationI T 3 2 UNIT 9 W A N. Intermediate TCP/IP T E C H N O L O G Y DPW
UI 9 Intermediate P/IP Packet eader Protocol field maps layer to layer 4 P & UDP eaders Delivery Services uaranteed delivery Delivery with bounded delay guaranteed within a specific time period In order
More informationChapter 5: The Data Link Layer. Chapter 5 Link Layer and LANs. Ethernet. Link Layer. Star topology. Ethernet Frame Structure.
hapter 5 Link Layer and LNs omputer Networking: Top Down pproach 5 th edition. Jim Kurose, Keith Ross ddison-wesley, pril 2009. hapter 5: The Data Link Layer Our goals: understand principles behind data
More informationCSE 3214: Computer Network Protocols and Applications Network Layer
CSE 314: Computer Network Protocols and Applications Network Layer Dr. Peter Lian, Professor Department of Computer Science and Engineering York University Email: peterlian@cse.yorku.ca Office: 101C Lassonde
More informationChapter 4: network layer. Network service model. Two key network-layer functions. Network layer. Input port functions. Router architecture overview
Chapter 4: chapter goals: understand principles behind services service models forwarding versus routing how a router works generalized forwarding instantiation, implementation in the Internet 4- Network
More informationLecture 3. The Network Layer (cont d) Network Layer 1-1
Lecture 3 The Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router? Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets
More informationCS610- Computer Network Solved Subjective From Midterm Papers
Solved Subjective From Midterm Papers May 08,2012 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 CS610- Computer Network Midterm Examination - Fall 2011 1. Where are destination and source
More informationCommunication Networks ( ) / Fall 2013 The Blavatnik School of Computer Science, Tel-Aviv University. Allon Wagner
Communication Networks (0368-3030) / Fall 2013 The Blavatnik School of Computer Science, Tel-Aviv University Allon Wagner Kurose & Ross, Chapter 4 (5 th ed.) Many slides adapted from: J. Kurose & K. Ross
More informationCSE/EE 461 Distance Vector Routing
S/ 46 istance Vector Routing Last Time Introduction to the Network layer Internetworks atagram and virtual circuit services Internet Protocol (IP) packet format The Network layer Provides end-to-end data
More informationChapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP
Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP 4.5 routing algorithms link state
More informationECE 435 Network Engineering Lecture 11
ECE 435 Network Engineering Lecture 11 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 11 October 2018 Midterm on Tues Announcements 1 HW#4 Review maine.edu created? What is a
More informationCell Format. Housekeeping. Segmentation and Reassembly AAL 3/4
Housekeeping 1 st Project Handout ue Friday Oct 5 Quiz: Friday Sept 21 Material covered so far 1 st Test October 12 Cell Format User-Network Interface (UNI) 4 8 16 3 1 GFC VPI VCI Type CLP 8 HEC (CRC-8)
More informationQoS on Low Bandwidth High Delay Links. Prakash Shende Planning & Engg. Team Data Network Reliance Infocomm
QoS on Low Bandwidth High Delay Links Prakash Shende Planning & Engg. Team Data Network Reliance Infocomm Agenda QoS Some Basics What are the characteristics of High Delay Low Bandwidth link What factors
More informationChapter 5 Peer-to-Peer Protocols. School of Info. Sci. & Eng. Shandong Univ..
hapter 5 Peer-to-Peer Protocols School of Info. Sci. & Eng. Shandong Univ.. Outline 5. Peer-to-peer protocols and service models 5. RQ Protocols 5.3 Other daptation Functions Sliding Window Flow ontrol
More informationSection 1 Short Answer Questions
CPSC 3600 section 002 HW #1 Fall 2017 Last revision: 9/7/2017 You must work on this homework individually!! Submission: You are to submit your written answers to turnitin. Also, you are to submit your
More informationCSE3213 Computer Network I
SE33 omputer Network I Service Model, Error ontrol, Flow ontrol, and Link Sharing (h. 5. 5.3. and 5.7.) ourse page: http://www.cse.yorku.ca/course/33 Slides modiied om lberto Leon-Garcia and Indra Widjaja
More informationInternet Architecture. Network Layer Overview. Fundamental Network Layer Function. Protocol Layering and Data. Computer Networks 9/23/2009
omputer Networks 9//9 Network Layer Overview Kai Shen Internet rchitecture ottom-up: : electromagnetic signals on the wire : data transfer between neighboring elements encoding, framing, error correction,
More information1-1. Switching Networks (Fall 2010) EE 586 Communication and. October 25, Lecture 24
EE 586 Communication and Switching Networks (Fall 2010) Lecture 24 October 25, 2010 1-1 Announcements Midterm 1: Mean = 92.2 Stdev = 8 Still grading your programs (sorry about the delay) Network Layer
More informationÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra)
ontents ÉOL POLYTHNIQU ÉÉRL LUSNN! 1. Link state flooding topology information finding the shortest paths (ijkstra)! 2. Hierarchical routing with areas! 3. OSP Link State Routing database modelling neighbor
More informationAdministrivia CSC458 Lecture 4 Bridging LANs and IP. Last Time. This Time -- Switching (a.k.a. Bridging)
Administrivia CSC458 Lecture 4 Bridging LANs and IP Homework: # 1 due today # 2 out today and due in two weeks Readings: Chapters 3 and 4 Project: # 2 due next week Tutorial today: Joe Lim on project 2
More informationCS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016
9/9/6 S 7 Networking and the Internet Fall 06 Shortest-Path Problem Given: network topology with link costs c(x,y): link cost from node x to node y Infinity if x and y are not direct neighbors ompute:
More informationLecture 6: Bridging & Switching. Last time. Today. CSE 123: Computer Networks Chris Kanich. How do multiple hosts share a single channel?
Lecture 6: ridging & Switching SE 3: omputer Networks hris Kanich Project countdown: 5 days Last time How do multiple hosts share a single channel? Medium ccess ontrol (M) protocols hannel partitioning
More informationIntroduction. IP Datagrams. Internet Service Paradigm. Routers and Routing Tables. Datagram Forwarding. Example Internet and Conceptual Routing Table
Introduction Datagram Forwarding Gail Hopkins Service paradigm IP datagrams Routing Encapsulation Fragmentation Reassembly Internet Service Paradigm IP Datagrams supports both connectionless and connection-oriented
More information