Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN
|
|
- Maximilian Nicholson
- 6 years ago
- Views:
Transcription
1 Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN
2 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 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 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.
3 Token Ring Frame Format Frame Format Token Ring and IEEE 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 and Token Ring Specify Tokens and Data/Command Frames Token
4 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
5 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)
6 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.
7 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.
8 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.
9 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.
10 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.
11 Two SPECIAL STATION in Token Ring: The Active Monitor The Backup Monitor No Special station in Ethernet
12 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.
requests/sec. The total channel load is requests/sec. Using slot as the time unit, the total channel load is 50 ( ) = 1
Prof. X. Shen E&CE 70 : Examples #2 Problem Consider the following Aloha systems. (a) A group of N users share a 56 kbps pure Aloha channel. Each user generates at a Passion rate of one 000-bit packet
More informationWireless Internet Exercises
Wireless Internet Exercises Prof. Alessandro Redondi 2018-05-28 1 WLAN 1.1 Exercise 1 A Wi-Fi network has the following features: Physical layer transmission rate: 54 Mbps MAC layer header: 28 bytes MAC
More informationTime. Lakshmi Ganesh. (slides borrowed from Maya Haridasan, Michael George)
Time Lakshmi Ganesh (slides borrowed from Maya Haridasan, Michael George) The Problem Given a collection of processes that can... only communicate with significant latency only measure time intervals approximately
More informationRandom Access Protocols ALOHA
Random Access Protocols ALOHA 1 ALOHA Invented by N. Abramson in 1970-Pure ALOHA Uncontrolled users (no coordination among users) Same packet (frame) size Instant feedback Large (~ infinite) population
More informationMultiaccess Communication
Information Networks p. 1 Multiaccess Communication Satellite systems, radio networks (WLAN), Ethernet segment The received signal is the sum of attenuated transmitted signals from a set of other nodes,
More informationAnalysis of random-access MAC schemes
Analysis of random-access MA schemes M. Veeraraghavan and Tao i ast updated: Sept. 203. Slotted Aloha [4] First-order analysis: if we assume there are infinite number of nodes, the number of new arrivals
More informationPower Laws in ALOHA Systems
Power Laws in ALOHA Systems E6083: lecture 8 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA predrag@ee.columbia.edu March 6, 2007 Jelenković (Columbia University)
More informationComputer Networks ( Classroom Practice Booklet Solutions)
Computer Networks ( Classroom Practice Booklet Solutions). Concept Of Layering 0. Ans: (b) Sol: Data Link Layer is responsible for decoding bit stream into frames. 0. Ans: (c) Sol: Network Layer has the
More informationAppendix A Prototypes Models
Appendix A Prototypes Models This appendix describes the model of the prototypes used in Chap. 3. These mathematical models can also be found in the Student Handout by Quanser. A.1 The QUANSER SRV-02 Setup
More informationMathematical Analysis of IEEE Energy Efficiency
Information Engineering Department University of Padova Mathematical Analysis of IEEE 802.11 Energy Efficiency A. Zanella and F. De Pellegrini IEEE WPMC 2004 Padova, Sept. 12 15, 2004 A. Zanella and F.
More informationLecture on Sensor Networks
Lecture on Sensor Networks Cyclic Historical Redundancy Development Copyright (c) 2008 Dr. Thomas Haenselmann (University of Mannheim, Germany). Permission is granted to copy, distribute and/or modify
More informationDetecting Stations Cheating on Backoff Rules in Networks Using Sequential Analysis
Detecting Stations Cheating on Backoff Rules in 82.11 Networks Using Sequential Analysis Yanxia Rong Department of Computer Science George Washington University Washington DC Email: yxrong@gwu.edu Sang-Kyu
More informationChapter 5. Elementary Performance Analysis
Chapter 5 Elementary Performance Analysis 1 5.0 2 5.1 Ref: Mischa Schwartz Telecommunication Networks Addison-Wesley publishing company 1988 3 4 p t T m T P(k)= 5 6 5.2 : arrived rate : service rate 7
More informationService differentiation without prioritization in IEEE WLANs
Service differentiation without prioritization in IEEE 8. WLANs Suong H. Nguyen, Student Member, IEEE, Hai L. Vu, Senior Member, IEEE, and Lachlan L. H. Andrew, Senior Member, IEEE Abstract Wireless LANs
More informationAnswers to the problems from problem solving classes
Answers to the problems from problem solving classes Class, multiaccess communication 3. Solution : Let λ Q 5 customers per minute be the rate at which customers arrive to the queue for ordering, T Q 5
More informationBounded Delay for Weighted Round Robin with Burst Crediting
Bounded Delay for Weighted Round Robin with Burst Crediting Sponsor: Sprint Kert Mezger David W. Petr Technical Report TISL-0230-08 Telecommunications and Information Sciences Laboratory Department of
More informationExam Spring Embedded Systems. Prof. L. Thiele
Exam Spring 20 Embedded Systems Prof. L. Thiele NOTE: The given solution is only a proposal. For correctness, completeness, or understandability no responsibility is taken. Sommer 20 Eingebettete Systeme
More informationIntroduction to the Xilinx Spartan-3E
Introduction to the Xilinx Spartan-3E Nash Kaminski Instructor: Dr. Jafar Saniie ECE597 Illinois Institute of Technology Acknowledgment: I acknowledge that all of the work (including figures and code)
More informationMarkov Chain Model for ALOHA protocol
Markov Chain Model for ALOHA protocol Laila Daniel and Krishnan Narayanan April 22, 2012 Outline of the talk A Markov chain (MC) model for Slotted ALOHA Basic properties of Discrete-time Markov Chain Stability
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Total points: 40 Homework 1 - Solutions Out: 10/4, Due: 10/11 Solutions 1. Two-dimensional parity Given below is a series of 7 7-bit items of data, with an additional bit each
More informationC 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
C H A P T E R I G E N E S I S A N D GROWTH OF G U IL D S 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 i n a v a r i e t y o f f o r m s - s o c i a l, r e l i g i
More informationMultimedia Communication Services Traffic Modeling and Streaming
Multimedia Communication Services Medium Access Control algorithms Aloha Slotted: performance analysis with finite nodes Università degli Studi di Brescia A.A. 2014/2015 Francesco Gringoli Master of Science
More informationN 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
UI 5 thernet s onna arren opics for this Unit thernet History ypical network components functionality versus technologies and specifications he advantages and disadvantages of thernet technology in s dvantages
More informationc. 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
Essential Skills Chapter f ( x + h) f ( x ). Simplifying the difference quotient Section. h f ( x + h) f ( x ) Example: For f ( x) = 4x 4 x, find and simplify completely. h Answer: 4 8x 4 h. Finding the
More informationDistributed systems Lecture 4: Clock synchronisation; logical clocks. Dr Robert N. M. Watson
Distributed systems Lecture 4: Clock synchronisation; logical clocks Dr Robert N. M. Watson 1 Last time Started to look at time in distributed systems Coordinating actions between processes Physical clocks
More informationDistributed Systems Principles and Paradigms. Chapter 06: Synchronization
Distributed Systems Principles and Paradigms Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.20, steen@cs.vu.nl Chapter 06: Synchronization Version: November 16, 2009 2 / 39 Contents Chapter
More informationSTATE AND OUTPUT FEEDBACK CONTROL IN MODEL-BASED NETWORKED CONTROL SYSTEMS
SAE AND OUPU FEEDBACK CONROL IN MODEL-BASED NEWORKED CONROL SYSEMS Luis A Montestruque, Panos J Antsalis Abstract In this paper the control of a continuous linear plant where the sensor is connected to
More informationImplementation of the IEEE 1588 Precision Time Protocol for Clock Synchronization in the Radio Detection of Ultra-High Energy Neutrinos
i Implementation of the IEEE 1588 Precision Time Protocol for Clock Synchronization in the Radio Detection of Ultra-High Energy Neutrinos Undergraduate Research Thesis Presented in partial fulfillment
More informationDistributed Systems Principles and Paradigms
Distributed Systems Principles and Paradigms Chapter 6 (version April 7, 28) Maarten van Steen Vrije Universiteit Amsterdam, Faculty of Science Dept. Mathematics and Computer Science Room R4.2. Tel: (2)
More informationK E L LY T H O M P S O N
K E L LY T H O M P S O N S E A O LO G Y C R E ATO R, F O U N D E R, A N D PA R T N E R K e l l y T h o m p s o n i s t h e c r e a t o r, f o u n d e r, a n d p a r t n e r o f S e a o l o g y, a n e x
More informationgender mains treaming in Polis h practice
gender mains treaming in Polis h practice B E R L IN, 1 9-2 1 T H A P R IL, 2 O O 7 Gender mains treaming at national level Parliament 25 % of women in S ejm (Lower Chamber) 16 % of women in S enat (Upper
More informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Ł Ł Ł Ł Arbitrary networ capacity [Gupta & Kumar The Capacity of Wireless Networs ] Ł! Ł "! Receiver Model Ł Ł # Ł $%&% Ł $% '( * &%* r (1+ r Ł + 1 / n 1 / n log n Area
More informationcs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Agenda Internetworking n Routing across LANs, layer2-layer3 n DHCP n NAT Transport layer
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 5.2: Error Detection & Correction Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527
More informationModeling and Simulation NETW 707
Modeling and Simulation NETW 707 Lecture 6 ARQ Modeling: Modeling Error/Flow Control Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Data Link Layer Data Link Layer provides
More informationP e = 0.1. P e = 0.01
23 10 0 10-2 P e = 0.1 Deadline Failure Probability 10-4 10-6 10-8 P e = 0.01 10-10 P e = 0.001 10-12 10 11 12 13 14 15 16 Number of Slots in a Frame Fig. 10. The deadline failure probability as a function
More information16:330:543 Communication Networks I Midterm Exam November 7, 2005
l l l l l l l l 1 3 np n = ρ 1 ρ = λ µ λ. n= T = E[N] = 1 λ µ λ = 1 µ 1. 16:33:543 Communication Networks I Midterm Exam November 7, 5 You have 16 minutes to complete this four problem exam. If you know
More informationTime in Distributed Systems: Clocks and Ordering of Events
Time in Distributed Systems: Clocks and Ordering of Events Clocks in Distributed Systems Needed to Order two or more events happening at same or different nodes (Ex: Consistent ordering of updates at different
More informationDesign and Analysis of a Propagation Delay Tolerant ALOHA Protocol for Underwater Networks
Design and Analysis of a Propagation Delay Tolerant ALOHA Protocol for Underwater Networks Joon Ahn a, Affan Syed b, Bhaskar Krishnamachari a, John Heidemann b a Ming Hsieh Department of Electrical Engineering,
More informationCS 425 / ECE 428 Distributed Systems Fall Indranil Gupta (Indy) Oct. 5, 2017 Lecture 12: Time and Ordering All slides IG
CS 425 / ECE 428 Distributed Systems Fall 2017 Indranil Gupta (Indy) Oct. 5, 2017 Lecture 12: Time and Ordering All slides IG Why Synchronization? You want to catch a bus at 6.05 pm, but your watch is
More informationDiscrete Random Variables
CPSC 53 Systems Modeling and Simulation Discrete Random Variables Dr. Anirban Mahanti Department of Computer Science University of Calgary mahanti@cpsc.ucalgary.ca Random Variables A random variable is
More informationI 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
I zm ir I nstiute of Technology CS - 1 0 2 Lecture 1 Lecture Notes are based on the CS 101 notes at the University of I llinois at Urbana-Cham paign I zm ir I nstiute of Technology W hat w ill I learn
More informationClass Diagrams. CSC 440/540: Software Engineering Slide #1
Class Diagrams CSC 440/540: Software Engineering Slide # Topics. Design class diagrams (DCDs) 2. DCD development process 3. Associations and Attributes 4. Dependencies 5. Composition and Constraints 6.
More informationMPP5800 series - PANEL MOUNT PRINTERS. Options
series - PANEL MOUNT PRINTERS MPP5810 MPP5820 Introduction 5-8Vdc, 4A peak 5-8Vdc, 2A peak 10-35Vdc Features Easy load paper feature High resolution thermal printing 5-8Vdc standard, 10-35Vdc / low power
More informationNetworked Control Systems
Networked Control Systems Simulation & Analysis J.J.C. van Schendel DCT 2008.119 Traineeship report March till June 2008 Coaches: Supervisor TU/e: Prof. Dr. D. Nesic, University of Melbourne Dr. M. Tabbara,
More informationCongestion Control. Need to understand: What is congestion? How do we prevent or manage it?
Congestion Control Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion Problem: regulate traffic influx such that congestion does not occur
More informationRobust Network Codes for Unicast Connections: A Case Study
Robust Network Codes for Unicast Connections: A Case Study Salim Y. El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University College Station,
More informationLU N C H IN C LU D E D
Week 1 M o n d a y J a n u a ry 7 - C o lo u rs o f th e R a in b o w W e w ill b e k ic k in g o ff th e h o lid a y s w ith a d a y fu ll o f c o lo u r! J o in u s fo r a ra n g e o f a rt, s p o rt
More informationProduct Data Sheet KyoRack 4
series - PANEL MOUNT PRINTERS Page 1 of 10 Introduction 5-8Vdc, 4A peak 5-8Vdc, 2A peak 10-35Vdc Features Easy open paper loading feature High resolution thermal printing 5-8Vdc standard, 10-35Vdc / low
More informationPerformance analysis of IEEE WLANs with saturated and unsaturated sources
Performance analysis of IEEE 82.11 WLANs with saturated and unsaturated sources Suong H. Nguyen, Hai L. Vu, Lachlan L. H. Andrew Centre for Advanced Internet Architectures, Technical Report 11811A Swinburne
More informationCongestion estimation technique in the optical network unit registration process
Letter Optics Letters 1 Congestion estimation technique in the optical network unit registration process GEUNYONG KIM 1,2, HARK YOO 1, DONGSOO LEE 1, YOUNGSUN KIM 1, AND HYUK LIM 2,* 1 Electronics and
More informationFraud within Asymmetric Multi-Hop Cellular Networks
Financial Cryptography 2005 EPFL, Lausanne, Switzerland ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE Wireless networks Single-hop cellular network Multi-hop network Multi-hop cellular network Asymmetric multi-hop
More informationForm and content. Iowa Research Online. University of Iowa. Ann A Rahim Khan University of Iowa. Theses and Dissertations
University of Iowa Iowa Research Online Theses and Dissertations 1979 Form and content Ann A Rahim Khan University of Iowa Posted with permission of the author. This thesis is available at Iowa Research
More informationReliable Broadcast for Broadcast Busses
Reliable Broadcast for Broadcast Busses Ozalp Babaoglu and Rogerio Drummond. Streets of Byzantium: Network Architectures for Reliable Broadcast. IEEE Transactions on Software Engineering SE- 11(6):546-554,
More informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Per-node throughput in case of: Full connected networs each node sees all the others Generic networ topology not all nodes are visible Performance Analysis of single-hop
More informationATM VP-Based Ring Network Exclusive Video or Data Traffics
ATM VP-Based Ring Network Exclusive Video or Data Traffics In this chapter, the performance characteristic of the proposed ATM VP-Based Ring Network exclusive video or data traffic is studied. The maximum
More informationSolutions to COMP9334 Week 8 Sample Problems
Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items
More informationInformation in Aloha Networks
Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha
More informationIntegrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks
VANET Analysis Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks Tom Hao Luan, Xuemin (Sherman) Shen, and Fan Bai BBCR, ECE, University of Waterloo, Waterloo, Ontario, N2L 3G1,
More informationEP2200 Course Project 2017 Project II - Mobile Computation Offloading
EP2200 Course Project 2017 Project II - Mobile Computation Offloading 1 Introduction Queuing theory provides us a very useful mathematic tool that can be used to analytically evaluate the performance of
More informationCS115 Computer Simulation Project list
CS115 Computer Simulation Project list The final project for this class is worth 40% of your grade. Below are your choices. You only need to do one of them. Project MC: Monte Carlo vs. Deterministic Volume
More informationMODBUS Protocol for CS141 network card families
Last update: 20/09/208 MODBUS Protocol for CS4 network card families Summary. MODBUS PROTOCOL... 2.. MODBUS COMMUNICATION PARAMETERS... 2.2. AVAILABLE MODBUS FUNCTION CODES... 2.3. EXCEPTION CODES... 3
More informationPerformance Evaluation of Deadline Monotonic Policy over protocol
Performance Evaluation of Deadline Monotonic Policy over 80. protocol Ines El Korbi and Leila Azouz Saidane National School of Computer Science University of Manouba, 00 Tunisia Emails: ines.korbi@gmail.com
More informationOPERATING MANUAL. EIB-Kombisensor AS 315 N
EIB-Kombisensor AS 315 N OPERATING MANUAL EIB-Kombisensor AS 315 N 1 Contents Page 3 1. Description 4 1.1 Automated Operations 1.1.1 Sun System 1.1.2 Half-Light System 5 1.1.3 Wind System 1.1.4 Rain System
More informationE8 TCP. Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione
E8 TP Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Exercises o onsider the connection in the figure A =80 kbit/s τ =0 ms R =? τ =? B o o o Host A wants to know the capacity
More informationKybernetika. Andrzej Dziech; Andrzej R. Pach Bounds on the throughput of an unslotted ALOHA channel in the case of a heterogeneous users' population
Kybernetika Andrzej Dziech; Andrzej R. Pach Bounds on the throughput of an unslotted ALOHA channel in the case of a heterogeneous users' population Kybernetika, Vol. 25 (1989), No. 6, 476--485 Persistent
More informationChapter 5 A Modified Scheduling Algorithm for The FIP Fieldbus System
Chapter 5 A Modified Scheduling Algorithm for The FIP Fieldbus System As we stated before FIP is one of the fieldbus systems, these systems usually consist of many control loops that communicate and interact
More informationSTEEL PIPE NIPPLE BLACK AND GALVANIZED
Price Sheet Effective August 09, 2018 Supersedes CWN-218 A Member of The Phoenix Forge Group CapProducts LTD. Phone: 519-482-5000 Fax: 519-482-7728 Toll Free: 800-265-5586 www.capproducts.com www.capitolcamco.com
More informationCHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals
CHAPTER 4 Networks of queues. Open networks Suppose that we have a network of queues as given in Figure 4.. Arrivals Figure 4.. An open network can occur from outside of the network to any subset of nodes.
More informationCS505: Distributed Systems
Cristina Nita-Rotaru CS505: Distributed Systems. Required reading for this topic } Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson for "Impossibility of Distributed with One Faulty Process,
More informationLecture 15: Remote Monitoring (RMON)
Lecture 15: Remote Monitoring (RMON) Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4395 15-1 RMON Remote Network Monitoring (RMON): monitoring the state of a network
More informationCoordination. Failures and Consensus. Consensus. Consensus. Overview. Properties for Correct Consensus. Variant I: Consensus (C) P 1. v 1.
Coordination Failures and Consensus If the solution to availability and scalability is to decentralize and replicate functions and data, how do we coordinate the nodes? data consistency update propagation
More information21 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
EE345L Spring 2005 Final Version A Solution Page 1 Jonathan W. Valvano May 14, 2005, 9am - 12 noon First: Last: (4) Question 1. Give max number of bytes on the stack (4) Question 2. Yes/no. If yes, state
More informationReliable Data Transport: Sliding Windows
Reliable Data Transport: Sliding Windows 6.02 Fall 2013 Lecture 23 Exclusive! A Brief History of the Internet guest lecture by Prof. Hari Balakrishnan Wenesday December 4, 2013, usual 6.02 lecture time
More informationWiFi MAC Models David Malone
WiFi MAC Models David Malone November 26, MACSI Hamilton Institute, NUIM, Ireland Talk outline Introducing the 82.11 CSMA/CA MAC. Finite load 82.11 model and its predictions. Issues with standard 82.11,
More informationDistributed Systems. Time, Clocks, and Ordering of Events
Distributed Systems Time, Clocks, and Ordering of Events Björn Franke University of Edinburgh 2016/2017 Today Last lecture: Basic Algorithms Today: Time, clocks, NTP Ref: CDK Causality, ordering, logical
More informationAgressive Transmissions over Redundant Paths for Time Critical Messages
Agressive Transmissions over Redundant Paths for Time Critical Messages Hector Garcia-Molina Department of Computer Science Stanford University Stanford CA 94305 Ben Kao Department of Computer Science
More informationMission brief. Member. R a n k. O t h e r c r e w m e m b e r s
Mission brief Beagle 2 probe was due to land on Mars on 25th December 2003. The spacecraft was successfully ejected from Mars Express on 19th December 2003. Nothing has been heard from Beagle 2 since.
More informationOn the Stability and Optimal Decentralized Throughput of CSMA with Multipacket Reception Capability
On the Stability and Optimal Decentralized Throughput of CSMA with Multipacket Reception Capability Douglas S. Chan Toby Berger Lang Tong School of Electrical & Computer Engineering Cornell University,
More informationTCP over Cognitive Radio Channels
1/43 TCP over Cognitive Radio Channels Sudheer Poojary Department of ECE, Indian Institute of Science, Bangalore IEEE-IISc I-YES seminar 19 May 2016 2/43 Acknowledgments The work presented here was done
More informationModeling Approximations for an IEEE WLAN under Poisson MAC-Level Arrivals
Modeling Approximations for an IEEE 802.11 WLAN under Poisson MAC-Level Arrivals Ioannis Koukoutsidis 1 and Vasilios A. Siris 1,2 1 FORTH-ICS, P.O. Box 1385, 71110 Heraklion, Crete, Greece 2 Computer Science
More informationTuning the TCP Timeout Mechanism in Wireless Networks to Maximize Throughput via Stochastic Stopping Time Methods
Tuning the TCP Timeout Mechanism in Wireless Networks to Maximize Throughput via Stochastic Stopping Time Methods George Papageorgiou and John S. Baras Abstract We present an optimization problem that
More informationPerformance analysis of IEEE WLANs with saturated and unsaturated sources
1 Performance analysis of IEEE 8.11 WLANs with saturated and unsaturated sources Suong H. Nguyen, Student Member, IEEE, Hai L. Vu, Senior Member, IEEE, and Lachlan L. H. Andrew, Senior Member, IEEE Abstract
More informationMultiaccess Problem. How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users?
Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users? z The protocols we used to solve this multiaccess problem are
More informationDesign and Analysis of Multichannel Slotted ALOHA for Machine-to-Machine Communication
Design and Analysis of Multichannel Slotted ALOHA for Machine-to-Machine Communication Chih-Hua Chang and Ronald Y. Chang School of Electrical and Computer Engineering, Purdue University, USA Research
More informationS ca le M o d e l o f th e S o la r Sy ste m
N a m e ' D a t e ' S ca le M o d e l o f th e S o la r Sy ste m 6.1 I n t r o d u c t i o n T h e S olar System is large, at least w hen com pared to distances we are fam iliar w ith on a day-to-day basis.
More informationBurst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks
Burst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks G. Mohan, M. Ashish, and K. Akash Department of Electrical and Computer Engineering National University
More informationTime Synchronization
Massachusetts Institute of Technology Lecture 7 6.895: Advanced Distributed Algorithms March 6, 2006 Professor Nancy Lynch Time Synchronization Readings: Fan, Lynch. Gradient clock synchronization Attiya,
More informationRelaying Information Streams
Relaying Information Streams Anant Sahai UC Berkeley EECS sahai@eecs.berkeley.edu Originally given: Oct 2, 2002 This was a talk only. I was never able to rigorously formalize the back-of-the-envelope reasoning
More informationTiming Analysis of AVB Traffic in TSN Networks using Network Calculus
Timing Analysis of AVB Traffic in TSN Networks using Network Calculus Luxi Zao, Paul Pop Tecnical University of Denmark Zong Zeng, Qiao Li Beiang University Outline Introduction System Model Arcitecture
More informationA NEW SYSTEM FOR THE GENERATION OF UTC(CH)
A NEW SYSTEM FOR THE GENERATION OF UTC(CH) L.G. Bernier and G. Schaller METAS Swiss Federal Office of Metrology Lindenweg 50, Bern-Wabern, CH-3003, Switzerland laurent-guy.bernier@metas.ch Abstract A new
More informationFCFS Tree Algorithms with Interference Cancellation and Single Signal Memory Requirements
FCFS Tree Algorithms with Interference Cancellation and Single Signal Memory Requirements B. Van Houdt and G.T. Peeters University of Antwerp - IBBT Middelheimlaan 1 B-00 Antwerp Belgium Abstract Tree
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,b,, Bi Li b,a,c, Nicolas Nisse b,a, Hervé Rivano d, Min-Li Yu e a Univ. Nice Sophia Antipolis, CNRS,
More informationOn the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels
On the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels Jie Luo, Anthony Ephremides ECE Dept. Univ. of Maryland College Park, MD 20742
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.
Outline EECS 150 - Components and esign Techniques for igital Systems Lec 18 Error Coding Errors and error models Parity and Hamming Codes (SECE) Errors in Communications LFSRs Cyclic Redundancy Check
More informationAgreement. Today. l Coordination and agreement in group communication. l Consensus
Agreement Today l Coordination and agreement in group communication l Consensus Events and process states " A distributed system a collection P of N singlethreaded processes w/o shared memory Each process
More informationReduced operator noise. For increased resident satisfaction.
S I L E N C E I S G O L D E N. Reduced operator noise. For increased resident satisfaction. PRODUCT BROCHURE HCTDCU SPECIALTY OVERHEAD OPERATOR UPTIME. ALL THE TIME. E n g i n e e r e d t o r e d u c e
More informationCongestion Control. Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion
Congestion Control Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion Problem: regulate traffic influx such that congestion does not occur
More informationAnalysis on Packet Resequencing for Reliable Network Protocols
1 Analysis on Packet Resequencing for Reliable Network Protocols Ye Xia David Tse Department of Electrical Engineering and Computer Science University of California, Berkeley Abstract Protocols such as
More informationPhoto. EPRI s Power System and Railroad Electromagnetic Compatibility Handbook
Photo EPRI s Power System and Railroad Electromagnetic Compatibility Handbook Brian Cramer Project Manager Transmission and Substations bcramer@epri.com 815/478-5344 Problem Periodic false activation of
More information