An Effective Flow Aggregation Algorithm for Advance Reservations

Kai-Hui LEE; Yie-Tarng CHEN

An Effective Flow Aggregation Algorithm for Advance Reservations

Kai-Hui LEE, Yie-Tarng CHEN

Full Text Views

0

Cite this

Summary :

One drawback of Integrated service architecture is the scaling problem. Therefore, flow aggregation is an important solution for supporting quality of service in large-scale network. In advance reservation, priori information of advance-reserved requests can be used for flow aggregation before their initiation time. However, an impolitic aggregation can lead to violate admission control. In this paper, we propose an effective algorithm to aggregate advance-reserved requests with guaranteed delay. The proposed algorithm not only can reduce the amount of state in core network but also minimize the bandwidth consumption. The simulation result indicates that the state in the core network can be reduced as low as 17.3% even in the worst case.

Publication: IEICE TRANSACTIONS on Communications Vol.E84-B No.6 pp.1532-1540

Publication Date: 2001/06/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on New Developments on QoS Technologies for Information Networks)

Category

Cite this

Copy

Kai-Hui LEE, Yie-Tarng CHEN, "An Effective Flow Aggregation Algorithm for Advance Reservations" in IEICE TRANSACTIONS on Communications, vol. E84-B, no. 6, pp. 1532-1540, June 2001, doi: .
Abstract: One drawback of Integrated service architecture is the scaling problem. Therefore, flow aggregation is an important solution for supporting quality of service in large-scale network. In advance reservation, priori information of advance-reserved requests can be used for flow aggregation before their initiation time. However, an impolitic aggregation can lead to violate admission control. In this paper, we propose an effective algorithm to aggregate advance-reserved requests with guaranteed delay. The proposed algorithm not only can reduce the amount of state in core network but also minimize the bandwidth consumption. The simulation result indicates that the state in the core network can be reduced as low as 17.3% even in the worst case.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_6_1532/_p

Copy

@ARTICLE{e84-b_6_1532,
author={Kai-Hui LEE, Yie-Tarng CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={An Effective Flow Aggregation Algorithm for Advance Reservations},
year={2001},
volume={E84-B},
number={6},
pages={1532-1540},
abstract={One drawback of Integrated service architecture is the scaling problem. Therefore, flow aggregation is an important solution for supporting quality of service in large-scale network. In advance reservation, priori information of advance-reserved requests can be used for flow aggregation before their initiation time. However, an impolitic aggregation can lead to violate admission control. In this paper, we propose an effective algorithm to aggregate advance-reserved requests with guaranteed delay. The proposed algorithm not only can reduce the amount of state in core network but also minimize the bandwidth consumption. The simulation result indicates that the state in the core network can be reduced as low as 17.3% even in the worst case.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - An Effective Flow Aggregation Algorithm for Advance Reservations
T2 - IEICE TRANSACTIONS on Communications
SP - 1532
EP - 1540
AU - Kai-Hui LEE
AU - Yie-Tarng CHEN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2001
AB - One drawback of Integrated service architecture is the scaling problem. Therefore, flow aggregation is an important solution for supporting quality of service in large-scale network. In advance reservation, priori information of advance-reserved requests can be used for flow aggregation before their initiation time. However, an impolitic aggregation can lead to violate admission control. In this paper, we propose an effective algorithm to aggregate advance-reserved requests with guaranteed delay. The proposed algorithm not only can reduce the amount of state in core network but also minimize the bandwidth consumption. The simulation result indicates that the state in the core network can be reduced as low as 17.3% even in the worst case.
ER -