Solution To Problem 2.17

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

An Introduction to Queueing Systems, Kluwer Academic Publishers Solution Manual

Copyright 2001, Sanjay K. Bose


Solution to Problem 2.17
This is actually the same queue as the one considered in Sec. 2.10.1 except that the batch sizes
now range from 0 to . In Sec. 2.10.1, zero-sized batches were not allowed and hence the batch
sizes could only range from 1 to .
Let

=
=
1
* *
) (
r
r
r
z z be the batch generating function for Sec. 2.10.1 and

=
=
0
) (
r
r
r
z z be the
batch generating function for this problem. Then we can see that
0
*
1

=
r
r
and
) 0 ( 1
) 0 ( ) (
) (
*

=
z
z . If we use
) 0 ( 1
) 0 ( ) (
) (
*

=
z
z instead of (z) in the results of Sec. 2.10.1,
the results obtained will be the same as the ones asked for in this problem. The direct approach
applying the same methods as in Sec. 2.10.1 will verify this.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy