NSS Lecture 2

Dr. Padmalochan Bera

Network Delays
Network Delays
Network Delays
Network Delays
Network Delay
Network Delay
MAC
MAC
MAC
MAC
CSMA
CSMA Performance
CSMA performance
CSMA Performance
A and B are the only two stations on an Ethernet. Each has a steady queue of
frames to send. Both A and B attempt to transmit a frame, collide, and A wins
the first backoff race. At the end of this successful transmission by A, both A
and B attempt to transmit and collide. The probability that B wins the second
backoff race is:

A (0,1) [0 B (0,1) [1
2nd attempt B (0,1,2,3) 1/8
Consider a selective repeat sliding window protocol that uses a frame size of
1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To
achieve a link utilization of 60%, the minimum number of bits required to
represent the sequence number field is ________.

U = w/(1+2a) tp = tf = w = 2m-1
Suppose the round trip propagation delay for a 8 Mbps Ethernet having
48-bit jamming signal is 45 μs. The minimum frame size is:
• Station A needs to send a message consisting of 9 packets to Station B
using Go-Back 3 (window size 3) strategy. All packets are ready and
immediately available for transmission. If every 5th packet that A transmits
gets lost, then what is the total number of packets that A will transmit for
sending the message to B? if selective repeat is used with window size =
4, how many packets will be retransmitted?
• Two parties uses the Stop-n-Wait ARQ for reliable transmission of frames
with piggybacking. Frames are of size 1000 bytes and transmission rate is
80 kbps (1 kbps = 1000 bits/sec). Size of an acknowledgement (ack) is
100 bytes and the one-way propagation delay is 100 ms. Assuming no
frame is lost; calculate the utilization of the client. if every alternate frame
is lost what will be the channel utilization?
The optimal transmission probability in Slotted Aloha depends upon the
length of the time slots.

The optimal transmission probability in Slotted Aloha depends on the

number of contending stations.
Why there is a practical limit to the number of hosts a single Ethernet link
can support?
All hosts are in the same collision domain, so MAC efficiency decreases
The link bandwidth must be shared among all the hosts
Need to cap the binary exponential backoff at some point
• Suppose, nodes in slotted-Aloha transmit in each slot with probability p. Suppose that a
given channel has exactly 8 nodes. What is the probability that there is a collision in a
given slot?

• 1 − 8p(1 − p)7 − (1 − p)8

There are n stations in a slotted LAN. Each station attempts to transmit with a probability p in
each time slot. What is the probability that NO station transmits in a given time slot?
(1-p)n
• In MACAW protocol, a node set network allocation vector (NAV) to
- To estimate how long the channel will be not available
- To inform other nodes not to transmit
- To inform its state to Access point (AP)
• In MACAW protocol, SIFS is smaller than DIFS to
-ensure no other device transmit before the receiver can transmit its
ACK
-ensure no other device communicate to AP before the receiver can
transmit its ACK
-ensure no other device is in sleep mode
• sender sends a window of packets to a receiver R and receives the following ACKs
in response
• 101, 102, 103, 104, 104, 105, 106, 107, 108….
• Which is the best possible options? (Assume there is no other error or losses in the
network beyond mentioned in the options)
• Packet 105 was lost
• Packet 105 was delayed
• Either one of these
• A sender sends a window of packets to a receiver R and receives the
following ACKs in response
• 101, 102, 103, 104, 104, 104, 104….
• Which is the best possible options?
• Packet 105 was lost
• Packet 105 was delayed
• Either one of these
• A sender sends a window of packets to a receiver R and receives the
following ACKs in response
• 101, 102, 103, 104, 105, 106, 104….
• Which is the best possible options?
Packet 105 was delayed
Ack with sequence no 105 was lost
Ack with sequence number 105 was delayed
Two nodes competing for transmitting through a shared channel falls in
- Same collision domain
- Different collision domain
- Same broadcast domain
- Different broadcast domain
- Hub creates and expands collision domain and broadcast domain (1/1)
- Switch separates collision domain (i.e establish p-p-p connection)
- Switch creates broadcast domain
- Router separates collision and broadcast domain
 Security issues with Ethernet
Source: vulnerability in MAC table creation, ARP, VLAN, STP

The attacker may utilize the network access for: (1) learning about the
private network topology and the network traffic for use in a later attack, (2)
gaining control over switches, routers, or servers in the LAN, (3)
eavesdropping, (4) manipulating information, or (5) disrupting the
availability of the network.
 Security issues with Ethernet
1. NETWORK ACCESS
1. Unauthorized Joins
2. Unauthorized Expansion of the Network
3. VLAN Join
4. Remote Access to the LAN:
5. Topology and Vulnerability Discovery:
6. Switch Control:
2. Traffic Confidentiality
3. Traffic INTEGRITY
1. ARP Poisoning:
2. Session Hijacking:
3. Man in the Middle:
4. Replay: