The Experts below are selected from a list of 11298 Experts worldwide ranked by ideXlab platform
Nen-fu Huang - One of the best experts on this subject based on the ideXlab platform.
-
Providing multicast short message services over self-routing mobile cellular backbone network
IEEE Transactions on Vehicular Technology, 2003Co-Authors: Nen-fu HuangAbstract:The short message service (SMS), a bidirectional service for short alphanumeric (up to 160 bytes) messages, is a unique feature of GSM not found in older analog systems. Multireceiver short message traffic has increased amazingly over the years. We propose a multicast SMS architecture over our backbone network. Then, we demonstrate some approaches to maintain the SMS center Location information consistent with the home Location Register and illustrate our scheme for mobile terminated short message transfer. Finally, we simulate and evaluate this architecture. Our simulation indicates that the proposed strong consistency approaches have optimal efficiency by adjusting parameters, and the proposed architecture efficiently provides self-routing capability and multicast functionality in our cellular backbone network. The study also provides a further insight on the issues of multicast wireless cellular backbone network and demonstrates a referable methodology to propose and analyze a multicast cellular backbone network, which can promote the technology of a personal communication network.
-
Providing multicast short message services over self-routing mobile cellular backbone network
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001Co-Authors: Nen-fu HuangAbstract:The short message service (SMS), a bidirectional service for short alphanumeric (up to 160 bytes) messages, is a unique feature of GSM, not found in older analog systems. We propose a multicast short message service architecture over a backbone network. We demonstrate some approaches to maintain the Location information of the short message service center consistent to the home Location Register and illustrate our scheme for mobile-terminated short message transfer. Finally, we simulate and evaluate this architecture. Our simulation indicates that the proposed strong consistency approach has optimal efficiency by adjusting parameters. Also, the proposed architecture efficiently provides a self-routing capability and multicast functionality in the cellular backbone network. This study also provides a further insight on the issues of a multicast wireless cellular backbone network and demonstrates a referable methodology to propose and analyze a multicast cellular backbone network, which can promote the technology of personal communication networks.
Gunn Hwang - One of the best experts on this subject based on the ideXlab platform.
-
IP mobility support over wireless ATM
1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 1999Co-Authors: Gunn HwangAbstract:Increasing user demand for more bandwidth over wireless communications has motivated a new challenge to utilize the benefits of wireless ATM technology. This paper focuses on how to provide IP services to a mobile user over wireless ATM networks. It seems to be able to support the mobility by combining the existing schemes developed by the IETF and ATM Forum such as Mobile IP, IP over ATM, Next Hop Resolution Protocol (NHRP), mobile PNNI, and LR (Location Register) schemes. They may be so called "Mobile IP over ATM" or "IP over WATM". However, these naive combinations of existing schemes may result in shortcomings such as inefficiency, duplication of functions and waste of resources. Thus, a new efficient scheme called mobile NHRP is proposed to provide IP mobility support over wireless ATM networks. Also, the fault tolerant routing with mobile NHRP is described.
-
IP mobility support over wireless ATM
1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 1999Co-Authors: Gunn HwangAbstract:Increasing user demand for more bandwidth over wireless communications has motivated a new challenge to utilize the benefits of wireless ATM technology. This paper focuses on how to provide IP services to a mobile user over wireless ATM networks. It seems to be able to support the mobility by combining the existing schemes developed by the IETF and ATM Forum such as Mobile IP, IP over ATM, Next Hop Resolution Protocol (NHRP), mobile PNNI, and LR (Location Register) schemes. They may be so called "Mobile IP over ATM" or "IP over WATM". However, these naive combinations of existing schemes may result in shortcomings such as inefficiency, duplication of functions and waste of resources. Thus, a new efficient scheme called mobile NHRP is proposed to provide IP mobility support over wireless ATM networks. Also, the fault tolerant routing with mobile NHRP is described.
M. M. Naidu - One of the best experts on this subject based on the ideXlab platform.
-
Minimising network cost by employing sliding window method at mobile switching centres in GSM network
International Journal of Mobile Network Design and Innovation, 2018Co-Authors: Mallikharjuna Rao Nuka, M. M. NaiduAbstract:The cost effort of a global system for mobile communications (GSM) network is to be minimised for meeting effectively and efficiently the service requirements of ever increasing mobile subscriber's base. The period of temporary storage of subscribers' profiles in visitor Location Register (VLR) at a mobile switching centre (MSC) affects the cost of GSM network. This research study proposes a sliding window method for determining the storage period of profiles in VLR that minimises the network cost of GSM network. Further, this study examined and evaluated the computational efforts on proposed method. The proposed method proves to be better than the reported set intersection method.
-
An optimal sliding window size for maximising GSM network throughput
International Journal of Wireless and Mobile Computing, 2014Co-Authors: Mallikharjuna Rao Nuka, M. M. NaiduAbstract:The throughput of a Global System for Mobile Communications (GSM) network is to be maximised for effectively and efficiently meeting the service requirements of the ever-increasing mobile subscriber base. The period of temporary storage of subscribers' profiles in the Visitor Location Register (VLR) at a Mobile Switching Centre (MSC) affects the throughput of a GSM network. This research study proposes a sliding window method for determining the storage period of profiles in the VLR, and the principle of optimisation for such a policy is to maximise the throughput and minimise the call set-up time in a GSM network.
-
Sliding window method based on enhanced throughput prediction for improving GSM network efficiency by reducing HLR-VLR transitions
International Journal of Mobile Network Design and Innovation, 2013Co-Authors: Mallikharjuna Rao Nuka, M. M. NaiduAbstract:The throughput of a global system for mobile GSM communications network is to be maximised for meeting effectively and efficiently the service requirements of ever increasing mobile subscriber's base. The period of temporary storage of subscribers' profiles in visitor Location Register VLR at a mobile switching centre MSC affects the throughput of GSM network. This research study proposes a sliding window method for determining the storage period of profiles in VLR that maximises the throughput of GSM network. The proposed method proves to be better than the existing set intersection method.
Yang Xiao - One of the best experts on this subject based on the ideXlab platform.
-
Optimal Utilization and Effects of Inaccurate Estimation in Mobile Database Failure Restoration
IEEE Transactions on Wireless Communications, 2007Co-Authors: Yang Xiao, Hsiao-hwa Chen, Hui Chen, C. Philip L. ChenAbstract:Mobility databases such as home Location Register and visitor Location Register are adopted to support mobility management in personal communications services networks. If a visitor Location Register fails or crashes, the subscribers' services will be seriously degraded due to the loss or corruption of Location information. In this paper, we optimize utilization of demand re-registration messages for an adaptive p-persistent backoff database failure restoration scheme. An analytical model is developed and validated with simulations to obtain the optimal utilization using appropriate parameters so that the failed visitor Location Register is restored with the fastest speed. Some interesting aspects on the performance are studied and their deep insights are observed, such as effects of message sizes on choices of system parameters, effects of the inaccurate estimated number of stations, etc. One observation is that optimizations of utilization and successful transmission probability are two different goals, and a value to achieve the optimal successful transmission probability does not necessarily ensure optimal utilization. Furthermore, we also propose a scheme how to handle the problem with inaccurate (estimated) number of stations.
-
A simulation study of overflow replacement policies for Location management in mobile networks
International Journal of Mobile Communications, 2004Co-Authors: Jie Li, Yang XiaoAbstract:Location management is one of the most important issues of mobile networking systems. Most current mobile systems employ a two-tier database structure to store mobile users' information. HLR (Home Location Register) is used to retrieve user's information, and VLR (Visitor Location Register) is the temporal database for storing visitors' profiles. In the case when the number of users exceeds the capacity of the VLR due to mobility, database overflow occurs. To solve this problem, different replacement policies have been developed: random, most-idle, and inactive. In this paper, we propose a new policy, the least frequent replacement policy, which selects the least frequently accessed users as replacement candidates. Extensive simulation is carried out to predict the performance of the existing replacement policies and the proposed least frequent policy. Our simulation results show that the most idle and least frequent policies outperform the inactive and random replacement policies in most cases and the least frequent policy performs slightly better than the most idle replacement policy.
-
Backoff strategies for demand re-registration in PCS database failure recovery
Computer Communications, 2004Co-Authors: Yang XiaoAbstract:Mobility Databases, Home Location Register (HLR) and Visitor Location Register (VLR), are utilized to support mobility management for Mobile Stations (MSs) in Personal Communications Services (PCS) networks. If the Location database fail, the subscribers' services will be seriously degraded due to the loss or corruption of Location information. Previous work proposed demand re-registration with a p-persistent backoff strategy and a checkpoint method that demonstrates better performance than the periodic re-registration policy. In demand re-registration, after a VLR fails, it broadcasts a re-registration request to all MSs. Backoff strategies are needed since collisions may occur if all MSs try to re-Register after receiving the request. Choosing a good backoff strategy for demand re-registration has several benefits that are our goals in this paper. A better strategy will save the re-registration traffic in terms of signaling cost. Moreover, a better strategy will allow an MS to re-Register earlier to reduce the probability that a call termination with expensive paging operations happens earlier than Location information recovery. In this paper, we propose and study seven backoff strategies for demand re-registration: one optimal p-persistent strategy, three dynamic p-persistent strategies, and three non-persistent strategies. Among these proposed strategies, the optimal p-persistent strategy is optimal in the sense of optimality among all the p-persistent strategies; the three dynamic p-persistent strategies improve p-persistent strategies by allowing the p-value to change with time; the three non-persistent strategies include a binary exponential backoff strategy, an exponential backoff strategy, and a non-exponential non-persistent backoff strategy; our studies show that they can be approximately equivalent to special dynamic p-persistent strategies. Our studies also show that one of the dynamic p-persistent backoff strategies is the best strategy among all the seven proposed strategies and our results indicate that with better backoff strategies, the performance of demand re-registration can be dramatically improved.
-
Optimal Location management for two-tier PCS networks
Computer Communications, 2003Co-Authors: Yang XiaoAbstract:Abstract One of the most important issues in Personal Communication Service (PCS) networks is Location management, which keeps track of the Mobile Terminals (MTs) moving from place to place. In this paper, we analytically derive cost functions of Location updates and paging for a dynamic movement-based Location management scheme for PCS networks with two-tier mobility databases. We prove analytically that there is a unique optimal movement threshold that minimizes the total cost of Home Location Register Location updates, Visitor Location Register Location updates, and paging, per call arrival. An effective algorithm is proposed to find the optimal movement threshold. Furthermore, we propose a hybrid Location management scheme, in which when the call-to-mobility ratio is larger than a threshold, the optimal dynamic movement-based scheme is adopted. Otherwise, the static Location update is adopted. The Newton approximation method is adopted to find this threshold. Our study shows that the proposed hybrid scheme outperforms both the dynamic movement-based scheme and the static Location update scheme.
-
ICDCS Workshops - A new overflow replacement policy for efficient Location management in mobile networks
23rd International Conference on Distributed Computing Systems Workshops 2003. Proceedings., 2003Co-Authors: Jie Li, Yang XiaoAbstract:Location management is one of the most important issues in mobile networking systems. Most current mobile systems employ a two-tier database structure to store mobile users' information. HLR (Home Location Register) is used to retrieve user's information, and VLR (Visitor Location Register) is the temporal database for storing visitors' profile. In the case that the number of users exceeds the capacity of the VLR due to mobility, database overflow occurs. In this paper, we propose a new policy, the least frequent replacement policy, which selects the least frequently accessed users as replacement candidates. Extensive simulation is carried out for predicting the performance of the existing replacement policies and the proposed least frequent policy. Our simulation results show that the most idle and least frequent policies outperform the inactive and random replacement policies in most cases and that the least frequent policy performs slightly better than the most idle replacement policy.
Mallikharjuna Rao Nuka - One of the best experts on this subject based on the ideXlab platform.
-
Minimising network cost by employing sliding window method at mobile switching centres in GSM network
International Journal of Mobile Network Design and Innovation, 2018Co-Authors: Mallikharjuna Rao Nuka, M. M. NaiduAbstract:The cost effort of a global system for mobile communications (GSM) network is to be minimised for meeting effectively and efficiently the service requirements of ever increasing mobile subscriber's base. The period of temporary storage of subscribers' profiles in visitor Location Register (VLR) at a mobile switching centre (MSC) affects the cost of GSM network. This research study proposes a sliding window method for determining the storage period of profiles in VLR that minimises the network cost of GSM network. Further, this study examined and evaluated the computational efforts on proposed method. The proposed method proves to be better than the reported set intersection method.
-
An optimal sliding window size for maximising GSM network throughput
International Journal of Wireless and Mobile Computing, 2014Co-Authors: Mallikharjuna Rao Nuka, M. M. NaiduAbstract:The throughput of a Global System for Mobile Communications (GSM) network is to be maximised for effectively and efficiently meeting the service requirements of the ever-increasing mobile subscriber base. The period of temporary storage of subscribers' profiles in the Visitor Location Register (VLR) at a Mobile Switching Centre (MSC) affects the throughput of a GSM network. This research study proposes a sliding window method for determining the storage period of profiles in the VLR, and the principle of optimisation for such a policy is to maximise the throughput and minimise the call set-up time in a GSM network.
-
Sliding window method based on enhanced throughput prediction for improving GSM network efficiency by reducing HLR-VLR transitions
International Journal of Mobile Network Design and Innovation, 2013Co-Authors: Mallikharjuna Rao Nuka, M. M. NaiduAbstract:The throughput of a global system for mobile GSM communications network is to be maximised for meeting effectively and efficiently the service requirements of ever increasing mobile subscriber's base. The period of temporary storage of subscribers' profiles in visitor Location Register VLR at a mobile switching centre MSC affects the throughput of GSM network. This research study proposes a sliding window method for determining the storage period of profiles in VLR that maximises the throughput of GSM network. The proposed method proves to be better than the existing set intersection method.
