COMPUTING THE ONE-HOP TRANSMISSION DELAY Consider the figure below, in which a single router is transmitting packets, each of length L bits, over a single link with transmission rate R Mbps to another router at the other end of the link. Queue of packets waiting for output link Suppose that the packet length is L= 16000 bits, and that the link transmission rate along the link to router on the right is R = 1000 Mbps. L: packet length (in bits) R: link transmission rates (Mbps) Round your answer to two decimals after leading zeros QUESTION 1 OF 2 What is the transmission delay? Opcwor

COMPUTING THE ONE-HOP TRANSMISSION DELAY Consider the figure below, in which a single router is transmitting packets, each of length L bits, over a single link with transmission rate R Mbps to another router at the other end of the link. Queue of packets waiting for output link Suppose that the packet length is L= 16000 bits, and that the link transmission rate along the link to router on the right is R = 1000 Mbps. L: packet length (in bits) R: link transmission rates (Mbps) Round your answer to two decimals after leading zeros QUESTION 1 OF 2 What is the transmission delay? Opcwor

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

Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NIC
Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?
Suppose we have a web page which contains 10 objects including: a html main file, 8 jpg image, and a .mp3 background music. For simplicity, assume each of the 10 objects has a size of 4 Kbits and that each object can be completely transferred in one TCP packet. Furthermore, assume the round-trip time between the server and client is RTT= 250 ms, and the download rate is 1 Mbps. What will be the time it takes to complete transferring the web page running in the non-persistent mode? Total delay = ms
Suppose that the average object size is 850,000 bits and that the average request rate from the institution’s browsers to the origin servers is 16 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is three seconds on average (see Section 2.2.5). Model the total average response time as the sum of the average access delay (that is, the delay from Internet router to institution router) and the average Internet delay. For the average access delay, use Δ/(1 – Δ ), where Δ is the average time required to send an object over the access link and is the arrival rate of objects to the access link. a. Find the total average response time.b. Now suppose a cache installed in the institutional LAN, Suppose the miss rate is 0.4. Find the total response time.
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…
Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. b) Suppose the network is a packet-switched datagram network and a connectionless service is used. How long does it take to send the file?
Task2: In packet switching technology the packet size is an import parameter when it comes to efficiency and reducing the network latency. Let us assume a network which consists of a sender host and a receiver host at nh hops faraway from each other's (nh-1 routers R). s>R>R> ...>S. If we assume that all links have a bit-rate B bps and originally the message to be send from the sender to the receiver is of size L bits. 1) Give the formula to compute the network latency if we assume circuit switching (switching time per switch is s seconds). 2) Same as in 1) but we assume packet switching with packet size p bits. 3) From 2) drive the best packet size p which give the best performance (minimum network latency). Hint. One way to find out the minimum of a function f is to find its derivative f'(0). 4) Verify your result by providing prove example.
Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time by ts = 250 milliseconds. How long does it take to send the file from source to destination?
Consider a sender using a reliable data transfer protocol. The sender wants to send 9 packets to a receiver. The transmission delay for a single packet is 40 milliseconds. The propagation delay between the hosts is 100 milliseconds. Assume an ACK is small enough that you can ignore its transmission delay. You may also assume that no packets are lost, damaged, or reordered. For this question, a reliable data transfer is considered finished when all ACKs have been received by the sender. How long would this take using a pipelined reliable data transfer protocol with a window size of 6? In milliseconds How long would this take using a non-pipelined reliable data transfer protocol? In milliseconds
Consider four Internet hosts, each with a TCP session. These four TCP sessions share a common bottleneck link - all packet loss on the end-to-end paths for these four sessions occurs at just this one link. The bottleneck link has a transmission rate of R. The round trip times, RTT, for all fours hosts to their destinations are approximately the same. No other sessions are currently using this link. The four sessions have been running for a long time. i) What is the approximate throughput of each of these four TCP sessions? Explain your answer briefly. ii) What is the approximate size of the TCP window at each of these hosts? Explain briefly how you arrived at this answer.
In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…
Suppose that a router receives simultaneously 3 packets (pkt1, pkt2, and pkt3) with length L1 = 1 Kbit, L2 = 8 Kbit, and L3 = 4 Kbit, respectively. The three packets are to be forwarded through the same link with transmission rate R = 4 Mbps. Packets are to be forwarded in the following order: pk1, pkt2, pkt3. R 1. What is the queueing delay of pkt1? 2. What is the queueing delay of pkt2? 3. What is the queueing delay of pkt3? 4. What is the average queueing delay at router R?