Vous êtes sur la page 1sur 1


3 Performance Analysis
To make the analysis tractable, we consider a simplified case that (1) there is
one real-time mini-slot, and all the real-time packets are treated equally; (2)
per-router fairness is considered. We assume that the voice and video call arriv
als at each source node are independent and follow a Poisson process, and the ca
ll duration has an exponential distribution.
6.3.1 Real-Time Traffic Access Delay Bound
The access delay is defined as the time period from the instant that a packet be
comes the head in the buffer to the instant that the packet departs from the rou
ter. Let Ts denote the time duration of one slot, and Nm the number of mini-slot
s, including the real-time mini-slot. Consider the worst case that the target ro
uter has Nm 2 onehop and two hop neighbors, and all of them have real time packe
ts to transmit. After the target router transmits one packet, it takes Ts (Nm 1)
for the target router to transmit the next one. Thus, the access delay bound of
real time traffic at each hop is Ts (Nm 1), which is independent to the traffic l
oad of the networks.
6.3.2 Data Traffic Access Delay
Since guaranteed priority access is provided to real time traffic, the real time
traffic load will impact the data traffic access delay. The voice call is repre
sented by an on/off model with parameters nd . At n on stte, voice pckets r
e generted periodiclly with n inter-rrivl time Io, while no voice pcket is
generted t n off stte. For  video cll, the video frmes re generted per
iodiclly with n inter-rrivl time Iv. The video frme usully hs  lrge nd
vrile size [93]. Suppose tht it tkes one slot to trnsmit one voice pcket
, nd Mv slots (on verge) to trnsmit one video frme. Considering  trget ro
uter, we refer to its two-hop vicinity s the trget re.
To otin the dt trffic ccess dely, we first need to derive the frction of
chnnel time occupied y voice nd video trffic. We define  two-dimensionl s
tte (nv, no), where nv nd no re the numers of video clls nd voice clls, r
espectively, eing served y the routers within the trget re. Denote the ver
ge rrivl rtes of voice nd video clls tht trverse the trget re s o and
v, respectivey, and the average ca duration as o1 and v1, respectivey. We assume
that ca admission contro is in pace to guarantee the QoS of voice and video
cas, and the maxima number of acceptabe voice and video cas within the ta
rget area are denoted by No and Nv, respectivey. The state transition diagram i
s shown in Fig. 6.3. Since a video ca requires more resources than a voice ca
, when there is 1 video ca being served, the maxima number of supported voic
e cas is No Mv, denoted by No m. Define pi j as the joint probabiity that i vi
deo cas and j voice cas being served.