Lecture 7. Reminder: Homework 2, Programming Project 1 due today. Homework 3, Programming Project 2 out, due Thursday next week. Questions?
|
|
- Amice Jennings
- 5 years ago
- Views:
Transcription
1 Lecture 7 Reminder: Homework 2, Programming Project 1 due today. Homework 3, Programming Project 2 out, due Thursday next week. Questions? Thursday, September 15 CS 475 Networks - Lecture 7 1
2 Outline Chapter 3 - Internetworking 3.1 Switching and Bridging 3.2 Basic Internetworking (IP) 3.3 Routing 3.4 Implementation and Performance 3.5 Summary Thursday, September 15 CS 475 Networks - Lecture 7 2
3 Introduction Direct link networks from Chapter 2 must be connected together to form a global network. This internetworking is accomplished by switches and routers. A switch interconnects links of the same type. It has multiple inputs and outputs. Its job is to forward (switch) a packet arriving on an input to the right output. A router interconnects links of different types, dealing with heterogeneity. Thursday, September 15 CS 475 Networks - Lecture 7 3
4 Switching and Bridging A switch can use one of three methods to determine which output port a packet should be forwarded to: (1) datagram or connectless approach, (2) virtual-circuit or connection-oriented approach, (3) source routing. All three methods assume that each node has a unique identifier (an address). Thursday, September 15 CS 475 Networks - Lecture 7 4
5 Datagrams Dest. Port A 3 B 0 C 3 D 3 E 2 F 1 G 0 H 0 Forwarding table for Switch 2 Fig 3.2 Example network for datagram forwarding Thursday, September 15 CS 475 Networks - Lecture 7 5
6 Datagrams Each datagram packet contains the complete destination address. Each switch contains a forwarding (routing) table. A host can send a packet at any time (in contrast to virtual circuit networks). A host has no way of knowing if the network can deliver the packet (or if the destination is up). Packets are forwarded independently. A switch or link failure can be tolerated if an alternate route exists. Thursday, September 15 CS 475 Networks - Lecture 7 6
7 Datagrams For a simple network like the one shown here a network administrator could construct the forwarding tables manually. For more complex networks with dynamically changing topologies and multiple paths between nodes, routing algorithms are used to construct the table. We will study routing algorithms next week (Section 3.3). The Internet Protocol (IP) is based on datagram forwarding. Thursday, September 15 CS 475 Networks - Lecture 7 7
8 Virtual Circuit Switching Fig 3.3 An example of a virtual circuit network SWITCH In Int. In VCI Out Int. Out VCI Selected virtual circuit entries from switch tables (for a VC between hosts A and B) Thursday, September 15 CS 475 Networks - Lecture 7 8
9 Virtual Circuit Switching Communication between nodes A and B on a VC network requires that a connection be setup. In the setup (signalling) process host A sends a setup message to the network. The message contains the address of host B. As the message passes through each switch, the switch assigns a VC identifier (VCI) for that connection on the upstream link. The response from B contains the VCI for the downsteam link so each switch can construct an entry in the VC table. Thursday, September 15 CS 475 Networks - Lecture 7 9
10 Virtual Circuit Switching The VC tables establish a virtual circuit between hosts A and B. Notice that each link in a VC will typically have a different VCI. Multiple VCIs are normally assigned to a link. Each VCI would correspond to a different VC. Thursday, September 15 CS 475 Networks - Lecture 7 10
11 Virtual Circuit Switching There is at least a RTT delay for setup before two nodes can communication. While the connection request has to have the full address of B, data frames need only a VCI. (The VCI is changed in the frame by switch.) In the event of a switch or link failure a new connection must be setup. Forwarding of the connection request requires a routing algorithm. Thursday, September 15 CS 475 Networks - Lecture 7 11
12 Virtual Circuit Switching After the nodes are done communicating the VC should be torn down to free resources (VC table entries and VC buffers). It is relatively easy to implement different Quality of Service (QoS) guarantees on different VCs. Frame Relay and ATM networks were popular examples of VC networks. They were used as backbone networks. Thursday, September 15 CS 475 Networks - Lecture 7 12
13 Asynchronous Transfer Mode (ATM) Asynchronous Transfer Mode (ATM) was embraced by the telephone industry in the 1980s and early 1990s. ATM is a connection-oriented (virtual circuits), packet-switched technology. It uses fixed-length 53 byte (5 byte header, 48 byte payload) packets called cells. Although ATM was originally designed to compete with Ethernet, it is now used primarily only in DSL networks. Thursday, September 15 CS 475 Networks - Lecture 7 13
14 Asynchronous Transfer Mode (ATM) The most significant feature of the ATM cell is its fixed length. Easier to build hardware, write algorithms Easier to do tasks in parallel, improving scalability The payload of 48 bytes was a compromise. Voice data is better in smaller units; digital data better in larger units. Thursday, September 15 CS 475 Networks - Lecture 7 14
15 Source Routing Fig 3.7 Source routing example (the switch reads the rightmost number) Thursday, September 15 CS 475 Networks - Lecture 7 15
16 Source Routing In source routing the source node provides all the information about the network that is necessary for the packet to reach the destination. The information is embedded in the packet header. In the example on the previous slide the required switch output port number is included in the header. Since the number of switches is usually unknown, the list of ports numbers is rotated so that the port of the next switch is always at the head of the list. Thursday, September 15 CS 475 Networks - Lecture 7 16
17 Source Routing As alternatives to rotating the port list, the port number could be stripped as in (b) or the header could contain a pointer to the next port number as in (c). (The pointer would be updated as the packet passes through the switch.) Thursday, September 15 CS 475 Networks - Lecture 7 17
18 Source Routing Source routing requires the sending host know enough about the network topology to build the header (analogous to building forwarding or VC tables). Note that packet headers must, in general, be of variable length with no upper bound on the size of the header. Thursday, September 15 CS 475 Networks - Lecture 7 18
19 Bridges and LAN Switches Switches that forward packets between sharedmedia LANs (e.g. Ethernets) are known as LAN switches or bridges. A bridge (unlike a hub or repeater) buffers a packet received on one port and retransmits it on all other ports. The ports are in different collision domains. Bridges can be used to create an extended LAN. For example a bridge can be used to connect two Ethernets that are at their max. size and form an extended Ethernet. Thursday, September 15 CS 475 Networks - Lecture 7 19
20 Learning Bridges Host A 1 B 1 C 1 X 2 Y 2 Z 2 A bridge need not forward all frames. The bridge could use a forwarding table to only send packets addressed to host A out Port 1. Broadcast frames need to be forwarded to all ports (except the port they are received on). Thursday, September 15 CS 475 Networks - Lecture 7 20 Port Forwarding Table
21 Learning Bridges Forwarding tables are constructed automatically. Initially the bridge forwards packets to all ports while it inspects the source address in each frame. It builds the table by associating source addresses with the port on which the frame arrives. Table entries have timeout values to handle moving hosts from one network to another. Frames addressed to hosts not listed in the table are forwarded to all other ports. Thursday, September 15 CS 475 Networks - Lecture 7 21
22 Spanning Tree Algorithm The network at right contains loops. Simple forwarding tables might allow duplicate frames to arrive (along different paths) or broadcast frames to endlessly cycle. Fig Extended LAN with loops Thursday, September 15 CS 475 Networks - Lecture 7 22
23 Spanning Tree Algorithm If we imagine the network as a graph (with bridges as vertices) then a spanning tree is a Fig (a) cyclic graph (b) spanning tree subgraph which includes all vertices but includes no loops. An example graph and a corresponding spanning tree are shown above. (The spanning tree shown is one of many possible.) Thursday, September 15 CS 475 Networks - Lecture 7 23
24 Spanning Tree Algorithm The spanning tree algorithm is a protocol used by bridges to agree on a spanning tree for an extended network. The algorithm allows each bridge to select ports over which it will and will not forward frames. The algorithm is dynamic so that if a bridge fails, a new spanning tree is constructed. Thursday, September 15 CS 475 Networks - Lecture 7 24
25 Spanning Tree Algorithm The algorithm works as follows to allow each bridge to select ports over which it will forward packets: Each bridge has a unique ID (B1, B2). The bridge with the smallest ID is the root bridge. The root forwards packets out all ports. Each bridge computes the shortest path (# of hops) to the root and notes which port is on this path. This port is used as the preferred path to the root. Thursday, September 15 CS 475 Networks - Lecture 7 25
26 Spanning Tree Algorithm On each LAN one bridge is selected as the designated bridge for forwarding frames toward the root. The designated bridge is the one closest to the root (if there is a tie, the lowest ID wins). Each bridge is connected to multiple LANs and it participates in election of a designated bridge for each LAN it is connected to. The bridge forwards frames over those ports for which it is the designated bridge. Thursday, September 15 CS 475 Networks - Lecture 7 26
27 Spanning Tree Algorithm B5 is the designated bridge for LAN A because it is closer to the root (B1) than B3. It is also the designated bridge for LAN B because it has a lower ID than B7. Fig Spanning tree with removed ports Thursday, September 15 CS 475 Networks - Lecture 7 27
28 Spanning Tree Algorithm Ports not in the spanning tree neither accept or transmit frames. Frames from LAN B addressed (or broadcast frames) to nodes in LAN K would follow the B1-B5-B7 path. Note that bridges B3 and B6 are currently unused. If bridge B5 were to go down the algorithm is rerun, and bridges B3 and B7 would become designated bridges for LANs A and B, respectively. The network would function normally. Thursday, September 15 CS 475 Networks - Lecture 7 28
29 Spanning Tree Algorithm In real networks the spanning tree is created by bridges passing configuration messages to each other and then deciding whether or not they are a root or designated bridge (refer to the text for details). Each configuration message contains the following information: 1) The ID for the bridge sending the message 2) The ID of the bridge thought to be root 3) The distance (hops) to the root Thursday, September 15 CS 475 Networks - Lecture 7 29
30 Broadcast and Multicast Bridges forward broadcast frames on each active (selected) port other than the one on which it is received. Multicasts can be handled in the same way, but they can be handled more efficiently. If no hosts on a segment of the spanning tree are receiving the multicast the segment can be pruned. Each host in a multicast group must periodically send a frame to the multicast address so that the bridge does not prune the segment containing the host. Thursday, September 15 CS 475 Networks - Lecture 7 30
31 Limitations of Bridges Bridges should be used only to connect 10 or so LANs. The spanning tree algorithm scales linearly and broadcast messages are sent across the extended LAN. One approach to building larger networks is to use routers to connect (extended) LANs. We will discuss routing in Section 3.3. Newer LAN switches provide support for virtual LANs (VLAN). VLANs allow a bridged network to be partitioned into smaller separate LANs. Thursday, September 15 CS 475 Networks - Lecture 7 31
32 Limitations of Bridges Ports on LAN switches can be assigned to particular VLANs. Packets can be sent (using only MAC addressing) between hosts on the the same VLAN. Broadcast messages are restricted to the same VLAN. Frames on VLAN 100 are never forwarded to VLAN 200 (and vice versa). The packets must be routed between VLANs. Thursday, September 15 CS 475 Networks - Lecture 7 32
33 In-class Exercises Problem 3.3 on page 285 Problem 3.13 on page 288 Turn in at the end of class. Thursday, September 15 CS 475 Networks - Lecture 7 33
CompSci 356: Computer Network Architectures. Lecture 7: Switching technologies Chapter 3.1. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 7: Switching technologies Chapter 3.1 Xiaowei Yang xwy@cs.duke.edu Types of switching Datagram Virtual circuit Source routing Today Bridges and LAN switches
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 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 informationChapter 3 Part 2 Switching and Bridging. Networking CS 3470, Section 1
Chapter 3 Part 2 Switching and Bridging Networking CS 3470, Section 1 Refresher We can use switching technologies to interconnect links to form a large network What is a hub? What is a switch? What is
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 informationECE 4450:427/527 - Computer Networks Spring 2017
ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 6.1: Internetworking Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527 Computer
More informationSwitching / Forwarding
Switching / Forwarding A switch is a device that allows interconnection of links to form larger networks Multi-input, multi-output device Packet switch transfers packets from an input to one or more outputs
More informationSwitching and bridging
Switching and bridging CSCI 466: Networks Keith Vertanen Fall 2011 Last chapter: Overview Crea7ng networks from: Point- to- point links Shared medium (wireless) This chapter: SoCware and hardware connec7ng
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 informationSwitching and Forwarding
Switching and Forwarding Outline Store-and-Forward Switches Bridges and Extended LANs Spring 7 CSE64 Switch Switching protocol T T STS- Spring 7 CSE64 Scalable Networks Switch forwards packets from input
More informationChapter 3 Packet Switching
Chapter 3 Packet Switching Self-learning bridges: Bridge maintains a forwarding table with each entry contains the destination MAC address and the output port, together with a TTL for this entry Destination
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 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 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 informationData Communications. Connecting Devices
Data Communications Connecting Devices Connecting Devices Networks do not normally operate in isolation. They are connected to one another or to the Internet. To connect LANs, or segments of LANs, we use
More informationCSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca
CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Administrivia Homework I out later today, due next Thursday Today: Link Layer (cont.)
More informationCSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca
CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Administrivia Homework I out later today, due next Thursday, Sep 25th Today: Link Layer
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 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 informationCSCI Computer Networks
CSCI-1680 - Computer Networks Link Layer III: LAN & Switching Chen Avin Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti, Peterson & Davie, Rodrigo Fonseca Today: Link Layer (cont.)
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 informationCSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca
CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Administrivia Homework I out later today, due next ursday, Sep 27th Today: Link Layer
More information4.2 Multicast IP supports multicast to support one-to-many (radio, news, IP multicast was originally a many-to-many (any source MC or
CS475 Networks Lecture 14 Chapter 4 Advanced Internetworking Assignments Reading for Lecture 15: Sections 5.1-5.2 Homework 5, Wireshark Project 3 posted, due next Thursday; Programming Project 3 posted,
More informationLecture 8. Reminder: Homework 3, Programming Project 2 due on Thursday. Questions? Tuesday, September 20 CS 475 Networks - Lecture 8 1
Lecture 8 Reminder: Homework 3, Programming Project 2 due on Thursday. Questions? Tuesday, September 20 CS 475 Networks - Lecture 8 1 Outline Chapter 3 - Internetworking 3.1 Switching and Bridging 3.2
More informationCompSci 356: Computer Network Architectures. Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch & 3.2. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch 3.1.5 & 3.2 Xiaowei Yang xwy@cs.duke.edu Review Past lectures Single link networks Point-to-point,
More informationCopyright 2010, Elsevier Inc. All rights Reserved
Computer Networks: A Systems Approach, 5e Larry L. Peterson and Bruce S. Davie C 3 Internetworking Copyright 2010, Elsevier Inc. All rights Reserved Switching and Forwarding Store-and-Forward Switches
More informationLecture 8. Basic Internetworking (IP) Outline. Basic Internetworking (IP) Basic Internetworking (IP) Service Model
Lecture 8 Basic Internetworking (IP) Reminder: Homework 3, Programming Project 2 due on Tuesday. An example internet is shown at right. Routers or gateways are used to connect different physical networks.
More informationPacke k t e S w S it w ching
Packet Switching Jun Jie, NG 08 Oct 2011 Reference Book Chapter 3: Packet Switching What is a Switch? In the simplest terms, a switch is a mechanism that allows us to interconnect links to form a larger
More informationCS4700/CS5700 Fundamentals of Computer Networks
CS4700/CS5700 Fundamentals of Computer Networks Lecture 9: Bridging Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu Northeastern
More informationCS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 20: Bridging Prof. Alan Mislove (amislove@ccs.neu.edu) Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui
More informationLecture 7. Network Layer. Network Layer 1-1
Lecture 7 Network Layer Network Layer 1-1 Agenda Introduction to the Network Layer Network layer functions Service models Network layer connection and connectionless services Introduction to data routing
More informationDistributed Queue Dual Bus
Distributed Queue Dual Bus IEEE 802.3 to 802.5 protocols are only suited for small LANs. They cannot be used for very large but non-wide area networks. IEEE 802.6 DQDB is designed for MANs It can cover
More informationCSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca
CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Today: Link Layer (cont.) Framing Reliability Error correction Sliding window Medium
More informationLecture 9. Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1
Lecture 9 Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1 Outline Chapter 3 - Internetworking 3.1 Switching and Bridging 3.2 Basic
More informationSome portions courtesy Srini Seshan or David Wetherall
CSE 123 Computer Networks Fall 2009 Lecture 6: Data-Link III: Hubs, Bridges and Switches Some portions courtesy Srini Seshan or David Wetherall Misc Homework solutions have been posted I ll post a sample
More informationCS Networks and Distributed Systems. Lecture 5: Bridging. Revised 1/14/13
CS 3700 Networks and Distributed Systems Lecture 5: Bridging Revised 1/14/13 Just Above the Data Link Layer 2 Application Presentation Session Transport Network Data Link Physical Bridging! How do we connect
More informationEPL606. Internetworking. Part 2a. 1Network Layer
EPL606 Internetworking Part 2a The majority of the slides in this course are adapted from the accompanying slides to the books by Larry Peterson and Bruce Davie and by Jim Kurose and Keith Ross. Additional
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 informationBridging and Switching Basics
CHAPTER 4 Bridging and Switching Basics This chapter introduces the technologies employed in devices loosely referred to as bridges and switches. Topics summarized here include general link-layer device
More informationChapter 6 Connecting Device
Computer Networks Al-Mustansiryah University Elec. Eng. Department College of Engineering Fourth Year Class Chapter 6 Connecting Device 6.1 Functions of network devices Separating (connecting) networks
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 informationPoint-to-Point Network Switching. Computer Networks Term B10
Point-to-Point Network Switching Computer Networks Term B10 Network Switching Outline Circuit Switching, Message Switching, Packet Switching, Cell Switching Connection-Oriented versus Connectionless Protocols
More informationInternetwork Expert s CCNP Bootcamp. Hierarchical Campus Network Design Overview
Internetwork Expert s CCNP Bootcamp Hierarchical Campus Network Design Overview http:// Hierarchical Campus Network Design Overview Per Cisco, a three layer hierarchical model to design a modular topology
More informationLAN Interconnection and Other Link Layer Protocols
LAN Interconnection and Other Link Layer Protocols Ethernet dominant link layer technology for local-area networks Ethernet frame structure Kai Shen Dept. of Computer Science, University of Rochester Ethernet
More informationIntroduction to Communication Networks Spring Unit 13 Network extensions Bridges.
Introduction to Communication Networks Spring 2007 Unit 13 Network extensions Bridges. Acknowledgements slides coming from: The book by Peterson/Davie The book by Wiliam Stallings Slides from lectures
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 informationCSE 461: Bridging LANs. Last Topic
CSE 461: Bridging LANs Last Topic Medium Access Control (MAC) protocols Part of the Link Layer At the heart of Local Area Networks (LANs) How do multiple parties share a wire or the air? Random access
More informationLOCAL AREA NETWORKS Q&A Topic 4: VLAN
A. Indicate whether the sentence or statement is true or false: 1. VLANs are more flexible in handling moves and additions of ports than routers 2. VLANs logically segment the physical LAN infrastructure
More informationGood day. Today we will be talking about Local Internetworking What is Internetworking? Internetworking is the connection of different networks.
Computer Networks Prof: Sujoy Ghosh Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Local Internetworking Good day. Today we will be talking about
More informationLecture 8: Networks to Internetworks
Lecture 8: Networks to Internetworks CSE 123: Computer Networks Alex C. Snoeren NO CLASS FRIDAY Lecture 8 Overview Bridging & switching Learning bridges Spanning Tree Internetworking Routering Internet
More informationARP, IP. Chong-Kwon Kim. Each station (or network interface) should be uniquely identified Use 6 byte long address
ARP, IP Chong-Kwon Kim Routing Within a LAN MAC Address Each station (or network interface) should be uniquely identified Use 6 byte long address Broadcast & Filter Broadcast medium Signals are transmitted
More informationLink layer: introduction
Link layer: introduction terminology: hosts and routers: nodes communication channels that connect adjacent nodes along communication path: links wired links wireless links LANs layer-2 packet: frame,
More informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 6: Data-Link III: Hubs, Bridges and Switches Some portions courtesy Srini Seshan or David Wetherall Last Time How do multiple hosts share a single channel?
More information6.1.2 Repeaters. Figure Repeater connecting two LAN segments. Figure Operation of a repeater as a level-1 relay
6.1.2 Repeaters A single Ethernet segment can have a maximum length of 500 meters with a maximum of 100 stations (in a cheapernet segment it is 185m). To extend the length of the network, a repeater may
More informationCSE/EE 461 The Network Layer. Application Presentation Session Transport Network Data Link Physical
CSE/EE 461 The Network Layer Application Presentation Session Transport Network Data Link Physical This Lecture Focus: What to do when one wire isn t big enough? Point to point link Broadcast link (Ethernet
More informationChapter 3. Underlying Technology. TCP/IP Protocol Suite 1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 3 Underlying Technology TCP/IP Protocol Suite 1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. OBJECTIVES: To briefly discuss the technology of dominant
More informationGrowth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs.
Internetworking Multiple networks are a fact of life: Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Fault isolation,
More informationL9: Bridges and LAN Switches. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806
L9: Bridges and LAN Switches Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 1 Acknowledgements Some pictures used in this presentation were obtained
More informationLANs do not normally operate in isolation. They are connected to one another or to the Internet. To connect LANs, connecting devices are needed.
LAN interconnecting devices INTRODUCTION LANs do not normally operate in isolation. They are connected to one another or to the Internet. To connect LANs, connecting devices are needed. Connecting devices
More informationLocal Area Networks (LANs): Packets, Frames and Technologies Gail Hopkins. Part 3: Packet Switching and. Network Technologies.
Part 3: Packet Switching and Gail Hopkins Local Area Networks (LANs): Packets, Frames and Technologies Gail Hopkins Introduction Circuit Switching vs. Packet Switching LANs and shared media Star, bus and
More informationAsynchronous Transfer Mode
ATM Asynchronous Transfer Mode CS420/520 Axel Krings Page 1 Protocol Architecture (diag) CS420/520 Axel Krings Page 2 1 Reference Model Planes User plane Provides for user information transfer Control
More informationTelematics I. Chapter 6 Internetworking. (Acknowledement: These slides have been compiled from H. Karl s set of slides)
Telematics I Chapter 6 Internetworking (Acknowledement: These slides have been compiled from H. Karl s set of slides) 1 Goals of This Chapter So far: we can communicate between nodes all connected directly
More informationCMPE 150 Winter 2009
CMPE 150 Winter 2009 Lecture 9 February 3, 2009 P.E. Mantey CMPE 150 -- Introduction to Computer Networks Instructor: Patrick Mantey mantey@soe.ucsc.edu http://www.soe.ucsc.edu/~mantey/ / t / Office: Engr.
More informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 13 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of lecture 12 Routing Congestion
More informationLayer 2 functionality bridging and switching
Layer 2 functionality bridging and switching BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013 Overview Layer 2 functionality Error detection Bridges Broadcast and collision domains How
More informationLecture 4b. Local Area Networks and Bridges
Lecture 4b Local Area Networks and Bridges Ethernet Invented by Boggs and Metcalf in the 1970 s at Xerox Local area networks were needed to connect computers, share files, etc. Thick or Thin Ethernet Cable
More informationReminder: Datalink Functions Computer Networking. Datalink Architectures
Reminder: Datalink Functions 15-441 15 441 15-641 Computer Networking Lecture 5 Media Access Control Peter Steenkiste Fall 2015 www.cs.cmu.edu/~prs/15-441-f15 Framing: encapsulating a network layer datagram
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 informationSwitching 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 informationNetwork Superhighway CSCD 330. Network Programming Winter Lecture 13 Network Layer. Reading: Chapter 4
CSCD 330 Network Superhighway Network Programming Winter 2015 Lecture 13 Network Layer Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-2007
More informationLecture 9: Bridging & Switching"
Lecture 9: Bridging & Switching" CSE 123: Computer Networks Alex C. Snoeren HW 2 due Wednesday! Lecture 9 Overview" Finishing up media access Contention-free methods (rings) Moving beyond one wire Link
More informationScale Computer Networking. Scale. Problem 1 Reconnecting LANs. Lecture 8 Bridging, Addressing and Forwarding
Scale 5- Computer Networking yak yak Lecture 8 Bridging, Addressing and Forwarding What breaks when we keep adding people to the same wire? 9--06 Lecture 8: Bridging/Addressing/Forwarding Scale Problem
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 informationTraditional network management methods have typically
Advanced Configuration for the Dell PowerConnect 5316M Blade Server Chassis Switch By Surendra Bhat Saurabh Mallik Enterprises can take advantage of advanced configuration options for the Dell PowerConnect
More informationModule 1. Introduction. Version 2, CSE IIT, Kharagpur
Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical
More informationA primer on modern LANs
Advanced Networks http://disi.unitn.it/locigno/index.php/teaching-duties/ A primer on modern LANs Renato Lo Cigno Copyright Quest opera è prote1a dalla licenza: Crea&ve Commons A-ribuzione- Non commerciale-
More informationCSE 123: Computer Networks Alex C. Snoeren. HW 2 due Thursday 10/21!
CSE 123: Computer Networks Alex C. Snoeren HW 2 due Thursday 10/21! Finishing up media access Contention-free methods (rings) Moving beyond one wire Link technologies have limits on physical distance Also
More informationHubs. twisted pair. hub. 5: DataLink Layer 5-1
Hubs Hubs are essentially physical-layer repeaters: bits coming from one link go out all other links at the same rate no frame buffering no CSMA/CD at : adapters detect collisions provides net management
More informationA. ARPANET was an early packet switched network initially connecting 4 sites (Stanford, UC Santa Barbara, UCLA, and U of Utah).
Volume: 245 Questions Question No: 1 Which of the following statements best describes ARPANET? A. ARPANET was an early packet switched network initially connecting 4 sites (Stanford, UC Santa Barbara,
More informationRevision of Previous Lectures
Lecture 15 Overview Last Lecture Local area networking This Lecture Wide area networking 1 Source: chapters 8.1-8.3, 17.1, 18.1, 18.2 Next Lecture Wide area networking 2 Source: Chapter 20 COSC244 Lecture
More informationChapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.
More informationMore on LANS. LAN Wiring, Interface
More on LANS Chapters 10-11 LAN Wiring, Interface Mostly covered this material already NIC = Network Interface Card Separate processor, buffers incoming/outgoing data CPU might not be able to keep up network
More informationSwitching & ARP Week 3
Switching & ARP Week 3 Module : Computer Networks Lecturer: Lucy White lbwhite@wit.ie Office : 324 Many Slides courtesy of Tony Chen 1 Ethernet Using Switches In the last few years, switches have quickly
More informationIntegrated Services. Integrated Services. RSVP Resource reservation Protocol. Expedited Forwarding. Assured Forwarding.
Integrated Services An architecture for streaming multimedia Aimed at both unicast and multicast applications An example of unicast: a single user streaming a video clip from a news site An example of
More informationAsynchronous Transfer Mode (ATM) ATM concepts
Asynchronous Transfer Mode (ATM) Asynchronous Transfer Mode (ATM) is a switching technique for telecommunication networks. It uses asynchronous time-division multiplexing,[1][2] and it encodes data into
More informationECE 435 Network Engineering Lecture 21
ECE 435 Network Engineering Lecture 21 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 27 November 2018 Announcements HW#9 was posted Project Status One e-mail per group One-line
More informationVirtual University of Pakistan. Describe the Hidden Node and Exposed Node problems in Standard? VUSR. [Larry L. Peterson]
www..net Solution Assignment No. 2 Question No. 1 Describe the Hidden Node and Exposed Node problems in 802.11 Standard? Hidden Node Problem: Consider the figure below. [Larry L. Peterson] B can exchange
More informationCS475 Networks Lecture 8 Chapter 3 Internetworking. Ethernet or Wi-Fi).
Assignments Reading for Lecture 9: Section 3.3 3.2 Basic Internetworking (IP) Bridges and LAN switches from last section have limited ability CS475 Networks Lecture 8 Chapter 3 Internetworking is a logical
More informationUnderlying Technologies -Continued-
S465 omputer Networks Spring 2004 hapter 3 (Part B) Underlying Technologies -ontinued- Dr. J. Harrison These slides were produced from material by Behrouz Forouzan for the text TP/IP Protocol Suite (2
More informationCSCI 466 Midterm Networks Fall 2011
CSCI 466 Midterm Networks Fall 2011 Name: This exam consists of 7 problems on the following 9 pages. You may use your single- sided hand- written 8 ½ x 11 note sheet and a calculator during the exam. No
More informationPacket Switching. Guevara Noubir Fundamentals of Computer Networks. Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann
Guevara Noubir Textbook: Chapter 3. Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Outline Store- and- Forward Switches Cell Switching Segmenta?on and Reassembly Bridges
More informationNetWare Link-Services Protocol
44 CHAPTER Chapter Goals Describe the Network Link-Service Protocol. Describe routing with NLSP. Describe the data packet used by NLSP. Background The (NLSP) is a link-state routing protocol from Novell
More informationHW3 and Quiz. P14, P24, P26, P27, P28, P31, P37, P43, P46, P55, due at 3:00pm with both soft and hard copies, 11/11/2013 (Monday) TCP), 20 mins
HW3 and Quiz v HW3 (Chapter 3): R1, R2, R5, R6, R7, R8, R15, P14, P24, P26, P27, P28, P31, P37, P43, P46, P55, due at 3:00pm with both soft and hard copies, 11/11/2013 (Monday) v Quiz: 10/30/2013, Wednesday,
More informationToken Ring VLANs and Related Protocols
Token Ring VLANs and Related Protocols CHAPTER 4 Token Ring VLANs A VLAN is a logical group of LAN segments, independent of physical location, with a common set of requirements. For example, several end
More informationExpected Time: 90 min PART-A Max Marks: 42
Birla Institute of Technology & Science, Pilani First Semester 2010-2011 Computer Networks (BITS C481) Comprehensive Examination Thursday, December 02, 2010 (AN) Duration: 3 Hrs Weightage: 40% [80M] Instructions-:
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 informationMore on Link Layer. Recap of Last Class. Interconnecting Nodes in LAN (Local-Area Network) Interconnecting with Hubs. Computer Networks 9/21/2009
More on Link Layer Kai Shen Recap of Last Class Ethernet dominant link layer technology for local-area l networks Ethernet frame structure Ethernet multiple access control CSMA/CD, exponential back-off
More informationMulticast Communications
Multicast Communications Multicast communications refers to one-to-many or many-tomany communications. Unicast Broadcast Multicast Dragkedja IP Multicasting refers to the implementation of multicast communication
More informationCS 43: Computer Networks Switches and LANs. Kevin Webb Swarthmore College December 5, 2017
CS 43: Computer Networks Switches and LANs Kevin Webb Swarthmore College December 5, 2017 Ethernet Metcalfe s Ethernet sketch Dominant wired LAN technology: cheap $20 for NIC first widely used LAN technology
More information15-441: Computer Networks Homework 1
15-441: Computer Networks Homework 1 Assigned: September 12, 2006 Due: September 21, 2006 1. Consider sending a file of size F = M * L bits over a path of Q links. Each link transmits at R bits/s. The
More information