Strategies of Conflict in Coexisting Streaming Overlays Export

@inproceedings{multi_overlay_game_strategy_resource_alloc, abstract = {In multimedia applications such as IPTV, it is natural to accommodate multiple coexisting peer-to-peer streaming overlays, corresponding to channels of programming. With coexisting streaming overlays, one wonders how these overlays may efficiently share the available upload bandwidth on peers. In order to satisfy the required streaming rate in each overlay, as well as to minimize streaming costs. In this paper, we seek to design simple, effective and decentralized strategies to resolve conflicts among coexisting streaming overlays. Since such strategies of conflict are game theoretic in nature, we characterize them as a decentralized collection of dynamic auction games, in which downstream peers submit bids for bandwidth at the upstream peers. With extensive theoretical analysis and performance evaluation, we show that the outcome of these local games is an optimal topology for each overlay that minimizes streaming costs. These overlay topologies evolve and adapt to peer dynamics, fairly share peer upload bandwidth, and can be prioritized.}, author = {Wu, Chuan and Li, Baochun}, booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE}, citeulike-article-id = {5007704}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/INFCOM.2007.63}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4215645}, doi = {10.1109/INFCOM.2007.63}, journal = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE}, keywords = {game, p2p, resource-allocation, streaming}, pages = {481--489}, posted-at = {2009-06-29 08:01:54}, priority = {2}, title = {Strategies of Conflict in Coexisting Streaming Overlays}, url = {http://dx.doi.org/10.1109/INFCOM.2007.63}, year = {2007} }

TY - CONF ID - multi_overlay_game_strategy_resource_alloc L3 - citeulike-article-id:5007704 N2 - In multimedia applications such as IPTV, it is natural to accommodate multiple coexisting peer-to-peer streaming overlays, corresponding to channels of programming. With coexisting streaming overlays, one wonders how these overlays may efficiently share the available upload bandwidth on peers. In order to satisfy the required streaming rate in each overlay, as well as to minimize streaming costs. In this paper, we seek to design simple, effective and decentralized strategies to resolve conflicts among coexisting streaming overlays. Since such strategies of conflict are game theoretic in nature, we characterize them as a decentralized collection of dynamic auction games, in which downstream peers submit bids for bandwidth at the upstream peers. With extensive theoretical analysis and performance evaluation, we show that the outcome of these local games is an optimal topology for each overlay that minimizes streaming costs. These overlay topologies evolve and adapt to peer dynamics, fairly share peer upload bandwidth, and can be prioritized. JF - INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE EP - 489 TI - Strategies of Conflict in Coexisting Streaming Overlays T2 - INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE SP - 481 KW - game KW - p2p KW - resource-allocation KW - streaming AU - Wu, Chuan AU - Li, Baochun PY - 2007/// UR - http://dx.doi.org/10.1109/INFCOM.2007.63 ER -