Lecture 12

# N tlim e fn tg 1 1 x jj 1 j 0 thus using

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: for data networks, we can consider the arrival rate to be in packets/sec. Let N t = number of packets in the link at time t Q – What is the average number of packets in the link? N = tlim E fN tg = !1 1 X  jj = 1 , =  ,  : j =0 Thus, using the steady-state probabilities, we can obtain the result for N . What about other measures such as average packet delay? To obtain this, we need the use the following result known as Little’s Law : CS 522, v 0.94, d.medhi, W’99 12 avg. number of packets in system in steady state (N) = avg. arrival rate * avg. packet delay in system in steady state (T) That is, N = T: Rearranging, we get 1 T = N= =  ,  = 1 ,  : Average waiting time in the queue, W , is W= Avg. waiting time in System – Avg. waiting time in Service 1 1 =  ,  ,  =  , : Again, by Little’s Law which is also applicable in queues, the average number of customers in queue is, 2 Nq = W = 1 , : Thus, we have shown above four performance measures that may be of interest for a network l...
View Full Document

## This document was uploaded on 03/19/2014 for the course CS 6030 at Western Michigan.

Ask a homework question - tutors are online