po)toons !

IE3017 Computer Communications

Tutorial 1

1. Consider that a 4Mbps network is shared by multiple users. Each user needs 500 kbps during active
transmission. On the other hand, each user is active for only 15% of the time.

a) If the network with 20 users uses packet switching, derive the probability that a user reaching at the network
finds out that the network is busy. (Hint: Show your answer with a formula containing a sum of multiple
probabilities.

b) Discuss on ‘greedy case’ (lecture notes Week 1, Page 24). What if the network in Page 23 is used to support 100
users instead now?

(Optional: To get the final numerical answer, you may need to write a short program or use an advanced
calculator.)

2. Consider sending a message of F bits from A to B where A and B are connected by two links with a switch in
between, as shown in the figure given below.

A Switch B

Consider the links to be uncongested so that there are no queuing delays. Both the links operate at R bps.
Assume that A segments the message into segments of S bits each and adds an overhead of h bits to each
segment to form each packet that it transmits to B. The switch operates in a store-&-forward mode. For each
packet received, it buffers the whole packet before it starts transmitting the packet on the outgoing link; it can,
however, receive the (n+1)th packet while it is transmitting the nth packet. Assume the propagation delays to be
negligible and that packets can be sent one after another without acknowledgements.

a) How much delay will be incurred to send the message to B if it S=F?

b) How much delay will be incurred to send the message to B if it S=F/2?
c) As a conclusion, how much delay is saved for transmission of the message by using the method in b)?

2( F + h ) 3 ( F + 2 h ) 2( F + h ) 3 ( F + 2 h )
(Ans: , , - )
R 2 R R 2 R
 EE3017/IM2003
Computer Communications
Tutorial 1
Intro
• Assoc Prof Yuen Chau
• [email protected]  email me
• S1-B1a-12
Mock Up IRA
Things to do
• Go through the course policy
“Computer” Network

Nodes: Interfaces: Links:

- Computer - Ethernet card (for LAN) - Fiber
- Mobile phones - WiFi dongle - Copper wire
- …… - Cellular modem - Wireless
- …… - ……
 Network Architecture

Network Edge: Access Network: Network Core:

- Applications - Link btw edge and core - Routers
- Hosts - …… - ……
- ……

Home:
Tablets / Mobile phones  Fiber (by Singtel for example)  Internet

School (NTU):
Computers / Mobile phones  Fiber / Ethernet  Internet

Imagine your tablets at home connect to a server in NTU….

Circuit Switch vs Packet (Datagram) Switch
Circuit Switch vs Packet (Datagram) Switch

• No sharing of resources
• Connection setup / tear down required
• Resource wasted if no data transmission
• Guaranteed performance
• Each packet treated independently
(imagine Singtel IDD 001) • Packets can take any practical route
• Packets may arrive out of order
• Packets may go missing
• Up to receiver to re-order packets and recover from
missing packets
• Circuit switching
• Designed for voice
• Resources dedicated to a particular call
• Much of the time a data connection is idle
• Data rate is fixed
• Packet switching
• Designed for data
• Transmitted in small packets
• Packets contains user data and control info
• User data may be part of a larger message, i.e. data transmitted in small packets
• Control info includes routing (addressing) information
Datagram

May arrive out of sequence

11
Virtual Circuit

12
• Virtual circuits
• Network can provide sequencing and error control
• Packets are forwarded more quickly
• No routing decisions to make
• Less reliable
• Loss of a node loses all circuits through that node
• Datagram
• No call setup phase
• Better if few packets
• More flexible
• Routing can be used to avoid congested parts of the network
• More reliable
 Event
Time

Performance depends on various delays

• Node processing delay
• Queuing delay
• Transmission time
• Propagation delay

14
 1. Consider that a 4Mbps network is shared by multiple users. Each user needs 500 kbps during active
transmission. On the other hand, each user is active for only 15% of the time.

a) If the network with 20 users uses packet switching, derive the probability that a user reaching at the network
finds out that the network is busy. (Hint: Show your answer with a formula containing a sum of multiple
probabilities.

How many active users can be supported at any point of time? 4Mbps/500Kbps = 8 users

But in packet switching, resource is shared, as long as no more than 8 users active is ok.

This n is not that n

In this qn,
n is 20,
To be cont…. k is the n (the number of active user)
Binomial Distribution
In probability theory and statistics, the binomial distribution is the discrete probability
distribution that gives only two possible results in an experiment, either Success or Failure.
For example, if we toss a coin, there could be only two possible outcomes: heads or tails,
and if any test is taken, then there could be only two results: pass or fail.
k n–k
nCk * P * (1 – P)

e.g. A coin is tossed 10 times. What is the probability of getting exactly 6 heads?

• The number of trials (n) is 10

• The odds of success (“tossing a heads”) is 0.5 (So 1-p = 0.5)
• k=6

• P(k=6) = 10C6 * 0.5^6 * 0.5^4

k n-k
 Continue….

1. Consider that a 4Mbps network is shared by multiple users. Each user needs 500 kbps during active
transmission. On the other hand, each user is active for only 15% of the time.

a) If the network with 20 users uses packet switching, derive the probability that a user reaching at the network
finds out that the network is busy. (Hint: Show your answer with a formula containing a sum of multiple
probabilities.

This is the probability (you need to convert value to probability) of network is busy.
 1. Consider that a 4Mbps network is shared by multiple users. Each user needs 500 kbps during active transmission. On the
other hand, each user is active for only 15% of the time.

b) Discuss on ‘greedy case’ (lecture notes Week 1, Page 24). What if the network in Page 23 is used to support 100 users
instead now?

Slide 23

Value (or probability) of network busy

(if total 35 users):
Which one higher?
Value (or probability) of network busy
(if total 100 users):
(i.e. 41.48%)
 x a b y

Pipelining
2. Consider sending a message of F bits from A to B where A and B are connected by
two links with a switch in between, as shown in the figure given below.

Consider the links to be uncongested so that there are no queuing delays. Both the links
operate at R bps. Assume that A segments the message into segments of S bits each and
adds an overhead of h bits to each segment to form each packet that it transmits to B.
The switch operates in a store-&-forward mode. For each packet received, it buffers the
whole packet before it starts transmitting the packet on the outgoing link; it can, however,
receive the (n+1)th packet while it is transmitting the nth packet.
Assume the propagation delays to be negligible and that packets can be sent one after
another without acknowledgements.
a) How much delay will be incurred to send
the message to B if it S=F?

(A to switch) + (switch to B)
 b) How much delay will be incurred to send
the message to B if it S=F/2?

Packet_1 (A to switch)
Packet_2 (A to switch) + Packet_1 (switch to B)
Packet_2 (switch to B)
c) As a conclusion, how much delay is saved for
transmission of the message by using the method in b)?

Time save: D1 – D2

To ensure time save > 0  D1 - D2 > 0  D1 > D2

F>2h to have the advantage of pipelining

 Transmission delay: 1 sec
Propagation delay: a sec

a>1 a<1
Question?