Service matching over block Rayleigh fading channels

Buffer utilization via overflow probability

Yunquan Dong, Pingyi Fan, Khaled Letaief, Ross D. Murch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In the paper, we consider information transmission over a block Rayleigh fading channel, where a finite length buffer is employed to match the source traffic. We evaluate the channel utilization efficiency and overflow performance by inputting a constant rate source traffic stream to the buffer and adjust its transmission rate over the block Rayleigh fading channel according to the channel states. The results reveal the relationship among source traffic rate, maximum buffer length, channel utilization efficiency and overflow performance. Two important observations are obtained: (1) the product of the average length of period when the buffer is emptied and the average length of period when the buffer is overflowed is unity, regardless of source traffic rate; (2) with a finite length buffer, the overflow probability decreases no slower than the inverse square of the maximum buffer length. Different from traditional queuing analysis, the obtained results are applicable to communication with finite length buffers and enables one to evaluate system performance in a finite time scale.

Original languageEnglish
Title of host publication2012 26th Biennial Symposium on Communications, QBSC 2012
Pages80-84
Number of pages5
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 26th Queen's Biennial Symposium on Communications, QBSC 2012 - Kingston, ON, United States
Duration: 28 May 201229 May 2012

Other

Other2012 26th Queen's Biennial Symposium on Communications, QBSC 2012
CountryUnited States
CityKingston, ON
Period28/5/1229/5/12

Fingerprint

Rayleigh fading
Fading channels
Communication

Keywords

  • block Rayleigh fading channel
  • channel utilization
  • finite length buffer
  • overflow probability

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Dong, Y., Fan, P., Letaief, K., & Murch, R. D. (2012). Service matching over block Rayleigh fading channels: Buffer utilization via overflow probability. In 2012 26th Biennial Symposium on Communications, QBSC 2012 (pp. 80-84). [6221356] https://doi.org/10.1109/QBSC.2012.6221356

Service matching over block Rayleigh fading channels : Buffer utilization via overflow probability. / Dong, Yunquan; Fan, Pingyi; Letaief, Khaled; Murch, Ross D.

2012 26th Biennial Symposium on Communications, QBSC 2012. 2012. p. 80-84 6221356.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dong, Y, Fan, P, Letaief, K & Murch, RD 2012, Service matching over block Rayleigh fading channels: Buffer utilization via overflow probability. in 2012 26th Biennial Symposium on Communications, QBSC 2012., 6221356, pp. 80-84, 2012 26th Queen's Biennial Symposium on Communications, QBSC 2012, Kingston, ON, United States, 28/5/12. https://doi.org/10.1109/QBSC.2012.6221356
Dong Y, Fan P, Letaief K, Murch RD. Service matching over block Rayleigh fading channels: Buffer utilization via overflow probability. In 2012 26th Biennial Symposium on Communications, QBSC 2012. 2012. p. 80-84. 6221356 https://doi.org/10.1109/QBSC.2012.6221356
Dong, Yunquan ; Fan, Pingyi ; Letaief, Khaled ; Murch, Ross D. / Service matching over block Rayleigh fading channels : Buffer utilization via overflow probability. 2012 26th Biennial Symposium on Communications, QBSC 2012. 2012. pp. 80-84
@inproceedings{8555c6f7bc21496ba1f353da76af0b5c,
title = "Service matching over block Rayleigh fading channels: Buffer utilization via overflow probability",
abstract = "In the paper, we consider information transmission over a block Rayleigh fading channel, where a finite length buffer is employed to match the source traffic. We evaluate the channel utilization efficiency and overflow performance by inputting a constant rate source traffic stream to the buffer and adjust its transmission rate over the block Rayleigh fading channel according to the channel states. The results reveal the relationship among source traffic rate, maximum buffer length, channel utilization efficiency and overflow performance. Two important observations are obtained: (1) the product of the average length of period when the buffer is emptied and the average length of period when the buffer is overflowed is unity, regardless of source traffic rate; (2) with a finite length buffer, the overflow probability decreases no slower than the inverse square of the maximum buffer length. Different from traditional queuing analysis, the obtained results are applicable to communication with finite length buffers and enables one to evaluate system performance in a finite time scale.",
keywords = "block Rayleigh fading channel, channel utilization, finite length buffer, overflow probability",
author = "Yunquan Dong and Pingyi Fan and Khaled Letaief and Murch, {Ross D.}",
year = "2012",
doi = "10.1109/QBSC.2012.6221356",
language = "English",
isbn = "9781467311137",
pages = "80--84",
booktitle = "2012 26th Biennial Symposium on Communications, QBSC 2012",

}

TY - GEN

T1 - Service matching over block Rayleigh fading channels

T2 - Buffer utilization via overflow probability

AU - Dong, Yunquan

AU - Fan, Pingyi

AU - Letaief, Khaled

AU - Murch, Ross D.

PY - 2012

Y1 - 2012

N2 - In the paper, we consider information transmission over a block Rayleigh fading channel, where a finite length buffer is employed to match the source traffic. We evaluate the channel utilization efficiency and overflow performance by inputting a constant rate source traffic stream to the buffer and adjust its transmission rate over the block Rayleigh fading channel according to the channel states. The results reveal the relationship among source traffic rate, maximum buffer length, channel utilization efficiency and overflow performance. Two important observations are obtained: (1) the product of the average length of period when the buffer is emptied and the average length of period when the buffer is overflowed is unity, regardless of source traffic rate; (2) with a finite length buffer, the overflow probability decreases no slower than the inverse square of the maximum buffer length. Different from traditional queuing analysis, the obtained results are applicable to communication with finite length buffers and enables one to evaluate system performance in a finite time scale.

AB - In the paper, we consider information transmission over a block Rayleigh fading channel, where a finite length buffer is employed to match the source traffic. We evaluate the channel utilization efficiency and overflow performance by inputting a constant rate source traffic stream to the buffer and adjust its transmission rate over the block Rayleigh fading channel according to the channel states. The results reveal the relationship among source traffic rate, maximum buffer length, channel utilization efficiency and overflow performance. Two important observations are obtained: (1) the product of the average length of period when the buffer is emptied and the average length of period when the buffer is overflowed is unity, regardless of source traffic rate; (2) with a finite length buffer, the overflow probability decreases no slower than the inverse square of the maximum buffer length. Different from traditional queuing analysis, the obtained results are applicable to communication with finite length buffers and enables one to evaluate system performance in a finite time scale.

KW - block Rayleigh fading channel

KW - channel utilization

KW - finite length buffer

KW - overflow probability

UR - http://www.scopus.com/inward/record.url?scp=84864138912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864138912&partnerID=8YFLogxK

U2 - 10.1109/QBSC.2012.6221356

DO - 10.1109/QBSC.2012.6221356

M3 - Conference contribution

SN - 9781467311137

SP - 80

EP - 84

BT - 2012 26th Biennial Symposium on Communications, QBSC 2012

ER -