Construction of network codes
Living in a world where communication is practically indispensable, we are interested in how network coding achieves bandwidth optimality between communication networks. In this report, we will study the Max-flow Min cut theorem which states that the maximum flow is tantamount to the bottleneck of t...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/17625 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Living in a world where communication is practically indispensable, we are interested in how network coding achieves bandwidth optimality between communication networks. In this report, we will study the Max-flow Min cut theorem which states that the maximum flow is tantamount to the bottleneck of the network. Besides, we will introduce the basic concept of network coding and technical terms that is used throughout the project and report. Examples of these terms are the local encoding kernels and the global encoding kernels. The advantage of network coding over routing will also be mentioned in this report. Next, we will proceed with the discussion of network codes.
Among all the possible network codes, we have placed our emphasis on the Jaggi-Sander Algorithm which constructs a linear multicast deterministically in polynomial time. An explicit explanation of the algorithm will be also presented. After which, we will go through the flow chart that will be used to construct the Jaggi Sanders Algorithm. In addition to that, we will briefly introduce the MATLAB software that is used in the construction of the network code. Last but not least, we will also present our failure milestone encountered in the course of the project and the possible further works. |
|---|