Lecture 9 November 12, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
|
|
- Scarlett Griffin
- 5 years ago
- Views:
Transcription
1 Lecture 9 November 12, 2018 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy
2 Medium Access Control Scheduled access
3 Classification of wireless MAC protocols Wireless MAC protocols Random access (contention) protocols Scheduled (contentionless) protocols Hybrid protocols Aloha CSMA Collision Avoidance Demand Polling Token Static assignment Random Reservation The above classification is based on how DATA traffic is transferred Most scheduled protocols, in fact, foresee a random access phase in which control packets are subject to collision
4 Scheduled Access Protocols Scheduled access avoids more than one terminal transmitting at a given time Data packets do not suffer from collision: at all times terminals know which terminal is allowed to transmit Good for centralized architectures, where a controller (Base Station, Access Point) manages the access Suitable as well for distributed architectures in which resource control and management is centralized Possible schemes are: Polling the controller calls one terminal at a time (see Bluetooth) On Demand Assignment the controller grants the channel to terminals following a request, typically submitted in a random access phase Static a resource (e.g. time slot, carrier) is statically assigned to a terminal when it joins the network In distributed architectures, scheduled protocols can be adopted by either promoting a terminal to act as a controller or by adopting a distributed scheduling strategy (token)
5 Scheduled Access A scheduled access system can be modeled as a queueing system An important issue is designing the depth of the queue Among queueing systems the M/G/1 is particularly suited to model the behaviour of a scheduled access system
6 Time in system vs. time in queue In the analysis of the M/M/1 system we defined the time spent in the system by a packet, called T, and evaluated its average value: E[ T ] = E [ N ] ρ = λ ( 1 ρ)λ = 1 / µ ( 1 ρ) In general, for the i-th packet such time is given by the sum of two contributions: the service time X i and the time in queue W i T i = X i + W i E T [ ] = E[ X] + E[ W ] X + W In the case of the M/M/1 system one has: E[ T ] = 1 µ ( 1 ρ) = X + W = 1 µ + ρ µ 1 ρ ( )
7 The Pollaczek-Khinchin (P-K) formula For the general case, the average time in queue W can be obtained by means of the Pollaczek-Khinchin (P-K) formula We will derive it in the case of a M/G/1 system, and then use it to analyze performance of scheduled access systems Call: W i waiting time of the i-th packet R i residual service time seen by the i-th packet if a j-th packet is being served when the i-th packet arrives, R i is the time before service to the j-th packet is completed if the server is idle when the i-th packet arrives R i =0 X i service time of the i-th packet N i number of packets waiting in queue when the i-th packet arrives
8 The Pollaczek-Khinchin (P-K) formula One has thus the following expression for the time in queue W i = R i + i 1 j=i N i By taking expectations and using the independence of the random variables N i and X i-1, X i-ni, one has: X j E[ W ] i = E R i i 1 j=i N i [ ] + E X j = Average residual time = E[ R ] i + X E[ N ] i Average service time Average number of packets in queue
9 By taking the limit for i Note that the limit for i behaviour The Pollaczek-Khinchin (P-K) formula + one gets: W = R + 1 µ N Q + corresponds to a long-term If now one applies Little s result to the waiting queue, one has: N Q = λw and by substitution one obtains: W = R + 1 λw = R + ρw W = R µ 1 ρ W is thus a function of ρ and of the residual service time R, which will be evaluated in the following slides
10 The Pollaczek-Khinchin (P-K) formula Let us consider the residual service time r(τ) at time τ We will consider a time t such that r(t)=0, and we will indicate with M(t) the number of service completions in the interval [0,t], as in figure below: 0
11 The Pollaczek-Khinchin (P-K) formula M ( t) One has: 1 t 1 1 r( τ )dτ = t 0 t 2 X 2 i i=1 where X i is the service time of the i-th packet One can write the above equation as: 1 t t r( τ )dτ = M ( t) t M ( t) i=1 X i 2 ( ) M t and by taking the limit for t + and assuming that the limits below exist (finite value) one gets: 1 lim t + t t 0 r( τ )dτ = 1 2 lim t + M ( t) t lim t + M ( t) i=1 M t 2 X i ( )
12 The Pollaczek-Khinchin (P-K) formula 1 lim t + t Time average of the residual time t 0 r( τ )dτ = 1 2 lim t + M ( t) Assuming the system is in equilibrium, then the time average of the departure rate must equal the time average of the arrival rate Assuming that the process is ergodic, and thus that one can replace time averages with ensemble averages, one has: and thus: W = Time average of the departure rate R = 1 2 λ E X 2 R 1 ρ = λ E X ρ ( ) t lim t + M ( t) i=1 M t 2 X i ( ) Second moment of the service time Pollaczek-Khinchin (P-K) formula for a M/G/1 system
13 M/G/1 queue with vacations It is useful to consider the case where a server goes on vacation for some random interval of time between two busy periods : V 1, V 2,... are the durations of the vacations taken by the server, and we will assume they are independent and identically distributed (IID) random variables V 1, V 2,... are also assumed to be independent of interarrival and service times
14 M/G/1 queue with vacations A new packet arriving in the system has now to wait the end of the current service OR vacation of the server As a consequence one can still write: but in this case one has: W = R 1 ρ 1 t t 0 r( τ )dτ = 1 t = 1 2 M( t) i=1 1 2 X 2 i M ( t) t M( t) i=1 + 1 t X i 2 M t L( t) 1 2 V 2 i = i=1 ( ) L( t) t L( t) i=1 L t V i 2 ( )
15 If one takes the limit for t 1 lim t + t t 0 r( τ )dτ = 1 2 lim t + and thus: R = 1 2 λe X M/G/1 queue with vacations M ( t) t lim t + ( 1 ρ) E[ V ] E V 2 + one has in this case: M ( t) i=1 X i 2 M t ( ) lim t + L( t) t lim t + The result can be explained by observing that for t + the fraction of time spent serving packets approaches ρ, and thus the remaining fraction of time, spent on vacation, approaches 1-ρ One has thus: W = R 1 ρ = λ E X ρ ( ) + E V 2 2E[ V ] L( t) i=1 L t (P-K) formula for a M/G/1 system with vacations V i 2 ( )
16 Scheduled access with reservations The M/G/1 queue with vacations is the ideal tool for modeling a scheduled access system where transmission of data packets is preceded by a reservation phase Reservation periods correspond to the vacation times Let us consider the case of m users, each one emitting packets with rate λ/m Each user introduces a reservation time before sending all the packets in its queue (exhaustive system) Users work in a cyclic order, reserving the channel and sending immediately after the data packets
17 Scheduled access with reservations In this case one has the following expression for the expected time in queue E[ W ] i = E[ R ] i + E [ N ] i µ + E[ Y ] i where Y i is the sum of the duration of the whole reservation periods that user i has to wait before sending its packets
18 Scheduled access with reservations Following the same approach as before we get in this case: W = R + 1 R + Y λw + Y = R + ρw + Y W = µ 1 ρ where, as seen before, one has: 1 R = 1 2 λe X 2 = 1 2 λe X ( 2 1 ρ ) ρ R m 1 m m 1 l=0 m 1 l=0 ( ) E V 2 Y E[ V ] E V 2 l E [ V ] l The exact expression of and will depend on the statistics of the reservation time. In the following slides the derivation will be carried out for a Token Ring system. =
19 Token ring Token ring Nodes in the network exchange a token giving the right to use the channel Originally proposed for wired ring networks with unidirectional links: Nodes Network interfaces In the case of unidirectional wired links, a node in the ring will retransmit on its outgoing link the bits received from its incoming link, delayed by k bits (k 1), where k is the length of the token in bits
20 Token ring A node acquires the control of the channel by sending a busy token The busy token is followed by the bits of the packet When the node has completed transmission it releases the channel by sending a free token Busy token Data packet Free token Nodes keep on forwarding the free token until a node has a packet to send
21 Token ring Assuming that each node adds a propagation (and processing) delay of v the average time in queue in a token ring network can be evaluated as follows: Where in this case one has: R = 1 2 λe X 2 W = R + Y 1 ρ ( ) And Y can be shown to be in this case equal to Y = ( m 1) ρ v ( ) E V 2 E[ V ] = v E[ V ] = 1 2 λe X 2 E V 2 = v ( 2 1 ρ )v Delay due to reservation (token transfer) over half the ring
22 Token ring And thus: W = R + Y 1 ρ = λe X ρ = λe X ρ ( )v ( )v ( ) + 1 ρ 2( 1 ρ) + m 1 2( 1 ρ) = ( )v ( ) + m ρ 2( 1 ρ)
23 IEEE standard The IEEE standard adopted a token ring approach, with two key differences: A star topology is adopted: A node sending a packet waits to receive the acknowledgment from the destination before releasing the token
24 Polling Polling the controller calls one terminal at the time Controller!??! Stations Advantages: Flexibility in scheduling - different priority among nodes can be easily introduced by calling more often high priority nodes Ease of deployment - particularly simple when a centralized architecture is available, but can be done in distributed architectures as well (see Bluetooth) Drawbacks: Overhead - in the case of lightly loaded networks (when most nodes have no data) the impact of polling packets is no longer negligible Robustness - the controller is a weak point in the network, especially in centralized architectures
25 Polling vs. token networks Polling can be seen as an implementation of a token-based system The controller in a polling network has the role of taking the token from a node and transferring it to the next one!? Controller Token transfer Stations The need of two communications between each data transfer can lead to a large delay in token transfer compared to a token ring network, leading to a lower throughput
26 Hub polling and token bus The token transfer delay introduced by polling schemes can be reduced by adopting a mixed scheme called hub polling In hub polling the poll is only done at the beginning The first node then directly passes the token to the next node, without further intervention of the controller:? Controller Stations When there is no controller the network goes back to a fully distributed fashion, and goes under the name of token bus (adopted in the IEEE standard)
27 Scheduled access: examples Most existing wireless systems combine scheduled and random access depending on traffic and application requirements as for example: IEEE (Wi-Fi) Bluetooth IEEE IEEE a
28 IEEE Point Coordination Function - The Point Coordination Function in a network allows terminals to access the medium without contention (Contention Free or CF) The implementation of PCF is based on the presence of a Point Coordinator (typically an Access Point) that determines the access to the medium of the terminals according to a polling scheme The PCF can coexist with the a Distributed Coordination Function based on random access (CSMA-CA) In this case a CFP Repetition Period is defined The CFP Repetition Period is divided in a Contention Free Period (CFP) dedicated to contention free access based on the PCF and a Contention Period (CP) during which terminals access the medium according to the CSMA-CA protocol:
29 Bluetooth (IEEE ) Bluetooth adopts a Contention Free access, based on the Master-Slave (polling) approach: T SCO ACL SCO ACL ACL SCO Master Slave #1 Slave #2 TX RX TX RX TX RX TX RX RX RX TX RX Slave #7 Time
Wireless 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 informationWireless Access. Practice 15 November 14, 2018
Practice 15 November 14, 2018 Wireless Access Graduate course in Telecommunications School of Engineering University of Rome La Sapienza Rome, Italy 2018-2019 Token ring queueing time analysis with OMNeT++
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 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 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 informationCOMPUTER NETWORKS - Local area networks
Local area networks Telecommunication Networks Group firstname.lastname@polito.it http://www.telematica.polito.it/ COMPUTER NETWORKS LANs - 1 Copyright Quest opera è protetta dalla licenza Creative Commons
More informationLocal area networks. Copyright
Local area networks Telecommunication Networks Group firstname.lastname@polito.it http://www.telematica.polito.it/ COMPUTER NETWORKS LANs - 1 Copyright Quest opera è protetta dalla licenza Creative Commons
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 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 informationClass-based Packet Scheduling Policies for Bluetooth
Class-based Packet Scheduling Policies for Bluetooth Vishwanath Sinha, D. Raveendra Babu Department of Electrical Engineering Indian Institute of Technology, Kanpur - 08 06, INDIA vsinha@iitk.ernet.in,
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 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 informationData Link Layer Technologies
Chapter 2.2 La 2 Data Link La Technologies 1 Content Introduction La 2: Frames Error Handling 2 Media Access Control General approaches and terms Aloha Principles CSMA, CSMA/CD, CSMA / CA Master-Slave
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 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 informationData Link Layer -2- Network Access
EITF25 Internet: Technology and Applications Data Link Layer -2- Network Access 2015, Lecture 03 Kaan Bür Previously on EITF25 Logical Link Control Sublayer Flow control Send data Wait for ACK Error control
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 informationENGI 4557 Digital Communications Practice Problems 2017 (Part 2)
ENGI 4557 Digital Communications Practice Problems 207 (Part 2) H = n p i log 2 ( ) p i C = W log 2 ( + S N ) SNR = 6m + 0 log 0 ( 3σ2 x V ) 2 SNR = 6m 0 ( ) n n! = k k!(n k)! x = σ 2 = + + x p(x)dx (x
More informationData Link Layer -2- Network Access
EITF25 Internet: Technology and Applications Data Link Layer -2- Network Access 2013, Lecture 03 Kaan Bür, Stefan Höst Previously on EITF25 Logical Link Control Sublayer Flow control Send data Wait for
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 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 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 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 informationThis formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go
Chapter 3 Problem 2 In Figure 3.43 of the text every node transmits R bps, and we assume that both network partitions consist of 1 N nodes. So the total traffic generated by the nodes 2 of each Ethernet
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 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 informationEECS 563 Fall Review Test 2. Review Test 2
EECS 563 Fall 2013 1 Network traffic Request for resources Rate of requests= λ Average resource hold time = T h Common Assumptions Time between arrivals ~ exponentially Holding time ~ exponentially Voice
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 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 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 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 informationReview of Topology and Access Techniques / Switching Concepts
Review of Topology and s / Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013 Overview Three base wired topologies Bus, star, ring Two wireless topologies Ad-hoc, infrastructure
More informationJaringan Komputer. Broadcast Network. Outline. MAC (Medium Access Control) Channel Allocation Problem. Dynamic Channel Allocation
Broadcast Network Jaringan Komputer Medium Access Control Sublayer 2 network categories: point-to-point connections broadcast channels Key issue in broadcast network: how to determine who gets to use the
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 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 informationLecture 4: Wireless MAC Overview. Hung-Yu Wei National Taiwan University
Lecture 4: Wireless MAC Overview Hung-Yu Wei National Taiwan University Medium Access Control Topology 3 Simplex and Duplex 4 FDMA TDMA CDMA DSSS FHSS Multiple Access Methods Notice: CDMA and spread spectrum
More informationLink Layer and LANs 안상현서울시립대학교컴퓨터 통계학과.
Link Layer and LANs 안상현서울시립대학교컴퓨터 통계학과 ahn@venus.uos.ac.kr Data Link Layer Goals: understand principles behind data link layer services: error detection, correction sharing a broadcast channel: multiple
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 informationModule 16: Distributed System Structures
Chapter 16: Distributed System Structures Module 16: Distributed System Structures Motivation Types of Network-Based Operating Systems Network Structure Network Topology Communication Structure Communication
More informationStrengthening Unlicensed Band Wireless Backhaul
be in charge Strengthening Unlicensed Band Wireless Backhaul Use TDD/TDMA Based Channel Access Mechanism WHITE PAPER Strengthening Unlicensed Band Wireless Backhaul: Use TDD/TDMA Based Channel Access Mechanism
More informationThe Open System Interconnect model
The Open System Interconnect model Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 1 Layered network design Data networks are usually
More informationData and Computer Communications. Chapter 13 Wireless LANs
Data and Computer Communications Chapter 13 Wireless LANs Wireless LAN Topology Infrastructure LAN Connect to stations on wired LAN and in other cells May do automatic handoff Ad hoc LAN No hub Peer-to-peer
More informationCARRIER SENSE MULTIPLE ACCESS (CSMA):
Lecture Handout Computer Networks Lecture No. 8 CARRIER SENSE MULTIPLE ACCESS (CSMA): There is no central control management when computers transmit on Ethernet. For this purpose the Ethernet employs CSMA
More informationCOMP476 Networked Computer Systems. Polling. Sharing the Wire. LAN Technologies. COMP476 Networked Computer Systems 1
Media Access Control Sub Layer COMP476 Networked Computer Systems Sharing Common Media There are several ways to share common media. Some methods are: Frequency division multiplexing Time division multiplexing
More informationCS 43: Computer Networks Media Access. Kevin Webb Swarthmore College November 30, 2017
CS 43: Computer Networks Media Access Kevin Webb Swarthmore College November 30, 2017 Multiple Access Links & Protocols Two classes of links : point-to-point dial-up access link between Ethernet switch,
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 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 informationLAN Overview (part 2) Interconnecting LANs - Hubs
LAN Overview (part 2) CSE 3213 Fall 2011 1 November 2011 Interconnecting LANs - Hubs active central element of star layout each station connected to hub by two UTP lines hub acts as a repeater limited
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 informationLecture 9: Bridging. CSE 123: Computer Networks Alex C. Snoeren
Lecture 9: Bridging CSE 123: Computer Networks Alex C. Snoeren Lecture 9 Overview Finishing up media access Ethernet Contention-free methods (rings) Moving beyond one wire Link technologies have limits
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 informationAn Efficient Scheduling Scheme for High Speed IEEE WLANs
An Efficient Scheduling Scheme for High Speed IEEE 802.11 WLANs Juki Wirawan Tantra, Chuan Heng Foh, and Bu Sung Lee Centre of Muldia and Network Technology School of Computer Engineering Nanyang Technological
More informationTopics. Link Layer Services (more) Link Layer Services LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS. flow control: error detection:
1 Topics 2 LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS Multiple access: CSMA/CD, CSMA/CA, token passing, channelization LAN: characteristics, i basic principles i Protocol architecture Topologies
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 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 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 Chapter Overview Broadcast Networks All information sent to all users No routing
More informationModule 5 Local Area Networks
Module 5 Local Area Networks Lesson 15 LAN Topologies, Access Mechanisms And Media 5.1.1 INTRODUCTION Microelectronics brought a great revolution in computer technology. While the processing power of the
More informationWEB OBJECT SIZE SATISFYING MEAN WAITING TIME IN MULTIPLE ACCESS ENVIRONMENT
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 014 WEB OBJECT SIZE SATISFYING MEAN WAITING TIME IN MULTIPLE ACCESS ENVIRONMENT Y. J. Lee Department of Technology
More informationChapter 5 Link Layer and LANs
Chapter 5 Link Layer and LANs Computer Networking: A Top Down Approach 4 th edition. Jim Kurose, Keith Ross Addison-Wesley, July 2007. All material copyright 1996-2007 J.F Kurose and K.W. Ross, All Rights
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 informationLecture 05 Chapter 16 High Speed LANs
NET 456 High Speed Networks Lecture 05 Chapter 16 High Speed LANs Dr. Anis Koubaa Reformatted slides from textbook Data and Computer Communications, Ninth Edition by William Stallings, 1 (c) Pearson Education
More informationIntroduction to LAN Protocols
CHAPTER 2 Chapter Goals Learn about different LAN protocols. Understand the different methods used to deal with media contention. Learn about different LAN topologies. This chapter introduces the various
More informationMohamed Khedr.
Mohamed Khedr http://webmail.aast.edu/~khedr Tentatively Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12 Week 13 Week 14 Week 15 Overview Packet Switching IP addressing
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 informationIntroduction to Networks and the Internet
Introduction to Networks and the Internet HTML tutorial today. Announcements CMPE 80N Spring 2003 Week 5 1 2 MAC Protocols MAC Protocols Round-robin. Scheduled-access. Contention-based. Contention-based
More informationIntroduction to LAN Protocols
CHAPTER 2 Introduction to LAN Protocols This chapter introduces the various media-access methods, transmission methods, topologies, and devices used in a local area network (LAN). Topics addressed focus
More informationIEEE P Working Group for Wireless Personal Area Networks TM
IEEE P802.15 Working Group for Wireless Personal Area Networks TM SCORT - An Alternative to the Bluetooth SCO Link for Voice Operation in an Interference Environment Slide 1 Bluetooth SCO Link The Bluetooth
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 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 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 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 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 informationData Link Layer, Part 3 Medium Access Control. Preface
Data Link Layer, Part 3 Medium Access Control These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable
More informationLecture 6: Example LAN: Ethernet
Lecture 6: Example LAN: Ethernet Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE426: Communication Networks Network Types Local Area Networks (LANs):privately-owned networks
More informationCH : 15 LOCAL AREA NETWORK OVERVIEW
CH : 15 LOCAL AREA NETWORK OVERVIEW P. 447 LAN (Local Area Network) A LAN consists of a shared transmission medium and a set of hardware and software for interfacing devices to the medium and regulating
More informationELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ELEC / COMP 177 Fall 2011 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Project #2 Due Thursday, Nov 10 th By midnight Homework #5 Due Thursday, Nov 17 th Later this semester: Homework
More informationAnnouncements: ECE/CS 372 introduction to computer networks. Assignment 4 due now. Chapter 7
ECE/CS 372 introduction to computer networks Announcements: Assignment 4 due now Chapter 7 Acknowledgement: slides drawn heavily from Kurose & Ross and Prof. Bechir Hamdaoui Chapter 7, slide 1 Wireless
More informationCS 3640: Introduction to Networks and Their Applications
CS 3640: Introduction to Networks and Their Applications Fall 2018, Lecture 5: The Link Layer I Errors and medium access Instructor: Rishab Nithyanand Teaching Assistant: Md. Kowsar Hossain 1 You should
More informationWorst-case Ethernet Network Latency for Shaped Sources
Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................
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 informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 3 CMPE 257 Winter'11 1 Announcements Accessing secure part of the class Web page: User id: cmpe257.
More informationMedium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols
Medium Access Control MAC protocols: design goals, challenges, contention-based and contention-free protocols 1 Why do we need MAC protocols? Wireless medium is shared Many nodes may need to access the
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 informationData and Computer Communications
Data and Computer Communications Chapter 16 High Speed LANs Eighth Edition by William Stallings Why High Speed LANs? speed and power of PCs has risen graphics-intensive applications and GUIs see LANs as
More informationDifferent network topologies
Network Topology Network topology is the arrangement of the various elements of a communication network. It is the topological structure of a network and may be depicted physically or logically. Physical
More informationCPSC 441 Tutorial-19. Department of Computer Science University of Calgary
CPSC 441 Tutorial-19 Department of Computer Science University of Calgary Problem-1 Consider n nodes that use the slotted CSMA/ CD with binary exponential back-off to access a shared broadcast channel.
More informationModule 15: Network Structures
Module 15: Network Structures Background Topology Network Types Communication Communication Protocol Robustness Design Strategies 15.1 A Distributed System 15.2 Motivation Resource sharing sharing and
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 informationMULTIPLE ACCESS PROTOCOLS 2. 1
MULTIPLE ACCESS PROTOCOLS AND WIFI 1 MULTIPLE ACCESS PROTOCOLS 2. 1 MULTIPLE ACCESS LINKS, PROTOCOLS Two types of links : point-to-point broadcast (shared wire or medium) POINT-TO-POINT PPP for dial-up
More informationETSN01 Exam. August 22nd am 1pm. Clearly label each page you hand in with your name and the page number in the bottom right hand corner.
ETSN01 Exam August 22nd 2015 8am 1pm Instructions Clearly label each page you hand in with your name and the page number in the bottom right hand corner. Materials allowed: calculator, writing material.
More informationTypes of Computer Networks and their Topologies Three important groups of computer networks: LAN, MAN, WAN
Types of Computer and their Topologies Three important groups of computer networks: LAN, MAN, WAN LAN (Local Area ) 1 MAN (Metropolitan Area ) 2 WAN (Wide Area ) 3 Problems to be discussed when presenting
More informationData Communications. Automatic Repeat Request Medium Access Control
Data Communications Automatic Repeat Request Medium Access Control Handling Error Cases Automatic Repeat request(arq), also known as Automatic Repeat Query, is an error-control method ARQ uses acknowledgements
More informationCSE 461: Multiple Access Networks. This Lecture
CSE 461: Multiple Access Networks This Lecture Key Focus: How do multiple parties share a wire? This is the Medium Access Control (MAC) portion of the Link Layer Randomized access protocols: 1. Aloha 2.
More informationLAN Systems. Bus topology LANs
Bus topology LANs LAN Systems Design problems: not only MAC algorithm, not only collision domain management, but at the Physical level the signal balancing problem (signal adjustment): Signal must be strong
More informationECSE-4670: Computer Communication Networks (CCN) Informal Quiz 3
ECSE-4670: Computer Communication Networks (CCN) Informal Quiz 3 : shivkuma@ecse.rpi.edu Biplab Sikdar: sikdab@rpi.edu 1 T F Slotted ALOHA has improved utilization since the window of vulnerability is
More informationData Link Layer: Multi Access Protocols
Digital Communication in the Modern World Data Link Layer: Multi Access Protocols http://www.cs.huji.ac.il/~com1 com1@cs.huji.ac.il Some of the slides have been borrowed from: Computer Networking: A Top
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 informationLesson 2-3: The IEEE x MAC Layer
Module 2: Establishing Wireless Connectivity Lesson 2-3: The IEEE 802.11x MAC Layer Lesson Overview This lesson describes basic IEEE 802.11x MAC operation, beginning with an explanation of contention schemes
More informationMedium Access Control. CSCI370 Lecture 5 Michael Hutt New York Institute of Technology
Medium Access Control CSCI370 Lecture 5 Michael Hutt New York Institute of Technology The Data Link Layer Logical Link Control (LLC) IEEE 802.2 Standard RFC 1042 Provides three service options Unreliable
More informationWireless Sensor Networks 8th Lecture
Wireless Sensor Networks 8th Lecture 21.11.2006 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Media Access Control (MAC) Controlling when to send a packet and when to listen for a packet
More information