RED近似模型的精确解

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI:10.1109/GLOCOM.2007.350

C. Bauer, H. Yousefi’zadeh, H. Jafarkhani

{"title":"RED近似模型的精确解","authors":"C. Bauer, H. Yousefi’zadeh, H. Jafarkhani","doi":"10.1109/GLOCOM.2007.350","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping behavior of the RED algorithm. Using a notion from the theory of random walks, we then derive an exact-closed form expression that characterizes the loss characteristics of a RED queue. We validate the derived formula by a numerical comparison with the recursive equations.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Exact Solution to an Approximated Model of RED\",\"authors\":\"C. Bauer, H. Yousefi’zadeh, H. Jafarkhani\",\"doi\":\"10.1109/GLOCOM.2007.350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping behavior of the RED algorithm. Using a notion from the theory of random walks, we then derive an exact-closed form expression that characterizes the loss characteristics of a RED queue. We validate the derived formula by a numerical comparison with the recursive equations.\",\"PeriodicalId\":370937,\"journal\":{\"name\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2007.350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2007.350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了一个解析模型来捕捉RED算法的动态。我们首先开发了一个递归方程组来描述RED算法的丢包行为。利用随机漫步理论中的一个概念，我们推导了一个精确封闭形式表达式，该表达式表征了RED队列的损失特征。通过与递归方程的数值比较，我们验证了推导出的公式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Exact Solution to an Approximated Model of RED

In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping behavior of the RED algorithm. Using a notion from the theory of random walks, we then derive an exact-closed form expression that characterizes the loss characteristics of a RED queue. We validate the derived formula by a numerical comparison with the recursive equations.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

自引率

0.00%

发文量