On the characteristics of queueing and scheduling at encoding nodes for network coding

Yi Ma, Wei Li, Pingyi Fan, Khaled Letaief, Xuming Liu

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Synchronization can greatly influence the performance of network coding. In this paper, we shall investigate the synchronization issue based on the use of queueing theory. We shall first propose a queueing model, referred to as the classic model, to investigate the characteristics of the encoding process. It will be proved that given the packet arrival processes are stationary, i.e. the distribution of the arrival processes does not depend on time, and obey independently and identically Poisson distribution and that the encoding time is exponentially distributed, the output flow will be an asymptotically Poisson flow with the same parameter. Through simulation we shall show that the network is sensitive to the arrival rate of input flows and becomes unstable with the input queue size increasing to infinity. This indicates that the classic coding scheme would impose strict requirements on synchronization over the whole network. In order to address this, we shall propose a combined opportunistic scheduling and encoding (COSE) strategy, in which the classic coding scheme and the traditional forwarding algorithm are well integrated. Theoretical analysis and simulation will demonstrate that the COSE strategy is able to control the input queue sizes and keep the network operating in a stable state while maintaining a relatively high throughput, low blocking probability and small waiting delay under various levels of traffic load.

Original languageEnglish
Pages (from-to)755-772
Number of pages18
JournalInternational Journal of Communication Systems
Volume22
Issue number6
DOIs
Publication statusPublished - Jun 2009
Externally publishedYes

Fingerprint

Network coding
Synchronization
Scheduling
Queueing theory
Poisson distribution
Blocking probability
Throughput

Keywords

  • COSE strategy
  • Multicast networks
  • Network coding
  • Queueing model
  • Throughput

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

On the characteristics of queueing and scheduling at encoding nodes for network coding. / Ma, Yi; Li, Wei; Fan, Pingyi; Letaief, Khaled; Liu, Xuming.

In: International Journal of Communication Systems, Vol. 22, No. 6, 06.2009, p. 755-772.

Research output: Contribution to journalArticle

@article{8b1c262945b44ca4aac861de51cef417,
title = "On the characteristics of queueing and scheduling at encoding nodes for network coding",
abstract = "Synchronization can greatly influence the performance of network coding. In this paper, we shall investigate the synchronization issue based on the use of queueing theory. We shall first propose a queueing model, referred to as the classic model, to investigate the characteristics of the encoding process. It will be proved that given the packet arrival processes are stationary, i.e. the distribution of the arrival processes does not depend on time, and obey independently and identically Poisson distribution and that the encoding time is exponentially distributed, the output flow will be an asymptotically Poisson flow with the same parameter. Through simulation we shall show that the network is sensitive to the arrival rate of input flows and becomes unstable with the input queue size increasing to infinity. This indicates that the classic coding scheme would impose strict requirements on synchronization over the whole network. In order to address this, we shall propose a combined opportunistic scheduling and encoding (COSE) strategy, in which the classic coding scheme and the traditional forwarding algorithm are well integrated. Theoretical analysis and simulation will demonstrate that the COSE strategy is able to control the input queue sizes and keep the network operating in a stable state while maintaining a relatively high throughput, low blocking probability and small waiting delay under various levels of traffic load.",
keywords = "COSE strategy, Multicast networks, Network coding, Queueing model, Throughput",
author = "Yi Ma and Wei Li and Pingyi Fan and Khaled Letaief and Xuming Liu",
year = "2009",
month = "6",
doi = "10.1002/dac.998",
language = "English",
volume = "22",
pages = "755--772",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",
number = "6",

}

TY - JOUR

T1 - On the characteristics of queueing and scheduling at encoding nodes for network coding

AU - Ma, Yi

AU - Li, Wei

AU - Fan, Pingyi

AU - Letaief, Khaled

AU - Liu, Xuming

PY - 2009/6

Y1 - 2009/6

N2 - Synchronization can greatly influence the performance of network coding. In this paper, we shall investigate the synchronization issue based on the use of queueing theory. We shall first propose a queueing model, referred to as the classic model, to investigate the characteristics of the encoding process. It will be proved that given the packet arrival processes are stationary, i.e. the distribution of the arrival processes does not depend on time, and obey independently and identically Poisson distribution and that the encoding time is exponentially distributed, the output flow will be an asymptotically Poisson flow with the same parameter. Through simulation we shall show that the network is sensitive to the arrival rate of input flows and becomes unstable with the input queue size increasing to infinity. This indicates that the classic coding scheme would impose strict requirements on synchronization over the whole network. In order to address this, we shall propose a combined opportunistic scheduling and encoding (COSE) strategy, in which the classic coding scheme and the traditional forwarding algorithm are well integrated. Theoretical analysis and simulation will demonstrate that the COSE strategy is able to control the input queue sizes and keep the network operating in a stable state while maintaining a relatively high throughput, low blocking probability and small waiting delay under various levels of traffic load.

AB - Synchronization can greatly influence the performance of network coding. In this paper, we shall investigate the synchronization issue based on the use of queueing theory. We shall first propose a queueing model, referred to as the classic model, to investigate the characteristics of the encoding process. It will be proved that given the packet arrival processes are stationary, i.e. the distribution of the arrival processes does not depend on time, and obey independently and identically Poisson distribution and that the encoding time is exponentially distributed, the output flow will be an asymptotically Poisson flow with the same parameter. Through simulation we shall show that the network is sensitive to the arrival rate of input flows and becomes unstable with the input queue size increasing to infinity. This indicates that the classic coding scheme would impose strict requirements on synchronization over the whole network. In order to address this, we shall propose a combined opportunistic scheduling and encoding (COSE) strategy, in which the classic coding scheme and the traditional forwarding algorithm are well integrated. Theoretical analysis and simulation will demonstrate that the COSE strategy is able to control the input queue sizes and keep the network operating in a stable state while maintaining a relatively high throughput, low blocking probability and small waiting delay under various levels of traffic load.

KW - COSE strategy

KW - Multicast networks

KW - Network coding

KW - Queueing model

KW - Throughput

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

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

U2 - 10.1002/dac.998

DO - 10.1002/dac.998

M3 - Article

VL - 22

SP - 755

EP - 772

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

IS - 6

ER -