Two users, one using Telnet and one sending files with FTP, both send their traffic out via router R. The outbound link from R is slow enough that both users keep packets in R's queue at all times. Discuss the relative performance seen by the Telnet user if R's queuing policy for these two flows is (a) Round-robin service. (b) Fair queuing. (c) Modified fair queuing, where we count the cost only of data bytes and not IP or TCP headers. Consider outbound traffic only. Assume Telnet packets have 1 byte of data, FTP packets have 512 bytes of data, and all packets have 40 bytes of headers.

Two users, one using Telnet and one sending files with FTP, both send their traffic out via router R. The outbound link from R is slow enough that both users keep packets in R's queue at all times. Discuss the relative performance seen by the Telnet user if R's queuing policy for these two flows is (a) Round-robin service. (b) Fair queuing. (c) Modified fair queuing, where we count the cost only of data bytes and not IP or TCP headers. Consider outbound traffic only. Assume Telnet packets have 1 byte of data, FTP packets have 512 bytes of data, and all packets have 40 bytes of headers.

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

Related questions

Q: Refer to the exhibit. The network topology is provided and we are using Distance Vector Routing…

A: Hey there, I am writing the required solution of the questin mentioned above. Please do find the…

Q: Consider a simple UDP-based protocol for requesting files (based somewhat loosely on the Trivial…

Q: Suppose a router's drop policy is to drop the highest-cost packet whenever queues are full, where it…

Q: 22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a…

A: Answer: Probability of router discarding the packets= p that means Probability of router reach the…

Q: Data collision occurs when multiple senders simultaneously attempt to access the communication…

A: Data collisions can pose significant challenges in network communication when multiple senders…

Q: Given a M/G/1 queue, which has packets arriving at a rate 1 packets/sec, an output link rate R bps,…

A: Note: Answering the first three subparts as per the guidelines. Given Date : Packet arrival rate =…

Q: The usage of static routing has been met with opposition for several reasons, but which of the…

A: Because altering route information necessitates administrator interaction, topology changes need…

Q: Many bits can be sent at the same time over a link between two hosts. Please tell me how long it…

A: The answer is given below step.

Q: Host A and B are communicating over a TCP connection, and Host B has already received all bytes up…

A: Given data: Host A and B are communicating over a TCP connection, and Host B has already received…

Q: If the WFQ mechanism is used in scheduling the following queues. When does each packet leave the…

A: answer is in step 2

Q: Specifically, it contains four routers. This includes each of the four different router varieties.…

A: When a new connection is established between Routers A and C in a network consisting of four…

Q: A connection between two servers may transport multiple packets simultaneously. Please break down…

A: When two servers exchange information through a organization, the information is not sent in one…

Q: A datagram subnet allows routers to drop packets whenever they need to. The probability of a router…

A: According to the question, we have to find (a) hops a packet makes per transmission (b)…

Q: Consider a simple protocol for transferring files over a link. After some initial negotiation, A…

A: Stop-and-wait stop and wait, implies, that anything the information that the shipper needs to send,…

Q: Consider a simple protocol for transferring files over a link. After some initial negotiation, A…

A: Protocol:- This is the set of official rules or standard set of a system governed by the supreme…

Q: Defeating TCP congestion-control mechanisms usually requires explicit cooperation of the sender.…

Q: sends twe sequence segments segment eceived o

Q: Suppose a router's drop policy is to drop the highest-cost packet whenever queues are full, where it…

A: One advantage of this policy is that it can help to avoid dropping packets that have already been in…

Q: Problem 2. Consider a packet of L bits that is sent over a path of Q links (i.e., a source and…

A: Packet switching is defined as the connectionless network where the messages are divided and grouped…

Q: Consider that only a single TCP (Reno) connection uses one 10Mbps link which does not buffer any…

A: A The maximum window size that this TCP connection can achieve is 10 segments. BThe average window…

Q: Question 1 Suppose P packets arrive simultaneously to a link at which three packets are currently…

Q: For each of the three general approaches we studied for broadcast communi- cation (uncontrolled…

A: Uncontrolled Flooding: A node may receive multiple copies of the same packet is TRUE. Reason: The…

Q: Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both…

A: In this question we have to understand the comparison between non-persistent HTTP and persistent…

Q: Explain the impact on the delay and loss performance of the low-priority traffic under the following…

A: The presence of high-priority packets deprives low-priority packets from accessing the transmission…

Q: Consider one TCP connection on a path with a bottleneck link with capacity L. We have a file of size…

A: TCP Connection which refers to the one that it is TCP which is connection-oriented, and a connection…

Q: Consider a packet of length L that begins at end system A and travels over three links to a…

A: The above question is solved in step 2 :-

Q: Consider a simple protocol for transferring files over a link. After some initial negotiation, A…

A: Stop-and-wait Stop-and-wait ARQ likewise alluded to as rotating bit convention, is a strategy in…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

Two users, one using Telnet and one sending files with FTP, both send their traffic out via router R.
The outbound link from R is slow enough that both users keep packets in R's queue at all times.
Discuss the relative performance seen by the Telnet user if R's queuing policy for these two flows is
(a) Round-robin service.
(b) Fair queuing.
(c) Modified fair queuing, where we count the cost only of data bytes and not IP or TCP headers.
Consider outbound traffic only. Assume Telnet packets have 1 byte of data, FTP packets have 512
bytes of data, and all packets have 40 bytes of headers.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Assume now that between A and B there is a switch S that uses store and forward. The distance from A to S is m meters and from S to B 2m meters. The link speed between A and S is R bps and between S and B R/2 bps. A has a supply of 6 packets to send to B using UDP. The switch buffer can accommodate 3 packets including the one being transmitted (until it finishes its transmission). Will there be packet losses at the switch buffer. Which packets (number packets 1, 2, 3, ...). Draw an annotated time-space diagram to illustrate this data transmission. (you should roughly respect the scales in your drawing).
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?
We discussed increasing the timeout interval once a timeout occurred. This strategy is used to control traffic congestion. Why, in addition to the doubling-timeoutinterval approach, does TCP require a window-based congestion-control method?
Consider a client has established TCP connection with a server and sending data. The propagation delay is 5 ms and there are no timeouts and errors during transmission. The size of the receiver advertised window is 128 KB, the slow-start threshold at the client is 64 KB, and the maximum segment size is 4 KB. The connection is established at time T = 10 ms. What is the size of the congestion window (in KB) at time 90 ms after all acknowledgements are processed?
We observed that (n-1)D is the maximal delay in queuing if the fabric of switching is n times faster than the input line rate. Suppose all packets have the same duration, n packets are sent to n entry ports at the same time, and all n packets are sent to separate exit ports. What is the maximum delay for a memory packet?
For the sake of this example, let us assume that a packet is being sent from its origin to an address at the other end of the network through a fixed path. The following are other reasons for lateness: How long do the majority of total delays last, and what proportion of total delays are time-dependent?
For the sake of this example, let us assume that a packet is being sent from its origin to an address at the other end of the network through a fixed path. The following are other reasons for lateness: How long do the majority of total delays last, and what proportion of total delays are time-dependent?
Two users, one using Telnet and one sending files with FTP, both send their traffic out via router R. The outbound link from R is slow enough that both users keep packets in R's queue at all times. Discuss the relative performance seen by the Telnet user if R's queuing policy for these two flows is (a) Round-robin service. (b) Fair queuing. (c) Modified fair queuing, where we count the cost only of data bytes and not IP or TCP headers. Consider outbound traffic only. Assume Telnet packets have 1 byte of data, FTP packets have 512 bytes of data, and all packets have 40 bytes of headers.
What would happen - over time - to packets arriving at Router M in the following scenario?Explain
2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?
Let host A sends a file a size of 2200 byte to host B through routers R1, R2, R3, R4 and R5 respectively. Each packet contains 110 bytes of header information along with the user data. Assume that the bandwidth of each link is 106 B/s. File is split into 20 equal parts, and these packets are transmitted from A to B. Consider only transmission time and ignore processing, queuing and propagation delays also no error in transmission. What is the time taken by host A to send the complete file to host B?
In what ways do the architectural components of business intelligence differ?