Multicast Queueing Delay: Performance Limits and Order-Optimality of Random Linear Coding
Autor: | Brooke Shrader, R Cogill |
---|---|
Rok vydání: | 2011 |
Předmět: |
D/M/1 queue
Queueing theory Queue management system Computer Networks and Communications business.industry M/G/k queue Computer science Network packet ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS M/D/1 queue M/D/c queue Throughput Data_CODINGANDINFORMATIONTHEORY Computer Science::Performance Multilevel queue Computer Science::Networking and Internet Architecture M/G/1 queue M/M/c queue Electrical and Electronic Engineering business Priority queue Queue Bulk queue Computer Science::Information Theory Computer network |
Zdroj: | IEEE Journal on Selected Areas in Communications. 29:1075-1083 |
ISSN: | 0733-8716 |
DOI: | 10.1109/jsac.2011.110517 |
Popis: | In this work we analyze the average queue backlog for transmission of a single multicast flow consisting of M destination nodes in a wireless network. In the model we consider, the channel between every pair of nodes is an independent identically distributed packet erasure channel. We first develop a lower bound on the average queue backlog achievable by any transmission strategy; for a single-hop multicast transmission, our bound indicates that the queue size must scale as at least Ω(ln(M)). Next, we generalize this result to a multihop network and obtain a lower bound on the queue backlog as it relates to the minimum-cut capacity of the network. We then analyze the queue backlog for a strategy in which random linear coding is performed over groups of packets in the queue at the source node of a single-hop multicast. We develop an upper bound on the average queue backlog for the packet-coding strategy to show that the queue size for this strategy scales as O(ln(M)). Our results demonstrate that in terms of the queue backlog for single-hop multicast, the packet coding strategy is order-optimal with respect to the number of receivers. |
Databáze: | OpenAIRE |
Externí odkaz: |