To code or not to code: rate optimality in node-capacitated networks

Authors:
Ziyu Shao;Sidharth Jaggi;Shuo-Yen Robert Li
Affiliations:
Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 4
Cited 0

Utility maximization in peer-to-peer systems

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Node-capacitated networks are networks in which the capacity constraint is put on every node. They have recently attract attention as a good model for Peer-to-Peer (P2P) overlay networks. Existing work gives results on networks with constraints of node upload capacities. In this paper, we consider networks with constraints on both node upload and node download capacity. For such networks, we investigate the rate optimality of routing versus network coding. In general, network coding achieves a larger rate region than routing. However, for some important communication scenarios, routing achieves the same rate region as network coding.