Page 1 of 8

Problem 1
For a given , which is the loss probability, the system needs a capacity of C for sup-
porting N connections which can be computed as follows.
√
C = m + σ − ln 2π − 2 ln  (1)
p
where, m = N p , σ = N p(1 − p)
Hence, for a system with a given number of N multiplexed on-off sources, the required
capacity for a given  can be computed using the above equation, and thus computing
the required link capacity CL = CRp for the system to operate with the given QoS
measures.

8
x 10
3
peak CL assignment
−6
ε = 10
2.5
ε = 10−5
−4
ε = 10
Required Link Capacity CL

average CL assignment
2

1.5

0.5

0
0 100 200 300 400 500 600 700 800 900 1000
Number of Sources N

Figure 1: Peak and Average Capacity Assignment for varying N .

The graph in Figure 1 shows how the CL for capacity assignment increases with N ,
which is to be expected. The system analyzed in the figure is for the case where p = 0.02
and Rp = 4 M bps. Furthermore, a tighter constraint on the QoS requirement  would
imply that a higher link capacity assignment is needed to attend to the requests of the
same number of sources N , as shown in the graph. The curves for peak assignment, i.e.
CL = N Rp , is also included in the figure, and represents the extreme case of a strict
QoS requirement with  = 0. Average capacity assignment, given by CL = N pRp is also
included in the figure.

1
 Page 2 of 8

Problem 2
For a system with CL = 200 M bps, Rp = 4 M bps, p = 0.02, the maximum number
of sources N that can allowed while satisfying the system’s QoS constraint on the loss
probability  = 10−5 can be computed using the following.

CL √
= m + σ − ln 2π − 2 ln 
Rp
p √
= Np + N p(1 − p) − ln 2π − 2 ln 

Hence,

200 √
= 0.02N + 0.14 N (4.603)
4 √
50 = 0.02N + 0.644 N

Solving the above equation yields an N = 1326.5, i.e. N ≈ 1326 sources can be
allowed in the system with the given QoS constraints  = 10−5 .
If, however, the original link capacity is reduced to CL = 100 M bps, then the follow-
ing equation would need to be solved for N.

CL p √
= Np + N p(1 − p) − ln 2π − 2 ln 
Rp
100 √
= 0.02N + 0.14 N (4.603)
4 √
25 = 0.02N + 0.644 N

Solving the above equation yields an N = 517.2, i.e. N ≈ 517 sources can be allowed
in the system with the given QoS constraints  = 10−5 and CL = 100 M bps. Note how
the maximum number of allowed sources N reduces with a reduction in CL . However,
halving the link capacity reduces N by more than a half.

2
 Page 3 of 8

Problem 3
For this system, given that Rp = 5200 cells/sec, N = 100, β = 2 sec−1 , x = 3900 cells,
and PL = 10−6 , we can compute the required link capacity CL for a range of α using
the following equations.
 s 
2
1−k 1−k
CL = N R p  + + kp (2)
2 2

where
βx α
k = , p =
Rp (1 − p) ln P1L α+β
Note that the maximum buffer delay for this system is given as CxL . Figures 2 and
3 shows how the required link capacity varies with α1 (silent period). A very high link
capacity is required for sources with really small off-periods (with CL → peak assignment
as α1 → 0), which decreases rapidly as the size of the off-period increases and eventually
reaches a steady value for CL as α1 continues to increase. Figure 4 shows how the
maximum buffer delay increases as the size of the off-period increases, and eventually
reaches a steady point. This increase is due to the reduction in the required link capacity
CL as α1 increases, while maintaining the same buffer size.

5
x 10
5.2

5.1
Link Capacity CL

4.9

4.8

4.7

4.6
0 1 2 3 4 5
Average Off Interval (1/α)

Figure 2: Link Capacity Assignment for varying α1 , and for x = 3900 cells.

3
 Page 4 of 8

5.7
10
Link Capacity CL

5.69
10

5.68
10

5.67
10

−2 −1 0 1
10 10 10 10
Average Off Interval (1/α)

Figure 3: A Log-Scale Graph Showing the Link Capacity Assignment for varying α1 , and
for x = 3900 cells.

−3
x 10
8.6

8.5

8.4
Maxmimum Buffer Delay

8.3

8.2

8.1

7.9

7.8

7.7

7.6
0 1 2 3 4 5
Average Off Interval (1/α)

Figure 4: Maximum Buffer Delay for varying α1 , and for x = 3900 cells.

4
 Page 5 of 8

If the buffer size of the system was increased to x = 15600 cells, with the other
parameters remaining unchanged, the same equations can be used to compute the
required link capacity for this new system under various α1 . Figures 5 and 6 show a
similar behavior to those observed in the previous case, in terms of the relationship
between the required link capacity CL with increasing α1 . However, it is worth noting
that the steady value for the link capacity is much lower than that computed for the case
with a lower buffer size. This suggests that a reduction in the link capacity requirements
can be achieved through an increase in the buffer size, which still maintains the same
QoS requirements in terms of PL . However, this reduction in the required CL with a
larger buffer size comes at a cost of increasing the maximum buffer delay, as shown in
Figure 7.

5
x 10
5.5

5
Link Capacity CL

4.5

3.5

2.5
0 5 10 15 20
Average Off Interval (1/α)

Figure 5: Link Capacity Assignment for varying α1 , and for x = 15600 cells.

5
 Page 6 of 8

5.7
10

Link Capacity CL

5.6
10

5.5
10

−2 −1 0 1 2
10 10 10 10 10
Average Off Interval (1/α)

Figure 6: A Log-Scale Graph Showing the Link Capacity Assignment for varying α1 , and
for x = 15600 cells.

0.055

0.05
Maxmimum Buffer Delay

0.045

0.04

0.035

0.03
0 5 10 15 20
Average Off Interval (1/α)

Figure 7: Maximum Buffer Delay for varying α1 , and for x = 15600 cells.

6
 Page 7 of 8

Problem 4
Let i be the number of tokens in the token buffer pool and pi be the steady-state
probability that i tokens are in the pool just before a token is generated. Since the
tokens are generated periodically every D sec., token generation times are thus spaced
D sec. apart, as shown in figure.
Let αj be the probability j cells (packets) arrive in any D sec interval. Assume that
arrivals are independent from interval to interval.
In the steady state, the probability pi at the end of one interval could be equal to
the sum of the probabilities of the various states the token buffer could have been in,
exactly one interval earlier. This gives rise to a set of discrete-time balance equations.
Consider the state i = M , i.e., the state for which the token buffer is full. For this
state, there can only have been two possibilities one interval earlier: the buffer was in
state (M − 1), a token was added and no calls arrival during the entire interval, or buffer
was in state M , no token was added and again no arrivals took place. Thus,

pM = (pM −1 + pM )α0

Similarly, for i = M − 1, we have

pM −1 = pM −2 α0 + pM −1 α1 + pM α1

In general, allowing any number j of data cells to arrive in an interval, with its corre-
sponding probability of arrival αj , we have
M
X
pi = pj−1 αj−i + pM αM −i , 1≤i≤M
j=i

and
M
X −1
p0 = pj ᾱj + pM ᾱM −1
j=0

where
j ∞
X X
ᾱj = 1 − αk = αk .
k=0 k=j+1

Given the balance equations, pi can be solved from the following recursive technique.
Randomly choose some value of pM < 1. Then, we have

pM −1 = pM (1 − α0 )/α0
pM −2 = {[pM −1 (1 − α1 )] − pM α1 }/α0
−1−i
MX
pi = [pi+1 − pi+j αj − pM αM −1−i ]/α0 , 0 ≤ i ≤ M − 2.
j=1

7
 Page 8 of 8

PM
Let S = i=0 pi . Then,

pi = pi /S, 0≤i≤M

If token buffer is in state M , then at most M cells can be transmitted. (No token
can be added since the token buffer state has been defined just prior to a possible token
arrival. This arrival is blocked if the buffer is full.) Therefore, exactly M cells will be
transmitted if M or more cells arrive in the interval D sec long. If fewer arrive, they
will all be transmitted.
If token buffer is in state k ≤ M −1, then the number of cells that can be transmitted
in one token generation interval varies from 1, with arrival probability α1 , to at most
(k + 1), since an additional token will be added during that interval.
In summary:
M
X ∞
X M
X −1 k+1
X ∞
X
∗
λ D = pM [ iαi + M αi ] + pk [ iαi + (k + 1) αi ]
i=0 i=M +1 k=0 i=1 i=k+2