DOCSLIB.ORG

Real-Time Communications in Token Ring Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Real-Time Communications in Token Ring Networks U - b-Ît Real-Time Communications in Token Ring Networks by Li-Jun Yao A thesis submitted for the degree of Doctor of PhilosoPhY TN Department of ComPuter Science The [Jniaersi,tY of Adelaide Jairuary L994 \1q Au,o, ltJ \' Abstract as it imposes a Real-time communications differ from traditional data communications It is weil known that time constraint, such as d,ead,line, on each message transmission' for task scheduling in a the Earliest Deadline First (EDF) scheduling policy is optimal policy in a distributed centralized real-time system. However, implementing the EDF real-time environment real-time system is d.ifferent from its counterpart in a centralized work deals with the due to its non-negligible scheduling overhead involved. This distributed system implementation of the EDF policy in the context of a speciflc - a token ring a token ring local area network. Its main objectives are (i) to propose real-time message protocol which implements the exact network-wide trDF policy for level of transmission, and. (ii) to address the fundamental issue of the appropriate environment' implementing an optimal scheduling poiicy in a distributed real-time In brief, the work is concerned with the design and performance evaluation of implement variations three token ring protocols for real-time communications' which is an existing token of the EDF. transmission policy with different overheads. The flrst overhead' passingprotocol which does not adhere to the EDF poiicy but has a minimal the EDF policy The second is a modified priori,ty-ilriuen protocol which approximates for with a moderate overhead. The third is the window protocol which is proposed ll the exact EDF transmission the token ring networks for the first time' It implements high' policy, but its contention overhead may be potentially and compared' It The worst case performance of the three protocois is analyzed protocoi is determined is found that the pert'ormance of a distributed communication overhead not oniy by the transmission policy employed, but also by the contention that no protocol can incurred when implementing such a policy' It is also shown langes considered and that always outperform the others for the entire parameter performance is the best' each protocol has its own applicable region where its protocols is evaluated Furthermore, the average case performance of the three ring network through simulation. It is found that under the current token best performance as a result technology, the proposed window protocol achieves the when the ring gets of implementing the EDF policy. However, it is also shown that is reduced' faster, the difierence in the performance of the three protocols algorithm, Therefore, it is concluded that in designing a distributed scheduling in achieving an optimai such as a communication protocol, one should seek a balance scheduling policy and minimizing the scheduling overhead. Ill Acknowledgments to my former supervisor I wish to express my deep gratitude and appreciation guidance, support and Prof. wei zhao lor suggesting this project and for his devoted my coming help. I am very grateful to Prof. chris Barter for having facilitated support and to Australia to und.ertake this research and for his immense enthusiasm, Zukerman for expanding my encouïagement as my later supervisor. I thank Dr. Moshe the Network Analysis section' research horizon tremendously when I was working in cheng-chew Lim from Telecom Research Laboratories in 1991. I also thank Dr' heipful advice and the Department of Eiectricai and Electronic Engineering for his comments. but near I am deeply indebted to my parents and my sister who are remote thanks to and whose love, und.erstanding and support are invaluable' Special and bad piero Ammirato for his love and support and for sharing the good times introduced Australia to me times over the past four years. I thank Fred Thornett who me. Finally, I am thankful to seven years ago for his friendship, help and confldence in one way or another ali the staff members in the d.epartment and all my friends who in have contributed to the making of this thesis' This work was supported. by the univerity of Adelaide Postgraduate Research Scholarship. v Contents l1 Abstract iv Declaration v Acknowledgments 1 Introduction 1 1 1.1 Motivation and ScoPe 6 1.2 Real-Time Communications I.2.1 Definitions and Objectives 6 8 I.2.2 Selection of the Optimal Algorithm 10 1.3 Reiated Work 1.3.1 Related CSMA/CD Based Work 10 1.3.2 Related Token Bus/Ring Based Work 13 T7 I.4 Desirable Properties of Protocols for Real-Time communications ' 18 1.5 Thesis Outline 20 2 System Models 20 2.1 Network Model 23 2.2 Network Parameters V1 2.3 Message Model and Parameters 2.4 Protocol Notations and Performan.ce Metrics 2.5 Methodoiogy for Worst Case Performance Analysis 3 The Token Passing Protocol 3.1 Protocol DescriPtion 3.2 Protocol ProPerties 3.3 Worst Case Performance Analysis 3.4 Numerical Results and Discussions 4 The PrioritY-Driven Protocol +J Protocol DescriPtion 4.2 PrioritY Assignment Function 4.3 Worst Case Performance of PD*sP 4.3.1 Lower Bound of R(PD*>p,u,n) 4.3.2 UPPer Bound o1 R(PD*>n',u,n) 4.3.3 An Estimation of R(PD*>D,u,n) 4.g.4 Numerical Results and Discussions 4.4 Worst Case Performance of- PD^<a +.4.I Worst Case Performance Ratio R(PD*a¿,w,n) 4.+.2 Numerical Results and Discussions 4.5 Worst Case Performance of PD¿a*ap ' +.5.1 ProPerties of PD^<¿ 4.5.2 Performance bounds for Ak(n) 4.5.3 Numerical Results and Discussions 4.6 Enhancements and Modifications v11 L26 5 The Window Protocol t26 5.1 Basic ConcePts r27 5.2 Data Structures r27 5.2.1 Window Setting 130 5.2.2 Token Format t32 5.2.3 Data Structures on a Node t32 5.3 Protocol DescriPtion 5.3.1 Monitor Node 133 5.3.2 Non-Monitor Nodes 137 145 5.4 Worst Case Performance AnalYsis 150 5.5 Numerical Results and Discussions 151 b.0 Major Advantages of the Window Protocol t54 Ð.1 Protocol Realization t54 5.7.I Direct Realization ' 5.7.2 Optimal Realization 155 5.7.3 Practical Realization 161 L62 5.8 Enhancements and Modifications 5.8.1 Urgent Pre-emPtion. t62 5.8.2 Faster Deadline Tie Handling 166 167 5.8.3 Faster Resolution 169 5.8.4 Choice of Threshoid 169 5.8.5 Possible Realization . 6 'Worst Case Performance Comparison t70 6.1 Comparison Method 170 vrll 6.2 Pair-Wise ComParisons 6.3 Comparison of Three Protocols 6.4 AppticabilitY of Results 7 Average Case Performance Comparison 7.t Simulation Program 7.2 Traffic Model and Parameters 7.3 Performance Metrics 7.4 Simulation Resuits 7.4.I Effect of Offered Load 7.4.2 Efiect of Ring SPeed 7.4.3 Effect of Ring PoPulation 7.4.4 Effect of Protocol Parameters 7 -4-4.1 Effect of Number of Priorities 7.4.4.2 Effect of Length of Priority Assignment Function 7 -4.4.3 Effect of Initial Window Size 7.4.4.4 Effect of Initial Window Lower Bound 7.5 Discussions g conclusions and Recommendations for F\rture Research 8.1 SummarY of Results 8.2 Signifi,cance and Contribution 8.3 Recommendations for Future Research A Publications and Presentations References lx List of Tables 24 2.1 Network Parameters 137 5.1 Monitor Node Operations (trxplanatory Scheme) ' ' ' 138 5.2 Non-Monitor Node Operations (Explanatory Model) ' Scheme) 158 5.3 Encoding for Monitor Node Operations (Optimal scheme) . 159 5.4 Encoding for Non-Monitor Node operations (optimal scheme) . 163 5.5 Encoding for Monitor Node operations (Practical (Practical scheme) 164 ,5.C) Encoding for Non-Monitor Node operations 179 6.1 Performance Relationship in Six Regions 182 6.2 Range of Normalized Token Node-to-Node Delay 189 7.L Traffic Profrle r92 7.2 Effect of Offered Load Dq t97 1..) Effect of Ring SPeed 202 7.4 Effect of Ring PoPulation 2lr 7.5 Effect of Initial Window Lower Bound x List of Figures 2T 2.r Generic Real-Time Communication Layer Model 23 2.2 A Token Ring Network Ðt 3.1 Worst Case Performance Ratio of TP 64 4.1 A Priority Assignment Function 66 4.2 Time Diagram of Message Transmission ' 93 4.3 Worst Case Performance Ratio of PD*sp 93 4.4 Comparison of R¡o-, Ru, and R""t 103 4.5 Effect of the Number of Priorities 104 4.6 Worst Case Performance ratio of PD*<a t27 4.7 Effect of the Number of Priorities t22 4.8 Effect of Parameter Ie . t22 +.9 Worst Case Performance o'L PD¿a*aD ' t28 5.1 Initial Window Boundaries 130 5.2 Proposed Token Access (AC) Field t34 5.3 Protocol State Machine Transition Diagram r+2 5.4 Splitting of Window WPw 151 5.5 Worst Case Performance Ratio of WD t52 5.6 Effect of Number of Windows xl 153 5.7 Time Diagram for Message Transmission 161 5.8 IEEE 802.5 Token Format 173 6.1 Pair-Wise Equai Performing Bands 175 6.2 Pair-\Mise Equal Performing Curves 777 6.3 Comparison of Three Protocols 178 6.4 Comparison of Three Protocols 180 6.5 Comparison of Three Protocols 183 6.6 Parameter Range of Current Token Ring Networks 186 7.r Simulation Program Flow Chart ' ' ' 190 7.2 Token Access Controi Field Format 195 LJ Effect of Offered Load 199 7.4 Effect of Ring SPeed 201 7.5 Effect of Ring PoPulation 204 7.6 Effect of Number of Priorities 206 7.7 Effect of Length of Priority Assignment Function 208 7.8 Effect of Initial Window Size ' 2t0 7.9 Effect of Initial Window Lower Bound xll Chapter 1 Introduction 1-.1 Motivation and ScoPe over the last The need for high speed.
Load more

Recommended publications
  • 1) What Is the Name of an Ethernet Cable That Contains Two
    1) What is the name of an Ethernet cable that contains two electrical conductors ? A coaxial cable 2) What are the names of the two common conditions that degrade the signals on c opper-based cables? Crosstal and attenuation 3) Which topology requires the use of terminators? Bus 4) Which of the following topologies is implemented only logically, not physical ly? Ring 5) How many wire pairs are actually used on a typical UTP Ethernet network? Two 6) What is the name of the process of building a frame around network layer info rmation? Data encapsulation 7) Which of the connectors on a network interface adapter transmits data in para llel? The System bus connector 8) Which two of the following hardware resources do network interface adapters a lways require? I/O port address and IRQ 9) What is the name of the process by which a network interface adapter determin es when it should transmit its data over the network? Media Access Control 10) Which bus type is preferred for a NIC that will be connected to a Fast Ether net network? PCI 11) A passive hub does not do which of the following? Transmit management information using SNMP 12) To connect two Ethernet hubs together, you must do which of the following? Connect the uplink port in one hub to a standard port on the other 13) Which term describes a port in a Token Ring MAU that is not part of the ring ? Intelligent 14) A hub that functions as a repeater inhibits the effect of____________? Attenuation 15) You can use which of the following to connect two Ethernet computers togethe r using UTP
    [Show full text]
  • An Analysis of IEEE 802.16 and Wimax Multicast Delivery
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Calhoun, Institutional Archive of the Naval Postgraduate School Calhoun: The NPS Institutional Archive Theses and Dissertations Thesis Collection 2007-09 An analysis of IEEE 802.16 and WiMAX multicast delivery Staub, Patrick A. Monterey, California. Naval Postgraduate School http://hdl.handle.net/10945/3203 NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS AN ANALYSIS OF IEEE 802.16 AND WIMAX MULTICAST DELIVERY by Patrick A. Staub September, 2007 Thesis Advisor: Bert Lundy Second Reader: George Dinolt Approved for public release; distribution is unlimited THIS PAGE INTENTIONALLY LEFT BLANK REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-0188 Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302, and to the Office of Management and Budget, Paperwork Reduction Project (0704-0188) Washington DC 20503. 1. AGENCY USE ONLY (Leave blank) 2. REPORT DATE 3. REPORT TYPE AND DATES COVERED September 2007 Master’s Thesis 4. TITLE AND SUBTITLE An Analysis of IEEE 802.16 and WiMAX 5. FUNDING NUMBERS Multicast Delivery 6. AUTHOR(S) Patrick A. Staub 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8.
    [Show full text]
  • System Performance of Wireless Sensor Network Using Lora…
    Computers, Materials & Continua Tech Science Press DOI:10.32604/cmc.2021.016922 Article System Performance of Wireless Sensor Network Using LoRa–Zigbee Hybrid Communication Van-Truong Truong1, Anand Nayyar2,* and Showkat Ahmad Lone3 1Faculty of Electrical and Electronic Engineering, Duy Tan University, Da Nang, 550000, Vietnam; Institute of Research and Development, Duy Tan University, Da Nang, 550000, Vietnam 2Graduate School, Duy Tan University, Da Nang 550000, Vietnam; Faculty of Information Technology, Duy Tan University, Da Nang, Vietnam 3Department of Basic Science, College of Science and Theoretical Studies, Saudi Electronic University, Jeddah Campus, KSA *Corresponding Author: Anand Nayyar. Email: [email protected] Received: 15 January 2021; Accepted: 17 February 2021 Abstract: Wireless sensor network (WSN) is considered as the fastest growing technology pattern in recent years because of its applicability in var- ied domains. Many sensor nodes with different sensing functionalities are deployed in the monitoring area to collect suitable data and transmit it to the gateway. Ensuring communications in heterogeneous WSNs, is a critical issue that needs to be studied. In this research paper, we study the system performance of a heterogeneous WSN using LoRa–Zigbee hybrid communi- cation. Specifically, two Zigbee sensor clusters and two LoRa sensor clusters are used and combined with two Zigbee-to-LoRa converters to communicate in a network managed by a LoRa gateway. The overall system integrates many different sensors in terms of types, communication protocols, and accuracy, which can be used in many applications in realistic environments such as on land, under water, or in the air. In addition to this, a synchronous man- agement software on ThingSpeak Web server and Blynk app is designed.
    [Show full text]
  • 13 Embedded Communication Protocols
    13 Embedded Communication Protocols Distributed Embedded Systems Philip Koopman October 12, 2015 © Copyright 2000-2015, Philip Koopman Where Are We Now? Where we’ve been: •Design • Distributed system intro • Reviews & process • Testing Where we’re going today: • Intro to embedded networking – If you want to be distributed, you need to have a network! Where we’re going next: • CAN (a representative current network protocol) • Scheduling •… 2 Preview “Serial Bus” = “Embedded Network” = “Multiplexed Wire” ~= “Muxing” = “Bus” Getting Bits onto the wire • Physical interface • Bit encoding Classes of protocols • General operation • Tradeoffs (there is no one “best” protocol) • Wired vs. wireless “High Speed Bus” 3 Linear Network Topology BUS • Good fit to long skinny systems – elevators, assembly lines, etc... • Flexible - many protocol options • Break in the cable splits the bus • May be a poor choice for fiber optics due to problems with splitting/merging • Was prevalent for early desktop systems • Is used for most embedded control networks 4 Star Network Topologies Star • Can emulate bus functions – Easy to detect and isolate failures – Broken wire only affects one node – Good for fiber optics – Requires more wiring; common for Star current desktop systems • Broken hub is catastrophic • Gives a centralized location if needed – Can be good for isolating nodes that generate too much traffic Star topologies increasing in popularity • Bus topology has startup problems in some fault scenarios • Safety critical control networks moving
    [Show full text]
  • Nomadic Communications
    Nomadic Communications Renato Lo Cigno ANS Group – [email protected] Francesco Gringoli [email protected] http://disi.unitn.it/locigno/index.php/teaching-duties/nomadic-communications Copyright Quest’opera è protetta dalla licenza: Creative Commons Attribuzione-Non commerciale-Non opere derivate 2.5 Italia License Per i dettagli, consultare http://creativecommons.org/licenses/by-nc-nd/2.5/it/ What do you find on the web site • Exam Rules • Exam Details ... should be on ESSE3, but ... • Generic (useful) information • Teaching Material: normally posted at least the day before the lesson • Additional Material and links • Laboratories groups, rules, description and hints • News, Bulletin, How to find and meet me and Francesco, etc. • ... The web site is work in progress (well as of today working badly, but improving) and updated frequently(that’s at least my intention) Please don’t blame ME if you did’t read the last news J Program • Why “Nomadic” – Mobile vs. nomadic – Cellular vs. HotSpot – Local wireless communications • Some rehearsal – Access Control Protocols – Protocols and architectures – Services and primitives – IEEE 802 project – Nomadic communications positioning Program • WLAN – 802.11 Standard – 802.11 MAC – 802.11b/g/a/h/n/ac PHY – QoS and Differentiation enhancement: 802.11e – Mesh networks: 802.11s & other protocols – Other extensions: 802.11f/p/ad/ad/... Program • Ad-Hoc Networks – Stand-Alone WLANs – Routing and multi-hop in Ad-Hoc networks • Vehicular Networks Problems and scenarios – Specific issues
    [Show full text]
  • The Spirit of Wi-Fi
    Rf: Wi-Fi_Text Dt: 09-Jan-2003 The Spirit of Wi-Fi where it came from where it is today and where it is going by Cees Links Wi-Fi pioneer of the first hour All rights reserved, © 2002, 2003 Cees Links The Spirit of Wi-Fi Table of Contents 0. Preface...................................................................................................................................................1 1. Introduction..........................................................................................................................................4 2. The Roots of Wi-Fi: Wireless LANs...................................................................................................9 2.1 The product and application background: networking ..............................................................9 2.2 The business background: convergence of telecom and computers? ......................................14 2.3 The application background: computers and communications ...............................................21 3. The original idea (1987 – 1991).........................................................................................................26 3.1 The radio legislation in the US .................................................................................................26 3.2 Pioneers .....................................................................................................................................28 3.3 Product definition ......................................................................................................................30
    [Show full text]
  • Unit 3 Basics of Network Technology
    UNIT 3 BASICS OF NETWORK TECHNOLOGY Structure 3.0 Objectives 3.1 Introduction 3.2 Network Concept and Classification 3.2.1 Advantages of Networks 3.2.2 Network Classification 3.3 Local Area Network (LAN) Overview 3.3.1 LAN Topologies 3.3.2 LAN Access Methods 3.4 Wide Area Network 3.4.1 WAN Topologies 3.4.2 WAN Switching Methods 3.4.3 WAN Devices/Hardware 3.5 Wireless Technology 3.5.1 WiFi 3.5.2 WiMax 3.6 Summary 3.7 Answers to Self Check Exercises 3.8 Keywords 3.9 References and Further Reading 3.0 OBJECTIVES After going through this Unit, you will be able to: explain the concept of computer networks; understand different application of networks; differentiate between different types of computer networks based on size, connection and functioning; compare the different network topologies used in LAN and WAN; understand the working of LAN access methods; explain the working of networking devices used in WAN; know the importance of using networked system; and understand the concept of wireless technologies and standards. 3.1 INTRODUCTION With the ICT revolution the functioning of organisations has changed drastically. In a networked scenario organisations often need several people (may be at different locations) to input and process data simultaneously. In order to achieve this, a computer-networking model in which a number of separate but interconnected computers do the job has replaced the earlier standalone-computing model. By linking individual computers over 4 7 Network Fundamentals a network their productivity has been increased enormously. A most distinguishing characteristic of a general computer network is that data can enter or leave at any point and can be processed at any workstation.
    [Show full text]
  • IEEE 802.5 (Token Ring) LAN
    IEEE 802.5 (Token Ring) LAN Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF IEEE 802.5 (Token Ring): Ring Topology Shared ring medium: all nodes see all frames Round Robin MAC Protocol: determines which station can transmit A special 3-byte pattern, the token, circulates around the ring perpetually and represents the "right to transmit" This establishes round-robin media access Data flow is unidirectional All data flows in a particular direction around the ring; nodes receive frames from their upstream neighbor and forward them to their downstream neighbor Data rate: 4 or 16 Mbps R R R R IEEE 802.5 (Token Ring) Operation The token bit sequence circulates around the ring. Each station forwards the token if it does not have a frame to transmit. A station with data to send seizes the token (repeater now in transmit state) and begins sending it’s frame. It can transmit for length of time called the Token Hold Time (THT) = 10 mseconds. Each station forwards the frame. The destination station notices its address and saves a copy of the frame as it also forwards the frame. When the sender sees its frame return, it drains it from the ring and reinserts a token. When the last bit of the returning frame has been drained, the repeater switches immediately to the listen state. IEEE 802.5 (Token Ring) using a Hub The star-wired ring topology uses the physical layout of a star in conjunction with the token-passing data transmission method.
    [Show full text]
  • The Network Stack (1) L41 Lecture 5 Dr Robert N
    1/25/17 The Network Stack (1) L41 Lecture 5 Dr Robert N. M. Watson 25 January 2017 Reminder: where we left off last term • Long, long ago, but in a galaxy not so far away: • Lecture 3: The Process Model (1) • Lecture 4: The Process Model (2) • Lab 2: IPC buffer size and the probe effect • Lab 3: Micro-architectural effects of IPC • Explored several implied (and rejected) hypotheses: • Larger IO/IPC buffer sizes amortise system-call overhead • A purely architectural (SW) review dominates • The probe effect doesn’t matter in real-world workloads L41 Lecture 5 – The Network Stack (1) 1 1/25/17 This time: Introduction to Network Stacks Rapid tour across hardware and software: • Networking and the sockets API • Network-stack design principles: 1980s vs. today • Memory flow across hardware and software • Network-stack construction and work flows • Recent network-stack research L41 Lecture 5 – The Network Stack (1) Networking: A key OS function (1) • Communication between computer systems • Local-Area Networks (LANs) • Wide-Area Networks (WANs) • A network stack provides: • Sockets API and extensions • Interoperable, feature-rich, high-performance protocol implementations (e.g., IPv4, IPv6, ICMP, UDP, TCP, SCTP, …) • Security functions (e.g., cryptographic tunneling, firewalls...) • Device drivers for Network Interface Cards (NICs) • Monitoring and management interfaces (BPF, ioctl) • Plethora of support libraries (e.g., DNS) L41 Lecture 5 – The Network Stack (1) 2 1/25/17 Networking: A key OS function (2) • Dramatic changes over 30 years: 1980s: Early packet-switched networks, UDP+TCP/IP, Ethernet 1990s: Large-scale migration to IP; Ethernet VLANs 2000s: 1-Gigabit, then 10-Gigabit Ethernet; 802.11; GSM data 2010s: Large-scale deployment of IPv6; 40/100-Gbps Ethernet ..
    [Show full text]
  • LAN Systems: Ethernet, Token Ring, and FDDI
    LANLAN SystemsSystems Raj Jain Professor of CIS The Ohio State University Columbus, OH 43210 [email protected] This presentation is available on-line at http://www.cis.ohio-state.edu/~jain/cis677-98/ The Ohio State University Raj Jain 1 OverviewOverview q IEEE 802.3: Ethernet and fast Ethernet q IEEE 802.5: Token ring q Fiber Distributed Data Interface (FDDI) The Ohio State University Raj Jain 2 LANLAN TopologiesTopologies Tap Terminating Repeater Flow of data resistance Station (a) Bus (c) Ring Central hub, switch, or repeater Headend (b) Tree (d) Star The Ohio State University Fig 12.4 Raj Jain 3 MediaMedia AccessAccess ControlControl (MAC)(MAC) Bus Topology Ring Topology Token Passing IEEE 802.4 IEEE 802.5 Token bus Token Ring Slotted Access IEEE 802.6 Cambridge DQDB Ring Contention IEEE 802.3 Slotted CSMACD Ring The Ohio State University Raj Jain 4 (a) Multiple Access (b) Carrier-Sense Multiple Access with Collision Detection The Ohio State University Raj Jain 5 CSMA/CDCSMA/CD q Aloha at Univ of Hawaii: Transmit whenever you like Worst case utilization = 1/(2e) =18% q Slotted Aloha: Fixed size transmission slots Worst case utilization = 1/e = 37% q CSMA: Carrier Sense Multiple Access Listen before you transmit q p-Persistent CSMA: If idle, transmit with probability p. Delay by one time unit with probability 1-p q CSMA/CD: CSMA with Collision Detection Listen while transmitting. Stop if you hear someone else The Ohio State University Raj Jain 6 IEEEIEEE 802.3802.3 CSMA/CDCSMA/CD q If the medium is idle, transmit (1-persistent).
    [Show full text]
  • Token Bus Occur in Real‐Time with Minimum Delay, and at the Same Speed As the Objects Moving Along the Assembly Line
    Introduction • LANs have a direct application in factory automation and process control, where nodes are computers controlling the manufacturing Chap ter 12 process. • In this type of application, processing must Token Bus occur in real‐time with minimum delay, and at the same speed as the objects moving along the assembly line. 2 Introduction Introduction • Ethernet is not suitable for this purpose, • Token Bus is the solution to this type of because the number of collisions is not problem. predictable and delay in sending data from the • It combines the physical configuration of control center to the computers along the Ethernet (a bus topology) and the collision‐ assembly line is not a fixed value. free (predictable delay) feature of Token Ring. • Token Ring is not suitable either, because an • It is a physical bus operating as a logical ring assembly line resembles a bus topology and using tokens. not a ring topology. 3 4 Figure 12-1 Physical Versus Logical Topology A Token Bus Network • The logical ring is formed based on the physical address of the stations in descending order. • Each station considers the station with the immediate lower address as the next station and the station with the immediate higher address as the previous station. • The station with the lowest address considers the station with the highest address the next station, and the station with the highest address considers the station with the lowest address the previous station. 5 6 Token Passing Token Passing • To control access to the shared medium, a • After sending all its frames or after the time small token frame circulates from station to period expires (whichever comes first), the station in the logical ring.
    [Show full text]
  • Token Bus Lan Performance: Modeling and Simulation
    Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or reproduction is not to be “used for any purpose other than private study, scholarship, or research.” If a, user makes a request for, or later uses, a photocopy or reproduction for purposes in excess of “fair use” that user may be liable for copyright infringement, This institution reserves the right to refuse to accept a copying order if, in its judgment, fulfillment of the order would involve violation of copyright law. Please Note: The author retains the copyright while the New Jersey Institute of Technology reserves the right to distribute this thesis or dissertation Printing note: If you do not wish to print this page, then select “Pages from: first page # to: last page #” on the print dialog screen The Van Houten library has removed some of the personal information and all signatures from the approval page and biographical sketches of theses and dissertations in order to protect the identity of NJIT graduates and faculty. TOKEN BUS LAN PERFORMANCE: MODELING AND SIMULATION y AMES KUOO esis sumie o e acuy o e Gauae scoo o e ew esey Isiue O ecoogy i aia uime o e equieme o e egee o Mase o Sciece i Eecica Egieeig auay 199 APPROVAL SHEET Title of Thesis: Token Bus LAN Performance: Modeling and Simulation.
    [Show full text]