Secure network coding with a cost criterion
Name
85479924-MIT.pdf
Description
Full printable version
Size
2.56 MB
Format
Adobe PDF
Checksum (MD5)
7842be1314a28e39b85a348e2a9d1cba
Author(s)
Tan, Jianlong, M. Eng. Massachusetts Institute of Technology
Advisor(s)
Muriel Médard.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
Network coding is a viable alterative to traditional routing methods that are being used in current data networks as it offers many advantages, including higher throughput rates and lower network costs. Although research has been conducted with regards to the cost and security issues of network coding, a joint investigation of these two parameters has not been done yet, thus providing the motivation for this thesis. For this thesis, we consider the situation where a set of messages is to be multicasted across the network, of which a known subset is of interest to a wiretapping adversary. The problem that we attempt to solve is to find a network coding scheme that has both a low network cost and a low probability of the wiretapper being able to retrieve all the messages of interest. We make use of random linear codes in anticipation for decentralized implementation of the scheme, and focus on the problem of finding the multicast subgraph. As an exact algorithmic solution is difficult, we propose two heuristic solutions, and compare their performances to traditional routing through a simulation study on Rocketfuel networks. Our results suggest that network coding can be more effective than routing for this low cost and secure data multicast problem, especially when the links are not easily tapped.
Description
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
Includes bibliographical references (p. 67-68).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
