Splitting Algorithms
|
|
- Dana Jackson
- 6 years ago
- Views:
Transcription
1 Splitting Algorithms We have seen that slotted Aloha has maximal throughput 1/e Now we will look at more sophisticated collision resolution techniques which have higher achievable throughput These techniques also maintain stability without a complex estimation procedure like in pseudo-bayesian slotted Aloha The way they obtain this is by choosing different retransmission probability for different nodes, at each time slot during collision resolution the nodes are subdivided into two sets Information Networks p.1/24
2 Splitting Algorithms A preliminary explanation as to how this is possible is to consider an algorithm that will make new arrivals wait until an ongoing collision has been resolved Assuming a small attempt rate it is most likely to have only two packets colliding All other nodes will refrain from transmitting until they have observed that those two backlogged packets have been successfully transmitted Each of the colliding packets could then be retransmitted with probability 1/2 leading to successful retransmission of one of them with probability 1/2 and the other could then be transmitted in next slot Information Networks p.2/24
3 Splitting Algorithms With probability 1/2 another collision or an idle slot occurs If so, the two packets would again be retransmitted with probability 1/2 until a successful transmission occurred which would be followed by the transmission of the remaining packet The probability of two slots for retransmitting the packets is 1/2 since this happens if there is no further collision Probability for three slots is 1/4, probability for i slots is 2 (i 1) Information Networks p.3/24
4 Splitting Algorithms The expected value for number of slots to send these two packets is thus i=2 i2 (i 1) = 1 (1 1/2) 2 1 = 3 Thus we get a throughput of 2/3 for the period during which the collision is resolved Various ways to choose whether to transmit or not in successive slots: Random choice ( flip an unbiased coin ) Using arrival time of its collided packet Node identifier (in case of finite number of nodes) Information Networks p.4/24
5 Splitting Algorithms All alternatives have the property that the set of colliding nodes is split into subsets, one of which is transmitting in the next slot If the collision is not resolved, then a further splitting into subsets is performed We assume slotted channel, Poisson arrivals, collision or perfect reception, (0, 1, e) immediate feedback, retransmission of collisions, and an infinite set of nodes When collision occurs in slot k, all nodes not involved in collision goes into waiting mode, the rest are split into two subsets Information Networks p.5/24
6 Tree Algorithms First subset transmits in slot k + 1 and if that slot is idle or successful, the second subset transmits in slot k + 2 Alternatively, if another collision occurs in slot k + 1 the first subset is split again and the second subset waits for the resolution of that collision We can describe the splitting procedure with a binary tree, we call the root set of nodes involved in the initial collision S, and the sets it is split up into L (left) and R (right), further splitting of L gives the subsets LL and LR, etc All nodes in the left set and all its descendants (further splitting) is transmitted before the subsets of the right right branch Information Networks p.6/24
7 Tree Algorithms From the feedback (0, 1, e) each node can construct the tree and keep track of its own subset in that tree and determine when to retransmit An alternative description is to consider a stack, when collision occurs the set of nodes involved is split into two subsets and these are pushed on the stack, then the subset at head of stack is removed and transmitted (with splitting and pushing on stack if collision occurs) A node with a backlogged packet can keep track of when to retransmit by a counter determining the position of its subset on the stack Information Networks p.7/24
8 Tree Algorithms When packet is involved in collision the counter is set to 0 or 1 depending on which subset it is placed in When counter is 0 packet is transmitted If counter is nonzero, it is incremented by 1 for each collision and decremented by 1 for each success or idle A collision resolution period (CRP) is defined to be completed when a success or idle occurs and there are no remaining elements on the stack When a CRP is completed a new CRP is started with the packets that arrived during previous CRP Information Networks p.8/24
9 Tree Algorithms If a lot of slots are required during a CRP it is likely that a lot of packets arrived during that time, these will collide and continue to collide until the subsets get small enough in the new CRP The solution is that at the end of a CRP the new arrivals will be split into j subsets, where j is chosen so that the expected number of nodes per subset is slightly greater than 1 These j subsets are placed on the stack and then a new CRP begins Each node will keep track of the number of elements on the stack and the number of slots since the end of previous CRP, the nodes involved in the CRP will also keep track of its position on the stack Information Networks p.9/24
10 Tree Algorithms On the completion of a CRP each node determines the expected number of new arrivals and from that a new number j of subsets, and those with new arrivals waiting will randomly choose one of those j subsets and set their counter to the corresponding stack position The maximal throughput available with this algorithm, optimized over the choice of j as a function of expected number of new arrivals, is 0.43 packets per slot If a collision is followed by an idle slot, this means that all packets involved in the collision were assigned to the second subset, then tree algorithm would retransmit this subset with a guaranteed collision Information Networks p.10/24
11 Tree Algorithms, improvement 1 An improvement would be to upon detecting an idle slot following a collision splitting this second set into two sets and just retransmit the first one Similarly if an idle occurs again, the second subset is again split before retransmission, and so forth The improvement can be stated in the stack case too, each node much keep an additional binary state that is 1 if, for some i 1, the last i slots contained a collision followed by i 1 idle slots, otherwise the state is 0 If feedback is 0 and state is 1, then state stays at 1 and the set on top of stack is split into two that are pushed on stack instead of the old head element Information Networks p.11/24
12 Tree Algorithms, improvement 1 The maximal throughput with this improvement is 0.46 packets per slot In practice there is a problem with this improved algorithm, if an idle slot is incorrectly perceived by the receiver as a collision then the algorithm continues splitting indefinitely Thus, in practice, after some number h of idle slots following a collision, the algorithm should be modified to not split any further but instead retransmit the current subset If the feedback is very reliable h can be fairly large, otherwise h should be small Information Networks p.12/24
13 Tree Algorithms, improvement 2 Consider a collision followed by another collision. Let x be the number of packets in first collision and x L and x R the number of packets in the L and R subsets from the split, thus x = x L + x R Assuming that x is Poisson and that the splitting into L and R is done randomly so that x L and x R are independent (and due to random splitting Poisson) Given the two collisions, we know x L + x R 2 and x L 2 and since the latter implies the former conditioning on both is the same as conditioning on the latter only Information Networks p.13/24
14 Tree Algorithms, improvement 2 Given the feedback of two collisions we thus get P (x R = k x L 2) = P (x R = k) since x L and x R are independent On the other hand P (x L = k x L 2) = P (x L = k)/p (x L 2) if k 2 (and 0 otherwise) Thus most packets are probably in first slot, and the small expected number of packets in R makes it reasonable to not devote a slot to R but instead count the packets in this set as waiting new arrivals With this improvement and splitting done on arrival time we get the first-come first-serve (FCFS) splitting algorithm Information Networks p.14/24
15 Variants of the tree algorithm Tree algorithm requires all nodes to monitor channel feedback and keep track of when each CRP ends If new arrivals instead just join the subset of nodes at head of stack, and only backlogged nodes monitor the feedback, we get an algorithm called unblocked stack algorithm In contrast the tree algorithm is often called blocked stack algorithm, since new arrivals are blocked until the end of current CRP Since new arrivals are added to head of stack, collisions involve a somewhat larger number of packets on the average Information Networks p.15/24
16 Variants of the tree algorithm Because of likelihood of three or more packets in collision higher maximum throughput can be obtained by splitting into three subsets rather than two Maximal throughput for unblocked stack algorithm is 0.40 Information Networks p.16/24
17 FCFS Splitting Algorithm Splitting will be done based on packet arrival times Each subset will consist of all packets that arrived in some time interval, when a collision occurs that interval will be split into two smaller intervals By always transmitting the earlier arriving interval first, the algorithm will always transmit successful packets in the order of their arrival At each slot k the packets to be transmitted are those that arrived in some earlier interval, from T (k) to T (k) + α(k), this interval is called the allocation interval for slot k Information Networks p.17/24
18 FCFS Splitting Algorithm We can think of the packets arriving after T (k) + α(k) as being in a queue and those arriving between T (k) and T (k) + α(k) as being in service All nodes keep track of the allocation interval over which service (i.e. transmission) is taking place The algorithm is specified by the set of rules by which nodes calculate T (k) and α(k) for each successive k on basis of the feedback from previous slot These rules are the tree algorithm with the two improvements mentioned, specialized to the case of splitting according to arrival time Information Networks p.18/24
19 FCFS Splitting Algorithm When a collision occurs, the allocation interval is split into two equal subintervals and the leftmost subinterval L is the allocation interval in slot k + 1 When idle follows collision the previous rightmost interval R is known to contain two or more packets and is immediately split with RL forming the allocation interval in slot k + 1 When collision follows collision we would like to regard R as if it had never been part of an allocation interval, by splitting L into LL forming allocation interval and LR waiting, the algorithm simply forgets about R At end of CRP, instead of splitting into some number of subsets we choose a new allocation interval of some given size α 0 Information Networks p.19/24
20 FCFS Splitting Algorithm The second improvement, having a right interval lose its identity whenever the corresponding left interval is split, corresponds to pruning the tree so it never has more that two leaves, or in stack language the stack never remembers more that the top two elements Whenever the allocation corresponds to the left subset of a split, there is a corresponding right subset that might have to be transmitted later Conversely, when allocation corresponds to a right subset there are no more waiting intervals Thus the nodes need only remember the allocation interval and whether it is a right or left interval, by convention the initial interval of a CRP is considered a right interval Information Networks p.20/24
21 FCFS Splitting Algorithm If feedback = e then T (k) = T (k 1), α(k) = 1 2α(k 1), σ(k) = L If feedback = 1 and σ(k 1) = L then T (k) = T (k 1) + α(k 1), α(k) = α(k 1), σ(k) = R If feedback = 0 and σ(k 1) = L then T (k) = T (k 1) + α(k 1), α(k) = 1 2α(k 1), σ(k) = L If feedback = 0 or 1 and σ(k 1) = R then T (k) = T (k 1) + α(k 1), α(k) = min(α 0, k T (k)), σ(k) = R The size of new allocation interval in this last case is some constant value α 0 that can be chosen to either minimize delay for a given arrival rate or to maximize the stable throughput Information Networks p.21/24
22 FCFS Splitting Algorithm Maximum throughput at λα 0 = λα 0 is the expected number of packets in original allocation interval; as expected it is somewhat larger than 1 If α 0 is chosen to be 2.6 = 1.266/ then FCFS is stable for λ < Expected delay is very hard to analyze, but upper and lower bound have been developed Splitting into equal size subintervals is slightly nonoptimal, the optimal splitting gives maximum throughput An upper bound to maximum stable throughput using our assumptions is Information Networks p.22/24
23 FCFS Splitting Algorithm For any finite set of m nodes we can achieve any throughput up to 1 packet per slot with TDM, but with TDM the expected delay (for a given λ) increases linearly with m whereas FCFS achieve a delay bounded independently of m Much higher throughputs than are achievable if the slotted assumption is abandoned and early feedback is available when the channel is idle or experiencing a collision The FCFS has the same problem as first improvement of tree algorithm if feedback from an idle slot is mistaken as a collision. As before we can solve this by specifying a maximum number of splits when seeing idle on left interval. Information Networks p.23/24
24 FCFS Splitting Algorithm We also assumed that nodes can measure arrival time of packets with infinite precision. In practice, if arrival times are measured with a finite number of bits, each node will generate extra bits as needed for splitting by a pseudo-random number generator. Also delayed feedback can be handled by a slightly modified FCFS algorithm, if the feedback for slot k arrives between beginning of slot k + j 1 and slot k + j for some fixed j > 1, then we can run one instance of FCFS for each of the j slots in a time division multiplexing manner, the only exception being that the waiting set is common for all j of the FCFS algorithm. Also for this algorithm maximum stable throughput is Information Networks p.24/24
TSIN01 Information Networks Lecture 8
TSIN01 Information Networks Lecture 8 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 24 th, 2018 Danyo Danev TSIN01 Information
More informationMultiple Access Communications. EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department
Multiple Access Communications EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department 1 Multiple Access Satellite systems, radio networks (WLAN), ethernet segment
More informationPacket multiple access and the Aloha protocol
Packet multiple access and the Aloha protocol Massachusetts Institute of Technology Department of Aeronautics and Astronautics Slide 1 Packet Multiple Access PMA SHARED UPLINK TERMINAL TERMINAL APPL TRANS
More informationTSIN01 Information Networks Lecture 3
TSIN01 Information Networks Lecture 3 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 10 th, 2018 Danyo Danev TSIN01 Information
More informationMarkov Chains and Multiaccess Protocols: An. Introduction
Markov Chains and Multiaccess Protocols: An Introduction Laila Daniel and Krishnan Narayanan April 8, 2012 Outline of the talk Introduction to Markov Chain applications in Communication and Computer Science
More informationCom S 611 Spring Semester 2007 Discrete Algorithms for Mobile and Wireless Networks. Lecture 3: Tuesday, 23rd January 2007
Com S 611 Spring Semester 2007 Discrete Algorithms for Mobile and Wireless Networks Lecture 3: Tuesday, 23rd January 2007 Instructor: Soma Chaudhuri Scribe: Abhishek Sinha 1 Introduction The lecture can
More informationProtocols for Multiaccess Networks
Protocols for Multiaccess Networks Hosts broadcast packets When a collision occurs, all transmitted packets are lost Lost packets have to be retransmitted => Need Multiaccess Protocol Model - Slotted Aloha
More informationECEN 5032 Data Networks Medium Access Control Sublayer
ECEN 5032 Data Networks Medium Access Control Sublayer Peter Mathys mathys@colorado.edu University of Colorado, Boulder c 1996 2005, P. Mathys p.1/35 Overview (Sub)networks can be divided into two categories:
More informationWhere Are We? Basics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design
Where Are We? Basics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design Layered Architecture Layered Architecture Data Link Layer Functionality
More informationPower Laws in ALOHA Systems
Power Laws in ALOHA Systems E6083: lecture 7 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA predrag@ee.columbia.edu February 28, 2007 Jelenković (Columbia
More informationMultiple Access (1) Required reading: Garcia 6.1, 6.2.1, CSE 3213, Fall 2010 Instructor: N. Vlajic
1 Multiple Access (1) Required reading: Garcia 6.1, 6.2.1, 6.2.2 CSE 3213, Fall 2010 Instructor: N. Vlajic Multiple Access Communications 2 Broadcast Networks aka multiple access networks multiple sending
More informationSlotted Aloha UHFHLYHU. Recall assumptions:
Recall assumptions: infinite # of transmitters packets of equal length immediate feedback Poisson arrivals rate Slotted Aloha UHFHLYHU WUDQVPLWWHUV VRW WLPH If a new packet arrives during a slot, transmit
More informationWritten Exam in Information Networks TSIN01
Written Exam in Information Networks TSIN01 10th August 2006 08:00-12:00 Location: TER2 Examiner: Robert Forchheimer Teacher: Peter Johansson, 4017 or 0702-141405 Aids: Standard mathematical/technical
More informationMedium Access Control
Medium Access Control Fundamental Problem N nodes in vicinity want to transmit (to, say, N other nodes). How to do this interference free? Interference free means SINR Otherwise, we say that packets collide.
More informationLANs. Local Area Networks. via the Media Access Control (MAC) SubLayer. Networks: Local Area Networks
LANs Local Area Networks via the Media Access Control (MAC) SubLayer 1 Local Area Networks Aloha Slotted Aloha CSMA (non-persistent, 1-persistent, p-persistent) CSMA/CD Ethernet Token Ring 2 Network Layer
More informationOn Achieving Fairness and Efficiency in High-Speed Shared Medium Access
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 1, FEBRUARY 2003 111 On Achieving Fairness and Efficiency in High-Speed Shared Medium Access R. Srinivasan, Member, IEEE, and Arun K. Somani, Fellow, IEEE
More informationComputer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis
Computer Network Fundamentals Spring 2008 Week 3 MAC Layer Andreas Terzis Outline MAC Protocols MAC Protocol Examples Channel Partitioning TDMA/FDMA Token Ring Random Access Protocols Aloha and Slotted
More informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationSimulated SA Throughput vs. p
Problem 1. Simulation of Slotted Aloha network (A) There are n stations in the network that are trying to transmit messages to an access point. (B) All the stations are synchronized and they are using
More informationUnavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols
1th WEA International Conference on COMMUICATIO, Heraklion, reece, July 3-5, 8 Unavoidable Constraints and Collision Avoidance Techniques in Performance Evaluation of Asynchronous Transmission WDMA Protocols
More informationLink Layer: Retransmissions
Link Layer: Retransmissions Context on Reliability Where in the stack should we place reliability functions? Application Transport Network Link Physical CSE 461 University of Washington 2 Context on Reliability
More informationRandom Access. 1. Aloha. 2. Slotted Aloha 3. CSMA 4. CSMA/CD
Random Access 1. Aloha 2. Slotted Aloha 3. CSMA 4. CSMA/CD Background Communication medium B No Collision collision A C Modern Local Area Networks (LANs) operate as follows Users are connected to communication
More informationChapter 6 Medium Access Control Protocols and Local Area Networks
Chapter 6 Medium Access Control Protocols and Local Area Networks Part I: Medium Access Control Part II: Local Area Networks CSE 3213, Winter 2010 Instructor: Foroohar Foroozan Chapter Overview Broadcast
More informationMultiple Access Protocols
Multiple Access Protocols Computer Networks Lecture 2 http://goo.gl/pze5o8 Multiple Access to a Shared Channel The medium (or its sub-channel) may be shared by multiple stations (dynamic allocation) just
More information2. Modelling of telecommunication systems (part 1)
2. Modelling of telecommunication systems (part ) lect02.ppt S-38.45 - Introduction to Teletraffic Theory - Fall 999 2. Modelling of telecommunication systems (part ) Contents Telecommunication networks
More informationCOS 140: Foundations of Computer Science
COS 140: Foundations of Computer Science ALOHA Network Protocol Family Fall 2017 Homework 2 Introduction 3 Network Protocols.......................................................... 3 Problem.................................................................
More informationOutline. Application examples
Outline Application examples Google page rank algorithm Aloha protocol Virtual circuit with window flow control Store-and-Forward packet-switched network Interactive system with infinite servers 1 Example1:
More informationWireless Medium Access Control Protocols
Wireless Medium Access Control Protocols Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 Classification of wireless MAC protocols Wireless
More informationAnalyzing Multi-Channel Medium Access Control Schemes With ALOHA Reservation
Analyzing Multi-Channel Medium Access Control Schemes With ALOHA Reservation Yunghsiang S. Han, Jing Deng and Zygmunt J. Haas Graduate Institute of Communication Engineering National Taipei University,
More informationWireless Communications
4. Medium Access Control Sublayer DIN/CTC/UEM 2018 Why do we need MAC for? Medium Access Control (MAC) Shared medium instead of point-to-point link MAC sublayer controls access to shared medium Examples:
More informationETSN01 Exam Solutions
ETSN01 Exam Solutions March 014 Question 1 (a) See p17 of the cellular systems slides for a diagram and the full procedure. The main points here were that the HLR needs to be queried to determine the location
More information4.1 COMPUTATIONAL THINKING AND PROBLEM-SOLVING
4.1 COMPUTATIONAL THINKING AND PROBLEM-SOLVING 4.1.2 ALGORITHMS ALGORITHM An Algorithm is a procedure or formula for solving a problem. It is a step-by-step set of operations to be performed. It is almost
More informationCollege of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435
College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435 Student Name ID Time Allowed: 2.0 Hours. Closed Book, Closed
More informationTeletraffic theory (for beginners)
Teletraffic theory (for beginners) samuli.aalto@hut.fi teletraf.ppt S-38.8 - The Principles of Telecommunications Technology - Fall 000 Contents Purpose of Teletraffic Theory Network level: switching principles
More informationAccess Technologies! Fabio Martignon
Access Technologies! Fabio Martignon 1 LAN Ethernet - IEEE 802.3 Broadcast Bus Capacity=10 Mb/s Xerox-Intel-Digital inventors Standardized at the beginning of the 80s as IEEE 802.3 Big Success and Several
More informationRandom Assignment Protocols
Random Assignment Protocols Random assignment strategies attempt to reduce problem occur in fixed assignment strategy by eliminating pre allocation of bandwidth to communicating nodes. Random assignment
More informationProgramming Project. Remember the Titans
Programming Project Remember the Titans Due: Data and reports due 12/10 & 12/11 (code due 12/7) In the paper Measured Capacity of an Ethernet: Myths and Reality, David Boggs, Jeff Mogul and Chris Kent
More informationMedia Access Control in Ad Hoc Networks
Media Access Control in Ad Hoc Networks The Wireless Medium is a scarce precious resource. Furthermore, the access medium is broadcast in nature. It is necessary to share this resource efficiently and
More informationCover sheet for Assignment 3
Faculty of Arts and Science University of Toronto CSC 358 - Introduction to Computer Networks, Winter 2018, LEC0101 Cover sheet for Assignment 3 Due Monday March 5, 10:00am. Complete this page and attach
More informationTransmission Control Protocol (TCP)
TETCOS Transmission Control Protocol (TCP) Comparison of TCP Congestion Control Algorithms using NetSim @2017 Tetcos. This document is protected by copyright, all rights reserved Table of Contents 1. Abstract....
More informationRedes de Computadores. Medium Access Control
Redes de Computadores Medium Access Control Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto 1 » How to control the access of computers to a communication medium?» What is the ideal Medium
More informationEnergy-Efficient Collision Resolution in Wireless Ad-Hoc Networks
Energy-Efficient Collision Resolution in Wireless Ad-Hoc Networks Yalin Evren Sagduyu, Anthony Ephremides Electrical and Computer Engineering Dept. and Institute for Systems Research University of Maryland
More informationCongestion Control. Queuing Discipline Reacting to Congestion Avoiding Congestion. Issues
Congestion Control Outline Queuing Discipline Reacting to Congestion Avoiding Congestion Issues Two sides of the same coin pre-allocate resources to avoid congestion (e.g. telephone networks) control congestion
More informationMultimedia Communication Services Traffic Modeling and Streaming
Multimedia Communication Services Traffic Modeling and Streaming Medium Access Control algorithms Introduction and details on Aloha networks with infinite nodes Università degli Studi di Brescia A.A. 2014/2015
More informationMedium Access Control Protocols With Memory Jaeok Park, Member, IEEE, and Mihaela van der Schaar, Fellow, IEEE
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 6, DECEMBER 2010 1921 Medium Access Control Protocols With Memory Jaeok Park, Member, IEEE, and Mihaela van der Schaar, Fellow, IEEE Abstract Many existing
More informationLink Layer. (continued)
Link Layer (continued) Where we are in the Course Moving on up to the Link Layer! Application Transport Network Link Physical CSE 461 University of Washington 2 Topics 1. Framing Delimiting start/end of
More informationPerformance Analysis of WLANs Under Sporadic Traffic
Performance Analysis of 802.11 WLANs Under Sporadic Traffic M. Garetto and C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di Torino, Italy Abstract. We analyze the performance of 802.11 WLANs
More informationCS 716: Introduction to communication networks. - 9 th class; 19 th Aug Instructor: Sridhar Iyer IIT Bombay
CS 716: Introduction to communication networks - 9 th class; 19 th Aug 2011 Instructor: Sridhar Iyer IIT Bombay Contention-based MAC: ALOHA Users transmit whenever they have data to send Collisions occur,
More informationISSN: (Online) Volume 2, Issue 6, June 2014 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 2, Issue 6, June 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
More informationLecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 12 December 04, 2017 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2017-2018 Random Medium Access Control Part II - CSMA and Collision
More informationLayered Network Architecture. CSC358 - Introduction to Computer Networks
Layered Network Architecture Layered Network Architecture Question: How can we provide a reliable service on the top of a unreliable service? ARQ: Automatic Repeat Request Can be used in every layer TCP
More informationECE453 Introduction to Computer Networks. Broadcast vs. PPP. Delay. Lecture 7 Multiple Access Control (I)
ECE453 Introduction to Computer Networks Lecture 7 Multiple Access Control (I) 1 Broadcast vs. PPP Broadcast channel = multiaccess channel = random access channel Broadcast LAN Satellite network PPP WAN
More informationCHAPTER 3 ANTI-COLLISION PROTOCOLS IN RFID BASED HUMAN TRACKING SYSTEMS (A BRIEF OVERVIEW)
33 CHAPTER 3 ANTI-COLLISION PROTOCOLS IN RFID BASED HUMAN TRACKING SYSTEMS (A BRIEF OVERVIEW) In a RFID based communication system the reader activates a set of tags, and the tags respond back. As outlined
More informationCOS 140: Foundations of Computer Science
COS 140: Foundations of C S Network Protocol Family Fall 2017 Copyright c 2002 2017 UMaine School of Computing and Information S 1 / 25 Homework Homework Slides, book Chapter 24 on line Homework: All exercises
More informationPessimistic Backoff for Mobile Ad hoc Networks
Pessimistic Backoff for Mobile Ad hoc Networks Saher S. Manaseer Department of computing science Glasgow University saher@dcs.gla.ac.uk Muneer Masadeh Department of Computer Science Jordan University of
More informationLANs Local Area Networks LANs provide an efficient network solution : To support a large number of stations Over moderately high speed
Local Area Networks LANs provide an efficient network solution : To support a large number of stations Over moderately high speed With relatively small bit errors Multiaccess Protocols Communication among
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 32 Multiple Server Queueing Models In this lecture, we continue our discussion
More informationThe Link Layer and LANs. Chapter 6: Link layer and LANs
The Link Layer and LANs EECS3214 2018-03-14 4-1 Chapter 6: Link layer and LANs our goals: understand principles behind link layer services: error detection, correction sharing a broadcast channel: multiple
More informationImproved Collision Resolution Algorithms for Multiple Access Channels with Limited Number of Users * Chiung-Shien Wu y and Po-Ning Chen z y Computer a
Improved Collision Resolution Algorithms for Multiple Access Channels with Limited Number of Users * Chiung-Shien Wu y and Po-Ning Chen z y Computer and Communication Research Labs. ITRI, Hsinchu, Taiwan
More informationDistributed Dynamic Priority Queuing Medium Access Control Protocol
Distributed Dynamic Priority Queuing Medium Access Control Protocol by Himal P. Karmacharya B. S., Electrical Engineering and Computer Science MIT Submitted to the Department of Electrical Engineering
More informationAloha and slotted aloha
CSMA 2/13/06 Aloha and slotted aloha Slotted aloha: transmissions are synchronized and only start at the beginning of a time slot. Aloha sender A sender B collision sender C t Slotted Aloha collision sender
More informationName: Student ID: Due Wednesday 4/29 at the beginning of class (Please TYPE your answers this will allow our TAs to be much more efficient)
CSE123 Spring 2015 Homework #2 Instructor: Stefan Savage Due Wednesday 4/29 at the beginning of class (Please TYPE your answers this will allow our TAs to be much more efficient) 1. IP Checksum Below is
More informationDepartment of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Spring Quiz III
6.02 Spring 2009, Quiz 3 Page 1 of 10 Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.02 Spring 2009 Quiz III There are 24 questions and 10 pages in this
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.4: Multiple Access Protocols Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527
More informationComputer Networks Project 4. By Eric Wasserman and Ji Hoon Baik
Computer Networks Project 4 By Eric Wasserman and Ji Hoon Baik Modifications to the Code, and the Flowcharts UDP transmission is different from TCP transmission in that: 1. UDP transmission is unidirectional;
More informationDistributed Floor Control Protocols for Computer Collaborative Applications on Overlay Networks
Distributed Floor Control Protocols for Computer Collaborative Applications on Overlay Networks Shankar M Banik, Sridhar Radhakrishnan, Tao Zheng School of Computer Science University of Oklahoma Chandra
More informationChapter 3 MEDIA ACCESS CONTROL
Chapter 3 MEDIA ACCESS CONTROL Distributed Computing Group Mobile Computing Winter 2005 / 2006 Overview Motivation SDMA, FDMA, TDMA Aloha Adaptive Aloha Backoff protocols Reservation schemes Polling Distributed
More informationOptimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks
Optimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks ITA 11, San Diego CA, February 2011 MHR. Khouzani, Saswati Sarkar, Koushik Kar UPenn, UPenn, RPI March 23, 2011 Khouzani, Sarkar,
More informationDEPARTMENT OF EECS MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Quiz III. December 18, 2012
6.02 Fall 2012, Quiz 3 Page1of13 Name: DEPARTMENT OF EECS MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.02 Fall 2012 Quiz III December 18, 2012 your section Section Time Recitation Instructor TA D 1 10-11 Victor
More informationOutline. Introduction to Networked Embedded Systems - Embedded systems Networked embedded systems Embedded Internet - Network properties
Outline Introduction to Networked Embedded Systems - Embedded systems Networked embedded systems Embedded Internet - Network properties Layered Network Architectures - OSI framework descriptions of layers
More informationSENSOR-MAC CASE STUDY
SENSOR-MAC CASE STUDY Periodic Listen and Sleep Operations One of the S-MAC design objectives is to reduce energy consumption by avoiding idle listening. This is achieved by establishing low-duty-cycle
More informationRandomization. Randomization used in many protocols We ll study examples:
Randomization Randomization used in many protocols We ll study examples: Ethernet multiple access protocol Router (de)synchronization Switch scheduling 1 Ethernet Single shared broadcast channel 2+ simultaneous
More informationRandomization used in many protocols We ll study examples: Ethernet multiple access protocol Router (de)synchronization Switch scheduling
Randomization Randomization used in many protocols We ll study examples: Ethernet multiple access protocol Router (de)synchronization Switch scheduling 1 Ethernet Single shared broadcast channel 2+ simultaneous
More informationIntroduction. hashing performs basic operations, such as insertion, better than other ADTs we ve seen so far
Chapter 5 Hashing 2 Introduction hashing performs basic operations, such as insertion, deletion, and finds in average time better than other ADTs we ve seen so far 3 Hashing a hash table is merely an hashing
More informationAnalysis of the Stability and Performance of Exponential Backoff
Analysis of the Stability and Performance of Exponential Backoff Byung-Jae Kwak bjkwak@antd.nist.gov Nah-Oak Song nsong@antd.nist.gov Leonard E. Miller lmiller@antd.nist.gov Abstract New analytical results
More informationEP2210 Scheduling. Lecture material:
EP2210 Scheduling Lecture material: Bertsekas, Gallager, 6.1.2. MIT OpenCourseWare, 6.829 A. Parekh, R. Gallager, A generalized Processor Sharing Approach to Flow Control - The Single Node Case, IEEE Infocom
More informationEP2210 FEP3210 Performance analysis of Communication networks. Topic 2 Medium access control (or multiple access protocols)
EP2210 FEP3210 Performance analysis of Communication networks Topic 2 Medium access control (or multiple access protocols) 1 Medium access control Lecture material: R. Rom, M. idi, Multiple access protocols,
More informationA Priority Scheme for the IEEE MAC Protocol for Hybrid Fiber-Coax Networks
200 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 2, APRIL 2000 A Priority Scheme for the IEEE 802.14 MAC Protocol for Hybrid Fiber-Coax Networks Mark D. Corner, Student Member, IEEE, Jörg Liebeherr,
More informationReal-Time (Paradigms) (47)
Real-Time (Paradigms) (47) Memory: Memory Access Protocols Tasks competing for exclusive memory access (critical sections, semaphores) become interdependent, a common phenomenon especially in distributed
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.5: Ethernet Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527 Computer Networks
More informationProblem Set Name the 7 OSI layers and give the corresponding functionalities for each layer.
Problem Set 1 1. Why do we use layering in computer networks? 2. Name the 7 OSI layers and give the corresponding functionalities for each layer. 3. Compare the network performance of the 3 Multiple Access
More informationMidterm Review EECS 122. University of California Berkeley
Midterm Review EECS 122 University of California Berkeley Topics Network Architecture Network hierarchy Layering Performance Link Layer Ethernet Wi-Fi 2 Review: Network WAN MAN 3 Review: Network WAN MAN
More informationAGOOD medium access control (MAC) protocol for wireless
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 3, MAY 2004 793 Design of MAC Protocols With Fast Collision Resolution for Wireless Local Area Networks Younggoo Kwon, Yuguang Fang, Senior Member,
More informationMultiple Access. Data Communications and Networking
Multiple Access In the previous part we discussed data link control, a mechanism which provides a link with reliable communication. In the protocols we described, we assumed that there is an available
More informationCongestion Control in Communication Networks
Congestion Control in Communication Networks Introduction Congestion occurs when number of packets transmitted approaches network capacity Objective of congestion control: keep number of packets below
More informationChapter 5 Hashing. Introduction. Hashing. Hashing Functions. hashing performs basic operations, such as insertion,
Introduction Chapter 5 Hashing hashing performs basic operations, such as insertion, deletion, and finds in average time 2 Hashing a hash table is merely an of some fixed size hashing converts into locations
More informationImproved High Maximum Stable Throughput FCFS Tree Algorithms with Interference Cancellation
Improved High Maximum Stable Throughput FCFS Tree Algorithms with Interference Cancellation T Peeters ginopeeters@uaacbe University of Antwerp - IBBT Middelheimlaan B-2020 Antwerp, Belgium B Van Houdt
More informationEthernet. Introduction. CSE 3213 Fall 2011
Ethernet CSE 3213 Fall 2011 19 October 2011 1 Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed LAN technologies: Fast and gigabit Ethernet
More informationCollisions & Virtual collisions in IEEE networks
Collisions & Virtual collisions in IEEE 82.11 networks Libin Jiang EE228a project report, Spring 26 Abstract Packet collisions lead to performance degradation in IEEE 82.11 [1] networks. The carrier-sensing
More information16.682: Communication Systems Engineering. Lecture 17. ARQ Protocols
16.682: Communication Systems Engineering Lecture 17 ARQ Protocols Eytan Modiano Automatic repeat request (ARQ) Break large files into packets FILE PKT H PKT H PKT H Check received packets for errors Use
More informationMAC Sublayer(1) Principal service of the Medium Access Control Sublayer: Allocating a single broadcast channel (mostly a LAN) among competing users
MAC Sublayer(1) Principal service of the Medium Access Control Sublayer: Allocating a single broadcast channel (mostly a LAN) among competing users Static Channel Allocation: Frequency Division Multiplexing
More informationLocal Area Networks (LANs) SMU CSE 5344 /
Local Area Networks (LANs) SMU CSE 5344 / 7344 1 LAN/MAN Technology Factors Topology Transmission Medium Medium Access Control Techniques SMU CSE 5344 / 7344 2 Topologies Topology: the shape of a communication
More informationAssignment 7: TCP and Congestion Control Due the week of October 29/30, 2015
Assignment 7: TCP and Congestion Control Due the week of October 29/30, 2015 I d like to complete our exploration of TCP by taking a close look at the topic of congestion control in TCP. To prepare for
More informationSome Optimization Trade-offs in Wireless Network Coding
Some Optimization Trade-offs in Wireless Network Coding Yalin Evren Sagduyu and Anthony Ephremides Electrical and Computer Engineering Department and Institute for Systems Research University of Maryland,
More informationMultiple Access Links and Protocols
Multiple Access Links and Protocols Two types of links : point-to-point PPP for dial-up access point-to-point link between Ethernet switch and host broadcast (shared wire or medium) old-fashioned Ethernet
More informationLecture 10 Collision resolution. Collision resolution
Lecture 10 Collisio resolutio Collisio resolutio May applicatios ivolve a iquiry over a shared chael, which ca be ivoked for: discovery of eighborig devices i ad hoc etworks, coutig the umber of RFID tags
More information1-1. Switching Networks (Fall 2010) EE 586 Communication and. November 8, Lecture 30
EE 586 Communication and Switching Networks (Fall 2010) Lecture 30 November 8, 2010 1-1 Announcements Quiz on Wednesday Next Monday hands-on training on Contiki OS Bring your laptop 4-2 Multiple Access
More informationCSC 4900 Computer Networks: The Link Layer
CSC 4900 Computer Networks: The Link Layer Professor Henry Carter Fall 2017 Last Time We talked about intra-as routing protocols: Which routing algorithm is used in RIP? OSPF? What techniques allow OSPF
More informationComputer Networks. Wenzhong Li. Nanjing University
Computer Networks Wenzhong Li Nanjing University 1 Chapter 2. Direct Link Networks Link Service and Framing Error Detection and Reliable Transmission HDLC, PPP, and SONET Token Ring Ethernet Bridges and
More informationCOMMUNICATION NETWORKS NETW 501
COMMUNICATION NETWORKS NETW 501 TUTORIAL 6 Presented by: Eng. Hana Hesham Eng. Mohamed Atef Data Link Layer Data Link Layer is split into 2 sublayers which are the Logical Link Control (LLC) and the Medium
More information