• DocumentCode
    3429171
  • Title

    A Multi-channel QoS Model for Random Access Systems

  • Author

    Abdel-Hamid, Y. ; Gebali, F. ; Gulliver, T.A.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC
  • fYear
    2009
  • fDate
    11-13 May 2009
  • Firstpage
    20
  • Lastpage
    24
  • Abstract
    In this paper, we present a simple two-class QoS model for random access systems. We provide a practical mechanism for categorizing the available resources into two distinct service classes prior to medium access. We use an a Markov chain model to define the states and transitions, and derive the system access success probability. This provides a mathematical basis for an accurate model that can be efficiently used to determine the resource allocation for each class. This model provides a useful analytical tool for contention systems that utilize random access for network entry, resource acquisition, and/or contention-based data transmission, e.g. the IEEE 802.16 uplink contention channel. We also study the trade-off between resources allocated and the input traffic from each class. For simplicity, we only consider two classes, however the technique can easily be extended to any number of classes.
  • Keywords
    Markov processes; quality of service; resource allocation; subscriber loops; IEEE 802.16 uplink contention channel; Markov chain model; contention-based data transmission; multichannel QoS model; quality of service; random access systems; resource acquisition; resource allocation; subscriber stations; system access success probability; Access protocols; Analytical models; Bandwidth; Communication networks; Communication system traffic control; Data communication; Mathematical model; Resource management; Telecommunication traffic; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Networks and Services Research Conference, 2009. CNSR '09. Seventh Annual
  • Conference_Location
    Moncton, NB
  • Print_ISBN
    978-1-4244-4155-6
  • Electronic_ISBN
    978-0-7695-3649-1
  • Type

    conf

  • DOI
    10.1109/CNSR.2009.14
  • Filename
    4939102