Scribd
Upload
23 views4 pages

TUT3 Sol

The document provides solutions to various networking problems, including calculating end-to-end delays in packet-switched and circuit-switched networks, and analyzing the impact of transmission and propagation delays. It discusses the appropriateness of network types for specific applications and the necessity of congestion control under certain conditions. Additionally, it includes calculations for latency in Ethernet networks and describes a synchronous TDM multiplexer setup.

Uploaded by

surtiaryan2004
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
23 views4 pages

TUT3 Sol

The document provides solutions to various networking problems, including calculating end-to-end delays in packet-switched and circuit-switched networks, and analyzing the impact of transmission and propagation delays. It discusses the appropriateness of network types for specific applications and the necessity of congestion control under certain conditions. Additionally, it includes calculations for latency in Ethernet networks and describes a synchronous TDM multiplexer setup.

Uploaded by

surtiaryan2004
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
You are on page 1/ 4

TUTORIAL 3 (SOLUTION)

1. Suppose there is exactly one packet switch between a sending host


and the receiving host. Assume that the transmission speed of the
links between the sending host & the switch, the switch& 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 and
processing delays.

Solution:

At time t0 the sending host begins to transmit. At time t1 = L/R1, the


sending host completes transmission and the entire packet is received
at the router (no propagation delay).

Because the router has the entire packet at time t1, it can begin to
transmit the packet to the receiving host at time t1. At time t2 = t1 +
L/R2, the router completes transmission and the entire packet is
received at the receiving host (again, no propagation delay).

Thus, the end‐to‐end delay is L/R1 + L/R2.

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 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?

Sol:
a) A circuit-switched network would be well suited to the application,
because the application involves long sessions with predictable
smooth bandwidth requirements. Since the transmission rate is
known and not bursty, bandwidth can be reserved for each
application session without significant waste. In addition, the
overhead costs of setting up and tearing down connections are
amortized over the lengthy duration of a typical application session.

b) In the worst case, all the applications simultaneously transmit over


one or more network links. However, since each link has sufficient
bandwidth to handle the sum of all of the applications' data rates,
no congestion (very little queuing) will occur. Given such generous
link capacities, the network does not need congestion control
mechanisms.

3. Consider two hosts, A and B, connected by a single link of rate R bps.


Suppose that the two hosts are separated by m meters, and suppose
the propagation speed along the link is s meters/sec. Host A is to send
a packet of size L bits to Host B.

a. Ignoring processing and queuing delay, obtain an expression for


the end-to-end delay.
b. Suppose s=2.5*10^8 meters/sec, L=120 bits, and R=56kbps.
Find the distance m so that the propagation delay equals
transmission delay.
4. Calculate the latency (from first bit sent to last bit received) for:
a. 10-Mbps Ethernet with a single store-and-forward switch in the path
and a packet size of 5000 bits. Assume that each link introduces a
propagation delay of 10 μs and that the switch begins retransmitting
immediately after it has finished receiving the packet.
b. Same as (a) but with three switches.
c. Same as (b), but assume the switch implements “cutthrough”
switching; it is able to begin retransmitting the packet after the first
200 bits have been received

5. 5. The Fig. below shows a multiplexer for Synchronous TDM. Assume that a
frame consists of 3 time slots, that each time slot contains 3 bits, and that
each frame starts with a framing bit, alternating between 0 and 1. What is the
bit sequence on the outgoing link?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy