Performance analysis of CDMA random access systems with heavy-tailed packet length distribution

S. Z. Ozer, S. Papavassiliou, A. N. Akansu

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations

Abstract

This paper analyzes the performance of unslotted CDMA random access schemes with heavy-tailed packet length distribution. Most of the previous work cover the analysis of the system with Poisson process and for infinite population and infinite buffer size where the results mainly depend on the mean values of the traffic. In this paper we remove these assumptions and analyze the behavior of the system for the more general and realistic case of finite population, finite buffers and variable packet length. The emphasis is placed on the study of the effect of the heavy-tailed packet length on the system characteristics. Specifically, we show via analysis and simulation that even when the mean packet length is small the system can have bottlenecks due to the packet length characteristics, and therefore dynamic adaptation and control of the system is required.

Original languageEnglish (US)
Pages597-602
Number of pages6
StatePublished - Jan 1 2001
Event6th IEEE Symposium on Computers Communications ISCC 2001 - Hammamet, Tunisia
Duration: Jul 3 2001Jul 5 2001

Other

Other6th IEEE Symposium on Computers Communications ISCC 2001
CountryTunisia
CityHammamet
Period7/3/017/5/01

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications

Keywords

  • CDMA
  • Heavy-tailed packet length
  • Random access
  • Wireless networks

Fingerprint Dive into the research topics of 'Performance analysis of CDMA random access systems with heavy-tailed packet length distribution'. Together they form a unique fingerprint.

Cite this