Scribd
Upload
98 views3 pages

EE2007-DCN Assignment - 1 (CLO 01)

This document contains a homework assignment for a Data Communication Networks course. It includes 10 questions related to networking concepts like bandwidth, latency, layered protocols, packet propagation, transmission, and queuing delays. Students are asked to define terms, provide examples, calculate values, and explain concepts for full credit on the assignment.

Uploaded by

bolum
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
98 views3 pages

EE2007-DCN Assignment - 1 (CLO 01)

This document contains a homework assignment for a Data Communication Networks course. It includes 10 questions related to networking concepts like bandwidth, latency, layered protocols, packet propagation, transmission, and queuing delays. Students are asked to define terms, provide examples, calculate values, and explain concepts for full credit on the assignment.

Uploaded by

bolum
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/ 3

National University of Computer and Emerging Sciences, Lahore Campus

Course: Data Communication Networks Course Code: EE2007


Program: BS Electrical Engineering Semester: Fall 2021
Deadline: 30 Sept-2021 (start of Lecture) Total Marks: 50
Date: 23 Sept-2021 Weight 3.33
Section: - Page(s): 2
Exam: HW Assignment-1

CLO 01: Describe the design principles of the Internet architecture, and Define and evaluate network
performance parameters.

Give short answers to the following questions.


1. The performance of a client-server system is strongly influenced by two major network
characteristics: the bandwidth of the network (that is, how many bits/sec it can transport) and the
latency (that is, how many seconds it takes for the first bit to get from the client to the server). Give
an example of a network that exhibits high bandwidth but also high latency. Then give an example of
one that has both low bandwidth and low latency.

2. A factor in the delay of a store-and-forward packet-switching system is how long it takes to store and
forward a packet through a switch. If switching time is 10 μsec, is this likely to be a major factor in
the response of a client-server system where the client is in New York and the server is in California?
(Suppose client and server are 6000 km apart with 60 routers between them). Assume the
propagation speed in copper and fiber to be 2/3 the speed of light in vacuum.

3. What are two reasons for using layered protocols? What is one possible disadvantage of using
layered protocols?

4. A system has an n-layer protocol hierarchy. Applications generate messages of length M bytes. At
each of the layers, an h-byte header is added. What fraction of the network bandwidth is filled with
headers?

5. Answer the following separately


a) Suppose the algorithms used to implement the operations at layer k is changed. How does this
impact operations at layers k − 1 and k + 1?
b) Suppose there is a change in the service (set of operations) provided by layer k. How does this
impact services at layers k-1 and k+1?

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

Department of Electrical Engineering Page 1


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.

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

8. This elementary problem begins to explore propagation delay and transmission delay, two central
concepts in data networking. 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) Express the propagation delay, dprop, in terms of m and s.
b) Determine the transmission time of the packet, dtrans, in terms of L and R.
c) Ignoring processing and queuing delays, obtain an expression for the end-to-end delay.
d) Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans, where is the last bit
of the packet?
e) Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit of the packet?
f) Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit of the packet?
g) Suppose s = 2.5 x 108, L = 120 bits, and R = 56 kbps. Find the distance m so that dprop equals dtrans.

9. Consider a packet of length L which begins at end system A and travels over three links to a
destination end system. These three links are connected by two packet switches. Let di, si, and Ri
denote the length, propagation speed, and the transmission rate of link i, for i = 1, 2, 3. The packet
switch delays each packet by dproc. Assuming no queuing delays, in terms of di, si, Ri, (i = 1, 2, 3), and L,
what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the
propagation speed on all three links is 2.5 x 10 8 m/s, the transmission rates of all three links are 2
Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length
of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is
the end-to-end delay?

10. Consider Figure 1.19(a) in Book by Kurose and Ross. 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

Department of Electrical Engineering Page 2


the second packet T seconds after sending the first packet. How large must T be to ensure no
queuing before the second link? Explain.

h)

Department of Electrical Engineering Page 3

You might also like