Scribd
Upload
121 views15 pages

Lecture17 Aloha Ethernet

The document discusses multiple access protocols including ALOHA and its variants pure and slotted ALOHA. It describes how ALOHA works using collision detection and its origins in packet switched radio networks. It also discusses the efficiencies of slotted ALOHA and pure ALOHA and how throughput is maximized in ALOHA. Finally, it introduces carrier sense multiple access (CSMA) protocols as an improvement over ALOHA.

Uploaded by

23wings
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
121 views15 pages

Lecture17 Aloha Ethernet

The document discusses multiple access protocols including ALOHA and its variants pure and slotted ALOHA. It describes how ALOHA works using collision detection and its origins in packet switched radio networks. It also discusses the efficiencies of slotted ALOHA and pure ALOHA and how throughput is maximized in ALOHA. Finally, it introduces carrier sense multiple access (CSMA) protocols as an improvement over ALOHA.

Uploaded by

23wings
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Computer Networks Prof.

Hema A Murthy

Multiple Access Protocols: ALOHA


• ALOHA
pure
slotted
• Basic idea: User transmit whenever they have data
to send
• Collision detection:
– use feed back property to determine collisions
• Originated as part of packet switched radio
networks

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

ALOHA
• Very inefficient: 18%
– Solution: Slotted ALOHA
• Slotted ALOHA
– Time divided into Slots
• Transmission only in slots
• Efficiency : 36%

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

ALOHA

C Collision, Contention

Collision Resolution: Wait random amount of time before


retransmitting
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy

ALOHA: Throughput

t0 t0+t t0+2t t0+3t


t – time required to send a frame
Throughput: maximised when frames across stations of same size

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

ALOHA: Efficiency
• population: infinite number of users
generate frame (in a frame time)
– S frames/frametime
– Assume Poisson Distributed
– S < 1 – only then possible to successfully
transmit.
– S > 1 – almost all frames suffer collision
– G – number of attempts/frame

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

ALOHA: Efficiency
• Throughput: S = GP0
– P0 – Probability that a frame does not suffer
collision
• Low Load:
S ≈ 0
G ≈ S
Low Collisions, few transmissions
• High Load:
G > S
High Collisions, almost every frame collides
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy

ALOHA-Analysis
• Probability of zero frames: e-G
• In an interval two frames long –
– number of frames generated is 2G
• Probability that no other traffic – during
vulnerable period
– P0 = e-2G
– S = G e-2G
• Max Throughput: G = 0.5, S = 1/2a (a is the
propagation delay

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

ALOHA: Throughput vs Load


S (throughput per frame time

0.4 Slotted ALOHA


36.8%
S = G e-G Successful
transmission/frame
Pure ALOHA
0.2 18.9% time S = G P0
S = G e-2G

0 0.5 1 2 3
G (attempts per packet time)

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Carrier Sense Transmission


• ALOHA: Utilisation very poor
– need a better solution
• CSMA – Carrier Sense Multiple Access
Protocols
• CSMA / CD – Additional overhead over
CSMA –
– once collision detected stop transmitting
• Ethernet Xerox Palo Alto Research

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Carrier Sense Transmission


• All stations can detect when a station is idle
/ busy.
• Collision detection (CD)
– collision a host listens as it transmits
– knows when a collision has occurred (change in
signal levels on the line)

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Carrier Sense Transmission


• 1 (p) – persistent CSMA:
– When station has data to send – listens
• busy – then wait
• idle – transmit
– Collision occurs
– wait random amount of time and then retransmit
• 1 (p) – persistent:
– station transmits with a probability 1 (p) – when idle

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Carrier Sense Transmission


• Issues – propagation delays become worse
with large a.
– two stations back off for same time retransmit
more collision

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Ethernet: Miscellaneous
• Cable: 10/100 Base T
– 10/100 Mbps
– T – twisted pair
• Splice T-joint in cable
– Cables are connected to machines which connect to a
hub
– Maximum cable length from machine to hub
• 100m
• Encoding: Manchester encoding

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

A Typical Ethernet LAN


...

...

...

Repeater ... Terminator

Terminators attached at the end of each segment absorb the signal


Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy

Hub based communication

Hub Hub

multiway repeaters

daisy chain a number of hosts


•almost like a star
•data transmitter on one segment received by every body else
•single channel multi access
•same collision domain

Indian Institute of Technology Madras

You might also like