Performance Evaluation of Real-Time Scheduling Policies for PCS Mobility Database System

碩士 === 國立交通大學 === 資訊科學學系 === 86 === In Personal Communication Services (PCS), the network tracks the locations of the mobile stations so that incoming calls can be delivered to the target mobile stations. At present, a two-level mobility da...

Full description

Bibliographic Details
Main Authors: Kuo, Chun-Ju, 郭春汝
Other Authors: Wei-Pang Yang
Format: Others
Language:zh-TW
Published: 1997
Online Access:http://ndltd.ncl.edu.tw/handle/62459146076886993219
Description
Summary:碩士 === 國立交通大學 === 資訊科學學系 === 86 === In Personal Communication Services (PCS), the network tracks the locations of the mobile stations so that incoming calls can be delivered to the target mobile stations. At present, a two-level mobility database system is extensively used to store location information of the mobile stations. In this paper, we aim to investigate how to meet real-time requirements for the mobility database system. Under some assumptions, a set of experiments have been conducted to evaluate the performance of various real- time scheduling policies. Based on the experimental results, the following suggestions are given for PCS provider to design a high-performance mobility database system. 1) The evaluated real-time scheduling policies have significant impact on improving the performance. 2) Increasing power of HLR can obviously improve the performance. 3) Giving remote accesses higher priority to enter the system can decrease the effect of overload spreading by the bottleneck site. 4) Memory resident databases make little contribution to improving the performance. 5.) Mobility rate of mobile stations seriously affects the performance.