Suppose a router has three input flows and one output. It receives the packets listed in Table 6.1 all at about the same time, in the order listed, during a period in which the output port is busy but all queues are otherwise empty. Give the order in which the packets are transmitted, assuming (a) Fair queuing. (b) Weighted fair queuing, with flow 2 having weight 4, and the other two flows having weight 1. Table 6.1 Packets for Exercise 10 Packet 1 2 3 4 5 6 7 8 Size 100 100 100 100 190 200 110 50 Flow 1 1 1 2 2 3

Suppose a router has three input flows and one output. It receives the packets listed in Table 6.1 all at about the same time, in the order listed, during a period in which the output port is busy but all queues are otherwise empty. Give the order in which the packets are transmitted, assuming (a) Fair queuing. (b) Weighted fair queuing, with flow 2 having weight 4, and the other two flows having weight 1. Table 6.1 Packets for Exercise 10 Packet 1 2 3 4 5 6 7 8 Size 100 100 100 100 190 200 110 50 Flow 1 1 1 2 2 3

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: Suppose a router's drop policy is to drop the highest-cost packet whenever queues are full, where it…

Q: 1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with…

A: i) Message 1: {"Alice", K, RA}Bob, Message 2: RA, RB "Bob" who is authenticated to person "Alice"…

Q: Eight data terminals statistically share the capacity of an outgoing link. Traffic is combined from…

A: The Handwritten Solution is given below:

Q: Consider the network topology shown below with routers labeled A through F, inclusive. Each link is…

A: Answer is given below .

Q: . List all non-looping paths that take exactly 4 hops from A to G

A: Question a is saying we have to find all the path that start from A goes to G and path should cross…

Q: 2. Packet transmission. a. Consider a packet of length L that begins at end system A and travels…

A: Below is the complete solution with explanation in detail for the given questions about Packet…

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: The graph abstruction of a network with a set of routers {s, v, w, x, y, z} is given in figure 1.…

A: Using Dijkstra's link state algorithm to find the shortest path from router 's' to all the other…

Q: given in figure given in the figure. kstra's link sta jontnm suppose you waht to nd the shortest…

A: Dijkstra algorithm is used to find shortest path from a particular source node to every other node.…

Q: A router has the following four active flows, and each flow has packets to transmit. Given FQ is…

A: Given, A router has the following four active flows, and each flow has packets to transmit. Given FQ…

Q: Suppose two hosts A and B are connected via a router R. The A-R link has infinite bandwidth; the R-B…

A: Here is explanation regarding the graph.

Q: 12. Consider the network shown below with the current measured delays between two nodes. B 1 E F a.…

A: SHORTEST PATH: The complexity of finding the shortest path from top to top in a line. The least…

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…

Q: Assume the VC number of a virtual-circuit network is a 16-bit field. What is the maximum number of…

A: Understanding the Concept of Virtual Circuits and VC NumbersA virtual-circuit network utilizes…

Q: Consider the network in the figure. Use distance vector algorithm to calculate and fill in the…

A: Distance vector routing: Distance vector routing is an asynchronous algorithm in which node x sends…

Q: A. During which of the following intervals of time is TCP performing slow start*? B. During which of…

A: The question is asking to identify the intervals of time during which TCP is performing slow start,…

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

10. Suppose a router has three input flows and one output. It receives
the packets listed in Table 6.1 all at about the same time, in the
order listed, during a period in which the output port is busy but
all queues are otherwise empty. Give the order in which the
packets are transmitted, assuming
(a) Fair queuing.
(b) Weighted fair queuing, with flow 2 having weight 4, and the
other two flows having weight 1.
Table 6.1 Packets for Exercise 10
Packet
1
2
3
4
5
6
7
8
Size
100
100
100
100
190
200
110
50
Flow
1
1
1
1
2
2
3
3

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

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 3 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

4. a) Consider designing an ATM network with a leaky-bucket policer that ensures a virtual circuit does not send more cells than expected. Suppose a link has a first-in-first-out (FIFO) queue and carries traffic for two virtual circuits. The traffic on the first virtual circuit follows a leaky- bucket policer (with a bucket depth of 9 cells and a token rate of 100 cells/second) and can settle for best-effort service. The traffic on the second virtual circuit follows a leaky-bucket policer (with a bucket depth of one cell and a token rate of 100 cells/second) that cannot tolerate more than 100 milliseconds of delay in delivering each cell. Suppose the propagation delay on the link is 50 milliseconds. Analyse the smallest transmission rate R, in cells per second, that can satisfy the delay constraint, given that the link serves cells in FIFO order.
Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but…
A TCP connection is established through 10 wireless hops in an acoustic underwater ad hoc network. Assume that each hop is 100 meter in the average, acoustic signals travel 1500 meter per second, 10 kilobit data can be sent per second over a link, the source node has one megabyte of data to send, the receiver window size is 64 kilobytes, the maximum segment size is 1 kilobyte and the average processing delay for routing at each node is one millisecond. Assume also that the following segments do not reach the destination: 67, 112, 137. What would be the average utilization of the links for this connection if there is not another communications through them? Explain an alternative approach to increase the bandwidth utilization?
. Let A and B be two stations attempting to transmit on an Ethernet. Each has a steady queue of frames ready to send; A's frames will be numbered A1, A2, and so on, and B's similarly. Let T= 51.2 µs be the exponential backoff base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times of 0 x and 1 x T, respectively, meaning A wins the race and transmits A₁ while B waits. At the end of this transmission, B will attempt to retransmit B₁ while A will attempt to transmit A2. These first attempts will collide, but now A backs off for either 0 × T or 1 x T, while B backs off for time equal to one of 0 x T,..., 3 x T. (a) Give the probability that A wins this second backoff race immediately after this first collision; that is, A's first choice of backoff time k x 51.2 is less than B's. (b) Suppose A wins this second backoff race. A transmits A3, and when it is finished, A and B collide again as A tries to transmit A4 and B tries once more to…
2. Consider a network node represented by an M/M/1 model. (a) Find the probability that the mumber of packets in the node is less than a given number k, P[K(t) < k]. This is normally used to estimate the threshold time of the network node to reach a certain load. (b) If we require that P[K(t) < 20] = 0.9904, determine the switching service rate if the arrival rate to this node is 300 packets per second.
Suppose a router's drop policy is to drop the highest-cost packet whenever queues are full, where it defines the "cost" of a packet to be the product of its size by the time remaining that it will spend in the queue. (Note that in calculating cost it is equivalent to use the sum of the sizes of the earlier packets in lieu of remaining time.) (a) What advantages and disadvantages might such a policy offer, compared to tail drop? (b) Give an example of a sequence of queued packets for which dropping the highest-cost packet differs from dropping the largest packet. (c) Give an example where two packets exchange their relative cost ranks as time progresses.
A) Assume there is a wide-area network with N nodes, where N ≥ 2 What is the smallest number of point-to-point communication links such that every node in the network is able to talk to every other node? (Note: A network in which some nodes are unable to exchange messages with other nodes because there is no path between them is called disconnected.)