Abstract
Network coding has been shown to be an effective coding technique to improve the throughput of a multicast session in a communication network. In general, an undirected network can be used to model a communication network in which nodes at both ends of a link can exchange messages. For a single multicast session in an undirected network with network coding, the maximum throughput can be estimated based on the minimum maxflow between the source node and the destination nodes. In this letter, we evaluate the impact of the network topology on the maximum multicast throughput of a network-coded communication network. In particular, the scalefree network, which represents the topology of most man-made networks including the Internet, will be compared with the random network. The maximum throughputs of the multicast sessions are evaluated for different choices of source and destination nodes. It is found that network coding can achieve better throughput of a scalefree network only if the source and destination nodes are chosen from high-degree nodes.
Original language | English |
---|---|
Pages (from-to) | 2741-2748 |
Number of pages | 8 |
Journal | International Journal of Bifurcation and Chaos |
Volume | 21 |
Issue number | 9 |
DOIs | |
Publication status | Published - 1 Jan 2011 |
Keywords
- Complex networks
- Complexity
- Network coding
- Scalefree network
- Throughput
ASJC Scopus subject areas
- Modelling and Simulation
- Applied Mathematics