Queueing Performance Analysis of CDF-Based Scheduling over Markov Fading Channels 


Vol. 41,  No. 10, pp. 1240-1243, Oct.  2016


PDF
  Abstract

In this paper, we analyze the queueing performance of cumulative distribution function (CDF)-based opportunistic scheduling over Nakagami-m Markov fading channels. We derive the formula for the average queueing delay and the queue length distribution by constructing a two-dimensional Markov chain. Using our formula, we investigate the queueing performance for various fading parameters.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Kim, "Queueing Performance Analysis of CDF-Based Scheduling over Markov Fading Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 10, pp. 1240-1243, 2016. DOI: .

[ACM Style]

Yoora Kim. 2016. Queueing Performance Analysis of CDF-Based Scheduling over Markov Fading Channels. The Journal of Korean Institute of Communications and Information Sciences, 41, 10, (2016), 1240-1243. DOI: .

[KICS Style]

Yoora Kim, "Queueing Performance Analysis of CDF-Based Scheduling over Markov Fading Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 10, pp. 1240-1243, 10. 2016.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880