TSIN01 Information Networks Lecture 8
|
|
- Paul Tate
- 5 years ago
- Views:
Transcription
1 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 Networks Lecture 8 1 / 29
2 Lecture overview Agenda Tree algorithm Tree algorithm improvements First-Come First-Serve (FCFS) algorithm Danyo Danev TSIN01 Information Networks Lecture 8 2 / 29
3 Tree algorithm 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 go into waiting mode, the rest are split into two subsets (e.g. by coin flip) All nodes of the first subset transmit in slot k + 1. If that slot is idle or successful, the nodes of the second subset transmit in slot k + 2. Alternatively, if a collision occurs in slot k + 1 the first subset is split again and the nodes of the second subset wait for the resolution of that collision Danyo Danev TSIN01 Information Networks Lecture 8 3 / 29
4 Tree algorithm We can describe the splitting procedure with a binary tree The root is the set of nodes involved in the initial collision S is split up into L (left- transmit ) and R (right- wait ) If collision occurs, L is further split in subsets LL and LR Subsets with at least 2 packets correspond to tree vertices with upward branches Subsets with 0 or 1 packet correspond to leaf vertices All packets in the left subset and all its descendants (due to further splitting) are transmitted before the packets in the right subset Danyo Danev TSIN01 Information Networks Lecture 8 4 / 29
5 Example of tree algorithm Danyo Danev TSIN01 Information Networks Lecture 8 5 / 29
6 Tree algorithm: stack description From the (0, 1, e) feedback each node can construct the tree, keep track of its own subset in that tree, and determine when to transmit its backlogged packet An alternative description is to consider a stack When a collision occurs the set of nodes involved is split into two subsets and these are pushed on the stack The subset at head of stack is then removed and retransmitted (with splitting and pushing on stack if collision occurs) Danyo Danev TSIN01 Information Networks Lecture 8 6 / 29
7 Tree algorithm: stack description A backlogged node keeps track of when to retransmit by a counter determining the position of its subset in the stack When a packet is involved in collision, the counter is set to 0 or 1 depending on which subset it is placed in When the counter is 0, the packet is retransmitted If the 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 the previous CRP Danyo Danev TSIN01 Information Networks Lecture 8 7 / 29
8 Tree algorithm: smart initialization If many slots are required for a CRP it is likely that many packets have arrived during that time In the new CRP, there will be many collision untill the subsets become small A solution is to immediately split the new arrivals into j subsets, at the end of a CRP 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 Danyo Danev TSIN01 Information Networks Lecture 8 8 / 29
9 Tree algorithm: smart initialization Each node keeps track of the number of elements in the stack and number of slots since the end of the previous CRP The nodes involved in the CRP also keep track of their position in the stack On completion of a CRP, each node determines a new number j of subsets from the expected number of new arrivals The nodes with new arrivals waiting 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, is 0.43 packets per slot Danyo Danev TSIN01 Information Networks Lecture 8 9 / 29
10 Tree algorithm: improvement 1 If a collision is followed by an idle slot, all packets involved in the collision were assigned to the second subset and collision was guaranteed An improvement would be upon detecting an idle slot following a collision, to directly split this second set into two sets and 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 must keep track of an additional binary state that is 1, if for some i 1, the last i slots contained one collision followed by i 1 idle slots, otherwise the state is 0 If feedback is 0 and the state is 1, then state remains 1 and the set on the top of stack is split into two that are pushed on stack instead of the old head element Danyo Danev TSIN01 Information Networks Lecture 8 10 / 29
11 Tree algorithm: 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, 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 Danyo Danev TSIN01 Information Networks Lecture 8 11 / 29
12 Tree algorithm: 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 Poisson due to random splitting) 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 Danyo Danev TSIN01 Information Networks Lecture 8 12 / 29
13 Tree algorithm: 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) > P (x L = k) = P (x R = k) = P (x R = k x L 2) if k 2 (and 0 otherwise) Thus most packets are probably in L and the small expected number of packets in R makes it reasonable to avoid devoting a slot to R but instead count these packets as waiting new arrivals With this improvement and splitting done on arrival time, we get the first-come first-serve (FCFS) splitting algorithm Danyo Danev TSIN01 Information Networks Lecture 8 13 / 29
14 Example of tree algorithm improvements Danyo Danev TSIN01 Information Networks Lecture 8 14 / 29
15 Unblocked stack algorithm The 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 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 the head of the stack, collisions involve a somewhat larger number of packets on the average Because of the 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 Danyo Danev TSIN01 Information Networks Lecture 8 15 / 29
16 FCFS splitting algorithm In FCFS, splitting is done based on packet arrival times Each subset consists of all packets that arrived in a given time interval When a collision occurs that interval is split into two smaller intervals The earlier interval is transmitted first, so packets successfully depart in the order of their arrival At each slot k, the packets to be transmitted are those that arrived in some earlier allocation interval from T (k) to T (k) + α(k) Danyo Danev TSIN01 Information Networks Lecture 8 16 / 29
17 FCFS splitting algorithm We can think of the packets arriving after T (k) + α(k) as being in a queue of unknown size All nodes keep track of the allocation interval over which service (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 Danyo Danev TSIN01 Information Networks Lecture 8 17 / 29
18 FCFS splitting algorithm: 1st improved rule When a collision occurs, the allocation interval is split into two equal subintervals The leftmost (longest-waiting) 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 Due to the 1st improvement, it is immediately split RL forms the allocation interval in slot k + 2 Danyo Danev TSIN01 Information Networks Lecture 8 18 / 29
19 FCFS splitting algorithm: 1st improved rule Danyo Danev TSIN01 Information Networks Lecture 8 19 / 29
20 FCFS splitting algorithm: 2nd improved rule When collision follows collision we would like to regard R as if it had never been part of an allocation interval L contains at least two packets and is split into LL and LR LL forms the allocation interval and LR waits Due to the 2nd improvement, the algorithm simply forgets about R (moves it to the next CRP) At end of CRP, instead of splitting into some number of subsets (as in the tree algorithm), we choose a new allocation interval of some given size α 0 Danyo Danev TSIN01 Information Networks Lecture 8 20 / 29
21 FCFS splitting algorithm: 2nd improved rule Danyo Danev TSIN01 Information Networks Lecture 8 21 / 29
22 FCFS splitting algorithm: 2nd improved rule The 2nd improvement corresponds to pruning the tree so it never has more than two leaves, or in stack language the stack never remembers more than 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 The nodes only need to 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 Danyo Danev TSIN01 Information Networks Lecture 8 22 / 29
23 FCFS splitting algorithm: summary 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 initial size of allocation interval is some constant value α 0 that can be chosen to either minimize delay for a given arrival rate or to maximize the stable throughput Danyo Danev TSIN01 Information Networks Lecture 8 23 / 29
24 FCFS splitting algorithm: Markov chain A CRP evolution can be visualized by a Markov chain Danyo Danev TSIN01 Information Networks Lecture 8 24 / 29
25 FCFS splitting algorithm: Markov chain The node at the left side of the chain corresponds to the initial and final slot of the CRP; it is split in two to visualize the beginning and end of a CRP An idle or a collision from a left allocation interval generates one additional split with a smaller left allocation interval and corresponds to a transition from (L, i) to (L, i + 1), where i is the number of splits A success from a left interval leads to a right interval with no additional split and corresponds to a (L, i) to (R, i) transition A success from a right interval ends the CRP and corresponds a transition back to (R, 0) A collision from a right interval causes a new split and corresponds to a transition from (R, i) to (L, i + 1) Danyo Danev TSIN01 Information Networks Lecture 8 25 / 29
26 FCFS splitting algorithm: performance A CRP can be analyzed using the Markov chain to calculate transition and state probabilities, and eventually when the drift is negative Maximum throughput is 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 bounds have been developed Danyo Danev TSIN01 Information Networks Lecture 8 26 / 29
27 FCFS splitting algorithm: performance Danyo Danev TSIN01 Information Networks Lecture 8 27 / 29
28 FCFS splitting algorithm: improvements Splitting intervals into equal-size subintervals is slightly non-optimal in achieving maximum stable throughput When splitting to optimally-sized subintervals the maximum stable throughput is The maximum stable throughput using assumptions 1-6b is unknown; an upper bound is 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 FCFS achieves bounded-delay 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 Danyo Danev TSIN01 Information Networks Lecture 8 28 / 29
29 Next lecture Topics CSMA: Carrier Sense Multiple Access CSMA Slotted ALOHA CSMA Slotted ALOHA: Pseudo-Bayesian stabilization CSMA Unslotted ALOHA FCFS with CSMA Multiaccess reservations CSMA/CD (Collision Detection): slotted and unslotted Packet radio networks (PRN) Danyo Danev TSIN01 Information Networks Lecture 8 29 / 29
Splitting Algorithms
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
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationMedia Access Control. Networked Systems (H) Lecture 5
Media Access Control Networked Systems (H) Lecture 5 Lecture Outline Controlling access to the channel Link contention Media access control protocols Contention-based protocols CSMA/CD Token ring Slotted
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 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 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 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 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 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 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 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 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 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 informationComputer Networks. Medium Access Sublayer (Part I)
Computer Networks Medium Access Sublayer (Part I) Topics Introduction Multiple Access Protocols Ethernet Wireless LAN Protocols Bridges Misc (brief) High-Speed LANs Satellite Networks Introduction Remember,
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 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 informationMAC Protocols and Packet Switching
MAC Protocols and Packet Switching 6.02 Fall 2013 Lecture 19 Today s Plan MAC Protocols: Randomized Access (Aloha) Stabilization Algorithms Packet Switching: Multi-Hop Networks Delays, Queues, and the
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 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 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 informationCS 3640: Introduction to Networks and Their Applications
CS 3640: Introduction to Networks and Their Applications Fall 2018, Lecture 7: The Link Layer II Medium Access Control Protocols Instructor: Rishab Nithyanand Teaching Assistant: Md. Kowsar Hossain 1 You
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 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 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 informationLecture 6. Data Link Layer (cont d) Data Link Layer 1-1
Lecture 6 Data Link Layer (cont d) Data Link Layer 1-1 Agenda Continue the Data Link Layer Multiple Access Links and Protocols Addressing Data Link Layer 1-2 Multiple Access Links and Protocols Two types
More informationCHAPTER 7 MAC LAYER PROTOCOLS. Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College
CHAPTER 7 MAC LAYER PROTOCOLS Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College MEDIUM ACCESS CONTROL - MAC PROTOCOLS When the two stations transmit data
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 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 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 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 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 informationRMIT University. Data Communication and Net-Centric Computing COSC 1111/2061/1110. Lecture 8. Medium Access Control Methods & LAN
RMIT University Data Communication and Net-Centric Computing COSC 1111/2061/1110 Medium Access Control Methods & LAN Technology Slide 1 Lecture Overview During this lecture, we will Look at several Multiple
More informationCS 43: Computer Networks. 27: Media Access Contd. December 3, 2018
CS 43: Computer Networks 27: Media Access Contd. December 3, 2018 Last Class The link layer provides lots of functionality: addressing, framing, media access, error checking could be used independently
More informationData. Networks. Second Ed ition DIMITRI BERTSEKAS ROBERT GALLAGER. PRENTICE HALL, Englewood Cliffs, New Jersey 07632
Second Ed ition Data Networks DIMITRI BERTSEKAS Massachusetts Institute of Technology ROBERT GALLAGER Massachusetts Institute of Technology PRENTICE HALL, Englewood Cliffs, New Jersey 07632 4 Busy ----
More informationLecture 8 The Data Link Layer part I. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 8 The Data Link Layer part I Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Link Layer: setting the context two physically connected devices: host-router, router-router,
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 informationMassive Random Access: Fundamental Limits, Optimal Design, and Applications to M2M Communications
Massive Random Access: Fundamental Limits, Optimal Design, and Applications to M2M Communications Lin Dai Department of Electronic Engineering City University of Hong Kong lindai@cityu.edu.hk March, 2018
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 informationData Link Layer: Collisions
Data Link Layer: Collisions 1 Multiple Access Data Link layer divided into two sublayers. The upper sublayer is responsible for datalink control, The lower sublayer is responsible for resolving access
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 informationDelay Distributions of Slotted ALOHA and CSMA
1846 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 11, NOVEMBER 2003 Delay Distributions of Slotted ALOHA and CSMA Yang Yang, Member, IEEE, and Tak-Shing Peter Yum, Senior Member, IEEE Abstract In
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 informationThe Medium Access Control Scheme (MAC Layer) Reference: Andrew S. Tanenbaum, Computer Networks, 3rd Edition, Prentice Hall, 1996.
The Medium Access Control Scheme (MAC Layer) Reference: Andrew S. Tanenbaum, Computer Networks, 3rd Edition, Prentice Hall, 1996. 1 Table of Contents Introduction ALOHA Carrier Sense Multiple Sense (CSMA)
More informationNMA Radio Networks Network Level: Medium Access Control Roberto Verdone
NMA Radio Networks Network Level: Medium Access Control Roberto Verdone Outline 1. Introduction 2. Fundamentals of Random MAC Aloha in Compact Networks Slotted Aloha in Compact Networks CSMA in Compact
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 informationLAN PROTOCOLS. Beulah A AP/CSE
LAN PROTOCOLS Beulah A AP/CSE IEEE STANDARDS In 1985, the Computer Society of the IEEE started a project, called Project 802, to set standards to enable intercommunication among equipment from a variety
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 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 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 informationChapter 1 Basic concepts of wireless data networks (cont d)
Chapter 1 Basic concepts of wireless data networks (cont d) Part 2: Medium access methods for mobile data networks Sept 15 2004 1 Fixed assignment access schemes in voice-oriented networks Frequency division
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 informationThe Medium Access Control Sublayer
The Medium Access Control Sublayer Chapter 4 Channel Allocation Problem Static channel allocation Assumptions for dynamic Assumptions for Dynamic Channel Allocation 1. Independent traffic 2. Single channel
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 informationCOMP/ELEC 429/556 Introduction to Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks Broadcast network access control Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng
More informationCHAPTER 5. QoS RPOVISIONING THROUGH EFFECTIVE RESOURCE ALLOCATION
CHAPTER 5 QoS RPOVISIONING THROUGH EFFECTIVE RESOURCE ALLOCATION 5.1 PRINCIPLE OF RRM The success of mobile communication systems and the need for better QoS, has led to the development of 3G mobile systems
More informationThe MAC layer in wireless networks
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?
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 informationCS 455/555 Intro to Networks and Communications. Link Layer
CS 455/555 Intro to Networks and Communications Link Layer Dr. Michele Weigle Department of Computer Science Old Dominion University mweigle@cs.odu.edu http://www.cs.odu.edu/~mweigle/cs455-s13 1 Link Layer
More informationEITF25 Internet Techniques and Applications L4: Network Access. Stefan Höst
EITF25 Internet Techniques and Applications L4: Network Access Stefan Höst Repetition The link layer protocol should make sure that the data is correctly transmitted over the physical link using error
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 informationGoal and Outline. Computer Networking. What Do We Need? Today s Story Lecture 3: Packet Switched Networks Peter Steenkiste
Goal and Outline 15-441 15-641 Computer Networking Lecture 3: Packet Switched Networks Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15 441 F16 Goal: gain a basic understanding of how you can build a
More informationDirect Link Networks (II)
Direct Link Networks (II) Computer Networking Lecture 03 HKU SPACE Community College January 30, 2012 HKU SPACE CC CN Lecture 03 1/25 Outline Reliable Link Service Stop-and-Wait Sliding Window Media Access
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 informationChapter 4. The Medium Access Control Sublayer
Chapter 4 The Medium Access Control Sublayer The Channel Allocation Problem Static Channel Allocation in LANs and MANs Dynamic Channel Allocation in LANs and MANs Dynamic Channel Allocation in LANs and
More informationComputer Networks Medium Access Control. Mostafa Salehi Fall 2008
Computer Networks Medium Access Control Mostafa Salehi Fall 2008 2008 1 Outline Issues ALOHA Network Ethernet Token Ring Wireless 2 Main Issues Local Area Network (LAN) : Three or more machines are physically
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 informationECE 158A: Lecture 13. Fall 2015
ECE 158A: Lecture 13 Fall 2015 Random Access and Ethernet! Random Access! Basic idea: Exploit statistical multiplexing Do not avoid collisions, just recover from them When a node has packet to send Transmit
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 19. Principles behind data link layer services Framing Multiple access protocols
Link Layer Lecture 19 Principles behind data link layer services Framing Multiple access protocols ALOHA *The slides are adapted from ppt slides (in substantially unaltered form) available from Computer
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 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 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 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 informationChapter 12 Multiple Access 12.1
Chapter 12 Multiple Access 12.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 12.2 Figure 12.1 Data link layer divided into two functionality-oriented sublayers
More informationIMPLEMENTATION OF A PACKET PRIORITY AND FIFO QUEUING MODEL IN PACKET RADIO SYSTEM
IMPLEMENTATION OF A PACKET PRIORITY AND FIFO QUEUING MODEL IN PACKET RADIO SYSTEM H. Lami 1, A. Affandi 2 1, 2 Department of Electrical Engineering, Faculty of Industrial Technology, Institut Teknologi
More informationAnnouncements. Late homework policy
Announcements Late homework policy n Updated on course website n Up to 1 HW can be late for up to 5 days without penalty n After that, late HW accepted and graded with discount of 10%/day for up to 5 days
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 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 information>>> SOLUTIONS <<< Answer the following questions regarding the basics principles and concepts of networks.
Midterm Exam for Computer Networks (CNT 625) Fall 24 >>> SOLUTIONS
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 16
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 16 1 Final project demo Please do the demo next week to the TAs. So basically you may need
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 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 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 informationThe MAC layer in wireless networks
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a time/space problem Who transmits when?
More information