Quality of Service and Resource Allocation 2018-19

3. A1.router
1 attached to mail server is responsible only for receiving and smoothing e-mail. The
router is equipped with the leaky-bucket traffic-shaping scheme, whereby the capacity of the grant
buffer is set on window size ‰ = 4. Packets arrive at » = 20 packets per second, and grants arrive
at g = 30 packets per second. Packet arrival during 1 /g is distributed according to Poisson. Assume
that P = 0.007.

1. Find the probability that k packets arrive during 1 /g, denoted by P X (k).
2. Find the probabilities that 0, 1, 2, and 3 grants are allocated to arriving packets.
3. Find all the transition probabilities for four states 0, 1, 2, and 3.
4. Sketch a Markov chain representing the number of grants allocated to packets for the first
four states.

DEPT OF E & C, JSSSTC-MYSURU 1

Quality of Service and Resource Allocation 2018-19

4. Consider a token-bucket traffic shaper. Let the bucket size be b bits and the token arrival
rate be ½ b/s; let the maximum output data rate be z b/s.

1. Derive an equation for T b , the time consumed for a flow to be transmitted at the
maximum rate.
2. Find T b when the bucket size is b = 0.5 Mb, ½ = 10 Mb/s, and z = 100 Mb/s.

DEPT OF E & C, JSSSTC-MYSURU 2

Quality of Service and Resource Allocation 2018-19

6. Derive an expression for a priority scheduler to present the mean residual service time, 𝑟𝑖 ,
used in Equation (12.10). (Hint: Use𝜇𝑖 .)

7. Assume that all components of a three-flow (n = 3) priority scheduler are identical: » i = » =

0.2/ms, 1 / µ i = 1 / µ = 1/ms, and r i = r = 0.5/ms. Find the total system delay for a packet
passing each of the three queues 1, 2, and 3 and the server denoted by E [T 1], E [T 2],
and E [T 3], respectively. Do the following.

1. Use a non-preemptive priority scheduler for the task.

2. Use a preemptive priority scheduler for the task.
3. Comment on results obtained in parts (a) and (b).

DEPT OF E & C, JSSSTC-MYSURU 3

Quality of Service and Resource Allocation 2018-19

8. We want to compare the impact of an increased number of inputs on total delay in priority
schedulers. Assume that all components of a three-flow (n = 3) and a four-flow (n = 4) priority
scheduler are identical: » i = » = 0.2/ms, 1 / µ i = 1 / µ = 1/ms, and r i = r = 0.5/ms. Find the
total system delay for a packet passing queue 3 denoted by E [T 3]. Do the following

1. Use a non-preemptive priority scheduler for the task.

2. Use a preemptive priority scheduler for the task.
3. Justify the results obtained in parts (a) and (b).

DEPT OF E & C, JSSSTC-MYSURU 4

Quality of Service and Resource Allocation 2018-19

DEPT OF E & C, JSSSTC-MYSURU 5

Quality of Service and Resource Allocation 2018-19

9. Suppose that four flows are processed in a router that accepts only equal-size packets.
Packets in these flows arrive at the following virtual clock times:

Flow 1: 4, 5, 6, 7, 9

Flow 2: 1, 6, 9, 12, 14

Flow 3: 1, 4, 8, 10, 12

Flow 4: 2, 4, 5, 6, 12

1. For each packet, give the virtual clock count at which it is transmitted, using fair
queueing. If the arrival times of two packets are the same, the smaller flow number is
selected.
2. Now consider weighted fair queueing, whereby flows 1, 2, 3, and 4 are given 10 percent,
20 percent, 30 percent, and 40 percent of the output capacity, respectively. For each
packet, give the virtual clock count at which it is transmitted.

12. In a non-preemptive priority queueing scheme, a low-priority flow is guaranteed to receive

10 percent of the total bit rate s of the transmission link.

1. How much better does this low-priority flow perform?

DEPT OF E & C, JSSSTC-MYSURU 6

Quality of Service and Resource Allocation 2018-19

2. What would be the impact on the performance of the high-priority flows?

13. Each output port processor unit of a router has four inputs designated to four different flows.
The unit receives the packets in the following order during a period in which the output port
is busy but all queues are empty. Give the order in which the packets are transmitted.

Flow:1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 4

Packet: 1, 2, 3, 4, 5, 6, 7,8, 9, 10, 11, 12

Packet size: 110, 110, 110, 100, 100, 100, 100, 200, 200, 240, 240, 240

1. Assume a fair queueing scheduler.

2. Assume a weighted fair-queueing scheduler with flow i ∈{1, 2, 3, 4} having
weights 𝑤𝑖 i ∈{10%, 20%, 30%, 40%} of the output capacity, respectively.

DEPT OF E & C, JSSSTC-MYSURU 7

Quality of Service and Resource Allocation 2018-19

14. In Figure 12.16, flows A, B, C, and D are processed at one of the outputs of a router. For
each packet, the time it arrives and its label are indicated in the figure. Specify the order of
packets transmitted at this output, using the following three schedulers. All schedulers scan the
flows, starting from flow A.

1. Priority queueing. Priorities decrease from line A to line D.

2. Fair queueing. If the arrival times of two packets are the same, the smaller flow number
is selected.
3. Weighted fair queueing, where flows A, B, C, and D are given 10 percent, 20 percent,
30 percent, and 40 percent, respectively, of the output capacity.

Figure 12.16. Exercise 14 comparison of priority queueing, fair queueing, and weighted fair
queueing on processing of four flows

DEPT OF E & C, JSSSTC-MYSURU 8

Quality of Service and Resource Allocation 2018-19

15. Figure 12.17 shows four flows (A, B, C, and D) to be processed at one of the outputs of a
router. For each packet, the time it arrives and its label are indicated in the figure. Specify the
order of packets transmitted at this output, using the following three schedulers. All schedulers
scan the flows, starting from flow A.

1. Priority queueing. Priorities decrease from line A to line D.

2. Fair queueing. If the arrival times of two packets are the same, the smaller flow number
is selected.
3. Weighted fair queueing, where flows A, B, C, and D are given 20 percent, 10 percent,
40 percent, and 20 percent, respectively, of the output capacity.

Figure 12.17. Exercise 15 comparison of priority queueing, fair queueing, and weighted fair
queueing on processing of four flows

DEPT OF E & C, JSSSTC-MYSURU 9

Quality of Service and Resource Allocation 2018-19

DEPT OF E & C, JSSSTC-MYSURU 10

Quality of Service and Resource Allocation 2018-19

1. Consider a commercial wireless mobile telephone system whose transmitter and receiver
are located 9.2 km apart. Both use isotropic antennas. The medium through which the
communication occurs is not a free space, and it creates conditions such that the path loss
is a function of d3 and not d2. Assume that the transmitter operating at the frequency of
800 MHz communicates with a mobile receiver with the received power of 10-6
microwatts.
a. Find the effective area of the receiving antenna.
b. Find the required transmission power.

DEPT OF E & C, JSSSTC-MYSURU 11

Quality of Service and Resource Allocation 2018-19

2. Assume that cellular networks were modeled by square cells

a. Find the cell coverage area, and compare it to the one using hexagonal cells. Assume
that the distance between the cell centers are identical in these two models.
b. What are the disadvantages of this model compared to the one with hexagonal cells?

3. A cellular network over 1,800 km2 supports a total of 800 radio channels. Each cell has an
area of 8 km2.
a. If the cluster size is 7, find the system capacity.
b. Find the number of times a cluster of size 7 must be replicated to approximately cover
the entire area.
c. What is the impact of the cluster size on system capacity?

DEPT OF E & C, JSSSTC-MYSURU 12

Quality of Service and Resource Allocation 2018-19

4. Consider a cellular network with 128 cells and a cell radius r=3 km. Let g be 420 traffic
channels for a N = 7-channel cluster system.
a. Find the area of each hexagonal cell.
b. Find the total channel capacity.
c. Find the distance between the centers of nearest neighboring cochannel cells.

DEPT OF E & C, JSSSTC-MYSURU 13

Quality of Service and Resource Allocation 2018-19

5. If cells split to smaller cells in high-traffic areas, the capacity of the cellular networks for
that region increases.
a. What would be the trade-off when the capacity of the system in a region increases as a
result of cell splitting?
b. Consider a network with 7-cell frequency reuse clustering. Each cell must preserve its
base station in its center. Construct the cell-splitting pattern in a cluster performed from
the center of the cluster.

6. We would like to simulate the mobility and handoff in cellular networks for case 4
described in this chapter. Assume 25 mph k 45 mph within city and 45 mph k 75 mph
for highway. Let db be the distance a vehicle takes to reach a cell boundary, ranging from
-10 miles to 10 miles.

DEPT OF E & C, JSSSTC-MYSURU 14

Quality of Service and Resource Allocation 2018-19

a. Plot the probability of reaching a cell boundary for which a handoff is required. Discuss
why the probability of reaching a boundary decreases in an exponential manner.
b. Show that the probability of reaching a cell boundary for a vehicle that has a call in
progress is dependent on db.
c. Show the probabilities of reaching a cell boundary as a function of a vehicle's speed.
d. Discuss why the probability of reaching a cell boundary is proportional to the vehicle's
speed.

DEPT OF E & C, JSSSTC-MYSURU 15

Quality of Service and Resource Allocation 2018-19

DEPT OF E & C, JSSSTC-MYSURU 16