Scribd
Upload
55 views1 page

HW 1 of Chapter 1

The document contains several problems related to packet switching and circuit switching. It asks about end-to-end delay when sending a packet through a single switch, the number of users that can be supported on a shared link using each switching technique, the probability of simultaneous transmission among users, and throughput for file transfers across multiple links. It also contains problems about propagation delay, maximum simultaneous connections in a circuit-switched network, and the probability of more than N users sending data on a packet-switched link.

Uploaded by

No one
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
55 views1 page

HW 1 of Chapter 1

The document contains several problems related to packet switching and circuit switching. It asks about end-to-end delay when sending a packet through a single switch, the number of users that can be supported on a shared link using each switching technique, the probability of simultaneous transmission among users, and throughput for file transfers across multiple links. It also contains problems about propagation delay, maximum simultaneous connections in a circuit-switched network, and the probability of more than N users sending data on a packet-switched link.

Uploaded by

No one
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

HW 1 of Chapter 1

R11. Suppose there is exactly one packet switch between a sending host and a receiving host.
The transmission rates between the sending host and the switch and between the switch and the
receiving host are R1 and R2, respectively. Assuming that the switch uses store-and-forward
packet switching, what is the total end-to-end delay to send a packet of length L? (Ignore queuing,
propagation delay, and processing delay.)

R13. Suppose users share a 2 Mbps link. Also suppose each user transmits continuously at 1
Mbps when transmitting, but each user transmits only 20 percent of the time. (See the discussion
of statistical multiplexing in Section 1.3 .)
a. When circuit switching is used, how many users can be supported?
b. For the remainder of this problem, suppose packet switching is used. Why will there be
essentially no queuing delay before the link if two or fewer users transmit at the same time?
Why will there be a queuing delay if three users transmit at the same time?
c. Find the probability that a given user is transmitting.
d. Suppose now there are three users. Find the probability that at any given time, all three
users are transmitting simultaneously. Find the fraction of time during which the queue
grows.
R18. How long does it take a packet of length 1,000 bytes to propagate over a link of distance
2,500 km, propagation speed 2.5⋅108 m/s, and transmission rate 2 Mbps? More generally, how
long does it take a packet of length L to propagate over a link of distance d, propagation speed s,
and transmission rate R bps? Does this delay depend on packet length? Does this delay depend
on transmission rate?
R19. Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has
three links, of rates R1=500 kbps, R2=2 Mbps, and R3=1 Mbps.
a. Assuming no other traffic in the network, what is the throughput for the file transfer?
b. Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how
long will it take to transfer the file to Host B?
c. Repeat (a) and (b), but now with R2 reduced to 100 kbps.

P4. Consider the circuit-switched network in Figure 1.13 . Recall that there are 4 circuits on each
link. Label the four switches A, B, C, and D, going in the clockwise direction. What is the maximum
number of simultaneous connections that can be in progress at any one time in this network?
Suppose that all connections are between switches A and C. What is the maximum number of
simultaneous connections that can be in progress? Suppose we want to make four connections
between switches A and C, and another four connections between switches B and D. Can we
route these calls through the four links to accommodate all eight ­connections?
P9. Consider the discussion in Section 1.3 of packet switching versus circuit switching in which
an example is provided with a 1 Mbps link. Users are generating data at a rate of 100 kbps when
busy, but are busy generating data only with probability p=0.1p=0.1. Suppose that the 1 Mbps
link is replaced by a 1 Gbps link.
a. What is N, the maximum number of users that can be supported simultaneously under
circuit switching?
b. Now consider packet switching and a user population of M users. Give a formula (in terms
of p, M, N) for the probability that more than N users are sending data.

You might also like