Source: Ann. Appl. Probab. Volume 20, Number 1
(2010), 312-355.
A stochastic model for a mobile network is studied. Users enter the network, and then perform independent Markovian routes between nodes where they receive service according to the Processor-Sharing policy. Once their service requirement is satisfied, they leave the system. The stability region is identified via a fluid limit approach, and strongly relies on a “spatial homogenization” property: at the fluid level, customers are instantaneously distributed across the network according to the stationary distribution of their Markovian dynamics and stay distributed as such as long as the network is not empty. In the unstable regime, spatial homogenization almost surely holds asymptotically as time goes to infinity (on the normal scale), telling how the system fills up. One of the technical achievements of the paper is the construction of a family of martingales associated to the multidimensional process of interest, which makes it possible to get crucial estimates for certain exit times.
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription.
Read more about accessing full-text
References
[1] Athreya, K. B. and Kang, H.-J. (1998). Some limit theorems for positive recurrent branching Markov chains. I, II. Adv. in Appl. Probab. 30 693–710, 711–722.
[2] Borst, S. (2005). User level performance of channel-aware scheduling algorithms in wireless data networks. IEEE/ACM Transactions on Networking 13 636–647.
[3] Borst, S., Proutière, A. and Hedge, N. (2006). Capacity of wireless data networks with intra- and inter-cell mobility. In Proceedings of IEEE INFOCOM 2006 1058–1069. Barcelona, Spain.
[4] Bramson, M. (1996). Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Syst. 22 5–45.
[5] Bramson, M. (1996). Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Syst. 23 1–26.
[6] Caputo, P. and Posta, G. (2007). Entropy dissipation estimates in a zero-range dynamics. Probab. Theory Related Fields 139 65–87.
[7] Chen, H. and Yao, D. D. (2001). Fundamentals of Queueing Networks. Applications of Mathematics 46. Springer, New York.
[8] Dai, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5 49–77.
[9] Dupuis, P. and Williams, R. J. (1994). Lyapunov functions for semimartingale reflecting Brownian motions. Ann. Probab. 22 680–702.
[10] Fricker, C., Robert, P. and Tibi, D. (1999). On the rates of convergence of Erlang’s model. J. Appl. Probab. 36 1167–1184.
[11] Grossglauser, M. and Tse, D. (2002). Mobility increases the capacity of ad-hoc wireless networks. IEEE/ACM Transactions on Networking 10 477–486.
[12] Robert, P. (2003). Stochastic Networks and Queues: Stochastic Modelling and Applied Probability. Applications of Mathematics (New York) 52. Springer, Berlin.
[13] Rybko, A. N. and Stolyar, A. L. (1992). On the ergodicity of random processes that describe the functioning of open queueing networks. Problemy Peredachi Informatsii 28 3–26.
