IEEE Standard 802 For LANs and

MANs
IEEE has standardized a number of local area networks and
metropolitan area networks under the name of IEEE 802
• 802.1 std:-introduction to set of stds & defines interface
primitives
• 802.2 std:-describes upper part of data link layer which uses
LLC (Logical Link Control) protocol
3 LAN stds
– 802.3 std:-CSMA/CD
– 802.4 std:-token bus
– 802.5 std:-token ring

• 802.6 std:-DQDB (Distributed Queue Dual Bus)

• Standards differ at the physical layer, but are compatible at the
data-link layer
 IEEE STANDARD 802.3:
ETHERNET
This is for a 1-persistent CSMA/CD LAN.
This s/m was called Ethernet after the lumiferous ether through which EM
radiation was once thought to propagate.
Xerox, Intel and DEC made a standard for a 10-Mbps Ethernet.
This std formed the basis for 802.3.

802.3 CABLING

Name Cable Max Segment Nodes/seg. Advantages

10 Base 5 Thick Coax 500 m 100 Good for Backbones
10 Base 2 Thin Coax 200 m 30 Cheapest System
10 Base T Twisted Pair 100 m 1024 Easy Maintenance
10 Base F Fiber Optics 2000 m 1024 Best between buildings
 IEEE STANDARD 802.3: ETHERNET
10Base5: thick Ethernet .
• 10Base5means it operates at 10Mbps,uses base band signaling, and can support
segments up to 500 Meters.
• Resembles a yellow garden hose with marking every 205 Ms to show where the
taps go.
• Connections t it are made using vampire taps in which a pin is carefully forced
halfway in to the coaxial cables core.
10Base2: thin Ethernet.
• Bends easily.
• Connections are made using std BNC connector to form T junction.
• Easier to use and more reliable.
• Much cheaper and easy to install
• But it can run for only 200m ,and can handle only 30 m/cs per cable segment.
10BaseT:
• For finding cable breaks all stations have a cable running to the central hub.
• These wires are telephone company twisted pairs.
• These scheme is called 10BaseT
• Hubs are costly
• Max cable length from hub is only 100m
• Popular due to ease of maintanence
10BaseF:
• Uses fiber optics
• Expensive due to cost of connectors & terminators
• It has excellent noise immunity
 Cable topologies a) Linear b) Spine c) Tree d) Segmented

• For large n/ws, multiple cables can be

connected by repeaters
• Repeater is a physical layer device. It receives,
amplifies and retransmits signals in both
directions
 Manchester Encoding
Straight binary encoding with
0 volts for a 0 bit
5 volts for a 1 bit
• Leads to ambiguities
• Two such approaches are called Manchester encoding and
differential Manchester encoding.
• With Manchester Encoding each bit period is divided into
2 equal intervals.
A binary 1 bit is sent by having the voltage set high during the
first interval and low in the second.
A binary 0 is its reverse: first low and then high.
This scheme ensures that every bit period has a transition in the
middle ,making it easy for the rxer to synchronize with the
sender.
Disadvtg: it requires twice as much b/w as straight binary
encoding because the pulses are half the width.
 Manchester Encoding

In Differential ME a 1 bit is indicated by the absence of transition at the start of

the interval.
A 0 bit is indicated by the presence of a transition at the start of the interval.
In both cases there is a transition in the middle as well.
It has better noise immunity..
802.3 baseband systems use Manchester encoding
802.3 MAC Sublayer Protocol

Packet Definition
• Preamble :of 7 bytes-10101010(this produces a square wave of 10MHz for
5.6 microSec to allow the rxer’s clock to synchronize with the sender.)

• Start of frame :10101011 to denote the start of a frame

• Destn/Source Address: supports 2/6 bytes(10Mbps std uses 6 –byte adrs)

• High order bit is 0 for ordinary adrs and 1 for group address.
• When a frame is sent to a group address all the statns in the group receive it
(multicast)
• The address consisting of all 1 bits is reserved for broadcast
• Frame containing all 1s in the destn field is delivered to all stations on the
n/w.

• Length: tells how many bytes are present in the data field ( 0 to a max of
1500)
• A valid frame must be at least 64 bytes long from destn adrs to check sum.
• If the data portion of the frame is less than 46 bytes the pad field is used to
fill out the frame to min size.

• Checksum: is a 32-bit hash code of the data .The check sum algorithm is a
CRC type.
 Packet Definition
Preamble == 7 bytes of 10101010
Start == 1 byte of 10101011
Dest == 6 bytes of MAC address
multicast == sending to a group of stations.
broadcast== (dest = all 1's) to all stations on network
Source == 6 bytes of MAC address
Length == number of bytes of data
Data == comes down from network layer
Pad == ensures 64 bytes from dest addr thru checksum.
checksum == 4 bytes of CRC.
 IEEE STANDARD 802.4:
TOKEN BUS
Drawbacks of 802.3:
• Station have to wait long to send frame
• Frames do not have priorities.

Token Bus
• Need a mechanism to handle real-time, deterministic requirements.
• A ring, with stations take turns in sending frames.
• Uses logical ring on linear cable.
• It is linear or tree-shaped cable onto which the stations are attached.

Mechanism:
• Logically stations are organized into ring with each station knowing the address of the
station to its LEFT and RIGHT.
• When the ring is initialized the highest numbered station may send the first frame.
• Then it passes permission to its immediate neighbor by sending a special control
frame called token
• The token propagates around the logical ring with only the token holder being
permitted to transmit frames.
• Since only 1 station at a time holds the token collisions do not occur.
Token Bus Local ring

17 14 20
Broad band
coaxial cable

This station not

13 11 7 19 currently in the
logical ring
Direction of
token motion
• Physical order in which stations are connected to the cable is not
important.
• Each station receives each frame discarding the ones not
addressed to it
• When a station passes the token ,it sends the token frame
specifically addressed to its logical neighbor in the ring,
irrespective of its physical location on the cable.
• When the stations are first powered on they will not be in the
ring , so the MAC protocol has provisions for adding stations to
and deleting stations from the ring.
• Very complex protocol with each station having to maintain 10
diff timers and 2 dozen internal variables
• States are represented as finite state machines and actions
written in Ada

• Physical layer: uses 75 ohm broadband coaxial cable (cable

TV).
 IEEE STANDARD 802.4:
TOKEN BUS
TOKEN BUS MAC SUBLAYER PROTOCOL:

• When ring is initialized ,stations are inserted in in order of statn address

from highest to lowest.
• Token passing is also from high to low address.
• When a station acquires a token it can transmit frames for a certain amount
of time. Then it must pass the token on
• If frames are short enough several consecutive frames may sent.
• If a station has no data it passes the token immediately upon receiving it.

• It has 4 priority classes: 0, 2, 4, 6( 0 lowest and 6 highest)

• Ie, each station internally being divided into 4 substations, one at each
priority level
• As i/p comes in to the MAC sub layer the data are checked for priority and
routed to one of the four substations
• Thus each substatn maintains its own queue of frames to be txed.
•
• When the token comes into the station thru cable, it is passed
internally to the priority 6 substation, which begin txing first if
it has any.
• When it is done (or timer expires) the token is passed internally
to the priority 4 substn and this process continues until priority
0 substation sent all its frame or its timer has expired
• Proper setting of the various timers ensures that high priority
requests happen first.
• Lower priorities have to live with what is left over
• If higher priority stns does not need all allocated time then
lower priority stns can use them, so it is not wasted
• This priority scheme which guarantees priority 6 traffic used to
implement real-time traffic
802.4 frame format
• Preamble : to synchronize with the sender

• Starting and Ending delimiter : mark boundaries, uses analog encoding of

symbols other than 0s and 1s No length field reqd

• Frame control : distinguish data from ctrl frames. It carries frame priority for
data frame

• Destn/Source Address: supports 2/6 bytes(10Mbps std uses 6 –byte adrs)

• High order bit is 0 for ordinary adrs and 1 for group address.
• When a frame is sent to a group address all the statns in the group receive it
(multicast)
• The address consisting of all 1 bits is reserved for broadcast
• Frame containing all 1s in the destn field is delivered to all stations on the
n/w.

• Data :up to 8182 bytes(2-byte addressing) long and 8174 bytes(6-byte

addresses)

• Checksum: is a 32-bit hash code of the data .The check sum algorithm is a
CRC type.
Logical Ring Maintenance
1. SOLICIT_SUCCESSOR frames-solicits bids from stns that wish to join
ring
• Frame sends senders addr & successors addr
• If no stn responds within slot time, response window is closed & token
holder continues with its normal opns
• If only 1 stn responds, it is inserted and becomes token holders successor
• If more than 1 stn responds simultaneously then collision occurs. Token
holder then runs arbitration algorithm with broadcast of
RESOLVE_CONTENTION frame

2. RESOLVE_CONTENTION frame-this frame is broadcasted to n/w

3. SET_SUCCESSOR frame-to leave the ring

• Eg: stn X with successor S and predecessor P
• X generates SET_SUCCESSOR frame and sends it to P informing that now
onwards S is its successor instead of X
4. CLAIM_TOKEN frame- used for ring initialization and adding new stns
• 1st stn in ring generates this frame
• It creates a token & sets up the ring containing only itself. Then it solicits
bids for new stns
 Problems with logical ring or token

• Stn tries to pass token to stn that has gone down

– After passing the token stn listens to see if its successor either transmits frame
or passes the token
– If it does neither it tries 2nd time
– If that also fails stn transmits WHO_FOLLOWS frame specifying address of
its successor
– When failed stns successor sees WHO_FOLLOWS frame naming its
predecessor, it sends SET_SUCCESSOR frame announcing itself as new
successor
• Token holder goes down taking token with it
– Solved using ring intialization algo
– Each stn has timer that is reset when frame appears on n/w
• Multiple tokens
– Stn holding token notices a transmission from another stn, it discards its token
 IEEE STANDARD 802.5:
TOKEN RING
Wire Center
Logically still ring but physically
each station is connected to the
wire center by a cable containing
(at least) 2 TPs, one for data to
the station and one for data from
the station.
• Inside the wire center are bypass
relays that are energized by
current from the station.
• If the ring breaks or a station goes
down , loss of the drive current
will release the relay and bypass
the station
 TOKEN RING MAC SUBLAYER
PROTOCOL
When there is no traffic on the ring, a 3-byte token circulates endlessly
waiting for a station to seize it by setting a specific 0 bit to a 1 bit ,thus
converting the token into the start-of-frame sequence. then station o/ps
the rest of the normal data frames.
Frame Structure Components -

• SD, ED : Delimiters - have invalid DME(HH and LL) so not

confused as data.
• AC : Access control, containing bits for:
• The token bit
• Monitor bit,
• Priority bits,
• Reservation bits

• FC: Frame control Provides numerous control options.

• Source/Destination addresses/checksum
• same as 802.3 & 802.4.
Frame Structure Components –

FS: Frame status:

Contains A and C bit
When a frame arrives at the i/f of a station with the destn adrs ,the i/f turns on the A bit as it
passes through.
If the i/f copies the frame to the station ,it also turns on the C bit.
When the sending stn drains the frame from the ring ,it examines the A and C bits .3
combinations r possible:
1.A=0 and C=0:destn not present or powered up.
2.A=1 and C=0:destn present but frame not copied
3.A=1 and C=1:destn present and frame copied
Serves as an automatic acknowledgment for each frame..
Priorities -
802.5 has an elaborate scheme for handling multiple priority.
The 3-byte token frame contains a field in the middle byte giving the token priority
RING MAINTENANCE:

Monitor station oversees the ring, but on failure any station can become monitor.
CLAIM_TOKEN is a request to become the new monitor.

Monitor oversees:
• Lost token management - If timer says token not seen in a while,
produce new one.
• Orphan frames - Frame on ring, but sender crashes before draining
frame
• Garbled frame - Monitor drains the frame and issues new token.
• Delay time - Ensures enough delay so whole token fits on ring.
 COMPARISONS OF 802.3, 802.4, AND 802.5:

POSITIVES NEGATIVES

802.3 Large installed base. Has analog requirements.

Simple protocol.
Good configurability.
Passive and cheap cable.
Low latency (no waiting
for token.)
Must detect possible weak remote station.
Minimum size = 64 bytes.
Non-deterministic/no priorities.
Short cable length.
Efficiency drops at higher speeds.

802.4 Highly reliable hardware. Lots of analog.

More deterministic except Complex protocol.
when token is lost. Delay at low load waiting for token.
Supports priorities.
Good throughput and Small installed base.
efficiency.
Cable can support
multiple channels.

802.5 Connections are Centralized control means

Point-to-point. critical component.
Simple engineering. Delay at low load waiting for token.
Fully digital.
Use many media.
Priorities possible.
Short & long frames
possible.
Good throughput and
efficiency.