5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.

Slides:



Advertisements
Similar presentations
Lecture 15 Link Layer Protocols. Lecture 15-2 Link Layer Services r Framing and link access: encapsulate datagram into frame adding header and trailer,
Advertisements

EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.
Comp 361, Spring 20056:Basic Wireless 1 Chapter 6: Basic Wireless (last updated 02/05/05) r A quick intro to CDMA r Basic
5: DataLink Layer5a-1 Chapter 5 Data Link Layer Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition. Jim Kurose, Keith Ross Addison-Wesley,
Link Layer Protocols. Link Layer Services  Framing and link access:  encapsulate datagram into frame adding header and trailer,  implement channel.
LANs Local Area Networks via the Media Access Control (MAC) Sub Layer LANs Local Area Networks via the Media Access Control (MAC) Sub Layer Advanced Advanced.
Network Layer4-1 Link Layer: Introduction Some terminology: r hosts and routers are nodes (bridges and switches too) r communication channels that connect.
Chapter 12 Multiple Access Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols.
5: DataLink Layer5a-1 MAC Sublayer. 5: DataLink Layer5a-2 Multiple Access Links and Protocols Two types of “links”: r point-to-point m PPP for dial-up.
1 Pertemuan 13 Teknik Akses Jaringan - Random Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
5: DataLink Layer5a-1 19: Link Layer: Error Detection/Correction, Multiple Access Protocols Last Modified: 6/17/ :26:09 AM.
5: DataLink Layer5-1 Data Link Layer r What is Data Link Layer? r Multiple access protocols r Ethernet.
11/11/ /13/2003 DLL, Error Detection, MAC, ARP November 11-13, 2003.
Rensselaer Polytechnic Institute © Shivkumar Kalvanaraman & © Biplab Sikdar1 ECSE-4730: Computer Communication Networks (CCN) Chapter 5: The Data Link.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
1 Link Layer Message M A B Problem: Given a message M at a node A consisting of several packets, how do you send the packets to a “neighbor” node B –Neighbor:
DataLink Layer session 1 TELE3118: Network Technologies Week 2: Data Link Layer Framing, Error Control, Multiple Access Some slides have been taken.
5: DataLink Layer5-1 Link Layer – Error Detection/Correction and MAC.
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross.
5: DataLink Layer5-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction m.
Medium Access Control Sublayer
Lecture 16 Random Access protocols r A node transmits at random at full channel data rate R. r If two or more nodes “collide”, they retransmit at random.
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Part 3: MAC Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley.
1 Link-Layer Contention EE 122: Intro to Communication Networks Fall 2007 (WF 4-5:30 in Cory 277) Vern Paxson TAs: Lisa Fowler, Daniel Killebrew & Jorge.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
4-1 Last time □ Link layer overview ♦ Services ♦ Adapters □ Error detection and correction ♦ Parity check ♦ Internet checksum ♦ CRC □ PPP ♦ Byte stuffing.
Chapter 12 Multiple Access Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols.
CSC4220/6220 Computer Networks
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking LANs 2: MAC protocols.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Link Layer multiple.
Medium Access Control NWEN302 Computer Network Design.
5: DataLink Layer5a-1 13: Link Layer, Multiple Access Protocols Last Modified: 10/14/2015 3:28:03 PM.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved. © The McGraw-Hill Companies, Inc. Medium Access Control Asst. Prof. Chaiporn.
5: DataLink Layer5a-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction.
4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.
Network Layer4-1 Link Layer: Introduction Some terminology: r hosts and routers are nodes (bridges and switches too) r communication channels that connect.
Chapter 6 Multiple Radio Access
5: DataLink Layer5-1 Link Layer r 5.1 Introduction and services r 5.2 Error detection and correction r 5.3Multiple access protocols r 5.4 Link-Layer Addressing.
1 Week 5 Lecture 3 Data Link Layer. 2 Data Link Layer location application: supporting network applications –FTP, SMTP, STTP transport: host-host data.
5: DataLink Layer5-1 The Data Link Layer Chapter 5 Kurose and Ross Today 5.1 and 5.3.
Multiple Access Links and Protocols
Data Link Layer. Useful References r Wireless Communications and Networks by William Stallings r Computer Networks (third edition) by Andrew Tanenbaum.
LANs Local Area Networks via the Media Access Control (MAC) Sub Layer LANs Local Area Networks via the Media Access Control (MAC) Sub Layer Advanced Computer.
Ch 12. Multiple Access. Multiple Access for Shared Link Dedicated link – Point-to-point connection is sufficient Shared link – Link is not dedicated –
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross.
5: DataLink Layer5a-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction.
Advanced Computer Networks C13
5: DataLink Layer5-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, error correction.
Transport Layer 3-1 Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012  CPSC.
5: DataLink Layer5-1 Link Layer r 5.1 Introduction and services r 5.2 Error detection and correction r 5.3Multiple access protocols r 5.4 Link-layer Addressing.
THE MEDIUM ACCESS CONTROL SUBLAYER 4.1 THE CHANNEL ALLOCATION PROBLEM 4.2 MULTIPLE ACCESS PROTOCOLS.
5: DataLink Layer5-1 Slotted ALOHA Assumptions r all frames same size r time is divided into equal size slots, time to transmit 1 frame r nodes start to.
2. Data Link Layer: Medium Access Control. Scheduling.
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.
Chapter 5 Link Layer and LANs
Computer Communication Networks
Chapter 5: The Data Link Layer
Multiple Access Mahesh Jangid Assistant Professor JVW University.
Channel Allocation (MAC)
Subject Name: Computer Communication Networks Subject Code: 10EC71
Services of DLL Framing Link access Reliable delivery
Multiple access.
THE IEEE MAC SUB-LAYER – chapter 14
Multiple Access Methods
Link Layer and LANs Not everyone is meant to make a difference. But for me, the choice to lead an ordinary life is no longer an option 5: DataLink Layer.
Link Layer 5.1 Introduction and services
Link Layer: Multiple Access
Chapter 6 Multiple Radio Access.
Dr. John P. Abraham Professor UTPA
Presentation transcript:

5: DataLink Layer 5a-1 Multiple Access protocol

5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire or medium; e.g, Ethernet, Wavelan, satellite, etc.) r switched (e.g., switched Ethernet, ATM, etc)

5: DataLink Layer 5a-3 Multiple Access Protocols r single shared communication channel r two or more simultaneous transmissions by nodes: interference m only one node can send successfully at a time r multiple access protocol: m distributed algorithm that determines how stations share channel, i.e., determine when station can transmit

Why collisions occur r One or more node start transmission while some other transmission is going on r Tow or more node start transmission at the same time 5: DataLink Layer 5a-4

5: DataLink Layer 5a-5 MAC Protocols: a taxonomy Three broad classes: r Static Channel Partitioning m divide channel into smaller “pieces” (time slots, frequency) m allocate piece to node for exclusive use r Random Access m allow collisions m “recover” from collisions r “Taking turns” (Dynamic channel partitioning) m tightly coordinate shared access to avoid collisions Goal: efficient, fair, simple, decentralized

5: DataLink Layer 5a-6 Channel Partitioning MAC protocols: TDMA TDMA: time division multiple access r access to channel in "rounds" r each station gets fixed length slot (length = pkt trans time) in each round r unused slots go idle r example: 6-station LAN, 1,3,4 have pkt, slots 2,5,6 idle r TDM (Time Division Multiplexing): channel divided into N time slots, one per user; inefficient with low duty cycle users and at light load. r FDM (Frequency Division Multiplexing): frequency subdivided.

5: DataLink Layer 5a-7 Channel Partitioning MAC protocols: FDMA FDMA: frequency division multiple access r channel spectrum divided into frequency bands r each station assigned fixed frequency band r unused transmission time in frequency bands go idle r example: 6-station LAN, 1,3,4 have pkt, frequency bands 2,5,6 idle r TDM (Time Division Multiplexing): channel divided into N time slots, one per user; inefficient with low duty cycle users and at light load. r FDM (Frequency Division Multiplexing): frequency subdivided. frequency bands time

5: DataLink Layer 5a-8 Channel Partitioning (CDMA) CDMA (Code Division Multiple Access) r unique “code” assigned to each user; ie, code set partitioning r used mostly in wireless broadcast channels (cellular, satellite,etc) r all users share same frequency, but each user has own “chipping” sequence (ie, code) to encode data r encoded signal = (original data) X (chipping sequence) r decoding: inner-product of encoded signal and chipping sequence r allows multiple users to “coexist” and transmit simultaneously with minimal interference (if codes are “orthogonal”)

5: DataLink Layer 5a-9 CDMA Encode/Decode

5: DataLink Layer 5a-10 CDMA: two-sender interference sender 1 sender 2 uses sender 1 code to receive sender 1 data

5: DataLink Layer 5a-11 Random Access protocols r When node has packet to send m transmit at full channel data rate R. m no a priori coordination among nodes r two or more trasnmitting nodes -> “collision”, r random access MAC protocol specifies: m how to detect collisions m how to recover from collisions (e.g., via delayed retransmissions) r Examples of random access MAC protocols: m slotted ALOHA m ALOHA m CSMA and CSMA/CD

CSMA r What is CSMA carrier Sense multiple Access r carrier Sense : transmitter listen for carrier before sending packet. r multiple Access : multiple nodes can send and receive on the medium r There for collision can occur 5: DataLink Layer 5a-12

Tow type of CSMA r CSMA/CA r CSMA/CD 5: DataLink Layer 5a-13

5: DataLink Layer 5a-14 CSMA: Carrier Sense Multiple Access) CSMA: listen before transmit: r If channel sensed idle: transmit entire pkt r If channel sensed busy, defer transmission m Persistent CSMA: retry immediately with probability p when channel becomes idle (may cause instability) m Non-persistent CSMA: retry after random interval

CSMA/CD (CSMA with Collision Detection) r In CSMA, if 2 terminals begin sending packet at the same time, each will transmit its complete packet (although collision is taking place). r Wasting medium for an entire packet time. r CSMA/CD Step 1:If the medium is idle, transmit Step 2:If the medium is busy, continue to listen until the channel is idle then transmit Step 3:If a collision is detected during transmission, cease transmitting Step 4:Wait a random amount of time and repeats the same algorithm 15

16 CSMA/CA (CSMA with collision Avoidance) r All terminals listen to the same medium as CSMA/CD. r Terminal ready to transmit senses the medium. r If medium is busy it waits until the end of current transmission. r It again waits for an additional predetermined time period DIFS (Distributed inter frame Space). r Then picks up a random number of slots (the initial value of backoff counter) within a contention window to wait before transmitting its frame. r If there are transmissions by other terminals during this time period (backoff time), the terminal freezes its counter. r It resumes count down after other terminals finish transmission + DIFS. The terminal can start its transmission when the counter reaches to zero.

5: DataLink Layer 5a-17 “Taking Turns” MAC protocols Polling: r master node “invites” slave nodes to transmit in turn r Request to Send, Clear to Send msgs r concerns: m polling overhead m latency m single point of failure (master) Token passing: r control token passed from one node to next sequentially. r token message r concerns: m token overhead m latency m single point of failure (token)