A resource has a capacity of 30 units and use of the resource is desired by...

Transcribed Image Text:

A resource has a capacity of 30 units and use of the resource is desired by 5 users. The users A, B. C, D, and E have demands of 6, 8, 12, 24, and 2 units, respectively. Determine the allocation of the resource on the basis of max-min fair sharing. You may assume that users may utilize fractions of resource units if required. Repeat the question, assuming that the users are given weights 20, 40, 10, 20, and 10, respectively. Question 2 Consider a GPS scheduler used to determine the servicing for 6 sources. Each source requires servicing according to the following: Source Start Time 1 2 3 4 5 6 0 2 3 10 15 20 Required Service Time 6 5 3 4 5 8 Determine the time at which each source is finished being served. Question 3 Consider a weighted round robin scheme for scheduling packets on a 100 Mbps link where each packet has a size of 1000 bits. We can view time divided into timeslots equivalent to the time required to transmit one cell on the link. Cells arrive at the link queues synchronized to a timeslot. The link is servicing 4 connections each having its own queue and the following service weights: Connection Weight 20 10 40 30 At a particular time, the queues have the following number of cells in them. Connection Cells in Quenes 10 10 20 20 A weighted round robin scheduling of the cells in queues begins at connection I and proceeds to connection 2, etc... What is the time required for the first round of the round robin? Determine how the cells would be scheduled for transmission on the link, assuming no other cells come in. Comment of the faimess of the scheme by comparing to GPS. A resource has a capacity of 30 units and use of the resource is desired by 5 users. The users A, B. C, D, and E have demands of 6, 8, 12, 24, and 2 units, respectively. Determine the allocation of the resource on the basis of max-min fair sharing. You may assume that users may utilize fractions of resource units if required. Repeat the question, assuming that the users are given weights 20, 40, 10, 20, and 10, respectively. Question 2 Consider a GPS scheduler used to determine the servicing for 6 sources. Each source requires servicing according to the following: Source Start Time 1 2 3 4 5 6 0 2 3 10 15 20 Required Service Time 6 5 3 4 5 8 Determine the time at which each source is finished being served. Question 3 Consider a weighted round robin scheme for scheduling packets on a 100 Mbps link where each packet has a size of 1000 bits. We can view time divided into timeslots equivalent to the time required to transmit one cell on the link. Cells arrive at the link queues synchronized to a timeslot. The link is servicing 4 connections each having its own queue and the following service weights: Connection Weight 20 10 40 30 At a particular time, the queues have the following number of cells in them. Connection Cells in Quenes 10 10 20 20 A weighted round robin scheduling of the cells in queues begins at connection I and proceeds to connection 2, etc... What is the time required for the first round of the round robin? Determine how the cells would be scheduled for transmission on the link, assuming no other cells come in. Comment of the faimess of the scheme by comparing to GPS.

Answer rating: 100% (QA)

For maxmin fair sharing without weights the allocation is determined by initially giving each user an equal share In this case 1 Allocate 6 units to A ... View the full answer