Scribd
Upload
18 views

Computer Networks

The document provides information about an assignment for a computer networks course. It includes 3 problems covering topics like components of delay in packet switching, differences between circuit switching and packet switching networks, and effects of increasing users in a packet switching network. The deadline for the assignment is March 27th and each problem is worth 10 points.

Uploaded by

jannatimtiaz288
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

Computer Networks

The document provides information about an assignment for a computer networks course. It includes 3 problems covering topics like components of delay in packet switching, differences between circuit switching and packet switching networks, and effects of increasing users in a packet switching network. The deadline for the assignment is March 27th and each problem is worth 10 points.

Uploaded by

jannatimtiaz288
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Networks - BSIT/ CC3071 - Spring 2024

Instructor: Shanza Zaman


Assignment 1((CLO 1) (CLO 2) (CLO 4)
(PLO2)))
Deadline: March 27th – 1:00am (hard and soft copies
required) Each problem has 10 points.
--------------------------------------------------------------------------
Problem
Consider a packet switching architecture.
a. What are the main components of delay when we use packet switching?
Answer
 Queuing delay,
 transmission delay
 propagation delay.

b. What is the difference between transmission delay and propagation delay?


Answer
Transmission Delay:
Time taken to transmit a packet from host to communication link.
Formula:
L/R
Propagation Delay:
Time taken to transmit a packet from host to destination (from one end to
another end).
Formula:
d/v

c. How is propagation delay affected if the length of the packet is increased?


Answer
It is not affected by the length of packet because propagation delay depends
upon:
Distance and speed.

Problem 2
Consider an application that transmits data at a steady rate (for example the sender
generates an N-bit unit of data every K time units, where K is small and fixed). Also,
when such an application starts, it will continue running for a relatively long period of
time. Answer the following questions, briefly justifying your answers.
a. Would a packet-switched network or a circuit-switched network be more
appropriate for this application? Why?
Answer
A circuit-switched network is a better option for this application. This is because of
the fact that the application is made up of long sessions with smooth data transfer
capacity needs and the path is dedicated.

The transmission rate is known, and does not transmit in short intervals every
application session can have a reserved bandwidth.

b. Suppose a packet-switched network is used and the only traffic in this network
comes from this application as described above. Furthermore, assume that
the sum of the application data rates is less than the capacities of each and
every link. Is some form of congestion control needed? Why?
Answer
Congestion control typically deals with situations where there's more data trying to
flow through the network than it can handle so, No congestion control needed as
the sum of application data rates is less than the capacities of each and every
link. For the worst case the bandwidth is still enough for all applications thus
congestion is not needed.

Problem 3 (CLO4) (Similar to Problem 9 in Ch1 in Kurose/Ross)


a. Consider the difference between circuit switching and packet switching.
Assume the link’s rate is 2 Mbps and users are generating data at a rate of
100 Kbps when busy. Users are busy only %1 of time.

b. What is the maximum number of users that a circuit switching architecture can
support simultaneously?

Maximum Users = link rate /data rate per user

2 Mbps / 100 Kbps = 20 users

c. Write down the formula to calculate the probability of having more than 5
active users, assuming that we have 20 users in total

The probability (P) of having more than 5 active users (X > 5) with 20 total
users (n) and a busy probability (p) of 1% (0.01) is:

P(X > 5) = 1 - Σ(P(X = k) for k = 0 to 5)

d. Explain the effects of having more users in a packet switching architecture


with the above characteristics.
The probability of having more than 20 users simultaneously increases, so the
buffers in routers become fuller and gradually packets will be dropped

You might also like