High-Speed Calculation of Worst-Case Link Delays in the EDD Connection Admission Control Scheme

Tokumi YOKOHIRA; Kiyohiko OKAYAMA

doi:10.1093/ietcom/e89-b.7.2012

High-Speed Calculation of Worst-Case Link Delays in the EDD Connection Admission Control Scheme

Tokumi YOKOHIRA, Kiyohiko OKAYAMA

Full Text Views

0

Cite this

Summary :

The EDD connection admission control scheme has been proposed for supporting real-time communication in packet-switched networks. In the scheme, when a connection establishment request occurs, the worst-case link delay in each link along the connection is calculated to determine whether the request can be accepted or not. In order to calculate the worst-case link delay, we must perform a check called the point schedulability check for each of some discrete time instants (checkpoints). Therefore when there are many checkpoints, the worst-case link delay calculation is time-consuming. We have proposed a high-speed calculation method. The method finds some checkpoints for which the point schedulability check need not be performed and removes such unnecessary checkpoints in advance before a connection establishment request occurs, and the check is performed for each of the remaining checkpoints after the request occurs. However, the method is not so effective under the situation that the maximum packet length in networks is large, because the method can find few unnecessary checkpoints under the situation. This paper proposes a new high-speed calculation method. We relax the condition which determines whether or not the point schedulability check need not be performed for each checkpoint in our previous method and derive a new condition for finding unnecessary checkpoints. Using the proposed method based on the new condition, we can increase the number of unnecessary checkpoints compared to our previous method. Numerical examples which are obtained by extensive simulation show that the proposed method can attain as much as about 50 times speedup.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.7 pp.2012-2022

Publication Date: 2006/07/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.7.2012

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Tokumi YOKOHIRA, Kiyohiko OKAYAMA, "High-Speed Calculation of Worst-Case Link Delays in the EDD Connection Admission Control Scheme" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 7, pp. 2012-2022, July 2006, doi: 10.1093/ietcom/e89-b.7.2012.
Abstract: The EDD connection admission control scheme has been proposed for supporting real-time communication in packet-switched networks. In the scheme, when a connection establishment request occurs, the worst-case link delay in each link along the connection is calculated to determine whether the request can be accepted or not. In order to calculate the worst-case link delay, we must perform a check called the point schedulability check for each of some discrete time instants (checkpoints). Therefore when there are many checkpoints, the worst-case link delay calculation is time-consuming. We have proposed a high-speed calculation method. The method finds some checkpoints for which the point schedulability check need not be performed and removes such unnecessary checkpoints in advance before a connection establishment request occurs, and the check is performed for each of the remaining checkpoints after the request occurs. However, the method is not so effective under the situation that the maximum packet length in networks is large, because the method can find few unnecessary checkpoints under the situation. This paper proposes a new high-speed calculation method. We relax the condition which determines whether or not the point schedulability check need not be performed for each checkpoint in our previous method and derive a new condition for finding unnecessary checkpoints. Using the proposed method based on the new condition, we can increase the number of unnecessary checkpoints compared to our previous method. Numerical examples which are obtained by extensive simulation show that the proposed method can attain as much as about 50 times speedup.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.7.2012/_p

Copy

@ARTICLE{e89-b_7_2012,
author={Tokumi YOKOHIRA, Kiyohiko OKAYAMA, },
journal={IEICE TRANSACTIONS on Communications},
title={High-Speed Calculation of Worst-Case Link Delays in the EDD Connection Admission Control Scheme},
year={2006},
volume={E89-B},
number={7},
pages={2012-2022},
abstract={The EDD connection admission control scheme has been proposed for supporting real-time communication in packet-switched networks. In the scheme, when a connection establishment request occurs, the worst-case link delay in each link along the connection is calculated to determine whether the request can be accepted or not. In order to calculate the worst-case link delay, we must perform a check called the point schedulability check for each of some discrete time instants (checkpoints). Therefore when there are many checkpoints, the worst-case link delay calculation is time-consuming. We have proposed a high-speed calculation method. The method finds some checkpoints for which the point schedulability check need not be performed and removes such unnecessary checkpoints in advance before a connection establishment request occurs, and the check is performed for each of the remaining checkpoints after the request occurs. However, the method is not so effective under the situation that the maximum packet length in networks is large, because the method can find few unnecessary checkpoints under the situation. This paper proposes a new high-speed calculation method. We relax the condition which determines whether or not the point schedulability check need not be performed for each checkpoint in our previous method and derive a new condition for finding unnecessary checkpoints. Using the proposed method based on the new condition, we can increase the number of unnecessary checkpoints compared to our previous method. Numerical examples which are obtained by extensive simulation show that the proposed method can attain as much as about 50 times speedup.},
keywords={},
doi={10.1093/ietcom/e89-b.7.2012},
ISSN={1745-1345},
month={July},}

Copy

TY - JOUR
TI - High-Speed Calculation of Worst-Case Link Delays in the EDD Connection Admission Control Scheme
T2 - IEICE TRANSACTIONS on Communications
SP - 2012
EP - 2022
AU - Tokumi YOKOHIRA
AU - Kiyohiko OKAYAMA
PY - 2006
DO - 10.1093/ietcom/e89-b.7.2012
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2006
AB - The EDD connection admission control scheme has been proposed for supporting real-time communication in packet-switched networks. In the scheme, when a connection establishment request occurs, the worst-case link delay in each link along the connection is calculated to determine whether the request can be accepted or not. In order to calculate the worst-case link delay, we must perform a check called the point schedulability check for each of some discrete time instants (checkpoints). Therefore when there are many checkpoints, the worst-case link delay calculation is time-consuming. We have proposed a high-speed calculation method. The method finds some checkpoints for which the point schedulability check need not be performed and removes such unnecessary checkpoints in advance before a connection establishment request occurs, and the check is performed for each of the remaining checkpoints after the request occurs. However, the method is not so effective under the situation that the maximum packet length in networks is large, because the method can find few unnecessary checkpoints under the situation. This paper proposes a new high-speed calculation method. We relax the condition which determines whether or not the point schedulability check need not be performed for each checkpoint in our previous method and derive a new condition for finding unnecessary checkpoints. Using the proposed method based on the new condition, we can increase the number of unnecessary checkpoints compared to our previous method. Numerical examples which are obtained by extensive simulation show that the proposed method can attain as much as about 50 times speedup.
ER -