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 十二月 1
事件2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications - Anaheim, CA, United States
持續時間: 2002 十月 72002 十月 10

Other

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

指紋

Routers
Scheduling
Labeling
Labels
Feedback
Bandwidth

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

引用此文

Li, J. S., Lin, Y. T., & Yang, C. F. (2002). Core-stateless fair rate estimation fair queuing. 1165-1170. 論文發表於 2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications, Anaheim, CA, United States.
Li, Jung Shian ; Lin, Yi Ting ; Yang, Ching Fang. / Core-stateless fair rate estimation fair queuing. 論文發表於 2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications, Anaheim, CA, United States.6 p.
@conference{ad5e1368bc6e4a1997a90f7b5d4a50e1,
title = "Core-stateless fair rate estimation fair queuing",
abstract = "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.",
author = "Li, {Jung Shian} and Lin, {Yi Ting} and Yang, {Ching Fang}",
year = "2002",
month = "12",
day = "1",
language = "English",
pages = "1165--1170",
note = "2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications ; Conference date: 07-10-2002 Through 10-10-2002",

}

Li, JS, Lin, YT & Yang, CF 2002, 'Core-stateless fair rate estimation fair queuing', 論文發表於 2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications, Anaheim, CA, United States, 02-10-07 - 02-10-10 頁 1165-1170.

Core-stateless fair rate estimation fair queuing. / Li, Jung Shian; Lin, Yi Ting; Yang, Ching Fang.

2002. 1165-1170 論文發表於 2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications, Anaheim, CA, United States.

研究成果: Paper

TY - CONF

T1 - Core-stateless fair rate estimation fair queuing

AU - Li, Jung Shian

AU - Lin, Yi Ting

AU - Yang, Ching Fang

PY - 2002/12/1

Y1 - 2002/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036998994&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036998994&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0036998994

SP - 1165

EP - 1170

ER -

Li JS, Lin YT, Yang CF. Core-stateless fair rate estimation fair queuing. 2002. 論文發表於 2002 MILCOM Proceedings; Global Information GRID - Enabling Transformation Through 21st Century Communications, Anaheim, CA, United States.