0% found this document useful (0 votes)
2 views7 pages

WeekEndAssignment-02 + Questions fully University Based

The document outlines a weekend assignment for a Computer Networking Workshop, detailing various exercises related to network performance parameters. It includes calculations for transmission times, propagation delays, and efficiency measures across different scenarios and network configurations. The assignment is to be submitted by March 3, 2024, and covers topics such as packet transmission, round trip times, and the impact of network bandwidth on data transfer.

Uploaded by

mardiblbiswajit
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)
2 views7 pages

WeekEndAssignment-02 + Questions fully University Based

The document outlines a weekend assignment for a Computer Networking Workshop, detailing various exercises related to network performance parameters. It includes calculations for transmission times, propagation delays, and efficiency measures across different scenarios and network configurations. The assignment is to be submitted by March 3, 2024, and covers topics such as packet transmission, round trip times, and the impact of network bandwidth on data transfer.

Uploaded by

mardiblbiswajit
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/ 7

Department of Computer Science and Engineering

Institute of Technical Education & Research, SOA, Deemed to be University

WEEK-END ASSIGNMENT-02
Computer Networking Workshop (CSE 4541)

Publish on: 24-02-2024 Submission on: 03-03-2024


Course Outcome: CO1 Program Outcome: PO1 Learning Level: L5

Workouts on network performance parameters


1. Consider a 100 Mbps link between an earth station (sender) and a satellite (receiver) at an altitude of
2100 km. The signal propagates at a speed of 3 × 108 m/s. Determine the time taken (in milliseconds,
rounded off to two decimal places) for the receiver to completely receive a packet of 1000 bytes
transmitted by the sender.

2. Hosts A and B are each connected to a switch S via 10-Mbps links as in the below Figure-1. The
propagation delay on each link is 20µs. S is a store-and-forward device; it begins retransmitting a
received packet 35µs after it has finished receiving it. Calculate the total time required to transmit
10, 000 bits from A to B.

A S B

Figure 1: Two node interconnection through a switch

(a) As a single packet.


(b) As two 5,000-bit packets sent one right after the other.

(a) as a single packet

WEA02-1
Department of Computer Science and Engineering
Institute of Technical Education & Research, SOA, Deemed to be University

As two 5,000-bit packets sent one right after the other

3. Assume that an RTT (round trip time) is of 80 ms. An RTT = 2 × Tp , where Tp is the propagation
delay. Initially 2 × RTT of “handshake” is required to setup the connection before data is sent. The
file that would be transmitted is broken into packets of size 1 KB. So, calculate the total time required
to transfer a 1.5 MB file in the following cases:
(a) The bandwidth is 10 Mbps and data packets can be sent continuously.
(b) The bandwidth is 10 Mbps, but after we finish sending each data packet, we must wait one RTT
before sending the next data packet.

The bandwidth is 10 Mbps and data packets can be sent continuously.

The bandwidth is 10 Mbps, but after we finish sending each data packet, we must wait one
RTT before sending the next data packet.

Do a comparative analysis of total time in both the cases to conclude the better approach in
sending the file over a network.

WEA02-2
Department of Computer Science and Engineering
Institute of Technical Education & Research, SOA, Deemed to be University

4. Consider a closed-loop network (e.g. a token ring network) with bandwidth 100 Mbps and propa-
gation speed of 2 × 108 m/s. What would the circumference of the loop be to exactly contain one
250 byte packet? ( Hint: The bandwidth-delay product defines the number of bits that can fill a
link.)

5. Consider a source computer (S) transmitting a file of size 106 bits to a destination computer (D) over
a network of two routers (R1 and R2 ) and three links(L1 , L2 ,and L3 ). L1 connects S to R1 ; L2 connects
R1 to R2 ; and L3 connects R2 to D. Let each link of length 100km. assume signals travel over each
line at a speed of 108 meters per second. Assume that bandwidth of the network is 1 Mbps ( i.e. the
link bandwidth on each link is 1 Mbps). Let the file broken down into 1000 packets each of size 1000
bits. Find the total sum of transmission and propagation delays in transmitting the file from S to D.
Draw the network topology and find the solution

WEA02-3
Department of Computer Science and Engineering
Institute of Technical Education & Research, SOA, Deemed to be University

6. An image is 1024 × 768 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long
does it take to transmit it over a 56-kbps modem channel? Over a 1-Mbps cable modem? Over a
10-Mbps Ethernet? Over 100-Mbps Ethernet?

7. A 100 km-long cable runs at the T1 data rate. The propagation speed in the cable is 2/3 the speed of
light in vacuum. How many bits fit in the cable? (T1 data rate is 1.544 mbps and speed of light in
vacuum 3 × 108 m/sec).

8. Suppose, we need to download a book. The book contains 80 pages, each page is an average 20 lines
with 80 characters in each line, each character requires 8 bit. If we want to download the books in 30
sec, what will be the required bit rate.

WEA02-4
Department of Computer Science and Engineering
Institute of Technical Education & Research, SOA, Deemed to be University

9. If the data rate of a ring network is 20 Mbps, signal propagation speed is 200 m/s, then the number of
bits that can be placed on the channel of 200 km is.

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

11. Let us consider a typical two nodes network. The two nodes are D meter distance apart. The date
rate of the network is R bps and the propagation speed is V m/sec. Determine the efficiency and
throughput of the network for a packet size of P bits transmitted from one node to other node in terms
of transmission time and propagation time.
Efficiency and Throughput measure

WEA02-5
Department of Computer Science and Engineering
Institute of Technical Education & Research, SOA, Deemed to be University

12. Consider a sender has n data packets, each of size L bits are transmitted to a receiver at a distance D
meter away. The sender can send one packet at a time and wait for the acknowledgement called ACK
packet from the receiver (the size of ACK is very very less than the data packet), then it can send the
next packet. The process will continue till to the last frame. Find the efficiency and throughput of
this mechanism assuming the working bandwidth of the network is B bps, and progation speed is V
m/s.
Efficiency and Throughput measure

WEA02-6
Department of Computer Science and Engineering
Institute of Technical Education & Research, SOA, Deemed to be University

13. Suppose that data are stored on 1.44 Mbyte floppy diskettes that weight 30 g each. Suppose that an
airliner carries 104 kg of these floppies at a speed of 1000 km/h over a distance of 5000 km. What is
the data transmission rate in bits per second of this system?
Transmission rate calculation

14. Five equal-size packets belonging to the same message leave for the destination one after another.
However, they travel through different paths as shown in the table;

Packets Path Length Visited Switches


1 3000 Km 1, 3, 5
2 10,800 Km 1, 2, 5
3 13,000 Km 1, 2, 3, 5
4 10,000 Km 1, 4, 5
5 10,400 Km 1, 4, 2, 5

We assume that the delay for each switch (including waiting and processing) is 2, 9, 23, 7, and 18 ms
respectively. Assuming that the propagation speed is 2 × 108 m/s. Find the order the packet arrive at
the destination and the delay for each. Ignore any other delay in transmission.
Delay computation

WEA02-7

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