Browsing by Author "Jeng, JY"

Now showing 1 - 8 of 8

Credit allocation for UMTS prepaid service
(2006-01-01)
Lin, P
;
Lin, YB
;
Gan, CH
;
Jeng, JY
;
資訊工程學系
Prepaid phone service requires a user to make payment before calling. In 2.5G or the 3G networks, a user may be engaged in multiple voice and/or data prepaid sessions at the same time. For such services, it is important to distribute appropriate amounts of prepaid credit units to simultaneously executed sessions of a user. By considering the universal mobile telecommunication system (UNITS) as an example, this paper studies the prepaid credit allocation for the prepaid sessions. To simulataneously accommodate more prepaid sessions for a user, we propose a credit reclaim mechanism called prepaid credit reclaim (PCR). Analysis and simulation experiments are conducted to investigate the performance of our mechanism. Our study indicates that PCR can significantly improve the-performance of the prepaid mechanism.
Dynamic resource assignment strategies for PCS data services
(1998-08-01)
Jeng, JY
;
Lin, YB
;
Chen, W
;
資訊工程學系
;
Department of Computer Science
For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of a single channel (or time slot). To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies are exercised. This paper proposes a generic Mobile Switching Center (MSC) resource allocation algorithm called MRA algorithm for Personal Communications Services (PCS) data services. The algorithm may combine with any base station resource allocation algorithms proposed in our previous study. A simulation model is proposed to investigate the performance of these algorithms. We define satisfaction indication SI to measure the performance of the resource allocation. SI indicates the customer's satisfaction about the call connection, it can also be used by the service provider as a charge indication. (C) 1998 Published by Elsevier Science Inc. All rights reserved.
Dynamic scheduling for GSM data services
(1997-02-01)
Jeng, JY
;
Lin, CW
;
Lin, YB
;
交大名義發表
;
National Chiao Tung University
A new GSM data protocol called high speed circuit switched data (HSCSD) have been developed by European Telecommunications Standards Institute (ETSI) for high speed file transfer and mobile video applications. HSCSD increases data rate by using multiple TDMA time slots (up to 8) instead of one time slot in the current GSM implementation. The problem of multiple time slot assignment is that the blocking rate of the system will increase. This problem can be solved by flexible resource assignment where the service specifies the maximum and the minimum capacity. Based on the current available capacity of a base station, a user will be assigned any rate between the maximum and the minimum capacities. This article describes HSCSD protocol and presents four radio resource allocation strategies for HSCSD: always allocates maximum, always allocates minimum, allocates maximum unless available resources are not enough, and allocates resources according to the current blocking statistics of the base station. A simulation model is proposed to investigate the performance of these algorithms. The blocking probability, the call completion probability, and the quality of service are used to evaluate the effects of algorithms in different system behaviors.
Dynamic scheduling for GSM data services
(1997-02-01)
Jeng, JY
;
Lin, CW
;
Lin, YB
;
交大名義發表
;
National Chiao Tung University
A new GSM data protocol called high speed circuit switched data (HSCSD) have been developed by European Telecommunications Standards Institute (ETSI) for high speed file transfer and mobile video applications. HSCSD increases data rate by using multiple TDMA time slots (up to 8) instead of one time slot in the current GSM implementation. The problem of multiple time slot assignment is that the blocking rate of the system will increase. This problem can be solved by flexible resource assignment where the service specifies the maximum and the minimum capacity. Based on the current available capacity of a base station, a user will be assigned any rate between the maximum and the minimum capacities. This article describes HSCSD protocol and presents four radio resource allocation strategies for HSCSD: always allocates maximum, always allocates minimum, allocates maximum unless available resources are not enough, and allocates resources according to the current blocking statistics of the base station. A simulation model is proposed to investigate the performance of these algorithms. The blocking probability, the call completion probability, and the quality of service are used to evaluate the effects of algorithms in different system behaviors.
Equal resource sharing scheduling for PCS data services
(1999)
Jeng, JY
;
Lin, YB
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of one channel. To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies have been proposed. This paper proposes the Equal Resource Sharing Allocation scheme (ERSA scheme) for flexible resource allocation. The ERSA scheme dynamically averages the allocated resource to the call requests based on the number of calls in a base station. The scheme accommodates the maximum number of requests while providing acceptable quality to the admitted requests. We developed an analytic model to investigate the performance of ERSA, and conducted simulation experiments to validate the analytic model. We define satisfaction indication SI as the performance measurement of the resource allocation algorithm. The experiment results indicate that the ERSA scheme outperforms other resource allocation algorithms proposed in our previous study.
Flexible Resource Allocation scheme for GSM data services
(1998-10-01)
Jeng, JY
;
Lin, YB
;
Rao, HCH
;
資訊工程學系
;
Department of Computer Science
In GSM High Speed Circuit Switched Data (HSCSD), the data rate can be increased by using multiple time slots instead of single time slot. Multiple time-slot assignment results in high blocking rate. To accommodate more users, flexible resource allocation strategies have been proposed. Since GSM follows TDMA/FDMA, the channels (time slots) in a base station are segmented by frequency carriers. The base station must allocate the channels which belong to the same frequency carrier to individual requests. This Flexible Resource Allocation scheme for GSM (FRA-GSM) is contrastive to the scheme proposed in our previous studies where a base station may arbitrarily allocate idle channels in the base station to incoming requests. We de fine satisfaction indication SI as the measurement to compare the performance of these schemes. Experiment results indicate that FRA-GSM scheme has good performance when the user mobility is high, or when some cost factors are taken into account.
Flexible Resource Allocation scheme for GSM data services
(1998-10-01)
Jeng, JY
;
Lin, YB
;
Rao, HCH
;
資訊工程學系
;
Department of Computer Science
In GSM High Speed Circuit Switched Data (HSCSD), the data rate can be increased by using multiple time slots instead of single time slot. Multiple time-slot assignment results in high blocking rate. To accommodate more users, flexible resource allocation strategies have been proposed. Since GSM follows TDMA/FDMA, the channels (time slots) in a base station are segmented by frequency carriers. The base station must allocate the channels which belong to the same frequency carrier to individual requests. This Flexible Resource Allocation scheme for GSM (FRA-GSM) is contrastive to the scheme proposed in our previous studies where a base station may arbitrarily allocate idle channels in the base station to incoming requests. We de fine satisfaction indication SI as the measurement to compare the performance of these schemes. Experiment results indicate that FRA-GSM scheme has good performance when the user mobility is high, or when some cost factors are taken into account.
Improving GSM call completion by call reestablishment
(1999-07-01)
Lin, PN
;
Lin, YB
;
Jeng, JY
;
資訊工程學系
;
Department of Computer Science
Global system for mobile communications (GSM) call reestablishment service allows a mobile station to resume a call in which the radio link has been temporarily interrupted due to interference or bad signal (which is referred to as an interrupted call). This service increases end user satisfaction and network quality perception. In this paper, we propose analytic models to study the performance for call reestablishment service. Our study indicates that call reestablishment can significantly reduces dropping for interrupted calls.