cmpe 150- introduction to computer networks 1 cmpe 150 fall 2005 lecture 15 introduction to computer...

1CMPE 150- Introduction to Computer Networks

CMPE 150

Fall 2005Lecture 15

Introduction to Computer Networks

2CMPE 150- Introduction to Computer Networks

Announcements

• Midterm moved to 11.04.– In class, closed books/notes.

• Homework 3 is up.– Due on 11,07.05.

3CMPE 150- Introduction to Computer Networks

Today

• MAC.

4CMPE 150- Introduction to Computer Networks

Example DLL Protocols

5CMPE 150- Introduction to Computer Networks

Example DLL Protocols

• High-Level Data Link Control (HDLC).• Point-to-Point Protocol (PPP).

6CMPE 150- Introduction to Computer Networks

HDLC

Flag

Identifieshost.

ACK,seq. #

CRC

ISO standard.

7CMPE 150- Introduction to Computer Networks

PPP

• Internet’s DLL.• Router-to-router.• Home user-to-ISP.• RFC 1661, etc.

• PPP is a multi-protocol framing mechanism that can be used over multiple PHYs (dial-up, dedicated point-to-point connections).

8CMPE 150- Introduction to Computer Networks

The Data Link Layer in the Internet

9CMPE 150- Introduction to Computer Networks

PPP Frame

Defaultvalue; noneed for addresses.

Default value:unumbered frame;No reXmissions.

Type of protocolin the payload

10CMPE 150- Introduction to Computer Networks

Medium Access Control

• MAC.• Tanenbaum, Chapter 4.

11CMPE 150- Introduction to Computer Networks

Why MAC?

• Point-to-point versus shared-medium networks.

• Shared-medium networks use “broadcast” channels.– A.k.a. multi-access or random access

channels.

MAC layer protocols regulate access to medium in shared-medium networks.

12CMPE 150- Introduction to Computer Networks

Where is the MAC Sub-Layer?

MAC

13CMPE 150- Introduction to Computer Networks

Where is the MAC Sub-Layer?

MAC

PHY

DLL Link Control

Network

Transport

Application

14CMPE 150- Introduction to Computer Networks

MAC and LANs

• LANs typically use shared-medium.• Examples?• MAC layer critical!– BTW, in wireless networks also!

• WANs typically use point-to-point connections.

15CMPE 150- Introduction to Computer Networks

Channel Allocation Problem

• How to allocate single shared, broadcast channel among several stations/users.

• If no arbitration, several stations/users may transmit at the same time: COLLISIONS!

• A.k.a., “floor control”.

16CMPE 150- Introduction to Computer Networks

Multiplexing

• Sharing a link/channel among multiple source-destination pairs.

• Example: high-capacity long-distance trunks (fiber, microwave links) carry multiple connections at the same time.

MU

X

...

DE

MU

X ...

17CMPE 150- Introduction to Computer Networks

Multiplexing Techniques

• 3 basic types:– Frequency-Division Multiplexing (FDM).– Time-Division Multiplexing (TDM).

– Statistical Time-Division Multiplexing (STDM).

Static

Dynamic

18CMPE 150- Introduction to Computer Networks

FDM

Time

Frequency

1 2 N

19CMPE 150- Introduction to Computer Networks

FDM

• Simple.

• But:– What if number of users is large?

– What if number of users changes over time?

– What if traffic is bursty?

20CMPE 150- Introduction to Computer Networks

TDM

Time

Frequency

12

N

21CMPE 150- Introduction to Computer Networks

TDM (Cont’d)

• Time divided into time slots.• One or more slots assigned to a data source.

• But, also inefficient…

1 2 N... 1 2 ... N

frame Time

U1 U2 ... UN

22CMPE 150- Introduction to Computer Networks

Dynamic Multiplexing

• Dynamic allocation.

• In particular, statistical TDM.–Dynamically allocates time slots on

demand.

• Increased channel utilization.

• But…

23CMPE 150- Introduction to Computer Networks

Multiple Access Protocols

• Centralized approaches:– Controller grants access to medium.

– Simple, greater control: priorities, QoS.

– But, single point of failure and performance bottleneck.

• Decentralized schemes:– All stations collectively run MAC to decide

when to transmit.

24CMPE 150- Introduction to Computer Networks

Round-Robin MAC

• Each station is allowed to transmit; station may decline or transmit (bounded by some maximum transmit time).

• Centralized (e.g., polling) or distributed (e.g., token ring) control of who is next to transmit.

• When done, station relinquishes and right to transmit goes to next station.

• Efficient when many stations have data to transmit over extended period (stream).

25CMPE 150- Introduction to Computer Networks

Scheduled-Access MAC

• Time divided into slots.• Station reserves slots in the future.• Multiple slots for extended transmissions.• Suited to stream traffic.

26CMPE 150- Introduction to Computer Networks

Contention-Based MAC

• No control.• Stations try to acquire the medium.• Distributed in nature.• Perform well for bursty traffic.• Can get very inefficient under heavy load.

27CMPE 150- Introduction to Computer Networks

Contention-Based MACs

• ALOHA family.• CSMA family.

28CMPE 150- Introduction to Computer Networks

Pure ALOHA

• In pure ALOHA, frames are transmitted at completely arbitrary times.

29CMPE 150- Introduction to Computer Networks

Pure ALOHA: Performance

• Vulnerable period for the shaded frame.

30CMPE 150- Introduction to Computer Networks

Pure ALOHA

• Throughput versus offered traffic for ALOHA systems.