CE3716 COMPUTER

NETWORKS
5

1
 Ethernet Networks

 A highly standardized popular network technology today

 Governed by the IEEE 802.3 standard
 Physical implementation Either Star or Bus, each has its
own advantage

2
 Communication Channels

Ethernet Frame

In a single channel

3
A Typical Ethernet Frame Format

Sender’s address

Preamble body

Frame Type

Receiver’s address CRC Trailer

4
Ethernet Frame Format used for TCP/IP Communication
Frame Components
 Preamble
8 byte to synchronize receiver before actual data is sent
 Destination address & Source address
byte, MAC address assigned to each adapter by 6
manufacturer e.g 8:0:e4:b1:2
 Type
Network layer protocol identifier, Usually IP (but also
Novell IPX, AppleTalk
 Body
can contain up to (46-1500) bytes of data
 Trailer (cycle redundancy check-code)
5
Receiver checks & simply drops frames with errors
 Network performance
Max size Min size Frame size (bytes)
frame frame Field
8 8 Preamble
6 6 Destination address
6 6 Source address
2 2 Length or type
1500 46 Data
4 4 Frame check sequence
1526 72 Total size

IEEE 802.3 (Ethernet) frame format

 Theframe size can vary from a minimum of 72 to a maximum of
1526 bytes.
Under Ethernet and 802.3 standards there is a dead time of 9.6
between frames.
6
 Using the frame size and dead time between frames you can
compute the maximum number of frames per second that can
flow on an Ethernet network.

[sec]

[frame/sec]

7
 For our example, let us assume we have a 10 Mbps LAN, such as
a 10base2 allows for 9.6 µs between frames, There is a bit time
of 100 ns (this is the time required to transmit one bit of
information). Assume all frames are at the maximum length of
1526 bytes. Thus the time required by a frame to be send is

 Theframe requires 1.23 ms then in one second (1000 ms) there can
approximately
= 812 frame/sec
The maximum transmission rate is 812 frames per second
Transmission rate in bytes 812* 1526 = 1,239,112 bytes/sec

What is the rate in bit/sec when the frame is at its minimum length ? 
8
 Access Method and Speed
 IEEE 802.3
Ethernet 10 Mbps
 IEEE 802.3u
Mbps 100
Also known as fast Ethernet
 IEEE 802.3z
Gbps 1
Also known as gigabit Ethernet
 IEEE 802.3ae
9 Ethernet 10 Gbps
Mbps IEEE 802.3 Implementations 10
§ 10BaseT
Twisted pair implementation
Maximum length 100 meters
§ 10Base2
Thin coaxial implementation
Maximum segment length 185 meters

§ 10Base5
Thick coaxial implementation
 Used as the Backbone


§ 10BaseFL
Fiber implementation
10
Mbps IEEE 802 Implementations 100

 100BaseTX
uses 2 pair Cat 5 UTP or STP
known as Fast Ethernet
 100BaseT4
Uses 4 pairs of regular Cat 3, 4, or 5 UTP

The network of choice at present is Gigabit Ethernet that is

gradually replacing 100BaseTx networks

11
Network Operating Systems for Ethernet
Networks
 Microsoft operating systems
 Peer-to-peer
 Client-server
 Unix/ Linux operating system

12
 Peer-to-Peer
Windows Workgroup 3.11
Windows 9x (95, 98, etc.)
Windows NT Workstation
 Client-Server
Windows NT Workstation for small LANs
Windows NT Server
Small Business Server
A combination of NT Server, Exchange Server etc.

13
Media Access Control (MAC) Schemes

MAC describes how to regulate the communication among

nodes
 Token ring
 Slotted Aloha
 Carrier sense multiple access
 Switching

14
 Slotted Aloha

 node decides to transmit independently of other nodes

attached to broadcast channel

 node does not pay attention whether another node is

transmitting (CSMA does)

 node does not stop transmitting if another node begins to

interfere with its transmission (CSMA/CD does)

15
16
Carrier Sense Multiple Access/Collision Detection
CSMA/CD
It is Ethernet’s Media Access Control (MAC) policy.
polite version of slotted Aloha
listens to line before/during sending
 If line is idle (no carrier sensed)
• send packet immediately
 If line is busy (carrier sensed)
• wait until idle and transmit packet immediately
 If collision detected (when two adaptors transmit at the
same time)
• Stop sending data and send Jam Signal and wait random
Back-off period
17 • Try again later
 It reduces the possibility of collision but it cannot eliminate it.
 Collision can only happen when more than one station begin
transmitting within a short time (the propagation time period )

  

So how long does it take to detect a collision? 

In the worst case, twice the maximum propagation delay of the
medium
18
  Latency depends on physical length of link
Time to propagate a packet from one end to the other
 Suppose A sends a packet at time t
And B sees an idle line at a time just before t +a, so
happily starts transmitting a packet
B detects a collision, and sends jamming signal
But A can’t see collision until t +2a

19
CSMA/CD

20 CSMA/CD Scenario Flow chart of CSMA/CD

algorithm
 Performance of CSMA/CD
 Increased propagation delay ⇒increased chance of collisions
 Rough estimate for Channel efficiency [E] is
1
efficiency 
1  5 * t prop / ttrans

 Theoretically the protocol cannot achieve a efficiency of 1

(100%)!!!  since this would mean zero propagation and or
infinite transmission delay, but  can be approached by making
the ratio of the propagation delay over the transmission delay the
smallest as possible.
 For a given distance the speed fixes a lower bound for the
propagation delay therefore the only degree of freedom is the
transmission delay (decrease BW or increase File size).
21