1 / 41

Ch. 15 LAN Overview

Ch. 15 LAN Overview. Definition of a LAN. A communication network that provides interconnection of a variety of data communicating devices within a small area. 15.1 LAN Background. Personal Computer LANs Backend Networks and Storage Area Networks

morrison
Download Presentation

Ch. 15 LAN Overview

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Ch. 15 LAN Overview

  2. Definition of a LAN • A communication network that provides interconnection of a variety of data communicating devices within a small area.

  3. 15.1 LAN Background • Personal Computer LANs • Backend Networks and Storage Area Networks • Used to interconnect large systems such as mainframes, supercomputers, and mass storage devices. • High-Speed Office Networks • Backbone LANs • High speed LANs used to interconnect other LANs.

  4. 15.2 Topologies and Transmission Media • Key Elements of a LAN • Topology • Transmission Media • Layout • Medium access control

  5. 15.2 Topologies and Transmission Media(p.2) • Bus and Tree Topologies (Fig. 15.2) • Bus • All stations are attached directly to the media. • Tree • The media is a branching cable with no closed loops. • The tree starts at the “headend” and branches out from there. • Each station must have an address and access is controlled (multipoint configuration.) • See Fig. 15.3.

  6. 15.2 Topologies and Transmission Media(p.3) • Ring Topology (Fig. 15.4) • Network consists of a set of repeaters joined by point-to-point links in a closed loop. • The links are unidirectional, and data circulates around the ring in one direction. • Each station is attached to a repeater, and frames are inserted onto the ring.

  7. 15.2 Topologies and Transmission Media (p.4) • Star Topology • Each station is connected to a common central node using two point-to-point links. • Received frames can either be "broadcast" or "switched" to a particular link.

  8. 15.2 Topologies and Transmission Media (p.5) • Choice of Topology • Depends on reliability, expandability, and performance. • Choice of Media • Depends on capacity, reliability, type of data supported, environmental scope.

  9. 15.3 LAN Protocol Architecture • Fig. 15.5 IEEE 802 vs. OSI Reference Model. • Physical Layer • Encoding/decoding of signals. • Preamble generation/removal (for synchronization). • Bit transmission/reception. • IEEE 802 also specifies the transmission medium and topology.

  10. 15.3 LAN Protocol Architecture (p.2) • Medium Access Control (MAC) Layer • Assemble data into a frame with address and error-detection fields. • Disassemble frames, perform address recognition and error detection • Govern access to the LAN transmission medium.

  11. 15.3 LAN Protocol Architecture (p.3) • Logical Link Control (LLC) Layer • Provide an interface to higher layers and perform flow and error control. • Fig. 15.6 LAN protocols in context.

  12. 15.3 LAN Protocol Architecture (p.4) • Logical Link Control • Specifies the mechanisms for addressing and the control of the data exchange. • Operation and format are based on HDLC. • Three Services • Unacknowledged connectionless service. • Connection-mode service. • Acknowledged connectionless service.

  13. 15.3 LAN Protocol Architecture (p.5) • Logical Link Control (cont.) • LLC PDU (Fig. 15.7) • Destination Service Access Point (1 octet) • 7 bits for the address. • One bit to indicate if it is a group address or not. • Source Service Access Point (1 octet) • 7 bits for the address. • One bit is used to indicate if it is a command or response. • LLC Control Field (1 or 2 octets) • Similar to HDLC control field. • Information Field (variable length)

  14. 15.3 LAN Protocol Architecture (p.6) • Differences between LLC and HDLC • LLC uses asynchronous balanced mode to support connection-mode service (type 2 operation). • LLC supports and unacknowledged connectionless service using the unnumbered information PDU (type 1 service). • LLC supports an acknowledged connectionless service by using two new unnumbered PDUs (type 3 operation.) • LLC permits multiplexing (using LSAPs).

  15. 15.3 LAN Protocol Architecture (p.7) • Medium Access Control • MAC protocols control access to the transmission medium in some type of orderly and efficient manner. • Access control could be centralized or distributed. • Centralized schemes tend to be simpler and avoid various "distributed control" problems, but performance and reliability can be a concern.

  16. 15.3 LAN Protocol Architecture (p.8) • Medium Access Control (cont.) • Synchronous Techniques • Specific capacity is dedicated to a connection, such as with circuit-switching, FDM, and TDM. • Generally do not work well in LANs.

  17. 15.3 LAN Protocol Architecture (p.9) • Medium Access Control (cont.) • Asynchronous techniques--capacity is allocated in a dynamic fashion. • Round Robin--each station is given a turn to transmit. • Reservation--a station wishing to transmit "reserves" slots of "time". • Contention--all stations "contend" for the medium.

  18. 15.3 LAN Protocol Architecture (p.10) • Medium Access Control (cont.) • Generic MAC Frame Format--Fig. 15.7 • MAC Control Field • Destination MAC Address • Source MAC Address • LLC PDU • CRC

  19. Problem 15.3 • Consider the transfer of a file containing one million 8-bit characters from one station to another. What is the total elapsed time and effective throughput for the following cases? • a. Circuit-Switched LAN • TtotalSwitch=S + L/B+tprop • ThroughputSwitch= L/TtotalSwitch

  20. Problem 15.3 (p.2) • b. Bus Topology • D--distance between stations. • B--data rate (use R bps if you wish.) • P--packet size. • Header is 80 bits. • Information field is P-80. • Acknowledgement is 88bits. • v=200 m/microsecond.

  21. Problem 15.3 (p.3) • b. Bus Topology (cont.) • Assume that each packet is acknowledge before the next is sent (stop-and-wait.) • Let NoPa= the number of packets. • NoPa= L/(P-80), rounded up (assuming fixed length packets and L is the number of inoformation bits in the message.) • There will be NoPa cycles needed to transfer the entire message.

  22. Problem 15.3 (p.4) • b. Bus Topology (cont.) • Ignore additional overhead--then tframe=P/B. • Also let tprop= D/v and tack=88/B. • Then TcycleBus=tframe +tprop+tack+tprop (ignoring processing delays.) • Thus, TtotalBus=NoPa (TcycleBus) • ThroughputBus=L/TtotalBus

  23. Problem 15.3(p.5) • c. Ring Topology • Total circular length is 2D, with the two stations a distance D apart. • Acknowledgement occurs with the circulation of the packet past the destination station, back to the source station. • There are N repeaters, each introduces a delay of one bit time (1/B).

  24. Problem 15.3 (p.6) • c. Ring Topology (cont.) • Assume similar overhead as in part b. • RingPropTime=2D/v + N/B • TcycleRing=tframe+RingPropTime • TtotalRing=NoPa(TcycleRing) • ThroughputRing=L/TtotalRing

  25. 15.4 Bridges • Bridges were originally used to interconnect LANs using the same physical and MAC protocols. • Eventually, bridges were developed that interconnected LANs with different MAC protocols. • In general, bridges are simpler than routers.

  26. Bridge Operation • Why use a bridge, instead of simply operating as one large LAN? • Reliability--bridges can be used to partition a large LAN environment. • Performance--in general, as stations are added to a LAN, the performance decreases. • Security--different types of traffic with different security needs can be kept on physically separate media. • Geography--two LANs in different locations can be bridged using point-to-point communications.

  27. Functions of a Bridge • See Fig. 15.8 • The bridge reads all frames transmitted on network A, accepting those addressed to B. • Frames accepted are transmitted on B. • The same is done for B-to-A traffic.

  28. Design Considerations • 1. The bridge makes no modifications to the content or format of the frames it receives. • 2. The bridge should contain enough buffer space to meet peak demands. • 3. The bridge must contain addressing and routing intelligence. • 4. A bridge may connect more than two LANs. • Note: Bridges can be more complex and have special functionality

  29. Bridge Protocol Architecture • The IEEE 802 committee has produced specifications for bridges. • These devices are called MAC-level relays. • Fig. 15.9 illustrates the architecture and operation.

  30. Routing with Bridges • Figure 15.10 illustrates the concept of alternate routes. • Three Strategies • Fixed Routing • Spanning Tree (IEEE 802.1) • Source Routing (IEEE 802.5)

  31. Routing with Bridges (p.2) • Fixed Routing • A route is selected for each source-destination pair of LANs in the internet. • If alternative routes exist, then the route with the fewest hops in chosen and placed in a routing table. • Widely used; simple and requires minimal processing. • Too limited for a dynamically changing internet.

  32. Routing with Bridges (p.3) • The Spanning Tree Approach • Three mechanisms • Frame Forwarding • Address Learning • Loop Resolution

  33. Routing with Bridges (p.4) • The Spanning Tree Approach (cont.) • Frame Forwarding • The bridge maintains a forwarding database for each port attached to a LAN. • The database indicates the station addresses for which frames should be forwarded through that port.

  34. Routing with Bridges (p.5) • The Spanning Tree Approach (cont.) • Address Learning • When a frame arrives at a particular port, the source address can be checked. • If the source address is not in the database for that port it can be added. • Each time an element is added to the database, a timer can be set. • When the timer expires, then the element will be removed from the database. • If the element is already in the database, the timer is reset.

  35. Routing with Bridges (p.6) • The Spanning Tree Approach (cont.) • Spanning Tree Algorithm--Loop Problems • The above procedures work fine when the topology is a tree, but problems occur when alternate routes exist. • Consider Fig. 15.11. • When A transmits to B, both bridges will update their databases and relay the frame. • However, they will receive each others relay and update the databases again. • B then cannot transmit to A.

  36. 14.2 Routing with Bridges (p.7) • The Spanning Tree Approach (cont.) • Spanning Tree Algorithm--Some Assumptions • 1.Each bridge is assigned a unique identifier. • 2.There is a special group MAC address that means "all bridges on this LAN". • 3. Each port of a bridge is uniquely identified within the bridge. • These assumptions allow the bridges to exchange routing information in order to obtain a spanning tree.

  37. 15.5 Layer 2 and Layer 3 Switches • Hubs • The active central element of a star layout. • Each station is connected to the hub with two lines, one for transmitting and one for receiving. • The system is essential a logical bus, since a transmission from any one station is transmitted to all other stations. • Multiple levels of hubs are possible (Fig. 15.12.) • Hubs are usually placed in a wiring closet. • Stations are about 100 meters away, using twisted pair, or 500 meters with optical fiber.

  38. 15.5 Layer 2 and Layer 3 Switches (p.2) • Layer 2 Switches (Fig. 15.13) • A shared medium hub (like a shared medium bus) has collisions when more than one station is transmitting at the same time. • A layer 2 switch takes an incoming frame and transmits it only on the destination station’s line. • Two types of switches: • Store-and-Forward--packets are buffered. • Cut-through--headers are read and switching occurs immediately--but no error checking.

  39. 15.5 Layer 2 and Layer 3 Switches (p.3) • Layer 2 switches may function as a multiport bridge--the differences are: • Bridge frames are handled in software, while layer 2 switches have hardware that performs address recognition and frame forwarding. • A bridge handles one frame at a time, while a switch can handle multiple frames at a time. • A bridge uses store and forward operations, while cut-through operations are possible with layer 2 switches.

  40. 15.5 Layer 2 and Layer 3 Switches (p.4) • Layer 3 Switches • Layer 2 switches provide improved performance, but have some drawbacks. • Flat address space--broadcast overload is a problem. • Multiple paths are not allowed--restricts performance and reliability. • Routers could be used to form subnetworks, but are software based and may not be able to handle the load. • Layer 3 switches were developed to overcome these problems.

  41. 15.5 Layer 2 and Layer 3 Switches (p.5) • Layer 3 Switches (cont.) • Packet by Packet --operates essentially like a router, but the forwarding logic is in hardware. • Flow-based--identifies flows of packets with the same source and destination addresses and forwards them along a predefined route. • Fig. 15.14 illustrates the typical configuration with circles indicating subnetworks.

More Related