loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)
A Finite-State Markov Chain Model for Statistical Loss Across a RED Queue
Montreal, Canada
August 14-August 17
ISBN: 0-7695-2422-2
Mohit B. Singh, University of California at Irvine
Homayoun Yousefi?zadeh, University of California at Irvine
Hamid Jafarkhani, University of California at Irvine
In this paper, we present an analytical study targeted at statistically capturing the loss behavior of a RED queue. We utilize a finite-state Markov chain model. Starting from recursive equations of the model, we derive equivalent closed-form equations. We numerically validate the matching of recursive and closed-form equations. Further, we apply our model to monitor the average RED queue size in a number of sample topologies illustrating their practicality. Based on our results, we argue that our model can adapt to the changing network conditions.
Index Terms:
Index Terms?RED, Markov Chain, Packet Loss Modeling
Citation:
Mohit B. Singh, Homayoun Yousefi?zadeh, Hamid Jafarkhani, "A Finite-State Markov Chain Model for Statistical Loss Across a RED Queue," icw, pp.305-400, 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.