Browsing by Subject "Capacity regions"

Now showing 1 - 2 of 2

Open Access
Capacity region of multi-resolution streaming in peer-to-peer networks
(IEEE, 2013) Karagöz, B.; Yavuz, Semih; Ho, T.; Effros, M.
We 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.
Open Access
On erasure correction coding for streaming
(IEEE, 2012) Tekin, Ömer Faruk; Ho, T.; Yao, H.; Jaggi, S.
We consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In our previous work [1], we gave a capacity-achieving code construction for the case of a fixed number of erasures. In this work, we consider a sliding window erasure pattern where the number of erasures within windows of size above some threshold is upper bounded by a fraction of the window size, modeling a constraint on burstiness of the channel. We lower bound the rates achievable by our previous code construction as a fraction of the capacity region, which approaches to one as the window size threshold and the initial playout delay increase simultaneously.