Data Communication Networks

Slides:



Advertisements
Similar presentations
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
Advertisements

The ALOHA Protocol “Free for all”: whenever station has a frame to send, it does so. –Station listens for maximum RTT for an ACK. –If no ACK after a specified.
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Multiple access What if multiple machines are sharing the same link?
Multiple Access Methods. When nodes or stations are connected and use a common link (cable or air), called a multipoint or broadcast link, we need a.
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
1 K. Salah Module 4.2: Media Access Control The Media Access Control (MAC) sublayer –Random Access (CSMA), IEEE –Token Passing, IEEE Ch 13-
Chapter 12 Multiple Access Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols.
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.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 13 Multiple Access.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Semester EEE449 Computer Networks The Data Link Layer Part 2: Media Access Control En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex,
Medium Access Control Sublayer
Chapter 12 Multiple Access Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols.
LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.
LOCAL AREA NETWORKS. CSMA Carrier Sense Multiple Access To minimize the chance of collision and, therefore, increase the performance, the CSMA method.
LOCAL AREA NETWORKS. MEDIUM ACCESS CONTROL All LANs and MANs consist of collections of devices that must share the network’s transmission capacity. Some.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Unit-II Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
LOCAL AREA NETWORKS. CSMA/CD Carrier Sense Multiple Access with Collision Detection The CSMA method does not specify the procedure following a collision.
Medium Access Control Sub Layer
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Multiple Access.
Data Communications, Kwangwoon University12-1 Chapter 12. Multiple Access 1.Random Access 2.Controlled Access 3.Channelization.
1 Kyung Hee University Chapter 12 Multiple Access.
Chapter 6 Multiple Radio Access
LOCAL AREA NETWORKS. CSMA/CA In a wired network, the received signal has almost the same energy as the sent signal because either the length of the cable.
1 Kyung Hee University Chapter 12 Multiple Access.
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.
Chapter 12 Multiple Access
Chapter 13 Multiple Access.
Chapter 12 Media Access Control (MAC)
UNIT 3 MULTIPLE ACCESS Adapted from lecture slides by Behrouz A. Forouzan © The McGraw-Hill Companies, Inc. All rights reserved.
Multiple Access. Figure 12.1 Data link layer divided into two functionality-oriented sublayers.
COMPUTER NETWORKS Data-link Layer (The Medium Access Control Sublayer) MAC Sublayer.
Lecture Focus: Data Communications and Networking  Data Link Layer  Media Access Control (MAC) Lecture 23 CSCS 311.
Multiple Access By, B. R. Chandavarkar, CSE Dept., NITK, Surathkal Ref: B. A. Forouzan, 5 th Edition.
Data Link Layer Lower Layers Local Area Network Standards
Part III. Data Link Layer
Multiple Access Methods
Data link layer divided into two functionality-oriented sublayers
Chapter 12 Multiple Access.
Lab 7 – CSMA/CD (Data Link Layer Layer)
Chapter 12 Multiple Access
Part III Datalink Layer 10.
Multiple Access Mahesh Jangid Assistant Professor JVW University.
Subject Name: Computer Communication Networks Subject Code: 10EC71
Chapter 12 Multiple Access
Net301 lecture9 11/5/2015 Lect 9 NET301.
Services of DLL Framing Link access Reliable delivery
Chapter 12 Multiple Access
Figure 12.1 Data link layer divided into two functionality-oriented sublayers Networks can be divided into two categories: those using point-to-point.
THE IEEE MAC SUB-LAYER – chapter 14
Multiple Access Methods
Chapter 12 Multiple Access
Chapter 12 Multiple Access
Multiple Accesses When nodes or stations are connected and use a common link, called a multipoint or broadcast link, we need a multiple-access protocol.
Channel Allocation Problem/Multiple Access Protocols Group 3
Channel Allocation Problem/Multiple Access Protocols Group 3
CSE 313 Data Communication
CSE 313 Data Communication
Multiple Access Methods
CARRIER SENSE MULTIPLE ACCESS (CSMA)
Chapter 6 Multiple Radio Access.
Dr. John P. Abraham Professor UTPA
Part III Datalink Layer 10.
Chapter 12 Media Access Control (MAC)
Chapter 12 Media Access Control (MAC)
Presentation transcript:

Data Communication Networks Lec 16 and 17

Multiple Access Assumed that there is available dedicated link between sender and receiver. Assumptions is not always true. If we use our cellular phone to connect to another cellular phone, the channel is not dedicated , a person a few feet away from us use the same channel to talk to her friend.

Multiple access Data link layer is divided into two sub layers. The upper sublayer is responsible for data link control And lower sublayer is responsible for resolving access to the shared media. If channel is dedicated , we do not need the lower sublayer.

Multiple access

Multiple access The upper sublayer is responsible for flow and error control is called logical link control(LLC). The lower sublayer is responsible for multiple access resolution us called media access control(MAC)layer. When stations are connected and use a common link, called a multipoint , we need multiple-access protocol to coordinate access to link. Rules of speaking.

Multiple-access protocols

Random access protocols In RS or contention methods, no station is superior to another, none assign control. No permit, does not permit another station to send. The station has to use procedure defined by protocol to make decision on whether or not to send. Idle or busy.

Random access protocols No scheduled time for stations to transmit, called random access. No rules specify which station to send next, stations compete with one another to access the medium, called contention methods. Every one has right, if more than one stations tries to send , there is access conflict –collision. Frames will be destroyed or modified.

Random access

Random access The random access methods evolve from ALOHA. Method improved with the addition of , that forces the station to sense the medium before transmitting , called carrier sense multiple access. CSMA/CD, tells the station what to do when a collision is detected CSMA/CA, tries to avoid the collision.

ALOHA Earliest, random access method, developed by university of Hawaii in 1970. Designed for radio(wireless)LAN , can be used on any shared medium.

Pure ALOHA Each station sends a frame whenever it has a frame to send . However, since there is only one channel to share , possibility of collision between frames from different stations. ALOHA relies on acknowledgements from the receiver. If acknowledgement does not arrive after time-out period , the station assume that frame is destroyed and resend the frame.

ALOHA The protocol dictates that when time-out period passes , each station waits a random amount of time before resending its frame. This randomness will avoid more collisions , called back off time. It again uses second method to prevent congestion with transmitted frames, after maximum number of retransmission attempts, a station give up and try again.

CSMA The station sense the medium before trying to use it. First listen to the medium before sending it. “sense before transmit” or “listen before talk” Reduce the possibility , cannot eliminate it. Because of propagation delay; when a station sends a frame , it takes time for a first bit to reach every station and for every station to sense it.

CSMA

CSMA A station may sense the medium and finds it idle, only because the first bit sent by another station has not been received.

Vulnerable time It is propagation time. Time needed for a signal to propagate from one end of the medium to the other.

Vulnerable time in CSMA

Flow charts

Carrier sense Multiple Access with Collision Detection (CSMA/CD) Augments the algorithm to handle collision. The station monitors the medium and sends a frame to see if the transmission was successful. If collision , frame is send again.

CSMA/CD

CSMA/CD At time t 1, station A has executed its persistence procedure and starts sending the bits of its frame. At time t2, station C has not yet sensed the first bit sent by A. Station C executes its persistence procedure and starts sending the bits in its frame, which propagate both to the left and to the right. The collision occurs sometime after time t2' Station C detects a collision at time t3 when it receives the first bit of A's frame. Station C immediately (or after a short time, but we assume immediately) aborts transmission.

CSMA/CD When a host has a packet to transmit: 1. Carrier Sense: Check that the line is quiet before transmitting. 2. Collision Detection: Detect collision as soon as possible. If a collision is detected, stop transmitting; wait a random time, then return to step 1.

Collision and abortion in CSMA/CD

Carrier sense Multiple Access with Collision Avoidance (CSMA/CA) Use 3 strategies interframe space Contention window Acknowledgement

IFS Collisions are avoided by deferring transmission even if the channel is found idle. Wait for a period of time called IFS. Even though the channel may appear idle a distant station may have already started transmitting after the IFS time the channel is still idle, the station can send.

IFS In CSMA/CA, the IFS can also be used to define the priority of a station or a frame.

Contention Window The amount of time divided into slots. The station that is ready to send chooses a random number of slots as its wait time. Uses backoff strategy This means that it is set to one slot the first time and doubles each time the station can not detect an idle channel after the IFS time. Similar to p-persistent method expect that the random outcome defines the number of slots taken by the waiting station.

Contention Method station needs to sense the channel after each time slot. However, if the station finds the channel busy, it does not restart the process; it just stops the timer and restarts it when the channel is sensed as idle. This gives priority to the station with the longest waiting time.

it stops the timer and restarts it when the channel becomes idle. In CSMA/CA, if the station finds the channel busy, it does not restart the timer of the contention window; it stops the timer and restarts it when the channel becomes idle.

Acknowledgements Positive ACK guarantees that the receiver has received the frame.