Modeling PCS networks under general call holding time and cell residence time distributions
IEEE/ACM Transactions on Networking (TON)
Mobile user location update and paging under delay constraints
Wireless Networks
Channel Occupancy Times and Handoff Rate for Mobile Computing and PCS Networks
IEEE Transactions on Computers
Teletraffic modeling for personal communications services
IEEE Communications Magazine
Location uncertainty in mobile networks: a theoretical framework
IEEE Communications Magazine
User mobility modeling and characterization of mobility patterns
IEEE Journal on Selected Areas in Communications
Call performance for a PCS network
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
A PCS network with correlated arrival process and splitted-rating channels
IEEE Journal on Selected Areas in Communications
Mobility Patterns in Microcellular Wireless Networks
IEEE Transactions on Mobile Computing
Completed analysis of cellular networks with PH-renewal arrival call
Computer Communications
Call admission control scheme for multiclass services under rain fading for satellite network
IEEE Transactions on Wireless Communications
Analysis of opportunistic spectrum sharing with Markovian arrivals and phase-type service
IEEE Transactions on Wireless Communications
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Proceedings of the 7th International Conference on Frontiers of Information Technology
Phase-type models for cellular networks supporting voice, video and data traffic
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow correlation of the interarrival times among new calls, among handoff calls, as well as between these two kinds of calls. The PCS network consists of homogeneous cells and each cell consists of a finite number of channels. Under the conditions that both cell's residence time and the requested call holding time possess the general phase type (PH) distribution, we obtain the distribution of the channel holding times, the new call blocking probability and the handoff call failure probability. Furthermore, we prove that the cell residence time is PH distribution if and only if• the new call channel holding time is PH distribution; or• the handoff call channel holding time is PH distribution; or• the call channel holding time is PH distribution;provided that the requested call holding time is a PH distribution and the total call arrival process is a MAP. Also, we prove that the actual call holding time of a non-blocked new call is a mixture of PH distributions. We then developed the Markov process for describing the system and found the complexity of this Markov process. Finally, two interesting measures for the network users, i.e., the duration of new call blocking period and the duration of handoff call blocking period, are introduced; their distributions and the expectations are then obtained explicitly.