Section: 3.5 Analytical modeling of PRWR and PRR scheme
Table 3.2: New fields added in FIB)
Field Description
RttF lag If it is set that means RTT measuring Interest is forwarded.
mrtt This field stores the value of the calculated RTT for each name prefix
rttExpireF lag This field indicates that the RTT value has expired or that the calculation has not yet been completed. It expresses the requirement for a new calculation.
sendT ime Contains the sending time of the RTT measuring Interest packet.
together with the Data packet. In RAPIT, however, RTT measuring interest is always served by the producer.
(ii) EQPR calculates RTT for all nodes, which uses a single RTT measuring interest on the path to the producer (in case the nodes require an RTT estimate). RAPIT uses a single RTT measuring Interest to compute RTT for only one node.
Table 3.3: Notations and their meaning
Symbols Meaning
N Number of PIT entries in an NDN node
K Number of reserved PIT entries for Prioritized Interests i Number of Prioritized entries in PIT, 0≤i≤N
j Number of Non-Prioritized entries in PIT, 0≤j≤N−K
Pi,j Probability of the system being in state (i, j), i.e., there are i Prioritized PIT entries and j Non-Prioritized PIT entries respectively.
λp Prioritized Interest packet arrival rate.
µp Prioritized Data packet service rate.
λnp Non-Prioritized Interest packet arrival rate.
µnp Non-Prioritized Data packet service rate.
Pblock,p Prioritized Interest Blocking probability.
Pblock,np Non-prioritized Interest Blocking probability.
Pnf t Non-prioritized forced termination probability.
Figure 3.2: System Model for analytical modeling
Figure 3.2 shows the system model. The module A in the Figure 3.2 represents the Interest packet aggregation at PIT.
Section: 3.5 Analytical modeling of PRWR and PRR scheme
The rate of PIT entry removal due to time-out can be calculated as:
β = 1/τ (3.2)
where τ is the PIT entry time out (default value is 4 sec).
Since we consider service time for prioritized and non-prioritized Interests are exponentially distributed withµp andµnp, the probability of service time for prioritized and non-prioritized Interests≤τ can be calculated from cumulative distribution (c.d.f) formula.
The probability of Prioritized and Non-Prioritized Interests for which data packets arrive are calculated as below.
ηp= 1−e−µpτ ηnp= 1−e−µnpτ
So, we can define µ0p=ηpµp+ (1−ηp)β µ0np=ηnpµnp+ (1−ηnp)β
µ=µ0p +µ0np
We use the following performance metrics:
1) Prioritized Interest Blocking probability, Pblock,p: It is the probability that an incoming prioritized Interest arrives and finds the PIT full and is discarded.
2) Non-prioritized Interest Blocking probability, Pblock,np: It is the probability that an in- coming non-prioritized interest arrives and finds the PIT full and is discarded.
3) Non-prioritized forced termination probability, Pnf t: It is the probability of removing non-prioritized PIT entries due to the arrival of a new prioritized Interest and PIT is full. This probability is more significant than others from the consumer’s perspective. The higher this probability, the lower the consumer’s ISR.
In order to obtain Pblock,p, Pblock,np and Pnf t, we calculate the steady-state probabilities of the state-transition diagram. In the following part, we have shown the evaluation of these probabilities for both schemes separately.
We calculate the steady-state probabilitiesPi,jof the state-transition diagram to getPblock,p, Pblock,npandPnf t. The evaluation of these probabilities for each scheme (PRWR and PRR) are presented in the next section.
3.5.1 PRWR scheme
The PRWR scheme can be modelled as a 2-dimensional continuous-time markov process. The system states are denoted by (i, j) wherei andj represent the number of prioritized and non- prioritized PIT entries, respectively. Figure 3.3 shows the transition rate diagram for PRWR scheme. For a better understanding of the transition rate diagram of the PRWR scheme, please refer to Figure 3.4. The state space is
Ω ={(i, j)|0≤i≤N,0≤j≤N}
In the following, we express equilibrium equations for each state of Figure 3.3.
i) i=j=0 :Pi,j * (λ0np+λ0p )= Pi,j+1 *µ0np+Pi+1,j *µ0p
ii) 1≤j≤N-1, i=0 : Pi,j * (λ0np + λ0p+j∗µ0np)= Pi,j+1 * (j+ 1)µ0np+ Pi,j−1 * λ0np+ Pi+1,j * µ0p
iii) i=0, j= N : Pi,j * (j∗µ0np+λ0p)=Pi,j−1 *λ0np
iv) 1≤i≤N-1 , j=0 : Pi,j * (λ0np +λ0p +i∗µ0p) =Pi,j+1 *µ0np+Pi−1,j * λ0p +Pi+1,j * (i+ 1)µ0p
v) i=N, j=0 : Pi,j * (i∗µ0p) = Pi−1,j *λ0p+Pi−1,j+1 *λ0p
vi) 1≤i ≤N-2, 1≤j≤N-2, i+j≤N-1 : Pi,j* (j∗µ0np+λ0np+λ0p+i∗µ0p) =Pi,j−1*λ0np+ Pi,j+1 *(j+ 1)µ0np+Pi−1,j *λ0p +Pi+1,j*(i+ 1)µ0p
vii) 1≤i≤N-1, i+j=N : Pi,j* (j∗µ0np+i∗µ0p+λ0p)=Pi,j−1*λ0np+Pi−1,j*λ0p+Pi−1,j+1
*λ0p
All the above equations (i)-(vii) can be combined and can be expressed as below.
{i∗µ0p+j∗µ0np+ [1−δ(N−i−j)]∗λ0np+ [1−δ(N−i)]∗λ0p} ∗Pi,j=
(i+ 1)∗µ0p∗[1−δ(N−i−j)]∗Pi+1,j+ (j+ 1)∗µ0np∗[1−δ(N−i−j)]∗Pi,j+1+ λ0np∗[1−δ(j)]∗Pi,j−1+λ0p∗[1−δ(i)]∗Pi−1,j+λ0p∗[1−δ(i)]∗δ(N−i−j)∗Pi−1,j+1
(3.3) whereδ(k) is a step function. k is a linear function ofi,j andN andi+j≤N.
δ(k) =
1 k= 0 0, otherwise
Section: 3.5 Analytical modeling of PRWR and PRR scheme
For normalizing the steady-state probabilities, X
i
X
j
Pi,j= 1 ∀i+j≤N (3.4)
Figure 3.3: Transition rate diagram for PRWR scheme Performance metrics
(i)Prioritized Interest Blocking probability,Pblock,p: It is given by the steady-state probability of state (N,0) as
Pblock,p=PN,0
The value ofPN,0can be calculated using the Erlang B formula.
PN,0=
Anp n!
N
P
l=0 Alp
l!
(3.5)
Figure 3.4: Transition rate diagram for PRWR scheme considering N=6
ii)Non-prioritized blocking probability,Pblock,np: It is expressed as Pblock,np= X
i,j;i+j=N
Pi,j (3.6)
iii)Non-prioritized forced termination probability,Pnf t: It is expressed as
Pblock,np= X
i,j;i+j=N
Pi,j∗λp/λnp (3.7)
The reason behind the Equation (3.7) is as follows:
The average time for which an entry stays in state (i, j) for time duration td=P(i, j)∗td.
So, the average number of replaced non-prioritized PIT entries=P(i, j)∗td∗(j/N−i)λp. The average number of non-prioritized interest arrival for time durationtdisλnp∗td. Now,
Section: 3.5 Analytical modeling of PRWR and PRR scheme
we can specifyPnf tas a function of the number of replaced non-prioritized PIT entries over the number of non-prioritized interest packet arrivals in periodts.
In PRWR scheme, non-prioritized entries are replaced wheni+j =N (PIT full), so Equation (3.7) becomes the final expression.
3.5.2 PRR scheme
The PRR scheme can be modeled as 2-dimensional continuous-time markov process. Figure 3.5 shows the Transition rate diagram of PRR scheme. For better understanding of the transition rate diagram of PRR scheme, please refer to Figure 3.6. The state space is defined as:
Ω ={(i, j)|0≤i≤N,0≤j≤N}
where iandj are the numbers of prioritized and non-prioritized PIT entries, respectively.
In the following, we express equilibrium equations for each state of Figure 3.5.
i) i=j=0 : Pi,j * (λ0np +λ0p )=Pi,j+1 * µ0np+Pi+1,j * µ0p
ii) 1≤j≤N-K-1, i=0 : Pi,j * (λ0np +λ0p+ j *µ0np)= Pi,j+1 * (j+1)µ0np +Pi,j−1 * λ0np + Pi+1,j *µ0p
iii) i=0, j= N-K : Pi,j * ( j *µ0np+λ0p)= Pi,j−1 *λ0np+Pi+1,j *µ0p
iv) 1≤i ≤N-K-1 , j=0 : Pi,j * (λ0np+λ0p + i *µ0p) =Pi,j+1 *µ0np+Pi−1,j *λ0p+Pi+1,j
* (i+1)µ0p
v) N-K≤i≤N-1 , j=0 : Pi,j * (λ0p+ i *µ0p) =Pi,j+1 *µ0np+Pi−1,j *λ0p +Pi+1,j * (i+1)µ0p vi) i=N, j=0 : Pi,j * (i*µ0p) = Pi−1,j *λ0p+Pi−1,j+1 *λ0p
vii) 1≤i≤N-K-2, 1≤j≤N-K-2, i+j≤N-K-1 : Pi,j* (j*µ0np+λ0np+λ0p+ i *µ0p) =Pi,j−1
* λ0np+Pi,j+1 * (j+1)µ0np+Pi−1,j *λ0p +Pi+1,j*(i+1)µ0p
viii) 1≤i≤K-1, j= N-K : Pi,j * (j*µ0np+ i *µ0p +λ0p)=Pi−1,j * λ0p +Pi+1,j * (i+1)µ0p ix) i=K, j= N-K : Pi,j * (j* µ0np+ i *µ0p +λ0p)=Pi−1,j *λ0p
x) K+1≤i≤N-1, 1≤j≤N-K-1, i+j=N : Pi,j * (j* µ0np+ i *µ0p +λ0p)= Pi−1,j * λ0p+ Pi−1,j+1 * λ0p
xi) K≤i≤N-2, 1≤j≤N-K-1, i+j≤N-1 : Pi,j * (j*µ0np+ i * µ0p + λ0p) =Pi,j * (j* µ0np+ λ0np+λ0p+ i *µ0p) = Pi,j+1 *(j+1)µ0np+Pi−1,j * λ0p +Pi+1,j*(i+1)µ0p
xii) 1≤i≤N-K-1, 1≤j≤N-K-1, i+j≤N-K : Pi,j * (j*µ0np+λ0p+ i *µ0p) =Pi,j−1*λ0np+ Pi,j+1 *(j+1)µ0np+Pi−1,j *λ0p +Pi+1,j*(i+1)µ0p
All the above equations (i)-(xii) can be combined and can be expressed as below:
Figure 3.5: Transition rate diagram for PRR scheme
Section: 3.5 Analytical modeling of PRWR and PRR scheme
Figure 3.6: Transition rate diagram for PRR scheme considering N=6, K=2
The balance equations for the PRR scheme are shown below.
{q∗λ0np+q1∗λ0p+i∗µ0p+j∗µ0np} ∗Pi,j=q2∗Pi−1,j∗λ0p+q3∗Pi+1,j∗(i+ 1)µ0p+ q4∗Pi,j+1∗(j+ 1)∗µ0np+q5∗j∗Pi,j−1∗λ0np+q6∗Pi−1,j+1∗λ0p (3.8)
where
q=
0 N−K≤i+j≤N 1 otherwise
q1 =
0 i=N 1 otherwise
q2 =
1 i >0 0 otherwise
q3 =
0 i+j=N 1 otherwise
q4 =
0 j≥N−K or i+j=N 1 otherwise
q5 =
0 i+j ¿ N-K or i+j=N 1 otherwise
q6 =
1 i+j=N and j! =N−K 0 otherwise
The sum of all the state probabilities is equal to 1 as below
X
i
X
j
Pi,j= 1 ∀i+j ≤N (3.9)
Section: 3.6 Performance Evaluation
Performance metrics
i) Non-prioritized blocking probability, Pblock,np: A non-prioritized interest is blocked at the states wherei+j≥N−K. It is expressed as
Pblock,np= X
i,j;i+j≥N−K
Pi,j (3.10)
The Prioritized Interest Blocking probability and Non-prioritized forced termination proba- bility can be similarly obtained using Equations (3.5) and (3.7) respectively.