Network Coding ApplicationsNow Publishers Inc, 2008. gada 8. janv. - 140 lappuses Network 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. |
No grāmatas satura
6.–10. rezultāts no 23.
18. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
20. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
21. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
22. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
26. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
Introduction | 1 |
Decentralized Network Operation | 7 |
Content Distribution | 17 |
Network Coding for Wireless Networks | 31 |
Bieži izmantoti vārdi un frāzes
achievable rates algorithm assume base-stations benefits binary bits BitTorrent broadcast Calvin capacity channel coding coded packet codeword coding scheme coding vectors collect complexity Computing connected Consider constraints content distribution coupon collector problem decode denote density matrix destination deterministic directed graph distinct coupons Dom(A edges equal erasure error correction example finite field forwarding Fountain codes Fragouli H(Sa Hamming weight IEEE Infocom information symbols Information Theory innovative input intermediate nodes iterations linear combination link failures matrix messages min-cut mobility multicast multicommodity flow problem multiple unicast neighbors network coding offers network in Figure network topology number of nodes observed operations optimal output P2P networks packet x1 peers perform probability probe packets protocols quantum information quantum networks qubits random graph random variables randomized network coding relay routing scenario Section sensor networks sensor nodes slot subflows subspace theorem throughput time-slot transmit undirected wireless networks