0% found this document useful (0 votes)
18 views2 pages

Circuit vs Packet Switching Analysis

The document discusses various concepts in networking, including the advantages of circuit-switched versus packet-switched networks, the impact of transmission rates on user capacity, and the probability of simultaneous transmissions. It also covers the Internet protocol stack, delay components in data transmission, and specific scenarios involving file transfers and queuing delays. Additionally, it explores the implications of bandwidth-delay products and the characteristics of data transmission over long distances.

Uploaded by

NITHA SHIFANA MK
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views2 pages

Circuit vs Packet Switching Analysis

The document discusses various concepts in networking, including the advantages of circuit-switched versus packet-switched networks, the impact of transmission rates on user capacity, and the probability of simultaneous transmissions. It also covers the Internet protocol stack, delay components in data transmission, and specific scenarios involving file transfers and queuing delays. Additionally, it explores the implications of bandwidth-delay products and the characteristics of data transmission over long distances.

Uploaded by

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

1. What advantage does a circuit-switched network have over a packet switched network?

What advantages does TDM have over FDM in a circuit-switched network?


2. 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.
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.
3. Suppose users share a 10 Mbps link. Also suppose each user requires 200 kbps when
transmitting, but each user transmits only 10 percent of the time.
a. When circuit switching is used, how many users can be supported?
b. For the remainder of this problem, suppose packet switching is used. Find the
probability that a given user is transmitting
c. Suppose there are 120 users. Find the probability that at any given time, exactly n
users are transmitting simultaneously. ( Hint: Use the binomial distribution.)
d. Find the probability that there are 51 or more users transmitting simultaneously.
4. Some content providers have created their own networks. Describe Google’s network.
What motivates content providers to create these networks?
5. Consider sending a packet from a source host to a destination host over a fixed route. List
the delay components in the end-to-end delay. Which of these delays are constant and
which are variable?
6. 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.
7. What are the five layers in the Internet protocol stack? What are the principal
responsibilities of each of these layers?
8. 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 answer:
a. Would a packet-switched network or a circuit-switched network be more
appropriate for this application? Why?
b. Suppose that a packet-switched network is used and the only traffic in this
network comes from such applications 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?
9. (a) Suppose N packets arrive simultaneously to a link at which no packets are currently
being transmitted or queued. Each packet is of length L and the link has transmission rate
R. What is the average queuing delay for the N packets?
(b) Now suppose that N such packets arrive to the link every LN/R seconds. What is the
average queuing delay of a packet?

10. Consider the following figure. Assume that we know the bottleneck link along the path
from the server to the client is the first link with rate Rs bits/sec. Suppose we send a pair
of packets back to back from the server to the client, and there is no other traffic on this
path. Assume each packet of size L bits, and both links have the same propagation delay
dprop.

a. What is the packet inter-arrival time at the destination? That is, how much time
elapses from when the last bit of the first packet arrives until the last bit of the
second packet arrives?
b. Now assume that the second link is the bottleneck link (i.e., Rc < Rs). Is it
possible that the second packet queues at the input queue of the second link?
Explain. Now suppose that the server sends the second packet T seconds after
sending the first packet. How large must T be to ensure no queuing before the
second link? Explain
11. Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a
direct link of R = 5 Mbps. Suppose the propagation speed over the link is 2.5 * 108
meters/sec.
a. Calculate the bandwidth-delay product, R * dprop.
b. Consider sending a file of 800,000 bits from Host A to Host B. Suppose the file is
sent continuously as one large message. What is the maximum number of bits that
will be in the link at any given time?
c. Provide an interpretation of the bandwidth-delay product.
d. What is the width (in meters) of a bit in the link? Is it longer than a football field?
e. Derive a general expression for the width of a bit in terms of the propagation
speeds, the transmission rate R, and the length of the link m.

Common questions

Powered by AI

The components of end-to-end delay include processing delay, transmission delay, propagation delay, and queuing delay. Processing delay and transmission delay are relatively constant as they depend on the fixed data rate and processing speed of nodes. Propagation delay is also constant, determined by physical distance and signal speed. However, queuing delay is variable as it depends on network congestion and traffic load .

To compute the throughput, you need to identify the bottleneck link which has the lowest data rate among R1 = 500 kbps, R2 = 2 Mbps, and R3 = 1 Mbps. The throughput will be equal to the bottleneck link's rate. For a file of 4 million bytes and a throughput of R1, the file transfer time is obtained by dividing the file size by the throughput. This calculation should be repeated for scenarios with different bottleneck configurations .

A circuit-switched network is more appropriate for an application transmitting data at a steady rate because it guarantees a dedicated path and consistent bandwidth throughout the session. This ensures stable performance essential for long-term operations without the variability and potential delays seen in packet-switched environments .

TDM provides advantages over FDM by allowing users to share the same frequency channel through time slots, which makes it more efficient in terms of bandwidth usage in a circuit-switched network. This effectively eliminates cross-talk issues associated with overlapping frequencies in FDM and ensures full bandwidth utilization when users are not actively using their time slots .

The width of a bit on a network link is calculated using the formula: width = propagation speed / transmission rate. Knowing the bit width is crucial in network engineering as it affects the design of physical network media and the spacing of bits on the transmission path. If the bit width is excessively long, signal integrity may be compromised due to interference with other bits .

Content providers like Google are motivated to create their own networks to have better control over data delivery, enhance the quality of service, reduce latency, and lower costs associated with data transmission. By owning the network infrastructure, they can optimize routes, reduce dependency on external networks, and ensure faster delivery of content to end-users, which is crucial for maintaining user satisfaction and competitive advantage .

There will be essentially no queuing delay before the link if two or fewer users transmit at the same time because the link's capacity is not exceeded, allowing for immediate transmission. Queuing delay occurs when three or more users transmit simultaneously because the combined data rate demand exceeds the link's capacity, leading to packets waiting to be transmitted .

The bandwidth-delay product represents the amount of data that can be in transit in the network before an acknowledgment is received, indicating the capacity of the network to hold information. It is significant as it helps in designing buffer sizes in network devices and understanding the efficiency of data communication over long distances. A higher bandwidth-delay product denotes a larger buffer requirement to ensure optimum data flow without congestion .

Congestion control may be necessary if there are bursts of data transmission that temporarily exceed the link's capacity, causing increased queuing delay and potential packet loss. Even with overall data rates below capacity, temporary spikes due to synchronized application activity can still lead to congestion, thus requiring some form of management to maintain network stability .

The binomial distribution is used to determine the likelihood of exactly n users transmitting simultaneously in a packet-switched network. For each user transmitting with probability p in a system of n users, the probability follows: P(X = k) = C(n, k) * p^k * (1-p)^(n-k). This result helps network administrators understand peak load conditions and manage bandwidth to reduce congestion .

You might also like