Network Coding ApplicationsNetwork Coding Applications looks at how ideas from network coding can have an impact on a number of new applications. Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. Today, more and more researchers and engineers ask what network coding is, what its benefits are, and how much it costs to design and operate networks implementing network coding. Network Coding Applications deals with wireless and content distribution networks, considered to be the most likely applications of network coding, and it also reviews emerging applications of network coding such as network monitoring and management. Multiple unicasts, security, networks with unreliable links, and quantum networks are also addressed. In tandem with the previous companion text on the theoretical foundations of network coding, Network Coding Applications provides the reader with a comprehensive state-of-the-art of this fast evolving research area. |
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Saturs
Introduction | 1 |
Decentralized Network Operation | 7 |
Content Distribution | 17 |
Network Coding for Wireless Networks | 31 |
Multiple Unicast Sessions | 59 |
Networks with Errors | 75 |
Security | 93 |
Emerging Applications of Network Coding | 119 |
Acknowledgments | 133 |
Bieži izmantoti vārdi un frāzes
achievable rates affect algorithm assume base-stations benefits binary bits BitTorrent briefly broadcast Calvin capacity channel coding codeword coding scheme coding vectors collect complexity computational connected Consider constraints content distribution coupon collector problem decode defined denote density matrix destination deterministic different directed graph Dom(A edges effectively energy efficiency equal erasures example file find finite field first fixed flow forwarding Hamming weight information symbols innovative input intermediate nodes iterations linear combination matrix messages min-cut mobility multicast multicommodity flow problem multiple unicast neighbors network coding network coding offers network in Figure network topology number of nodes observed operations optimal output P2P networks packet x1 peers Physical layer probability probe packets protocols quantum information qubits random graph random variables randomized network coding relay routing scenario Section sensor networks sensor nodes slot specific subflows subspace sufficient theorem throughput time-slot transmission transmit undirected wireless networks
Populāri fragmenti
138. lappuse - J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage.
140. lappuse - Kubiatowicz: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22 (2004): 41-53 8.
135. lappuse - I. Clarke, O. Sandberg, B. Wiley, and TW Hong. Freenet: A distributed anonymous information storage and retrieval system.