MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Networking from a network coding perspective

Author(s)
Ho, Tracey, 1976-
Thumbnail
DownloadFull printable version (6.306Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Muriel Médard.
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. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Network coding generalizes network operation beyond traditional routing, or store-and-forward, approaches, allowing for mathematical operations across data streams within a network. This thesis considers a number of theoretical and practical networking issues from network coding perspectives. We describe a new distributed randomized coding approach to multi-source multicast network scenarios, in which one or more, possibly correlated, sources transmit common information to one or more receivers. This approach substantially widens the scope of applicability of network coding to three new areas. Firstly, we show that it achieves robust network operation in a decentralized fashion, approaching optimal capacity with error probability decreasing exponentially in the length of the codes. Secondly, in the area of network security, we show how to extend this approach to obtain a low-overhead scheme for detecting the presence of faulty or malicious nodes exhibiting Byzantine (arbitrary) behavior. Thirdly, we show that this approach compresses information where necessary in a network, giving error bounds in terms of network parameters. Another area of our work develops an information theoretic framework for network management for recovery from non-ergodic link failures, based on the very general network coding concept of network behavior as a code. This provides a way to quantify essential management information as that needed to switch among di®erent codes (behaviors) for di®erent failure scenarios. We compare two di®erent recovery approaches, and give bounds, many of which are tight, on management requirements for various network connection problems in terms of network parameters.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
 
Includes bibliographical references (p. 143-149).
 
Date issued
2004
URI
http://hdl.handle.net/1721.1/87910
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Doctoral Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.