Show simple item record

dc.contributor.authorKaragöz, B.en_US
dc.contributor.authorYavuz, Semihen_US
dc.contributor.authorHo, T.en_US
dc.contributor.authorEffros, M.en_US
dc.coverage.spatialSevilla, Spainen_US
dc.date.accessioned2016-02-08T12:05:49Z
dc.date.available2016-02-08T12:05:49Z
dc.date.issued2013en_US
dc.identifier.urihttp://hdl.handle.net/11693/27937
dc.descriptionDate of Conference: 9-13 Sept. 2013en_US
dc.description.abstractWe consider multi-resolution streaming in fully-connected peer-to-peer networks, where transmission rates are constrained by arbitrarily specified upload capacities of the source and peers. We fully characterize the capacity region of rate vectors achievable with arbitrary coding, where an achievable rate vector describes a vector of throughputs of the different resolutions that can be supported by the network. We then prove that all rate vectors in the capacity region can be achieved using pure routing strategies. This shows that coding has no capacity advantage over routing in this scenario. © 2013 IEEE.en_US
dc.language.isoEnglishen_US
dc.source.title2013 IEEE Information Theory Workshop (ITW)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ITW.2013.6691317en_US
dc.subjectCapacity regionsen_US
dc.subjectDifferent resolutionsen_US
dc.subjectRouting strategiesen_US
dc.subjectTransmission ratesen_US
dc.subjectDistributed computer systemsen_US
dc.subjectInformation theoryen_US
dc.subjectPeer to peer networksen_US
dc.subjectVectorsen_US
dc.titleCapacity region of multi-resolution streaming in peer-to-peer networksen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Mathematicsen_US
dc.identifier.doi10.1109/ITW.2013.6691317en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record