Scribd
Upload
15 views2 pages

Computer Networks

The document discusses packet switching network architecture and components of delay in packet switching such as processing, queueing, transmission, and propagation delay. It also covers differences between circuit switching and packet switching networks and how to calculate maximum number of users and probability of more than a certain number of active users in circuit switching networks.

Uploaded by

lucifershen021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views2 pages

Computer Networks

The document discusses packet switching network architecture and components of delay in packet switching such as processing, queueing, transmission, and propagation delay. It also covers differences between circuit switching and packet switching networks and how to calculate maximum number of users and probability of more than a certain number of active users in circuit switching networks.

Uploaded by

lucifershen021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Networks

Assignment 1:
Problem 1
a. Packet switching architecture involves breaking data into packets and sending them
individually across a network.
b. The main components of delay in packet switching are:
 Processing delay: Time taken by routers/switches to process the packet header.
 Queueing delay: Time spent in router queues waiting to be transmitted.
 Transmission delay: Time to push all the packet's bits into the link.
 Propagation delay: Time for a bit to travel from sender to receiver.
c. Transmission delay is the time it takes to push all the packet's bits into the link, while
propagation delay is the time it takes for a bit to travel from sender to receiver through the
medium.
d. Propagation delay is not affected by the length of the packet. It depends on the distance
between sender and receiver and the speed of the medium.
Problem 2
a. For an application that transmits data at a steady rate and continues for a long time, a circuit-
switched network might be more appropriate. Circuit-switched networks dedicate resources for
the entire duration of the communication, which can be more efficient for long, steady
transmissions.
b. In a packet-switched network where the sum of application data rates is less than link
capacities and the traffic is from a single source, congestion control may not be critically
needed. However, some basic congestion management mechanisms might still be beneficial to
handle occasional bursts or network fluctuations.
Problem 3
a. Circuit switching involves reserving resources for the duration of a connection, while packet
switching involves breaking data into packets and sending them independently.
b. In circuit switching with a link rate of 2 Mbps and users generating data at 100 Kbps when
busy, and considering users are busy only 1% of the time, we can calculate the maximum
number of users as follows: Maximum users = (Link rate / Data rate per user) / (Fraction of time
busy) Maximum users = (2 Mbps / 100 Kbps) / 0.01 = 20 users
c. The formula to calculate the probability of having more than 5 active users, assuming 20
users in total, involves using the binomial probability formula: P(X > 5) = 1 - P(X ≤ 5), where X is
the number of active users.
d. In a packet switching architecture with many users, there can be increased contention for
resources like bandwidth and router processing. This can lead to higher queueing delays,
potential packet loss, and the need for effective congestion control mechanisms to manage the
shared resources efficiently.

You might also like