Matrix games in the multicast networks: maximum information flows with network switching
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network coding theory: single sources
Communications and Information Theory
Multiple-Description Coding for Overlay Network Streaming
IEEE MultiMedia
ACM Transactions on Sensor Networks (TOSN)
Offering data confidentiality for multimedia overlay multicast: Design and analysis
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A unified framework for multipath routing for unicast and multicast traffic
IEEE/ACM Transactions on Networking (TON)
Improving performance of multicast routing in ad hoc wireless networks
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Explicit routing in multicast overlay networks
Computer Communications
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient dynamic-identity based signature scheme for secure network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new deterministic linear network coding and its application on multicast network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Efficient multipath in wireless networks using network coding over braided meshes
International Journal of Sensor Networks
K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Census: location-aware membership management for large-scale distributed systems
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Flowcode: multi-site data exchange over wireless ad-hoc networks using network coding
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
An efficient P2P content distribution system based on altruistic demand and recoding dissemination
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on model-based diagnostics
Enabling P2P gaming with network coding
EUNICE'10 Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management
Low delay multiflow block interleavers for real-time audio streaming
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Multicast routing algorithm based on network coding
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
Hi-index | 0.07 |
All of the advantages of application-layer overlay networks arise from two fundamental properties: 1) the network nodes in an overlay network, as opposed to lower-layer network elements such as routers and switches, are end systems and have capabilities far beyond basic operations of storing and forwarding; 2) the overlay topology, residing above a densely connected Internet protocol-layer wide-area network, can be constructed and manipulated to suit one's purposes. We seek to improve end-to-end throughput significantly in application-layer multicast by taking full advantage of these unique characteristics. This objective is achieved with two novel insights. First, we depart from the conventional view that overlay nodes can only replicate and forward data. Rather, as end systems, these overlay nodes also have the full capability of encoding and decoding data at the message level using efficient linear codes. Second, we depart from traditional wisdom that the multicast topology from source to receivers needs to be a tree, and propose a novel and distributed algorithm to construct a two-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied. We design our algorithm such that the costs of link stress and stretch are explicitly considered as constraints and minimized. We extensively evaluate our algorithm by provable analytical and experimental results, which show that the introduction of two-redundant multicast graph and network coding may indeed bring significant benefits, essentially doubling the end-to-end throughput in most cases.