Browsing by Author "Agrawal, P"

Now showing 1 - 2 of 2

Implementing automatic location update for Follow-me database using VoIP and Bluetooth technologies
(2002-10-01)
Lin, YB
;
Cheng, HY
;
Cheng, YH
;
Agrawal, P
;
資訊工程學系
Personal Number (PIN) service or Follow-me service allows a user to access telecommunication services with any terminals (e.g., fixed telephones or mobile phones) in any locations within the service area. To provide this feature, the PN user needs to manually register with a phone number every time he/she enters a new location. It the user forgets to register the new phone number, the incoming calls will be misrouted. To provide user-friendly Follow-me service, this paper proposes an Automatic Follow-me Service (AFS) approach that automatically updates the PN records in the Follow-me database. The significance of our approach is that AFS can be integrated with existing Follow-me databases to automate PIN services offered by different PSTN service providers. We show how AFS can be implemented by using the Voice over IP and Bluetooth technologies. Then, we propose an analytic model to investigate the performance of AFS. The analytic results are validated by simulation experiments. Our study suggests how to select polling frequency to optimize the AFS performance.
Serving radio network controller relocation for UMTS All-IP network
(2004-05-01)
Pang, AC
;
Lin, YB
;
Hsien-Ming, T
;
Agrawal, P
;
資訊工程學系
To support real-time multimedia services in UNITS all-IP network, Third-Generation Partnership Project TR 25.936 proposed two approaches to support real-time serving radio network controller (SRNC) switching, which require packet duplication during SRNC relocation. These approaches significantly consume extra system resources. This paper proposes the fast SRNC relocation (FSR) approach that does not duplicate packets. In FSR, a packet buffering mechanism is implemented to avoid packet loss at the target RNC. We propose an analytic model to investigate the performance of FSR. The numerical results show that packet loss at the source RNC can be ignored. Furthermore, the expected number of packets buffered at the target RNC is small, which does not prolong packet delay.