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
무선 네트워크에서 제공되는 정보 서비스가 점점 더 많아지고 있습니다. 무선 링크의 긴 네트워크 지연으로 인해 거래는 오래 지속됩니다. 이러한 상황에서는 핸드오프의 발생이 불가피하므로 셀 경계를 넘는 이동 장치가 보유한 무선 링크가 강제로 종료될 수 있습니다. 활성 트랜잭션이 강제로 종료되는 것은 바람직하지 않습니다. 이전 연구에서는 트랜잭션 강제 종료 문제를 해결하기 위해 큐잉 방식을 제안했습니다. 그러나 2PL 프로토콜을 사용하는 경우 활성 트랜잭션을 일시 중지하면 잠금 유지 시간이 길어져 시스템 성능이 저하됩니다. 본 논문에서는 트랜잭션 강제 종료 확률을 줄이기 위해 정적 및 동적 두 가지 가드 채널 방식(GCS)을 제안합니다. 동적 GCS에서는 기지국에 예약된 채널 수가 해당 셀로 핸드오프할 수 있는 트랜잭션 호출 수에 따라 동적으로 할당되는 반면, 정적 GCS에서는 보호 채널 수가 고정되어 있습니다. 시스템 성능을 평가하기 위해 Markov 체인 기반의 분석 모델이 도출되었습니다. 이 모델의 정확성은 시뮬레이션을 통해 검증됩니다. 실험 결과는 동적 GCS를 사용함으로써 상당한 개선이 달성되었음을 보여줍니다.
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.
부
Guan-Chi CHEN, Suh-Yin LEE, "Modeling of Static and Dynamic Guard Channel Schemes for Mobile Transactions" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 1, pp. 87-99, January 2001, doi: .
Abstract: There are more and more information services provided on the wireless networks. Due to long network delay of wireless links, transactions will be long-lived transactions. In such a situation, the occurrence of handoff is inevitable, and thus a wireless link held by a mobile unit crossing cell boundaries might be forced to terminate. It is undesirable that an active transaction is forced to terminate. A queueing scheme has been proposed to solve the problem of forced termination of transactions in our previous research. However, when 2PL protocol is employed, suspending an active transaction will elongate the lock holding time and thus degrade the system performance. In this paper, we propose two guard channel schemes (GCS), static and dynamic, to reduce the probability of forced termination of transactions. In dynamic GCS, the number of channels reserved in a base station is dynamically assigned according to the number of transaction calls which may handoff to this cell while the number of guard channels is fixed in static GCS. An analytic model based on Markov chain is derived to evaluate the system performance. The correctness of this model is verified by simulation. The experimental results show that a significant improvement is achieved by using the dynamic GCS.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_1_87/_p
부
@ARTICLE{e84-d_1_87,
author={Guan-Chi CHEN, Suh-Yin LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Modeling of Static and Dynamic Guard Channel Schemes for Mobile Transactions},
year={2001},
volume={E84-D},
number={1},
pages={87-99},
abstract={There are more and more information services provided on the wireless networks. Due to long network delay of wireless links, transactions will be long-lived transactions. In such a situation, the occurrence of handoff is inevitable, and thus a wireless link held by a mobile unit crossing cell boundaries might be forced to terminate. It is undesirable that an active transaction is forced to terminate. A queueing scheme has been proposed to solve the problem of forced termination of transactions in our previous research. However, when 2PL protocol is employed, suspending an active transaction will elongate the lock holding time and thus degrade the system performance. In this paper, we propose two guard channel schemes (GCS), static and dynamic, to reduce the probability of forced termination of transactions. In dynamic GCS, the number of channels reserved in a base station is dynamically assigned according to the number of transaction calls which may handoff to this cell while the number of guard channels is fixed in static GCS. An analytic model based on Markov chain is derived to evaluate the system performance. The correctness of this model is verified by simulation. The experimental results show that a significant improvement is achieved by using the dynamic GCS.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - Modeling of Static and Dynamic Guard Channel Schemes for Mobile Transactions
T2 - IEICE TRANSACTIONS on Information
SP - 87
EP - 99
AU - Guan-Chi CHEN
AU - Suh-Yin LEE
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2001
AB - There are more and more information services provided on the wireless networks. Due to long network delay of wireless links, transactions will be long-lived transactions. In such a situation, the occurrence of handoff is inevitable, and thus a wireless link held by a mobile unit crossing cell boundaries might be forced to terminate. It is undesirable that an active transaction is forced to terminate. A queueing scheme has been proposed to solve the problem of forced termination of transactions in our previous research. However, when 2PL protocol is employed, suspending an active transaction will elongate the lock holding time and thus degrade the system performance. In this paper, we propose two guard channel schemes (GCS), static and dynamic, to reduce the probability of forced termination of transactions. In dynamic GCS, the number of channels reserved in a base station is dynamically assigned according to the number of transaction calls which may handoff to this cell while the number of guard channels is fixed in static GCS. An analytic model based on Markov chain is derived to evaluate the system performance. The correctness of this model is verified by simulation. The experimental results show that a significant improvement is achieved by using the dynamic GCS.
ER -