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: A new architecture, with N layers, is proposed. User application at the top layer generates a…

A: - First we have total N layers. - Second, The message generated at the top layer is M bytes as…

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

Q: Consider the following network. Here, Distance vector routing is being used. 00 8 X 6 6 12 y 3 W st…

A: The question is based on distance vector routing algorithm.

Q: Consider a half-duplex point-to-point link using a stop-and-wait scheme, in which a series of…

A: Half duplex data transmission means that data can be transmitted in both directions on a signal…

Q: What is the number of messages required to send a file F of 4 Mbits from one station to another?…

A: In networking, data transmission involves breaking information into small pieces called…

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: Eight data terminals statistically share the capacity of an outgoing link. Traffic is combined from…

A: The Handwritten Solution is given below:

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: A single connection has the capability to transmit multiple packets between hosts. This inquiry…

A: In computer networking, the transmission of data packets between hosts typically occurs over network…

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: KNOWLEDGE CHECKS PACKET SCHEDULING (SCENARIO 2, PRIORITY). Consider the pattern of red and green…

A: Introduction Data (packet) transmission-governing, a crucial aspect of quality of service, is…

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: b. C. Derive the initial routing table for all the routers. In the next time slot, router t receives…

A: Routing:- Routing is the process of forwarding packets from the source machine to the destination…

Q: 7. Consider the network from the problem running distance-vector routing has already achieved…

A: ANSWER:-

Q: Design a GUI for your auto dealership app. For a dealership customer interactive programme, provide…

A: The answer is given in the below step

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: Suppose the R-B link in the previous exercise changes from a bandwidth delay to a propagation delay,…

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: Consider the situation in the previous exercise, except this time assume that the router has a queue…

Q: Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second…

Q: Consider the Distance Vector Routing algorithm in a network of 1000 nodes. Each node has 19 lines to…

A: In this question we need to determine the data rate per line (full duplex) taken by the Distance…

Q: Consider a network with the following topology: 6. D The owner of the network is deploying a…

A: Below is the answer to above question. I hope this will be helpful for you..

Q: as a possible congestion control mechanism in a subnet using virtual circuits internally, a router…

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 the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's…

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

Q: Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second…

Q: Distance vector routing is used. Router L receives distance vectors from routers I, H, and K as…

A: ROUTING Routing is a crucial component of the network layer and deals with the issue of identifying…

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

Consider the Go-Back-N protocol, with a window size N = 50. Suppose 30 packets are sent, but the first send of the 10th packet is lost. There are no other failure assumptions. a. How many packets will be resent? b. Imagine that the Fast Retransmit optimization has been added to the protocol. How many packets will be resent in this case?
Explain the impact on the delay and lossperformance of the low-priority traffic under the following conditions: a. The high-priority traffic consists of uniformly spaced, fixed-length packets b. The high-priority traffic consists of uniformly spaced, variable-length packets
Consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start, that works in units of packets rather than bytes, and that starts each connection with a congestion window equal to one packet. Give a detailed sketch of this algorithm. Assume the delay is latency only and that when a group of packets is sent only a single ACK is returned. Plot the congestion window as a function of round-trip times for the situation in which the following packets are lost: 9, 25, 30, 38, and 50. For simplicity, assume a perfect timeout mechanism that detects a lost packet exactly 1 RTT after it is transmitted.
1. Consider a path from host A to host B through a router X as follows: A- -X-B The capacity of the link AX is denoted Ra, while the capacity of the link XB is denoted Rb in units of [bits/s]. Assume that Ra Ri. Is it possible that the second packet queues at input queue of the second link? Explain. Now suppose that host A sends the second packet T seconds after sending the first packet. How large must T be to ensure no queueing before the second link? Explain.
One of the mechanisms TCP uses to infer congestion is a timeout. The optimal time for a timeout is slightly longer than the actual RTT for a segment. What problem is caused by a timeout that is too short? а. TCP will then use the wrong sequence number. O b. There will be too much time spent waiting for ACKS. There will be unnecessary retransmissions of the data by the sender. O d. TCP will end the session.
Consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start, that works in units of packets rather than bytes, and that starts each connection with a congestion window equal to one packet. Give a detailed sketch of this algorithm. Assume the delay is latency only and that when a group of packets is sent only a single ACK is returned. Plot the congestion window as a function of round-trip times for the situation in which the following packets are lost: 9, 25, 30, 38, and 50. For simplicity, assume a perfect timeout mechanism that detects a lost packet exactly 1 RTT after it is transmitted.
Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? O C O O O LL B A 3 2 B 8 D 10 E 4 2 F
Suppose a routing algorithm identifies paths that are “best” in the sense that: (1) minimum number ofhops, (2) minimum delay, or (3) maximum available bandwidth. Identify conditions under which the pathsproduced by the different criteria are the same? are different?
hdet b) Consider sending a packet contains 1100 bits from Host A to Host B in a store and forward nerwork. There are 10 links (and 9 routers) between A and B, and the links are congested (there Is a queuing delays). Assume propagation delay over the links are negligible. As a packet travels along the route, it encounters an average of 5 packets already waiting in the queue to be transmitted when it arrives at each router, How long does it take for the packet to get to the receiver if the nodes transmit on a "first come first served" basis (in ms)?
as a possible congestion control mechanism in a subnet using virtual circuits internally, a router could refrain from acknowledging a received packet until (1) it knows its last transmission along the virtual circuit was received successfully and (2) it has a free buffer. for simplicity, assume that the routers use a stop-and-wait protocol and that each virtual circuit has one buffer dedicated to it for each direction of traffic. if it takes 7 sec to transmit a packet (data or acknowledgement) and there are n routers on the path, what is the rate at which packets are delivered to the destination host? assume that transmission errors are rare and that the host-router connection is infinitely fast.
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?
When building software, what is the most important idea that should be kept in mind when working with prototypes?