FDDI by default supports Early Token Release. Below is the operation of FDDI ring.

Similar documents
1999, Scott F. Midkiff

ECE 333: Introduction to Communication Networks Fall Lecture 19: Medium Access Control VII

Token Ring and. Fiber Distributed Data Interface (FDDI) Networks: Token Ring and FDDI 1

This formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall

Good day. In the last lecture, we talked about various multiple access schemes and one of this set of schemes is token bus DQD etc.

Content. Deterministic Access Polling(1) Master-Slave principles: Introduction Layer 2: Media Access Control

Module 5. Broadcast Communication Networks. Version 2 CSE IIT, Kharagpur

FDDI-M: A SCHEME TO DOUBLE FDDI S ABILITY OF SUPPORTING SYNCHRONOUS TRAFFIC

Introduction. The fundamental purpose of data communications is to exchange information between user's computers, terminals and applications programs.

FDDI. L26 - Fibre Distributed Data Interface (FDDI) L26 - Fibre Distributed Data Interface (FDDI) FDDI - Fiber Distributed Data Interface

Performance Analysis of FDDI. By Raj Jain

Goals. Fundamentals of Network Media. More topics. Topics. Multiple access communication. Multiple access solutions

Data Communication Prof. A. Pal Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture # 29 High Speed LANs

SIMULATION OF PACKET DATA NETWORKS USING OPNET

Unit II. Part A (2 Marks)

DP83261 BMAC TM Device (FDDI Media Access Controller)

Token Ring/IEEE 802.5

ET4254 Communications and Networking 1

Chapter 15 Local Area Network Overview

CARRIER SENSE MULTIPLE ACCESS (CSMA):

Data Link Layer (Sicherungsschicht) Medium Access Control (Zugriffsverfahren)

Lecture 9: Bridging & Switching"

UNIT II Medium Access Control Medium Access Control fully distributed Three general MAC techniques 1. Contention: 2. Token passing token

Real-Time (Paradigms) (47)

Data always flows in one direction around ring Like Ethernet, all nodes see all frames, and protocol is necessary to decide when to send

Local Area Network Overview

Integrating Information Systems: Technology, Strategy, and Organizational Factors

Lecture 4b. Local Area Networks and Bridges

CSE 123: Computer Networks Alex C. Snoeren. HW 2 due Thursday 10/21!

CH : 15 LOCAL AREA NETWORK OVERVIEW

Performance Evaluation of FDDI, ATM, and Gigabit Ethernet as Backbone Technologies Using Simulation

Local Area Network. Review of Lecture 7. Review of Lecture 7. Review of Lecture 7. Review of Lecture 7. Review of Lecture 7.

RFC A Traffic-Based Method of Detecting Dead Internet Key Exchange (IKE) Peers. (Czerny Andeas)

Chapter 8 LAN Topologies

Cabletron Systems FDDI TECHNOLOGY GUIDE

Configuring STP. Understanding Spanning-Tree Features CHAPTER

Module 16: Distributed System Structures

ISO IEC. INTERNATIONAL ISO/IEC STANDARD Information technology Fibre Distributed Data Interface (FDDI) Part 5: Hybrid Ring Control (HRC)

Process Description and Control. Chapter 3

Local Area Networks (LANs) SMU CSE 5344 /

Networks: Access Management

COMPUTER NETWORK Model Test Paper

2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS Collision Free Protocols 2.3 FDDI 2.4 DATA LINK LAYER DESIGN ISSUES 2.5 FRAMING & STUFFING

Computer-System Architecture

Computer-System Architecture. Common Functions of Interrupts. Computer-System Operation. Interrupt Handling. Chapter 2: Computer-System Structures

Chapter 11 in Stallings 10 th Edition

Ferdy Hanssen and Pierre G. Jansen. October Abstract

Modelling a Video-on-Demand Service over an Interconnected LAN and ATM Networks

Reminder: Datalink Functions Computer Networking. Datalink Architectures

University of Technology

Spanning Tree Protocol

Module 15: Network Structures

LAN Interconnection. different interconnecting devices, many approaches Vasile Dadarlat- Local Area Computer Networks

Configuring Rapid PVST+

Basics (cont.) Characteristics of data communication technologies OSI-Model

Chapter 13: I/O Systems

NetWare Link-Services Protocol

Local Area Networks. Lecture 17 Fall Token Ring and FDDI

Data Link Layer, Part 5. Medium Access Control

Configuring Spanning Tree

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis

Configuring Rapid PVST+

Introduction to LAN Protocols

DQDB. Distributed Queue Dual Bus (DQDB) DQDB is a MAN. Unlike FDDI, DQDB is an IEEE standard: 802.6

Systems. Roland Kammerer. 10. November Institute of Computer Engineering Vienna University of Technology. Communication Protocols for Embedded

Bridging and Switching Basics

Configuring Rapid PVST+ Using NX-OS

Introduction to Networks and the Internet

Chapter 12: I/O Systems

Chapter 13: I/O Systems

Chapter 12: I/O Systems. Operating System Concepts Essentials 8 th Edition

Lecture 9: Bridging. CSE 123: Computer Networks Alex C. Snoeren

Configuring Dial-on-Demand Routing

EECS 122: Introduction to Computer Networks Resource Management and QoS. Quality of Service (QoS)

Transactions on Information and Communications Technologies vol 9, 1995 WIT Press, ISSN

Data Link Layer: Collisions

Guide to Networking Essentials Fifth Edition. Chapter 2 Network Design Essentials

Ripple Counters. Lecture 30 1

Simulation of FDDI-based Distributed Energy Management Systems

Chapter 6. The Protocol TCP/IP. Introduction to Protocols

Network Topology. By Dr. Piya Techateerawat. Bus Topology Ring Topology Star Topology Fully Connected Topology. Combined Topology

Multiple Access Protocols

INTERNATIONAL STANDARD

Spanning Tree Protocol(STP)

MICROPROCESSOR TECHNOLOGY

Outline: Connecting Many Computers

Mixed-Media Bridging

I/O CANNOT BE IGNORED

A comparison of DQDB and FDDI for the interconnection of LANs

Configuring STP and RSTP

ECEN Final Exam Fall Instructor: Srinivas Shakkottai

Highly Available Networks

Module 16: Distributed System Structures. Operating System Concepts 8 th Edition,

Hot Standby Router Protocol (HSRP): Frequently Asked Questions

Lecture 11 Overview. Last Lecture. This Lecture. Next Lecture. Medium Access Control. Flow and error control Source: Sections , 23.

Data Link Layer (part 2)

CSCD 433/533 Advanced Networks

Chapter 13: I/O Systems. Operating System Concepts 9 th Edition

Transcription:

Lecture 9 Fault Tolerance FDDI is also built for fault tolerance. It is actually two networks, one going counter-clockwise and the other clockwise (as usually drawn). Normally only the primary links, i.e. the counter-clockwise ones, are used, but if a link or even a node goes down, the secondary links will maintain the operation of the network. For example, consider a four-node network, with nodes A, B, C and D (in counterclockwise order). Say the link from D to A is accidentally cut. Then the secondaries will automatically activate, so that the network makes U-turns at A and D: After a frame goes from B to C to D on the primary link, for instance, it will next go back to C from D on the secondary link, etc. In this manner, we retain the ring topology after the accidental break. FDDI MAC Protocol In FDDI, a station waiting for a token seizes the token by grabbing the token as soon as a token passes by. After capturing the token, the station begins transmitting one or more data frames. The 802.5 technique of flipping a bit to convert a token to frame is impractical, as FDDI was designed for considerable high data rate. FDDI by default supports Early Token Release. Below is the operation of FDDI ring.

Capacity Allocation The priority scheme used in IEEE 802.5 will not work with FDDI, as a station will often issue a token before its own transmitted frame returns. FDDI capacity allocation scheme seeks to accommodate a mixture of stream and bursty traffic. Each station is allocated a portion of the total capacity (may be zero); the frames that it transfers are referred to as synchronous frames. Any capacity that is not allocated or not used is available for the transmission of additional asynchronous frames. The allocation must be as following:

DMax + FMax + Token Time + SAi <= TTRT Where TTRT = target token rotation time SA i = synchronous allocation for station i DMax = propagation time for one complete circuit of the ring FMax = time required to transmit a maximum length frame (4500 octets) Token Time = time required to transmit a token If a token arrives early, the station can set Token-holding timer (THT) equal to the remaining time. After transmitting synchronous frames, the station can then transmit asynchronous frames up to the time in THT. If the token arrives late, the station will set its Late Counter (LC) to 1 and will only transmit synchronous frames. This scheme is designed to assure that the time between successive sightings of a token is on the order of TTRT or less. When a station wishes to enter an extended dialogue, it may gain control of all the unallocated (asynchronous) capacity on the ring by using a restricted token. The station captures a non-restricted token, transmits the first frame of the dialogue to the destination station, then issues a restricted token. Only the station that received the last frame may transmit asynchronous frames using the restricted token. The two stations may then exchange data frames and restricted tokens for an extended period. The standard assumes that restricted transmission is predetermined not to violate the TTRT limitation. The priority scheme used in 802.5 does not work in FDDI, as a station issues a token before its own transmitted frame returns. FDDI uses a capacity allocation scheme which seeks to accommodate a mixture of stream and bursty traffic. FDDI defines two types of traffic: synchronous and asynchronous. Assume fixed length frame sizes. Rather than defining capacity as bps, define it as the number of frames that can be transmitted in a given time period. Define the total amount of frames in a given time period as the synchronous traffic. Each station is allocated a certain percentage of the synchronous traffic. Synchronous Allocation or SA. Also define the rate at which the token needs to circulate around the ring as TTRT - Target Token Rotation Time. Thus, each station i is allocated a specific SA i values such that SA TTRT i However, we have to account for the time to actually transmit the token, propagation time and the time to get at least one frame around the ring: Total Synchronous Allocation = SA + Time to transmit one token + Propagation time around the ring + Time to transmit a frame i Total Synchronous Allocation TTRT

If this summation is less than TTRT, then all time left is considered asynchronous allocation. Asynchronous allocation = TTRT - Total Synchronous Allocation Operation: Each station holds the following variables TTRT: Fixed constant, same for all stations SA i : pre-assigned allocation amount TRT: Token Rotation Timer - Amount of time before the TTRT time expires THT: Token Holding Time - Amount of extra time left LC: Late Counter - Either 0,1, or 2, number of TTRT cycles that have elapsed since last token received. TRT is a counter. It continually decrements, unless otherwise stopped, or reset. Initialize: TRT TTRT; LC 0 While waiting for a token, the TRT continues to decrement. If it hits 0, then it increments the LC from 0 to 1, resets TRT, then continues waiting for token. If LC gets increment to 2, then the token is considered lost If it receives a token, and the LC is zero, then TRT represents extra time. THT TRT, TRT TTRT, enable TRT. Then, the station sends synchronous frames for a time SA i. After transmitting synchronous frames, or if there were no synchronous frames to transmit, THT is enabled. The station can transmit asynchronous frames as long as THT > 0. If it receives a token and the LC is 1, then LC 0, TRT continues to decrement. The station can only transmit synchronous frames for a time SA i. FDDI Physical Layer Specification

Some key differences between Token Ring and FDDI are

This document was created with Win2PDF available at http://www.daneprairie.com. The unregistered version of Win2PDF is for evaluation or non-commercial use only.