6610-l2- - Medium Access Control Puzzle How can a toss be called over the phone(without requiring trust Overview Medium Access Control ALOHA

Info iconThis preview shows pages 1–16. Sign up to view the full content.

View Full Document Right Arrow Icon
Medium Access Control
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Puzzle How can a toss be called over the phone (without requiring trust)?
Background image of page 2
Overview Medium Access Control ALOHA, slotted-ALOHA, CSMA, CSMA/CD Scheduling FCFS, Priority scheduling Fair queuing, Weighted fair queuing Round robin, Weighted round robin Deficit round robin Class based queuing
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Medium Access Control When multiple stations share a common channel, the protocol that determines which station gets access to the shared channel Key characteristics based on which MAC protocols are evaluated: utilization and fairness
Background image of page 4
ALOHA ALOHA When a station wants to transmit, it transmits Collisions detected at a higher layer and retransmissions done as required Simple logic Highly inefficient at large loads. Maximum utilization of 18% at a mean load of 0.5 transmissions/slot
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Slotted ALOHA Stations can transmit only at the beginning of pre-determined slots Reduces the “vulnerable period” for collisions More efficient Maximum utilization of 36% at a mean load of 1 transmission/slot
Background image of page 6
Carrier Sense Multiple Access Station wishing to transmit senses channel. If channel idle, transmits. Else, backs-off and tries later Carrier sensing hardware required More efficient than both versions of ALOHA 3 flavors of CSMA
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CSMA (contd.) 1-persistent CSMA On finding channel busy, station continues listening and transmits when channel becomes idle p-persistent CSMA On finding channel idle, station transmits with a probability of p, backs-off and tries again when channel is busy non-persistent CSMA On finding channel busy, station backs-off for a random amount of time and tries later
Background image of page 8
CSMA/CD In CSMA, when there is a collision of two transmissions, it is detected only after the entire frames have been transmitted … irrespective of when the collision occurs CSMA/CD includes a collision detection mechanism that can detect collisions even as stations are transmitting Transmitting stations terminate transmissions upon collision detection and try later
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10 CSMA/CD (Contd.) When will the performance of CSMA/CD be the same as that of CSMA? IEEE 802.3 Ethernet LAN Standard 802.3u – fast ethernet 802.3ab – gigabit ethernet 802.3ae – 10G ethernet Full-duplex Ethernet
Background image of page 10
Other MAC Schemes Collision free protocols Bit map protocol Binary countdown protocol Limited contention protocols Adaptive tree walk protocol
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Recap Class goals and overview Grading and other administrative stuff Communication networks OSI Protocol Stack
Background image of page 12
13 Scheduling
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
14 Scheduling When a station gets to transmit, the protocol that determines which packet gets to be transmitted Fairness the primary consideration Weighted fairness … an extension Default scheduling in today’s Internet?
Background image of page 14
15 Scheduling Policies … FCFS Packets queued on a first-come-first-served basis No fairness Priority
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 16
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/14/2009 for the course ECE 6610 taught by Professor Staff during the Fall '08 term at Georgia Institute of Technology.

Page1 / 67

6610-l2- - Medium Access Control Puzzle How can a toss be called over the phone(without requiring trust Overview Medium Access Control ALOHA

This preview shows document pages 1 - 16. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online