1.

Consider a queue with a general state-dependent departure (server) process n

a) Explain why the average throughput a given by =

=1

b) Take a special case of the M/M/2 queue n = , n=1 and n=2 n 2. Show that
= 1 + 2 1 0 1
Show that, this is just = if p1 and p0 are explicitly calculated using

= 2

with

2. A queueing system hold N packets, including the one in service. The service rate is
state dependent with n = n , 1 n N. Arrival are Poisson with average
a) Show that the probability the system is in state n is the Erlang distribute of
=

=0
!

with = /

b) Show that the average number in the system is given by

= 1

with = /

c) Show that the average throughput is = .E[n] in tow way

- Use =
-

=1

= 1 , pB is the blocking probability

d) Littles theory says that E[T] = E[n]/ = 1/. Explain this result

3.
A queueing system has two outgoing lines, used randomly by packets requiring
service. Each transmits at a rate of packets/sec. When both lines are transmitting
(service) packets, packets are blocked from entering i.e there is no buffering in this
system. Packets are exponentially distributed in length ; arrivals are Poisson with average
rate , = / = 1
a) Find the blocking probability pB of this system
b) Find the average number E[n] of this system
c) Find the normalized throughput / with is the average throughput in packets/sec
d) Fine the average delay E[T] throughput the system, in units of 1/ (Alternately find
E[T]/1/)

4. Data concentrate has 40 terminals connect to it. Each terminal inputs packets with an
average length of 680 bits, Forty bits control information are added to each packet before
transmission over an outgoing link with capacity C = 7200 bps
- Twenty of the terminal input 1 packet/10 sec each, on the average
- Ten of the terminal input 1 packet/5 sec each, on the average
- Ten of the terminal input 1 packet/2.5 sec each, on the average
The input statistics are Poisson
a) The data unit transmitted (called frame) are exponentially distributed in length. Find:
1. The average waiting time on queue , not including service time
2. The average number of packets in the concentrator, including the one in service
b) Repeat if the packets are all of constant length
c) Repeat if the second moment of the frame length is E[2] = 3(1/)2 with 1/ is the
average frame length

5. Two types of packets are transmitted over a data network. Type 1 control packets are
48 bits long and type 2 data packets are 960 bits long on the average. The transmission
links all have a capacity of 9600bps. The data packets have a variance 22 =
2

2 1 2

with 1/2 is the average packet length in seconds. The type 1 control packets

constitute 20 percent of the total traffic. The overall traffic utilization over transmission
link is = 0.5
a) FIFO is used, show that the average waiting time for either type of packets is E[W] =
1.48 sec
b) None-preemptive priority is given to the control packets (type 1). Show that the
waiting time of these packets is reduced to the E[Wl] = 74.5 msec whereas the wait time
of the data packets (type 2) is increased slightly up to E[W] = 149 msec
6. Consider a stop-and-wait protocol to used ack and time-out only. The ack arrived at
the transmitter at time tack after transmission a frame. Take tout > tack . Frames are all of
length tl and are always available for transmission. A frame is received in error with
probability p. Show that the maximum frame throughput is

1
1 + 1

With b = (tl + tout)/( tl + tack) > 1 and tT = tl + tout [4.3]

7. Consider the following go-back-N data link protocol

i) Packets are acknowledged individually by the receiver. The ack received at the
transmitter tack (sec) after a packet completes transmission
ii) For packets received in error
-

The first transmission of a packet received in error is negative acked. The nak
appears at the transmitter tack = tnak (sec) after transmission of the packet
Subsequent retransmission of a packet received in error are ignored by the
receiver. The transmitter time-out tout (sec) after previous retransmission and the
repeat the packet
t out > t ack

Each packet is tl (sec) long. The probability that a packet in received in error is p. Find
the maximum packet transmission rate in packet/sec. Make any simplifying
assumptions needed. [4.5]

Problem in Chapter 3 of Text-book

3.2
3.3
3.4
3.5
3.7
3.8
3.9
3.11
3.13
3.19
3.20
3.29
3.50