A finite-state Markov chain model for statistical loss across a RED queue

Mohit B. Singh, H. Yousefi’zadeh, H. Jafarkhani
{"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}
引用次数: 4

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RED队列统计损失的有限状态马尔可夫链模型
在本文中,我们提出了一项分析研究,旨在统计捕捉一个红色队列的损失行为。我们利用有限状态马尔可夫链模型。从模型的递推方程出发,推导出等效的闭型方程。用数值方法验证了递归方程和闭型方程的匹配性。此外,我们应用我们的模型来监控许多示例拓扑中的平均RED队列大小,以说明它们的实用性。基于我们的研究结果,我们认为我们的模型可以适应不断变化的网络条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic software reconfiguration in sensor networks Comparative study of MPNT topological models Bandwidth and latency model for DHT based peer-to-peer networks under variable churn On the performance of bandwidth estimation tools A novel fairness based criticality avoidance routing algorithm for wavelength routed optical networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1