The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 패킷 네트워크에서 다중 클래스 트래픽에 대해 다중 지연 범위를 보장하는 클래스 수준 서비스 지연(CSL) 알고리즘이라는 패킷 스케줄링 알고리즘을 제안합니다. 통화 승인을 결정하는 데 사용되는 관련 일정 가능성 테스트 조건을 도출합니다. 먼저 전통적이고 단순한 형태의 우선순위 제어의 새로운 구현을 소개합니다. CSL 알고리즘의 정의에 도달하기 위해 해당 구현의 논리적 타당성을 확인하려는 노력이 어떻게 관리되는지 보여줍니다. 우선순위 제어는 서비스 제공에 클래스 수준의 불공정성을 적용하여 실현되며, 기본 서비스 메커니즘은 공정한 대기열 개념을 사용하여 수행됩니다. 공정한 큐잉을 채택하면 오작동하는 트래픽이 있는 경우에도 정상적으로 동작하는 트래픽의 서비스 품질을 유지할 수 있습니다. 우리는 이것을 방화벽 속성이라고 부릅니다. 시뮬레이션 결과는 우선순위 제어와 방화벽 기능 모두에서 CSL 알고리즘의 우수성을 보여줍니다. 또한 CSL 알고리즘이 다음과 같은 계산 복잡성으로 어떻게 구현될 수 있는지 설명합니다. O(1). 클래스 수준 접근 방식으로 인해 향상된 확장성과 이러한 기능은 고속 패킷 네트워크에 대한 CSL 알고리즘의 적합성을 확인합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Daein JEONG, H. Jonathan CHAO, Hwasung KIM, "Multiple Delay Bounds Control Algorithm via Class-Level Service Curves" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 12, pp. 2868-2879, December 2002, doi: .
Abstract: In this paper, we propose a packet-scheduling algorithm, called the Class-level Service Lagging (CSL) algorithm, that guarantees multiple delay bounds for multi-class traffic in packet networks. We derive the associated schedulability test conditions, which are used to determine call admission. We first introduce a novel implementation of priority control, which has a conventional and simple form. We show how the efforts to confirm the logical validity of that implementation are managed to reach the definition of the CSL algorithm. The priority control is realized by imposing class-level unfairness in service provisioning, while the underlying service mechanism is carried out using the notion of fair queueing. The adoption of fair queueing allows the capability to maintain the service quality of the well-behaving traffic even in the presence of misbehaving traffic. We call this the firewall property. Simulation results demonstrate the superiority of the CSL algorithm in both priority control and firewall functionality. We also describe how the CSL algorithm is implementable with a computational complexity of O(1). Those features as well as the enhanced scalability, which results from the class-level approach, confirm the adequacy of the CSL algorithm for the fast packet networks.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_12_2868/_p
부
@ARTICLE{e85-b_12_2868,
author={Daein JEONG, H. Jonathan CHAO, Hwasung KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Multiple Delay Bounds Control Algorithm via Class-Level Service Curves},
year={2002},
volume={E85-B},
number={12},
pages={2868-2879},
abstract={In this paper, we propose a packet-scheduling algorithm, called the Class-level Service Lagging (CSL) algorithm, that guarantees multiple delay bounds for multi-class traffic in packet networks. We derive the associated schedulability test conditions, which are used to determine call admission. We first introduce a novel implementation of priority control, which has a conventional and simple form. We show how the efforts to confirm the logical validity of that implementation are managed to reach the definition of the CSL algorithm. The priority control is realized by imposing class-level unfairness in service provisioning, while the underlying service mechanism is carried out using the notion of fair queueing. The adoption of fair queueing allows the capability to maintain the service quality of the well-behaving traffic even in the presence of misbehaving traffic. We call this the firewall property. Simulation results demonstrate the superiority of the CSL algorithm in both priority control and firewall functionality. We also describe how the CSL algorithm is implementable with a computational complexity of O(1). Those features as well as the enhanced scalability, which results from the class-level approach, confirm the adequacy of the CSL algorithm for the fast packet networks.},
keywords={},
doi={},
ISSN={},
month={December},}
부
TY - JOUR
TI - Multiple Delay Bounds Control Algorithm via Class-Level Service Curves
T2 - IEICE TRANSACTIONS on Communications
SP - 2868
EP - 2879
AU - Daein JEONG
AU - H. Jonathan CHAO
AU - Hwasung KIM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2002
AB - In this paper, we propose a packet-scheduling algorithm, called the Class-level Service Lagging (CSL) algorithm, that guarantees multiple delay bounds for multi-class traffic in packet networks. We derive the associated schedulability test conditions, which are used to determine call admission. We first introduce a novel implementation of priority control, which has a conventional and simple form. We show how the efforts to confirm the logical validity of that implementation are managed to reach the definition of the CSL algorithm. The priority control is realized by imposing class-level unfairness in service provisioning, while the underlying service mechanism is carried out using the notion of fair queueing. The adoption of fair queueing allows the capability to maintain the service quality of the well-behaving traffic even in the presence of misbehaving traffic. We call this the firewall property. Simulation results demonstrate the superiority of the CSL algorithm in both priority control and firewall functionality. We also describe how the CSL algorithm is implementable with a computational complexity of O(1). Those features as well as the enhanced scalability, which results from the class-level approach, confirm the adequacy of the CSL algorithm for the fast packet networks.
ER -