DocumentCode :
2135274
Title :
A finite-state Markov chain model for statistical loss across a RED queue
Author :
Singh, Mohit B. ; Yousefi´zadeh, Homayoun ; Jafarkhani, Hamid
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA, USA
fYear :
2005
fDate :
14-17 Aug. 2005
Firstpage :
305
Lastpage :
310
Abstract :
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.
Keywords :
Markov processes; queueing theory; telecommunication network topology; RED queue; equivalent closed-form equations; finite-state Markov chain model; loss behavior; recursive equations; statistical loss; topologies; Engineering management; Equations; Guidelines; Internet; Loss measurement; Network topology; Queueing analysis; Shape measurement; Telecommunication traffic; Traffic control; Index Terms—RED; Markov Chain; Packet Loss Modeling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems Communications, 2005. Proceedings
Print_ISBN :
0-7695-2422-2
Type :
conf
DOI :
10.1109/ICW.2005.7
Filename :
1515542
Link To Document :
بازگشت