Question

2. Consider the three queues shown below. Suppose that we are implementing weighted fair queueing for access control, fill out the associated table base on the indicated weighting scheme. Show your work. Input Queues -- not necessarily to scale Packet Arrival Time Length Finish Time Output Order A 3 5 F A 1x B 5 2 C 5 2 D 8 9 H D B 1x E 8 8 F 10 6 G 11 10 J G E C 2x H 15 3 I 18 4 J 20 8

          2. Consider the three queues shown below. Suppose that we are implementing weighted fair
queueing for access control, fill out the associated table base on the indicated weighting
scheme. Show your work.
Input Queues -- not necessarily to scale
Packet
Arrival
Time
Length
Finish
Time
Output
Order
A
3
5
F
A
1x
B
5
2
C
5
2
D
8
9
H
D
B
1x
E
8
8
F
10
6
G
11
10
J
G
E
C
2x
H
15
3
I
18
4
J
20
8

2. Consider the three queues shown below. Suppose that we are implementing weighted fair
queueing for access control, fill out the associated table base on the indicated weighting
scheme. Show your work.
Input Queues – not necessarily to scale
Packet
Arrival
Time
Length
Finish
Time
Output
Order
A
3
5
F
A
1x
B
5
2
C
5
2
D
8
9
H
D
B
1x
E
8
8
F
10
6
G
11
10
J
G
E
C
2x
H
15
3
I
18
4
J
20
8

Added by Concepci-N J.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Avi Bukys

Step 1

The basic idea is to simulate a fluid model where packets from different queues are served in proportion to their weights. Step 2: Identify the Weights and Queues From the question, it's not explicitly stated what the weights for each queue are. For the purpose Show more…

Show all steps

Thanks for your feedback!

Consider the three queues shown below. Suppose that we are implementing weighted fair queuing for access control, fill out the associated table based on the indicated weighting scheme. Show your work. Input Queues - not necessarily to scale Packet Arrival Time 3 5 5 8 8 10 11 15 18 20 Length Finish Time Output Order A B C D 5 2 2 9 8 6 10 3 4 8 1 F G H J