Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 6 / 20. okt 2004

Slides:



Advertisements
Similar presentations
LECTURE 11 CT1303 LAN. DYNAMIC MAC PROTOCOL No fixed assignment for transmission media or any network resources.. It allows transmission when needed.
Advertisements

5-1 Link Layer: Introduction Some terminology: r hosts and routers are nodes r communication channels that connect adjacent nodes along communication path.
1 Pertemuan 13 Teknik Akses Jaringan - Random Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Wireless & Mobile Networking: Multiple Radio Access Azizol Bin Abdullah (A2.04) Rujukan: Text Book Chapter 6.
MAC Protocols Media Access Control (who gets the use the channel) zContention-based yALOHA and Slotted ALOHA. yCSMA. yCSMA/CD. TDM and FDM are inefficient.
15 – Data link layer Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Review r Multicast Routing m Three options m source-based tree: one tree per source shortest path trees reverse path forwarding m group-shared tree: group.
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:
Teknik Akses Jaringan - Non Carrier Sense Pertemuan 11 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
DataLink Layer session 1 TELE3118: Network Technologies Week 2: Data Link Layer Framing, Error Control, Multiple Access Some slides have been taken.
Review r Multicast Routing m Three options m source-based tree: one tree per source shortest path trees reverse path forwarding m group-shared tree: group.
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.
16 – CSMA/CD - ARP Network Layer4-1. 5: DataLink Layer5-2 CSMA (Carrier Sense Multiple Access) CSMA: listen before transmit: If channel sensed idle: transmit.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
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.
1 Mao W07 Multiple Access EECS 489 Computer Networks Z. Morley Mao Wednesday Feb 21, 2007 Acknowledgement:
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.
Multiple Access Protocols Chapter 6 of Hiroshi Harada Book
1 Computer Communication & Networks Lecture 12 Datalink Layer: Multiple Access Waleed Ejaz
4-1 Last time □ Link layer overview ♦ Services ♦ Adapters □ Error detection and correction ♦ Parity check ♦ Internet checksum ♦ CRC □ PPP ♦ Byte stuffing.
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.
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.
1 Kommunikatsiooniteenuste arendus IRT0080 Loeng 2 Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Medium Access Control Sub Layer
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 The Data Link Layer Chapter 5 Kurose and Ross Today 5.1 and 5.3.
Multiple Access Links and Protocols
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.
Data Link Layer. Useful References r Wireless Communications and Networks by William Stallings r Computer Networks (third edition) by Andrew Tanenbaum.
Ch 12. Multiple Access. Multiple Access for Shared Link Dedicated link – Point-to-point connection is sufficient Shared link – Link is not dedicated –
LECTURE9 NET301 11/5/2015Lect 9 NET DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies.
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.
Chapter 13 Multiple Access.
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.
EEC-484/584 Computer Networks
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.
Kommunikatsiooniteenuste arendus IRT0080
Multiple Access Methods
CT301 LECTURE 8.
Chapter 5 Link Layer and LANs
Part III Datalink Layer 10.
Chapter 5: The Data Link Layer
Multiple Access Mahesh Jangid Assistant Professor JVW University.
Channel Allocation (MAC)
CS 457 – Lecture 6 Ethernet Spring 2012.
Net301 lecture9 11/5/2015 Lect 9 NET301.
Chapter 5: The Data Link Layer
Services of DLL Framing Link access Reliable delivery
Multiple access.
2017 session 1 TELE3118: Network Technologies Week 2: Data Link Layer Framing, Error Control, Multiple Access Slides have been adapted from: Computer.
2012 session 1 TELE3118: Network Technologies Week 2: Data Link Layer Framing, Error Control, Multiple Access Some slides have been taken from: Computer.
EEC-484/584 Computer Networks
Multiple Access Methods
Overview Jaringan Komputer (3)
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
Multiple Access Methods
Link Layer: Multiple Access
Chapter 6 Multiple Radio Access.
Part III Datalink Layer 10.
Chapter 12 Media Access Control (MAC)
Chapter 12 Media Access Control (MAC)
Presentation transcript:

Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 6 / 20. okt 2004 Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst. avo.ots@ttu.ee

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

Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division,Code Division, Frequency Division Random partitioning (dynamic), ALOHA, S-ALOHA, CSMA, CSMA/CD carrier sensing: easy in some technologies (wire), hard in others (wireless) CSMA/CD used in Ethernet Taking Turns polling from a central site, token passing

Slotted ALOHA Operation Assumptions all frames same size time is divided into equal size slots, time to transmit 1 frame nodes start to transmit frames only at beginning of slots nodes are synchronized if 2 or more nodes transmit in slot, all nodes detect collision Operation when node obtains fresh frame, it transmits in next slot no collision, node can send new frame in next slot if collision, node retransmits frame in each subsequent slot with prob. p until success

Slotted ALOHA Cons collisions, wasting slots idle slots Pros nodes may be able to detect collision in less than time to transmit packet Pros single active node can continuously transmit at full rate of channel highly decentralized: only slots in nodes need to be in sync simple

Slotted Aloha efficiency Efficiency is the long-run fraction of successful slots when there’s many nodes, each with many frames to send For max efficiency with N nodes, find p* that maximizes Np(1-p)N-1 For many nodes, take limit of Np*(1-p*)N-1 as N goes to infinity, gives 1/e = .37 Suppose N nodes with many frames to send, each transmits in slot with probability p prob that 1st node has success in a slot = p(1-p)N-1 prob that any node has a success = Np(1-p)N-1 At best: channel used for useful transmissions 37% of time!

Throughput 0.368 S Slotted Aloha 0.184 Aloha G

Channel Sharing Techniques Static Channelization Channel Sharing Techniques Scheduling Dynamic Medium Access Control Random Access

Classification of Multiple Access Protocols Contention-based Conflict-free Random access Collision resolution ALOHA, CSMA, BTMA, ISMA, etc TREE, WINDOW, etc FDMA, TDMA, CDMA, Token Bus, DQDB, etc BTMA: Busy Tone Multiple Access ISMA: Internet Streaming Media Alliance DQDB: Distributed Queue Dual Bus

RTS/CTS Node A Node B RTS Propagation delay CTS Data ACK

http://www.isi.edu/nsnam/ns/