Core-stateless fair rate estimation fair queuing

Jung Shian Li, Yi Ting Lin, Ching Fang Yang

研究成果: Paper同行評審

1 引文 斯高帕斯(Scopus)

摘要

Core-stateless mechanisms, such as core-stateless fair queuing (CSFQ), reduce the complexity of fair queuing, which usually need to maintain state, manage buffers, and perform flow scheduling on a per flow basis. However, they require executing label rewriting and dropping decision on a per packet basis. This complexity may prevent them from being widely deployed. In this paper, we proposed a novel architecture based on CSFO without per-packet labeling. Similarly, we distinguish edge routers and core routers. Edge routers maintain per flow state; they employ a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per flow state; they use FIFO packet scheduling extended by a fare rate alarm mechanism that uses an estimate of active flow number based on a matching-mismatching algorithm. The novel scheme is called Core-Stateless Fair Rate Estimation Fair Queuing (CSFREFQ). We present and discuss simulations on the performance under different traffic scenarios.

原文English
頁面1165-1170
頁數6
出版狀態Published - 2002
事件2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications - Anaheim, CA, United States
持續時間: 2002 10月 72002 10月 10

Other

Other2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications
國家/地區United States
城市Anaheim, CA
期間02-10-0702-10-10

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程

指紋

深入研究「Core-stateless fair rate estimation fair queuing」主題。共同形成了獨特的指紋。

引用此