| Description |
1 online resource (190 pages) |
| Contents |
Cover; Network-aware Source Coding and Communication; Title; Copyright; Contents; 1: Introduction; 1.1 Network representation of source coding problems; 1.2 Source coding and communication in networks with more complextopologies; 1.3 Separability of source coding and on-route processing; 1.3.1 Lossless communication of a single source; 1.3.2 Single source communication to sinks with equal max-flow; 1.4 More general scenarios; 1.4.1 Distributed source coding in arbitrary networks; 1.4.2 Lossy communication of a single source in arbitrary networks; 1.5 Applications and motivations |
|
1.6 Network-aware source coding and communication: a formal definition1.7 Organization of this book; Part I: The lossless scenario; 2: Lossless multicast with a single source; 2.1 Network coding, the multicast scenario; 2.2 Information multicast with routing only; The case of integral routing: delay constraints; The case of fractional routing: relaxing the delay constraint; 3: Lossless multicast of multiple uncorrelated sources; 3.1 Multi-unicast problem; 3.2 Multi-unicast with routing and network coding on directed acyclic graphs; 3.2.1 Coding gain in directed networks can be high |
|
3.2.2 Cuts in undirected graphs3.2.2.1 Cuts in directed graphs; 3.2.3 Coding gain in undirected networks: Li and Li's conjecture; 3.3 Concluding remarks; 4: Lossless multicast of multiple correlated sources; 4.1 Slepian-Wolf problem in simple networks; 4.1.1 Main theorem and its proof; 4.1.2 Slepian-Wolf coding for many sources; 4.1.3 Slepian-Wolf code design; 4.1.3.1 Source splitting; 4.1.3.2 Slepian-Wolf coding by using channel codes; 4.2 Slepian-Wolf problem in general networks; 4.3 Concluding remarks; Part II: The lossy scenario |
|
5.6.4 The effect of the performance of path optimization algorithms5.7 Concluding remarks; 6: Solving the rainbow network flow problem; 6.1 Complexity results of the CRNF problem; 6.2 A binary integer program for CRNF on directed acyclic graphs; 6.2.1 Formulation; 6.2.2 The DAG requirement; 6.3 Solving CRNF on tree-decomposable graphs; 6.3.1 Calculation of the optimal flows; 6.3.2 Flow coloring; 6.4 Optimal CRNF for single sink; 6.5 Concluding remarks; 7: Continuous rainbow network flow: rainbow network flow with unbounded delay; 7.1 Continuous rainbow network flow; 7.2 Achievability results |
|
5: Lossy source communication: an approach based on multiple-description codes5.1 Separating source coding from network multicast; 5.2 Beyond common information multicast: rainbow network flow; 5.3 Multiple-description coding: a tool for NASCC; 5.3.1 Example 5.1; 5.3.2 Example 5.2; 5.3.3 Design issues; 5.4 Rainbow network flow problem; 5.5 Code design; 5.5.1 MDC using PET; 5.5.2 Optimizing code for a fixed rainbow flow; 5.5.3 Discrete optimization approaches; 5.6 Numerical simulations; 5.6.1 Network simulation setup; 5.6.2 Effect of the number of descriptions; 5.6.3 The effect of network size |
| Summary |
An introduction to the theory and techniques for achieving high quality network communication with the best possible bandwidth economy |
| Notes |
7.3 Concluding remarks |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Computer programming.
|
|
Telecommunication -- Data processing.
|
|
Telecommunication -- Traffic.
|
| Form |
Electronic book
|
| Author |
Dumitrescu, Sorina
|
|
Wang, Jia.
|
|
Wu, Xiaolin.
|
| ISBN |
1139034359 (electronic bk.) |
|
1139220624 |
|
1139224050 (electronic bk.) |
|
9781139034357 (electronic bk.) |
|
9781139220620 |
|
9781139224055 (electronic bk.) |
|
