Name
Abstract | ||
|---|---|---|
In this paper, we focus on content distribution applications with network coding in large networks where the network topology is unknown and no feedback is available. An unequal-size overlapping generation based network coding scheme is proposed. The sizes of generations are drawn from a degree distribution designed by and-or tree analysis. The overlapping of generations introduces redundancy and enables back substitution, which reduces the transmission overhead with little sacrifice of the computational complexity. Comparing with other overlapping based schemes (e.g. head-to-toe, random annex codes), our approach achieves a better overhead-complexity tradeoff. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/NETCOD.2012.6261902 | NetCod |
Keywords | Field | DocType |
network coding scheme,random annex code scheme,trees (mathematics),unequal-size overlapping generation,network topology,head-to-toe scheme,overhead-complexity tradeoff,computational complexity,transmission overhead,degree distribution,back substitution,and-or tree analysis,content distribution application,network coding,bismuth | Linear network coding,Large networks,Network topology,Theoretical computer science,Redundancy (engineering),Overlapping generations model,Degree distribution,Mathematics,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
978-1-4673-1890-7 | 4 | 0.48 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ye Li | 1 | 10 | 1.96 |
| W.-Y. Chan | 2 | 114 | 18.25 |
| Steven D. Blostein | 3 | 1461 | 211.53 |