We model peer-to-peer live streaming as a multistage congestion game where certain strategy restrictions allow, at equilibrium, to minimize both streaming duration and congestion. We also propose a distributed algorithm (ConGaS) that can be easily executed at peers, enabling them to coordinate toward streaming optimization. Finally, ConGaS is compared against two other dissemination policies through experimental evaluation, and simulations confirm the viability and efficacy of the former.
Multistage Congestion Games for Live-Streaming / G. Rossi; G. D'Angelo; S. Ferretti. - STAMPA. - (2010), pp. 830-833. (Intervento presentato al convegno 15th IEEE Symposium on Computers and Communications (ISCC 2010) tenutosi a Riccione (Italy) nel June 2010) [10.1109/ISCC.2010.5546779].
Multistage Congestion Games for Live-Streaming
D'ANGELO, GABRIELE;FERRETTI, STEFANO
2010
Abstract
We model peer-to-peer live streaming as a multistage congestion game where certain strategy restrictions allow, at equilibrium, to minimize both streaming duration and congestion. We also propose a distributed algorithm (ConGaS) that can be easily executed at peers, enabling them to coordinate toward streaming optimization. Finally, ConGaS is compared against two other dissemination policies through experimental evaluation, and simulations confirm the viability and efficacy of the former.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
