Video streaming over P2P networks: Challenges and opportunities

N Ramzan, H Park, E Izquierdo - Signal Processing: Image Communication, 2012 - Elsevier
A robust real-time video communication service over the Internet in a distributed manner is
an important challenge, as it influences not only the current Internet structure but also the …

[图书][B] Communication networks: An optimization, control and stochastic networks perspective

R Srikant, L Ying - 2014 - books.google.com
Provides a modern mathematical approach to the design of communication networks for
graduate students, blending control, optimization, and stochastic network theories. A broad …

Batched sparse codes

S Yang, RW Yeung - IEEE Transactions on Information Theory, 2014 - ieeexplore.ieee.org
Network coding can significantly improve the transmission rate of communication networks
with packet loss compared with routing. However, using network coding usually incurs high …

Epidemic live streaming: optimal performance trade-offs

T Bonald, L Massoulié, F Mathieu, D Perino… - Proceedings of the 2008 …, 2008 - dl.acm.org
Several peer-to-peer systems for live streaming have been recently deployed (eg
CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style …

Age of Information in Gossip Networks: A Friendly Introduction and Literature Survey

P Kaswan, P Mitra, A Srivastava, S Ulukus - arXiv preprint arXiv …, 2023 - arxiv.org
Gossiping is a communication mechanism, used for fast information dissemination in a
network, where each node of the network randomly shares its information with the …

Age of gossip in ring networks in the presence of jamming attacks

P Kaswan, S Ulukus - 2022 56th Asilomar Conference on …, 2022 - ieeexplore.ieee.org
We consider a system with a source which maintains the most current version of a file, and a
ring network of n user nodes that wish to acquire the latest version of the file. The source …

Susceptibility of age of gossip to timestomping

P Kaswan, S Ulukus - 2022 IEEE Information Theory Workshop …, 2022 - ieeexplore.ieee.org
We consider a fully connected network consisting of a source that maintains the current
version of a file, n nodes that use asynchronous gossip mechanisms to disseminate fresh …

Timely opportunistic gossiping in dense networks

P Mitra, S Ulukus - IEEE INFOCOM 2023-IEEE Conference on …, 2023 - ieeexplore.ieee.org
We consider gossiping in a fully-connected wireless network consisting of n nodes. The
network receives Poisson up-dates from a source, which generates new information. The …

Random network coding in peer-to-peer networks: From theory to practice

B Li, D Niu - Proceedings of the IEEE, 2011 - ieeexplore.ieee.org
With random network coding, network nodes between the source and receivers are able to
not only relay and replicate data packets, but also code them using randomly generated …

ASUMAN: Age sense updating multiple access in networks

P Mitra, S Ulukus - 2022 58th Annual Allerton Conference on …, 2022 - ieeexplore.ieee.org
We consider a fully-connected wireless gossip network which consists of a source and n
receiver nodes. The source updates itself with a Poisson process and also sends updates to …