0% found this document useful (0 votes)
16 views38 pages

6,7

The document discusses the fundamentals of link-layer protocols, focusing on Ethernet LAN technology and its components such as nodes, links, and network adapters. It covers key issues in data-link networks, including encoding, framing, error detection, and reliable delivery, as well as various multiple access methods like CSMA/CD. Additionally, it explains the MAC protocol and collision recovery mechanisms, emphasizing the efficiency and versatility of Ethernet in practical applications.

Uploaded by

prudhvitaduvai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views38 pages

6,7

The document discusses the fundamentals of link-layer protocols, focusing on Ethernet LAN technology and its components such as nodes, links, and network adapters. It covers key issues in data-link networks, including encoding, framing, error detection, and reliable delivery, as well as various multiple access methods like CSMA/CD. Additionally, it explains the MAC protocol and collision recovery mechanisms, emphasizing the efficiency and versatility of Ethernet in practical applications.

Uploaded by

prudhvitaduvai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 38

Topic 2: Direct Link

Network
Lecture 1
Link-layer Basics
Ethernet LAN technology

datagram Link layer protocol


Adapter Adapter
frame frame
Sender Receiver
Reca p Network’s definition

A network can be defined


recursively as two or more
nodes connected by a
physical link, or by two or
more networks connected
by one or more nodes.
Reca p Nodes /Links
Nodes that utilize the network
Hosts, PCs, etc.
Reca p Nodes /Links
Nodes implementing the network
Switches/ Routers, etc.
Reca p Nodes/ Links

Point to Point Link

Multiple-access Link
Topic’s objectives
find out the answers to:

1 - How to use nodes and links as


building blocks of creating
scalable direct-link networks ?

2 - How the Ethernet LAN


technology works ?
Fundamental issues in
Data-link networks
Fundamental data-link
problems
1. Encoding

2. Framing

3. Error detection

4. Reliable

delivery
5. Access

Mediation
Network Adapter
Responsible for the mentioned link-layer tasks

Also, called Network Interface Card (NIC)


Which transmission link to
use?

Wired LAN
Encoding
How to encode bits into signals that the link can carry
Framing
Error Detection
Basic mechanism is to add redundancy to

determine errors.
Reliable Transmission

Fundamental
mechanisms:
1. Acknowledgements

2. Timeouts
Automatic Repeat Request (ARQ)
Shared access networks:
Ethernet
Example Multiple Access
Links

Shared RF
(e.g., 802.11 WiFi)
Shared wire
(e.g., cabled
Ethernet)

Shared acoustical
waves
Shared RF
Different approaches to MAC
Three broad classes:
• Channel Partitioning
– Divide channel into smaller “pieces”
(time slots, frequency, code) and
allocate for exclusive use
• Random Access
– Channel not divided, allow (and recover
from) collisions
• “Taking turns”
Random Access Protocol
• When node has packet to send
– transmit at full channel data rate R.
– no a priori coordination among nodes

• Random access MAC protocol


specifies:
– how to detect collisions
– how to recover from collisions (e.g.,
via delayed retransmissions)

• Examples of random access MAC


Ethernet Standardization

802.3 Standard

10 Mbps – Ethernet
100 Mbps – Fast Ethernet
1 Gbps – Gigabit Ethernet
CSMA/CD (Collision
Detection)
CSMA/CD: carrier sensing, collision
detection
 “Collisions” detected within short time
 Colliding transmissions aborted
Human analogy: the polite conversationalist
Collision detection:
 Easy in wired LANs (used in Ethernet)
How do collisions occur?
Propagation delay:
d
Thicknet – 10Base5

Controller

Vampire Tap

Ethernet Bus
Transceiver

Segment length < 500m


Ethernet Repeater
Max Segment length: 500 m
Thinnet – 10Base2

Transceiver Controller

BNC T-Junction Ethernet Bus

Segment length < 200m


Twisted Pair – 10BaseT

Controller

Segment length
< 100m
Hub: multi-port repeater
Ethernet Hub

Single collision domain


Ethernet Switch

Collision Collision
domain domain

Bridge/
Switch

To be studied when we get to Packet Switching (Topic 3)


MAC protocol

Metcalfe’s Original Ethernet


MAC Address
 MAC Address: 48 bits (Ethernet)
 Organizationally Unique Identifier (initial 24
bits) ensures that MAC addresses are unique
 Every Ethernet host has a unique address
 Flat addressing -> does not facilitate routing
 ff-ff-ff-ff-ff-ff -> link-layer broadcast address
Receiver Algorithm at NIC

An Ethernet NIC receives all frames but accepts:


1. Frames addressed to its own address
2. Frames addressed to the broadcast address
3. Frames addressed to a multicast address,
if instructed to listen to that address
4. All frames, if placed in promiscuous mode
Transmit Algorithm: CSMA/
CD
1. If NIC senses channel idle, starts
transmission
2. If NIC senses channel busy, waits until
channel idle, then transmits
3. If NIC transmits entire frame detecting
no another transmission, NIC is done
with frame.
Transmit Algorithm: CSMA/
CD
4. If NIC detects another transmission while
transmitting, aborts and sends jam signal
5. After aborting, NIC enters exponential
backoff: after mth collision, K is chosen
randomly from {0,1,2,…,2m-1}. NIC waits
K·512 bit times, returns to Step 1.
Recovery from Collisions
Exponential Backoff:
 Goal: adapt retransmission attempts to
estimated current load
heavy load: random wait will be longer
 first collision: choose K from {0,1}; delay is
K x 512 bit transmission times
 after second collision: choose K from {0,1,2,3}
 after ten collisions: choose K from {0,1,2,3,4,
…,1023}
Collisions – worst case
scenario
Propagation
delay: d A sends a frame at
t

A’s frame arrives at


B
at t + d
B sends a frame at t
+d causing a
collision
B’s runt (32 bit)
arrives at A at t+2d
Minimum sized Ethernet
frame
Propagation
delay: d

An Ethernet station must transmit for at least


2d time to be able to detect a collision

The maximum RTT for 10Base5 is 51.2 us;


therefore min frame size = 512 bits (64 bytes)
Experience with Ethernet

1. Simple decentralized and cheap

methodology

2. In practice: nodes < 200; distance

<< 2500 m; dprop is as low as 5 us

3. In such condition, Ethernet

performs very well.


4. Very versatile; started with 3 Mbps
References

Section 2.6:
Direct Link
Networks [P&D]

Chapter 5:
Link Layer and
LANs [K&R]
?? ns /
sti o
u e
Q si o n s?
u
?
o nf
C
or u m
f
on g.com /
th e u s s i in
Us e d c
iosmpnet s . n
at:te/
/c e n t 20si
p: /
ge m e3
htt
l e dsite/c s
n owom/
A c k .c
s / le
dit s.go o g
:

You might also like