RUcore: Rutgers University Community Repository
Content networking with packet-level coding
Descriptive
TitleInfo
Title
Content networking with packet-level coding
Name
(type = personal)
NamePart
(type = family)
Li
NamePart
(type = given)
Yao
NamePart
(type = date)
1984-
DisplayForm
Yao Li
Role
RoleTerm
(authority = RULIB)
author
Name
(type = personal)
NamePart
(type = family)
Spasojevic
NamePart
(type = given)
Predrag
DisplayForm
Predrag Spasojevic
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
chair
Name
(type = personal)
NamePart
(type = family)
Raychaudhuri
NamePart
(type = given)
Dipankar
DisplayForm
Dipankar Raychaudhuri
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
internal member
Name
(type = personal)
NamePart
(type = family)
Yates
NamePart
(type = given)
Roy D.
DisplayForm
Roy D. Yates
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
internal member
Name
(type = personal)
NamePart
(type = family)
Soljanin
NamePart
(type = given)
Emina
DisplayForm
Emina Soljanin
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
outside member
Name
(type = corporate)
NamePart
Rutgers University
Role
RoleTerm
(authority = RULIB)
degree grantor
Name
(type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm
(authority = RULIB)
school
TypeOfResource
Text
Genre
(authority = marcgt)
theses
OriginInfo
DateCreated
(qualifier = exact)
2012
DateOther
(qualifier = exact);
(type = degree)
2012-10
Place
PlaceTerm
(type = code)
xx
Language
LanguageTerm
(authority = ISO639-2b);
(type = code)
eng
Abstract
(type = abstract)
This dissertation focuses on linear packet combining (coding) strategies for bulk content data distribution in packet-switching networks and their effects on transmission cost. The employment of packet level codes aims to reduce the communication overhead needed to exchange real-time network states to restore packet losses, or to plan for efficient sharing of communication links. The aim is achievable due to the additional diversity introduced by coding, which increases the possibility of extracting innovative information by receivers. Nevertheless, increased computational complexity is entailed and may lower the throughput of network node processors and hence the communication throughput. This dissertation, in particular, studies coding strategies generating linear combinations of packets that are decodable with reduced complexity. Major efforts to reduce computational complexity include limiting the number of packets combined in each coded packet and working with simple operations such as xoring. Two representative classes of codes are LT codes and coding with generations (hyperblocks). LT codes are the first class of fountain codes, especially suitable for multicast applications. Coding with generations is also of interest due to other practical reasons, such as source clustering. We study these codes in two settings: (1) Content delivery to heterogeneous users experiencing varied channel conditions and having diverse demand volumes; (2) One or more users collecting packets from a ``cloud'' of source nodes storing the content. Throughput performance is characterized analytically and optimized or improved by parameter selection and code design. In particular, with scenario (2), a probability analysis is conducted using balls-into-bins models. We show that (1) the achievable throughput and energy performance with coding and without receiver feedback can beat that achievable with receiver feedback but without coding; (2) fast encoding and decoding is essential to increasing the throughput limits; (3) employing coding such as LT codes with optimized degree distribution can increase the efficiency of a simultaneous service to heterogeneous users; (4) coding with generations compensates for the lack of coordination between sources or between collectors; and (5) the proposed random annex codes based on coding with generations effectively reduces transmission redundancy by introducing overlaps between generations.
Subject
(authority = RUETD)
Topic
Electrical and Computer Engineering
RelatedItem
(type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier
(type = RULIB)
ETD
Identifier
ETD_4264
PhysicalDescription
Form
(authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
xiii, 106 p. : ill.
Note
(type = degree)
Ph.D.
Note
(type = bibliography)
Includes bibliographical references
Note
(type = vita)
Includes vita
Note
(type = statement of responsibility)
by Yao Li
Subject
(authority = ETD-LCSH)
Topic
Computer networks--Management
Subject
(authority = ETD-LCSH)
Topic
Packet switching (Data transmission)
Identifier
(type = hdl)
http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000066891
RelatedItem
(type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier
(type = local)
rucore19991600001
Location
PhysicalLocation
(authority = marcorg);
(displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier
(type = doi)
doi:10.7282/T33F4ND8
Genre
(authority = ExL-Esploro)
ETD doctoral
Back to the top
Rights
RightsDeclaration
(ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder
(type = personal)
Name
FamilyName
Li
GivenName
Yao
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime
(encoding = w3cdtf);
(qualifier = exact);
(point = start)
2012-09-26 15:48:16
AssociatedEntity
Name
Yao Li
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
RightsEvent
DateTime
(encoding = w3cdtf);
(qualifier = exact);
(point = start)
2012-10-31
DateTime
(encoding = w3cdtf);
(qualifier = exact);
(point = end)
2013-05-02
Type
Embargo
Detail
Access to this PDF has been restricted at the author's request. It will be publicly available after May 2nd, 2013.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top
Technical
FileSize
(UNIT = bytes)
910336
OperatingSystem
(VERSION = 5.1)
windows xp
ContentModel
ETD
MimeType
(TYPE = file)
application/pdf
MimeType
(TYPE = container)
application/x-tar
FileSize
(UNIT = bytes)
911360
Checksum
(METHOD = SHA1)
2eb0df2e7409fb7065f46926226e98e33aa327e6
Back to the top
Statistical Profile