Virtual LAN (VLAN).

Slides:



Advertisements
Similar presentations
Switching and Forwarding
Advertisements

Communication Networks Recitation 3 Bridges & Spanning trees.
Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 19 Introduction to Computer Networks.
Fundamentals of Computer Networks ECE 478/578 Lecture #13: Packet Switching (2) Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Chabot College Chapter 2 Review Questions Semester IIIELEC Semester III ELEC
1 Switching and Forwarding Bridges and Extended LANs.
CSE331: Introduction to Networks and Security Lecture 7 Fall 2002.
1 Chapter 8 Local Area Networks - Internetworking.
Chapter 3 Ethernet Bridges & Switches, ATM Switching Professor Rick Han University of Colorado at Boulder
CSE331: Introduction to Networks and Security Lecture 6 Fall 2002.
1 Switching and Forwarding Bridges and Extended LANs.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
1 Computer Networks LAN Bridges and Switches. 2 Where are we?
Connecting LANs, Backbone Networks, and Virtual LANs
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 8: Bridging Slides used with permissions.
1 Token Passing: IEEE802.5 standard  4 Mbps  maximum token holding time: 10 ms, limiting packet length  packet (token, data) format:  SD, ED mark start,
CSC 336 Data Communications and Networking Lecture 7d: Interconnecting LAN Dr. Cheer-Sun Yang Spring 2001.
Token Passing: IEEE802.5 standard  4 Mbps  maximum token holding time: 10 ms, limiting packet length  packet (token, data) format:  SD, ED mark start,
ECE 4450:427/527 - Computer Networks Spring 2015 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 6.1: Internetworking Dr. Nghi Tran.
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
M. Veeraraghavan (originals by J. Liebeherr) 1 Need for Routing in Ethernet switched networks What do bridges do if some LANs are reachable only in multiple.
1 Chapter 3 Internetworking Computer Networks: A Systems Approach, 5e Larry L. Peterson and Bruce S. Davie Copyright © 2010, Elsevier Inc. All rights Reserved.
CS440 Computer Networks 1 Packet Switching Neil Tang 10/6/2008.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
1 Chapter 3: Packet Switching (Switched LANs) Dr. Rocky K. C. Chang 23 February 2004.
1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.
3. INTERNETWORKING (PART 1) Rocky K. C. Chang Department of Computing The Hong Kong Polytechnic University 18 February
1 Packet Switching Outline Switching and Forwarding Bridges and Extended LANs.
Chapter 3 Part 1 Switching and Bridging
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Chapter 3: Packet Switching (overview)
Youngstown State University Cisco Regional Academy
COMPUTER NETWORKS CS610 Lecture-15 Hammad Khalid Khan.
Chapter 4 Introduction to Network Layer
Networking Devices.
Advanced Computer Networks
Scaling the Network: The Internet Protocol
3. Internetworking (part 1)
Packet Switching Outline Store-and-Forward Switches
3. Internetworking (part 2: switched LANs)
Chapter 4 Data Link Layer Switching
: An Introduction to Computer Networks
Network Layer.
Switching and Forwarding Bridges and Extended LANs
Chapter 3 Part 1 Switching and Bridging
SWITCHING Switched Network Circuit-Switched Network Datagram Networks
Chapter 3 Part 3 Switching and Bridging
THE NETWORK LAYER.
Intra-Domain Routing Jacob Strauss September 14, 2006.
LAN switching and Bridges
Chapter 4 Introduction to Network Layer
NT2640 Unit 9 Activity 1 Handout
Bridges and Extended LANs
LAN switching and Bridges
The Network Layer Network Layer Design Issues:
CS4470 Computer Networking Protocols
Dr. Rocky K. C. Chang 23 February 2004
PRESENTATION COMPUTER NETWORKS
Chapter 3 Part 3 Switching and Bridging
Scaling the Network: The Internet Protocol
Chapter 15. Connecting Devices
LAN switching and Bridges
Packet Switching Outline Store-and-Forward Switches
ECE 4450:427/527 - Computer Networks Spring 2017
Bridges Neil Tang 10/10/2008 CS440 Computer Networks.
Presentation transcript:

Virtual LAN (VLAN)

VLAN Trunking ISL encapsulation IEEE 802.1Q tagged frame

Spanning Tree Extended LANs can have cycles because either they were built without global knowledge or for the sake of having redundant paths between LANs. In order to populate forwarding tables so that packets don’t end up looping forever, first we have to remove cycles from the network graph and find a spanning tree.

Spanning Tree Algorithm Question: How can you find a spanning tree of a graph if you don’t know the full graph? Bridges have ids, just as nodes do. When a bridge is started up, it exchanges configuration messages with others and elects one bridge to be the root of the spanning tree. configuration message Initially every bridge thinks it’s the root and sends out configuration messages on all its ports. When it starts receiving messages from other bridges, it checks to see if the new message improves the configuration recorded for that port. (1) id of sender bridge (2) id of believed root (3) distance in hops to root

Spanning Tree Algorithm A message is considered better than the recorded info if: it identifies a root with smaller id or it identifies a root with equal id but shorter distance or the root id and distance are equal, but the sending bridge has smaller id. Before updating the info with the received message, the bridge adds 1 to the hop count. When a bridge discovers it is not the root, it stops sending out messages of its own (only forwards those from other bridges after adding 1 to the hop count).

Spanning Tree Algorithm When a bridge discovers it’s not the designated bridge for that port, it stops sending configuration messages over that port. Eventually, the system stabilizes: only the root sends out configuration messages and the other bridges only forward them around.

Token Ring (IEEE 802.5) Ethernet and the similar protocols are contention-based protocol Token ring, token bus are examples of contention-free protocol

Properties The ring is a single, shared medium, not point to point links in a loop. All nodes see all frames. A distributed algorithm determines when a node can transmit. Data always flows in one direction. Basic idea: A token circulates around the ring. When a host has a frame to transmit, it seizes the token and injects the frame on the medium. The frame is forwarded by intermediate nodes until arriving at the destination. The destination puts the frame back after receiving it, but with a “special mark”. The frame circulates back to the sender.

Physical Properties Question: What happens if a node on the ring fails? As long as a node provides power to the relay, the relay stays open. When the node fails, the relay closes bypassing the node. Multi-Station Access Unit: Several relays packaged together. Multiple MSAUs can be plugged together to make a larger network. Typical token ring data rates go from 4 Mbps to 16 Mbps. Number of stations can be as high as 260.

Token Ring Frame Format (IEEE 802.5)

Switches Connected to a set of links: each one runs a data-link (layer 2) protocol. Primary job: receive incoming frames/packets from one link and output them to the appropriate link. Each input or output is a port (bidirectional). Question: How does a switch decide what output port to use? Alternatives: Datagrams, or Connection-less approach Virtual circuit, or Connection-oriented approach Source routing.

Datagrams Destination Port A 3 B C D E 2 F 1 G H C D E 2 F 1 G H Connectionless: Each datagram is forwarded on its own. forwarding table for switch 2

Connectionless Networks A host can send a packet anywhere, anytime. When a packet is sent, it is not known whether the network can deliver it. Each packet is forwarded independently of other packets that may have gone to the same destination. A switch or link failure is no big deal: an alternate route can be found and the forwarding table updated.

Virtual Circuit Switching Establish a connection between source and destination before any data is communicated. Virtual Circuit Table: virtual circuit identifier incoming interface outgoing interface [a different VCI for outgoing packets] Two part process: (1) Connection setup (2) Data transfer

Simple internetwork (example)

Service model Host-to-host service Philosophy: Define a model that is so undemanding that almost any network technology is able to provide the required service. (IP)