{"title":"RED队列统计损失的有限状态马尔可夫链模型","authors":"Mohit B. Singh, H. Yousefi’zadeh, H. Jafarkhani","doi":"10.1109/ICW.2005.7","DOIUrl":null,"url":null,"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.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A finite-state Markov chain model for statistical loss across a RED queue\",\"authors\":\"Mohit B. Singh, H. Yousefi’zadeh, H. Jafarkhani\",\"doi\":\"10.1109/ICW.2005.7\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":255955,\"journal\":{\"name\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICW.2005.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICW.2005.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A finite-state Markov chain model for statistical loss across a RED queue
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.