Wireless data performance in multi-cell scenarios

ABSTRACT

The performance of wireless data systems has been extensively studied in the context of a single base station. In the present paper we investigate the flow-level performance in networks with multiple base stations. We specifically examine the complex, dynamic interaction of the number of active flows in the various cells introduced by the strong impact of interference between neighboring base stations. For the downlink data transmissions that we consider, lower service rates caused by increased interference from neighboring base stations result in longer delays and thus a higher number of active flows. This in turn results in a longer duration of interference on surrounding base stations, causing a strong correlation between the activity states of the base stations. Such a system can be modelled as a network of multi-class processor-sharing queues, where the service rates for the various classes at each queue vary over time as governed by the activity state of the other queues. The complex interaction between the various queues renders an exact analysis intractable in general. A simplified network with only one class per queue reduces to a coupled-processors model, for which there are few results, even in the case of two queues. We thus derive bounds and approximations for key performance metrics like the number of active flows, transfer delays, and flow throughputs in the various cells. Importantly, these bounds and approximations are insensitive, yielding simple expressions, that render the detailed statistical characteristics of the system largely irrelevant.

REFERENCES

• 1: 3GPP (2002). Spatial Channel Model Text Description. {Combined ad-hoc from 3GPP and 3GPP2.} http://www.3gpp.org
• 2: Agrawal, R., Bedekar, A., La, R.J., Subramanian, V. (2001). Class and channel condition based weighted proportional fair scheduler. In: Teletraffic Engineering in the Internet Era, Proc. ITC-17, Salvador da Bahia, eds. J.M. de Souza, N.L.S. da Fonseca, E.A. de Souza e Silva (North-Holland, Amsterdam), 553--565.
• 3: Hari Balakrishnan , Venkata N. Padmanabhan , Srinivasan Seshan , Randy H. Katz, A comparison of mechanisms for improving TCP performance over wireless links, IEEE/ACM Transactions on Networking (TON), v.5 n.6, p.756-769, Dec. 1997 [doi>10.1109/90.650137]
• 4: Bedekar, A., Borst, S.C., Ramanan, K., Whiting, P.A., Yeh, E.M. (1999). Downlink scheduling in CDMA data networks. In: Proc. Globecom '99 Conference, 2653--2657.
• 5: Bender, P., Black, P., Grob, M., Padovani, R., Sindhushayana, N., Viterbi, A. (2000). CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users. IEEE Commun. Mag. 38 (7), 70--77.
• 6: Thomas Bonald , Alexandre Proutiere, Wireless downlink data channels: user performance and cell dimensioning, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA [doi>10.1145/938985.939020]
• 7: Bonald, T., Borst, S.C., Proutiére, A. (2004). How mobility impacts the flow-level performance of wireless data networks. In: Proc. Infocom 2004.
• 8: Borst, S.C. (2003). User-level performance of channel-aware scheduling algorithms in wireless data networks. In: Proc. Infocom 2003.
• 9: Chakravorty, R., Katti, S., Crowcroft, J., Pratt, I. (2003). Flow aggregation for enhanced TCP over wide-area wireless. In: Proc. Infocom 2003.
• 10: Cohen, J.W. (1984). On a functional relation in three complex variables; three coupled processors. Technical Report 359, Mathematical Institute, University of Utrecht.
• 11: Cohen, J.W., Boxma, O.J. (1983). Boundary Value Problems in Queueing System Analysis (North-Holland Publ. Cy., Amsterdam).
• 12: F. Delcoigne , A. Proutière , G. Régnié, Modeling integration of streaming and data traffic, Performance Evaluation, v.55 n.3-4, p.185-209, February 2004 [doi>10.1016/S0166-5316(03)00115-9]
• 13: Fayolle, G., Iasnogorodski, R. (1979). Two coupled processors: the reduction to a Riemann-Hilbert problem. Z. Wahr. verw. Geb. 47, 325--351.
• 14: Jalali, A., Padovani, R., Pankaj, R. (2000). Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In: Proc. IEEE VTC 2000 Spring Conf., 1854--1858.
• 15: Xin Liu , Edwin K. P. Chong , Ness B. Shroff, A framework for opportunistic scheduling in wireless networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.41 n.4, p.451-474, 15 March 2003 [doi>10.1016/S1389-1286(02)00401-2 ]
• 16: Shakkottai, S., Stolyar, A.L. (2001). Scheduling algorithms for a mixture of real-time and non-real time data in HDR. In: Teletraffic Engineering in the Internet Era, Proc. ITC-17, Salvador da Bahia, eds. J.M. de Souza, N.L.S. da Fonseca, E.A. de Souza e Silva (North-Holland, Amsterdam), 793--804.
• 17: Tsibonis, V., Georgiadis, L., Tassiulas, L. (2003). Exploiting wireless channel state information for throughput maximization. In: Proc. Infocom 2003.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Measurement techniques

  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Stochastic processes; Queueing theory

General Terms:
Performance

Keywords:
elastic traffic, fluid regime, insensitivity, multi-class processor-sharing, quasi-stationary regime, stability, time-varying service, wireless data networks