Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN

Similar documents
requests/sec. The total channel load is requests/sec. Using slot as the time unit, the total channel load is 50 ( ) = 1

Wireless Internet Exercises

Time. Lakshmi Ganesh. (slides borrowed from Maya Haridasan, Michael George)

Random Access Protocols ALOHA

Multiaccess Communication

Analysis of random-access MAC schemes

Power Laws in ALOHA Systems

Computer Networks ( Classroom Practice Booklet Solutions)

Appendix A Prototypes Models

Mathematical Analysis of IEEE Energy Efficiency

Lecture on Sensor Networks

Detecting Stations Cheating on Backoff Rules in Networks Using Sequential Analysis

Chapter 5. Elementary Performance Analysis

Service differentiation without prioritization in IEEE WLANs

Answers to the problems from problem solving classes

Bounded Delay for Weighted Round Robin with Burst Crediting

Exam Spring Embedded Systems. Prof. L. Thiele

Introduction to the Xilinx Spartan-3E

Markov Chain Model for ALOHA protocol

CSE 123: Computer Networks

C o r p o r a t e l i f e i n A n c i e n t I n d i a e x p r e s s e d i t s e l f

Multimedia Communication Services Traffic Modeling and Streaming

N E T W O R K S T A N D A R D S UNIT 5. Ethernet LANs & P R O T O C O L S DPW

c. What is the average rate of change of f on the interval [, ]? Answer: d. What is a local minimum value of f? Answer: 5 e. On what interval(s) is f

Distributed systems Lecture 4: Clock synchronisation; logical clocks. Dr Robert N. M. Watson

Distributed Systems Principles and Paradigms. Chapter 06: Synchronization

STATE AND OUTPUT FEEDBACK CONTROL IN MODEL-BASED NETWORKED CONTROL SYSTEMS

Implementation of the IEEE 1588 Precision Time Protocol for Clock Synchronization in the Radio Detection of Ultra-High Energy Neutrinos

Distributed Systems Principles and Paradigms

K E L LY T H O M P S O N

gender mains treaming in Polis h practice

Giuseppe Bianchi, Ilenia Tinnirello

cs/ee/ids 143 Communication Networks

ECE 4450:427/527 - Computer Networks Spring 2017

Modeling and Simulation NETW 707

P e = 0.1. P e = 0.01

16:330:543 Communication Networks I Midterm Exam November 7, 2005

Time in Distributed Systems: Clocks and Ordering of Events

Design and Analysis of a Propagation Delay Tolerant ALOHA Protocol for Underwater Networks

CS 425 / ECE 428 Distributed Systems Fall Indranil Gupta (Indy) Oct. 5, 2017 Lecture 12: Time and Ordering All slides IG

Discrete Random Variables

I zm ir I nstiute of Technology CS Lecture Notes are based on the CS 101 notes at the University of I llinois at Urbana-Cham paign

Class Diagrams. CSC 440/540: Software Engineering Slide #1

MPP5800 series - PANEL MOUNT PRINTERS. Options

Networked Control Systems

Congestion Control. Need to understand: What is congestion? How do we prevent or manage it?

Robust Network Codes for Unicast Connections: A Case Study

LU N C H IN C LU D E D

Product Data Sheet KyoRack 4

Performance analysis of IEEE WLANs with saturated and unsaturated sources

Congestion estimation technique in the optical network unit registration process

Fraud within Asymmetric Multi-Hop Cellular Networks

Form and content. Iowa Research Online. University of Iowa. Ann A Rahim Khan University of Iowa. Theses and Dissertations

Reliable Broadcast for Broadcast Busses

Giuseppe Bianchi, Ilenia Tinnirello

ATM VP-Based Ring Network Exclusive Video or Data Traffics

Solutions to COMP9334 Week 8 Sample Problems

Information in Aloha Networks

Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks

EP2200 Course Project 2017 Project II - Mobile Computation Offloading

CS115 Computer Simulation Project list

MODBUS Protocol for CS141 network card families

Performance Evaluation of Deadline Monotonic Policy over protocol

OPERATING MANUAL. EIB-Kombisensor AS 315 N

E8 TCP. Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione

Kybernetika. Andrzej Dziech; Andrzej R. Pach Bounds on the throughput of an unslotted ALOHA channel in the case of a heterogeneous users' population

Chapter 5 A Modified Scheduling Algorithm for The FIP Fieldbus System

STEEL PIPE NIPPLE BLACK AND GALVANIZED

CHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals

CS505: Distributed Systems

Lecture 15: Remote Monitoring (RMON)

Coordination. Failures and Consensus. Consensus. Consensus. Overview. Properties for Correct Consensus. Variant I: Consensus (C) P 1. v 1.

21 Yes, in LFP between ldd y and stx y. A) accuracy. J) desk check. D) bandwidth. E (partial credit B) D. P) latency. U) polled interrupt W) private

Reliable Data Transport: Sliding Windows

WiFi MAC Models David Malone

Distributed Systems. Time, Clocks, and Ordering of Events

Agressive Transmissions over Redundant Paths for Time Critical Messages

Mission brief. Member. R a n k. O t h e r c r e w m e m b e r s

On the Stability and Optimal Decentralized Throughput of CSMA with Multipacket Reception Capability

TCP over Cognitive Radio Channels

Modeling Approximations for an IEEE WLAN under Poisson MAC-Level Arrivals

Tuning the TCP Timeout Mechanism in Wireless Networks to Maximize Throughput via Stochastic Stopping Time Methods

Performance analysis of IEEE WLANs with saturated and unsaturated sources

Multiaccess Problem. How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users?

Design and Analysis of Multichannel Slotted ALOHA for Machine-to-Machine Communication

S ca le M o d e l o f th e S o la r Sy ste m

Burst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks

Time Synchronization

Relaying Information Streams

Timing Analysis of AVB Traffic in TSN Networks using Network Calculus

A NEW SYSTEM FOR THE GENERATION OF UTC(CH)

FCFS Tree Algorithms with Interference Cancellation and Single Signal Memory Requirements

Data Gathering and Personalized Broadcasting in Radio Grids with Interferences

On the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels

Outline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.

Agreement. Today. l Coordination and agreement in group communication. l Consensus

Reduced operator noise. For increased resident satisfaction.

Congestion Control. Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion

Analysis on Packet Resequencing for Reliable Network Protocols

Photo. EPRI s Power System and Railroad Electromagnetic Compatibility Handbook

Transcription:

Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN

Ethernet Frame Format 7 b y te s 1 b y te 2 o r 6 b y te s 2 o r 6 b y te s 2 b y te s 4-1 5 0 0 b y te s 4 b y te s P r e a m b le S ta r t F r a m e D e lim ite r D e s t. M A C S o u r c e M A C L e n g th (D a ta / P a d ) D S A P S S A P C T R L N L I F C S P r e a m b le T h is is a s tr e a m o f b its u s e d to a llo w th e tr a n s m itte r a n d r e c ie v e r to s y n c h r o n iz e th e ir c o m m u n ic a tio n. T h e p r e a m b le is a n a lte r n a tin g p a tte r n o f 5 6 o n e s a n d z e r o es. It is im m ed iately fo llo w e d b y th e S ta r t F r a m e D e lim te r. S ta r t F r a m e D e lim te r T h is is a lw a y s 1 0 1 0 1 0 1 1 a n d is u s e d to in d ic a te th e b e g in n in g o f th e fr a m e - in fo r m a tio n. D e s tin a tio n M A C T h is is th e M A C a d d r e s s o f th e m a c h in e r e c e iv in g d a ta. W h e n lis te n in g to th e w ir e, a n e th e r n e t d e v ic e is c h e c k in g th is fie ld fo r it's o w n a d d r e s s. S o u r c e M A C T h is is th e M A C a d d r e s s o f th e m a c h in e tr a n s m ittin g d a ta. D a ta / P a d d in g T h e p a y lo a d d a ta is p la c e d h e r e. T h is is w h e r e th e IP h e a d e r an d d ata is p laced if yo u are ru n n in g IP o v e r E th e r n e t. C o n ta in e d w ith in th e D S A P - D e s tin a tio n S e r v ic e A c c e s s P o in t S S A P - S o u r c e S e r v ic e A c c e s s P o io n t C T R L - C o n tr o l b its fo r e th e r n e t c o m m u n ic a tio n N L I - N e tw o r k L a y e r In te r fa c e F C S T h is fie ld c o n ta in s th e F r a m e C h e c k Seq u en ce (FC S) w h ich is calcu lated u sin g a C yclic R ed u n d an cy C h e c k (C R C ). T h e F C S a llo w s e th e r n e t to d e te c t e r r o r s in th e Eth ern et fram e an d reject th em if th e fr a m e a p p e a r s d a m a g e d.

Token Ring Frame Format Frame Format Token Ring and IEEE 802.5 support two basic frame types: tokens and data/command frames. Tokens are 3 bytes in length and consist of a start delimiter, an access control byte, and an end delimiter. Data/command frames vary in size, depending on the size of the Information field. Data frames carry information for upper-layer protocols, while command frames contain control information and have no data for upper-layer protocols. Both formats are shown in Figure 9-3. Figure 9-3: IEEE 802.5 and Token Ring Specify Tokens and Data/Command Frames Token

FCS in both frames Both Ethernet and TR are link level protocol, they doesn t have the functionality of retransmit the dropped frames Higher level protocol must recover bad and dropped frames

Ethernet represents a RANDOM access scheme where channels contend by listening for silent periods and transmitting. If a collision occurs then the stations involved backoff a RANDOM time---the average backoff time increases on successive collisions causing a LIFO effect. The backoff times after stations are involved in a collision are random. However, the width of the time interval from which a station chooses its backoff time gets wider the more times it collides (on the same frame transmission attempt). Note: only stations INVOLVED with a collision (actively transmitting when a collision occurs) back off. The backoff time is an integer multiple of the slot-time (max round trip propagation delay). It is the INTEGER multiplier that grows exponentially, namely, if the first attempt to send a frame involves a collision you backoff 1 or 2 slot times, if the retransmission attempt collides you backoff 1,2,3 or 4 slot times, if the second retransmission attempt collides you backoff 1,2,3,4,5,6,7 or 8 slot times... since the actual back off is random (uniform) the expected value of the backoff is INCREASING. Now, suppose a frame arrives at a different station and is involved in a collision. On its first retrans attempt it waits 1 or 2 slot times while your frame, which has been trying for quite a while must wait between (1,16) slot times (expected value = 8)... who has a better chance of going first when the next transmission attempts occur? The LAST guy there...ergo LIFO. Note that once a frame is successfully sent the window start again at 1,2 slot times so we are referring to frames not stations... Under high load, esp in a large network with many nodes and long cable runs there is NO BOUND on the time it will take to transmit a frame. In fact, there is no guarantee the frame will even be sent (it may be dropped by the ethernet controller)

Token Ring represents a CONTROLLED access scheme where there is a special FRAME called the token that a station must possess in order to transmit. The a station transmits for a maximum allowed time when it has the token and all other station REPEAT the bits of the frame as the pass by (adding a one bit delay). If the intended receiver recognized its address it will COPY the frame into its RCV BUFFER and set the frame received bit while still repeating the frame. The transmitter may either pass the token to the NEXT node PHYSICALLY attached to the ring as soon as it completes frame transmission, or, it may wait to receive the leading edge of its transmitted frame back (which IT removes from the ring) before passing the token. The scheme BOUNDS the time each station waits before having a chance to transmit and guarantees that the frame will be transmitted.

Ethernet and Token Ring both are using shared media. Transmit mode in both is Broadcast rather than Point to Point We are comparing to MULTIPLE ACCESS methods for a shared media; in other words the TRANSMISSION MODE is BROADCAST versus POINT TO POINT.

Ethernet is simple Token ring is complex... The benefit of ethernet is that it is extensible and has been adapted well to newer technologies. The result is that much of the hardware investment and ALL of the software investments, and at least after the intro of 10BaseT the physical infrastructure investment has all been preserved even as the 'ethernet' technology has changed and become faster and more efficient. Furthermore, ethernet is much easier to manage...there are only a few simple rules.

Token ring, on the other hand, has required changes in interface cards for each advance, different cabling and new controllers for the rings (called MAU=media access unit). Thus, the expense is greater even if the performance is a step ahead. TR also requires a more knowledgeable operator to troubleshoot problems because there is LAN-Layer control (meaning control frames) and special purpose nodes. On Ethernet there are NO CONTROL FRAMES---any control you see is from a HIGHER LAYER entity. There are also no special purpose nodes.

TOPOLOGY: Ethernet is a PHYSICAL STAR, but a LOGICAL BUS Token ring was originall a physical ring...if a link between two nodes was faulty the network failed. Today it is a PHYSICAL STAR and a LOGICAL RING. If a station is powered off or faulty it is removed from the ring via a relay in the MAU. Each station acts an active repeater on the ring which bounds ring size since each station has an independent clock and the timing drift is cumulative.

Two SPECIAL STATION in Token Ring: The Active Monitor The Backup Monitor No Special station in Ethernet

The Setup in our Lab Something to be remember 1) To make FTP file transfer performance result stable, each transfer should begin after the network return stable, (wait for 10 seconds). When Network utilization is very high, e.g., 90%, FTP transfer will drag down the traffic generator utilization. After the FTP transfer finished, network utilization need time to recover to its normal level. So if immediately do FTP transfer again may be make the results a little bit better than the expected results. 2) Two packet sizes were using on traffic generator (1518 and 512). Comparing the FTP file transfer results in two cases when the offer load are same, try to figure out a reason.