PROJECT 2 - Data Transfer Efficiency A packet consists of a header and a payload. The header is fixed at 20 bytes. The range of the user data to be transferred over the network is from 64 bytes to 1518 bytes with an increment of 1 byte, i.e., 64, 65, 66, ..., 1518. Plot transfer efficiency vs size of user data (y-axis is efficiency, x-axis is size of user data) on three different plots corresponding to these cases: (a) Maximum packet size = 100 bytes (b) Maximum packet size = 500 bytes (c) Maximum packet size = 2000 bytes Clearly label the axes and the ranges. What can you conclude looking at those three plots? You may use Excel or your favorite programming language to generate the plots. Submit the following on Canvas: The plots AND the answer to the above question in PDF format. • Your code.

PROJECT 2 - Data Transfer Efficiency A packet consists of a header and a payload. The header is fixed at 20 bytes. The range of the user data to be transferred over the network is from 64 bytes to 1518 bytes with an increment of 1 byte, i.e., 64, 65, 66, ..., 1518. Plot transfer efficiency vs size of user data (y-axis is efficiency, x-axis is size of user data) on three different plots corresponding to these cases: (a) Maximum packet size = 100 bytes (b) Maximum packet size = 500 bytes (c) Maximum packet size = 2000 bytes Clearly label the axes and the ranges. What can you conclude looking at those three plots? You may use Excel or your favorite programming language to generate the plots. Submit the following on Canvas: The plots AND the answer to the above question in PDF format. • Your code.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

PERL programming Consider a network with some hosts. The traffic from one host to the other is provided. The question is to find the total bytes that are moving in the network from one host to the other and also for all the routes. The total bytes that are transferred for the day is as below. peter ann 1250 peter mary 910 mark mary 1250 peter mary 450 peter andy 2924 paul peter 1218 paul helen 199 The first name is the source host, the second is the destination host and the number is the bytes that are transferred.
ngineering Computer EngineeringQ&A Library2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission t 2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the…
For NAT Network Address Translation Scenario: Jenny Bello is a small business owner selling and making customized computer peripherals. She has been finding it difficult to track her sales and inventories, however recently after an expert's advice, she adopted a Point of Sale (PoS) server. So, she can now track her sales and inventories at the store. However, she ran into another issue, the server can only be accessed within the store, because it has been assigned a private IPv4 address, it is not publicly accessible via the Internet. a) Why is not having the PoS server accessible over the Internet a problem for the business? b) What caused this problem? c) Propose a solution for the problem and explain how the solution works.
1. This question is about Networks The following diagram shows a set of interconnected networks. The six networks (networks 1-6) are shown as labelled ellipses and the machines (A-K) connected to the networks represented as letters. Some machines (such as C, and E) are connected to multiple networks and are set to forward packets between the two networks. For the purposes of this questions, machines will be addressed using the format 1.A where the number refers to the network the machine is connected and the letter identifies the machine. Machines connected to multiple networks can be addressed using multiple addresses – for example, machine c can be referred to as 1.c or 2.c depending on which network it is talking to. E- Network 3 -F Network 4 Network 1 Network 2 H. A Network 5 K The network is configured to use next-hop routing. In the following questions, you are required to specify the address of the next-hop where a machine should send a packet, If it is not on the same (local)…
Computer Science Draw a UML design for a Simulation of a DNS Server Using Java. DNS is a directory service that provides a mapping between the name of a host on the network and its numerical address and is required for the functioning of the internet.
A 1-km-long, 10-Mbps CSMA/CD LAN (i.e., Classic Ethernet)has a propagation speed of 200 m/μsec (i.e., how fast the radio signal moves on the link). Thereare no repeaters in this system. Data frames are 512 bits long, including 480 bits of payload (i.e.,effective data) and 32 bits of overhead (e.g., header, checksum, and other overhead fields). Everydata frame should be confirmed by a 64-bit ACK frame. We assume the sender needs to use onecontention slot to seize the channel before transmitting the data frame, and the receiver needsto use one contention slot to seize the channel before transmitting the ACK frame. Answer thefollowing questions: a. What is the minimum length of a contention slot in μsec? b. What is the effective data rate for the sender to send one data frame? Assume that there areno collisions. Show the calculation c. What would be the impact on the total delay and the effective data rate if we used a longerdata payload size in the data frame? Given one application…
Q3) Consider weighted queueing scheme with three queues at the output port. The weights assigned to queues are w = 4, w = 2, and w = 1. The contents of each queue at time t1 are shown in below Figure. Assume packets are all the same size and that transmission time for each is 1 micro-second. Answer the following: a) Using timeline, show the departure time for each packet,
2 This question is about Networks The following diagram shows a set of interconnected networks. The four networks (networks 1-4) are shown as labelled ellipses and the machines (A-K) con- nected to the networks represented as letters. Some machines (such às c, ánd E) are connected to multiple networks and are set to forward packets between the two networks. For the purposes of this guestions, machines will be addressed using the format 1.A where the number refers to the network the machine is connected and the let- ter identifies the machine. Machines connected to multiple networks can be ad- dressed usiņng multiple addresses - for example, machine c can be referred to as 1.cor 2.c depending on which network it is talking to. G Network 3 Network 1 -C Network 2 -F B D E Network 4 -K The network is configured to use next-hop routing. In the following questions, you are required to give the address of the next-hop where a machine should send a packet, if it is not on the same (local)…
Vehicular traffic networks Recall that latency is the time it takes to get from one place to another (measured in seconds, minutes, or hours), and bandwidth is the amount of something that can pass through a point in a given amount of time (measured in cars per minute, bits per second, etc.). Consider this road network with six cities. Single lines represent 1 lane in each direction, and double lines represent 2 lanes in each direction. 6 mi 3 mi 3 mi 9 mi A В 5 mi 5 mi 8 mi E F 1. There are four different routes to get from A to B (without going in circles). What are the four routes? (In graph theory language, you would say there are four distinct paths that go from A to B without cycles.) 2. What is the total length of the shortest route? 3. Assume all the roads have speed limit 30 miles per hour. a. What is the latency of a car traveling from A to B along route ACDB? b. What is the latency of a car traveling from A to B along route AEDB? 4. Assume everyone follows the 2-second rule…
Q6) Assuming the router's buffer is infinite, the queuing delay is 1.2957 ms, and 1476 packets arrive. How many packets will be in the buffer 1 second later? Assume a constant transmission rate of R = 300000 bps, a constant packet-length L = 1600 bits, and a is the average rate of packets/second. Traffic intensity I = La/R, and the queuing delay is calculated as I(L/R)(1 - 1) for I < 1. Average queuing delay 950 packets 705 packets 780 packets La/R 1 Answer isn't a unique number
Berkeley Computer Science example (CS-168): Picture this: there are two hosts (A and B). The two hosts are connected by 50 msec of propagation delay. The bandwidth is equal to 106 B/sec. Note that the hosts use a sliding window where (W = 4, and packet size = 1000 Bytes) with (Selective Repeat). We will ignore the size of ACK and assume that the timer value for each packet is set as (send time + RTT) and retransmission occurs immediately after a timer expires. Make sure to assume that the packets are sent in sequence starting at time 0. How long does it take to successfully receive all 4 packets (P_0, P_1, P_2, P_3). Your answer should be in milliseconds. 1. When there is no packet loss. 2. When the P_1 packet becomes lost, but there is no further packet loss
COMPUTER NETWORKS: Please solve with solutions and provide correct answer An application message is segmented into 20 packets, each of which is 1000-byte in size. Caculate the end-to-end delay for the message when the bit rate for any node is 1 Mbps, the optical path total distance is 2000-km, and the queuing and processing delays are 1-ms and 1-ms, respectively. There are 4 intermediate routers in the path, each of which uses the store-and-forward approach.