Suppose there is exactly one packet switch between a sending host and a receiving host.The transmission rates between the sending host and the switch and between the switch and thereceiving host are R₁ and R2, respectively. Assuming that the switch uses store-and-forwardpacket switching, what is the total end-to-end delay to send a packet of length L? (Ignorequeuing, propagation delay, and processing delay.)

In any data transmission process, the end-to-end delay refers to the total time spent for…

Suppose there is exactly one packet switch between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and th receiving host are R₁ 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 delay, and processing delay.)

Suppose there is exactly one packet switch between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and th receiving host are R₁ 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 delay, and processing delay.)

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

We send real-time voice from Host A to Host B over a packet-switched network (VolP). Host A converts analog voice to a disital 64 Kbps bitstream on the fly then groups the bits into 64-byte packets. As soon as Host A gathers a packet, it sends it to Host R (Obviously a data packet must be generated first before any bit inside it can be transmitted). There is one link between Hosts A and B; its transmission rate is 10 Mbps and its propagation delay is 10 msec. As soon as Host B receives an entire packet, it converts the packet's bits to an analog signal How much time (in milliseconds) elapses from the time a bit is created from the original analog signal at Host A) until the bis arrived at Host B and gets decodedas part of the analog signal at Host B)? Hint Calculate the time to generate a packet of 648 time to transmit this packettime to propagate Your aewwer should only contain umbers rounded to the hundredth (For example 123 S) Prvious
A sender with window size (W=3) is connected to a selective repeat receiver by a link with bandwidth =106 bytes/second and propagation delay of 0.25 msec. The receiver sends Positive ACK for correctly received packets. For each packet sent, the sender sets a timer with time out value of 5 msec. On receiving an ack for a packet, the timer for that packet is cancelled. If the timer expires, that packet is retransmitted immediately. Assume that the sender sends packets 1, 2, and 3 (at t=0, packet size =1000 Bytes) and packet 2 is lost. NO other packet is lost. Under this scheme , at what time in msec would all the packets been received at the receiver.
A sender with window size (W=3) is connected to a go back N receiver by a link with bandwidth =106 bytes/second and propagation delay of 0.25 msec. The receiver sends Positive ACK for correctly received in order packets. For each packet sent, the sender sets a timer with time out value of 5 msec. On receiving an ack for that packet, the timer is cancelled. If the timer expires, that packet is retransmitted immediately. Assume that the sender sends packets 1, 2, and 3 (at t=0, packet size =1000 Bytes) and packet 2 is lost. NO other packet is lost. Under this scheme , at what time (in msec) would all the packets been received at the receiver.
Consider a router buffer preceding an outbound link. In this problem, you will use Little’s formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little’s formula is N=a⋅d . Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link’s transmission rate is 100 packets/sec. Using Little’s formula, what is the average packet arrival rate, assuming there is no packet loss?
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
Consider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens for the following cases: The first packet in the sender window size is lost before reaching the destination. All transmitted packets reached the destination except the third one. Only the first and last packets in the sender window size reached the destination. Only the ACKs of the first and last packets, in the sender window size, reached the destination.
Consider two hosts, A and B that are connected by a transmissions link of2.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 time? d. Now suppose that node C is connected to node B also by a 2 Mbps, 100 Km link. How long does it take from when the first bit is transmitted by A to when the last bit is received at C, assuming B operates in a store-and -forward manner?
It is possible for a series of packets to be sent from one host to another over the same connection. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last a certain period of time while the other delay's length will be more malleable?
It is possible for a series of packets to be sent from one host to another utilizing the same route between the hosts. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last for a certain period of time, while the other delay's length remains open?
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.
It is theoretically feasible for two hosts to communicate with one another by sending packets back and forth over the same connection. Please enumerate all of the components that are responsible for the overall amount of time required to process a single packet, starting to end. Is it to be anticipated that one of the delays will continue for a certain amount of time, while the duration of the other delay will be more unpredictable?
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