Optimization of GPRS Time Slot Allocation

碩士 === 國立臺灣大學 === 資訊管理研究所 === 89 === With the maturity of the wireless networks technology, the demands for the mobile communication become higher and higher. Besides voice communication demands, data transmission applications such as WWW, multimedia are becoming more and more important....

Full description

Bibliographic Details
Main Authors: HSU-KUAN HUNG, 洪許寬
Other Authors: YEONG-SUNG LIN
Format: Others
Language:zh-TW
Published: 2001
Online Access:http://ndltd.ncl.edu.tw/handle/40842257186487983475
Description
Summary:碩士 === 國立臺灣大學 === 資訊管理研究所 === 89 === With the maturity of the wireless networks technology, the demands for the mobile communication become higher and higher. Besides voice communication demands, data transmission applications such as WWW, multimedia are becoming more and more important. The main system of mobile communication is GSM, which is mainly designed for voice and is not suitable for data transmission. In order to satisfy the increasing user requirements, in developing of GSM phase 2+, the ETSI has specified a general packet radio service (GPRS) that accommodates data connections with high bandwidth efficiency. Since GPRS is based on GSM and they use the same physical channels, the allocation of time slot is an academic issue. Different slot allocation policy will cause different revenue, throughput and QoS of the system. In the vendor's point of view, revenue maximization is the main consideration. Thus in this thesis, we want to find a policy to maximize the system revenue according to the users' traffic pattern. We propose two mathematical models to deal with the slot allocation problem in this thesis. The goal of our model is to find a slot allocation policy to maximize the system revenue under the capacity constraint. The main difference between two models is the time type. The first model is continuous-time, and the second model is discrete time. We apply Markovian decision process to solve our problem due to the problem size and the mathematical structure of our model. The computational results are good in our experiments. We can find a slot allocation policy to maximize the system revenue according to users' traffic pattern. Comparison to the policy that the vendors often used, the policy we found has great improvement in system revenue. Thus, our model could provide good decisions for system vendors and network planners.