Page 1 |
Save page Remove page | Previous | 1 of 163 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
NETWORK CODING CAPACITY AND PERFORMANCE
OPTIMIZATION
by
Xijin Yan
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Ful¯llment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(ELECTRICAL ENGINEERING)
August 2007
Copyright 2007 Xijin Yan
Object Description
| Title | Network coding capacity and performance optimization |
| Author | Yan, Xijin |
| Author email | xyan@usc.edu |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Electrical Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2007-05-04 |
| Date submitted | 2007 |
| Restricted until | Unrestricted |
| Date published | 2007-07-25 |
| Advisor (committee chair) | Zhang, Zhen |
| Advisor (committee member) |
Caire, Giuseppe Neely, Michael Ordóñez, Fernando |
| Abstract | Network coding has been shown to provide gains in terms of the achievable information rate region in modern communication networks. It generalizes the classical routing by allowing information mixing at each intermediate node to take better advantage of the redundant resources in the network.; In this research, we study the network coding capacity for general acyclic multi-source multi-sink networks with arbitrary transmission requirements. In particular, we develop a series of useful techniques that provide a systematic approach toward such general characterization. These techniques allow us to decompose an arbitrary acyclic multi-source network into a set of block-building units and build the general capacity characterization from ground up. Furthermore, these techniques have also been extended to determining the capacity region for a class of time-varying wireless networks with constrained coding. As an alternative approach, we also study an implicit characterization by using tools developed from the theory of entropy function. These tools allow us to look into the geometric properties of the rate region characterized by all the information inequalities that must be satisfied to meet the given transmission requirements.; Along with the capacity problems, a number of closely related performance optimization problems are also investigated to provide practical design guidelines. Equivalence between the physical layer capacity region and the network layer stability region has also been established to facilitate the design and analysis of algorithms that jointly achieve network stability and performance optimizations in a time-varying setting. |
| Keyword | network coding |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Type | texts |
| Legacy record ID | usctheses-m659 |
| Rights | Yan, Xijin |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-Yan-20070725 |
| Archival file | uscthesesreloadpub_Volume14/etd-Yan-20070725.pdf |
Description
| Title | Page 1 |
| Full text | NETWORK CODING CAPACITY AND PERFORMANCE OPTIMIZATION by Xijin Yan A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Ful¯llment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (ELECTRICAL ENGINEERING) August 2007 Copyright 2007 Xijin Yan |
Comments
Post a Comment for Page 1
