For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
An Effective Flow Aggregation Algorithm for Advance Reservations
Kai-Hui LEE Yie-Tarng CHEN
IEICE TRANSACTIONS on Communications
Publication Date: 2001/06/01
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on New Developments on QoS Technologies for Information Networks)
advance reservation, quality of service (QoS), scalability, flow aggregation,
Full Text: PDF(430.3KB)>>
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.