research-article

Bandwidth Allocation for Video Streaming over Peer-to-Peer Networks with Nash Bargaining

Authors:

Liping Liu,

Junni Zou,

Hongkai XiongAuthors Info & Claims

ICIMCS '14: Proceedings of International Conference on Internet Multimedia Computing and Service

Pages 363 - 367

https://doi.org/10.1145/2632856.2632904

Published: 10 July 2014 Publication History

Get Access

Abstract

Peer-to-Peer (P2P) communications are getting increasingly popular for video streaming over the Internet. This paper presents a Nash bargaining based game theoretic framework to address issues of network efficiency, fairness, utility maximization and incentives in bandwidth allocation of P2P streaming systems. We formulate the upload bandwidth allocation problem as cooperative bargaining games that reflects the cooperative strategies of the peers. By using the method of Nash bargaining solution in the games, two objectives, efficiency and fairness, can be implemented through the Pareto optimal bandwidth allocation. Considering the selfishness of peers, we introduce pricing and budget as incentive mechanism. It encourages the peer to share the resource as much as possible to obtain the sufficient budget so as to maximize the utility in bandwidth allocation. Then, a distributed algorithm based on dual-decomposition is proposed. Finally, we verify the performance of the proposed algorithm by numerical results.

References

[1]

Q. Cao, H. Zhao, and Y. Jing. Power allocation and pricing in multiuser relay networks using stackelberg and bargaininggamens. IEEE Trans. Vechicular Techonology, 61(7):3177--3190, September 2012.

Crossref

Google Scholar

[2]

J. Chen and A. L. Swindlehurst. Applying bargaining solutions to resource allocation in multiuser mimo-ofdma broadcast systems. IEEE Journal. Selected Topics in Signal Processing, 6(2):127--139, April 2012.

Crossref

Google Scholar

[3]

X. Chu, K. Zhao, Z. Li, and A. Mahanti. Auction-based on-demand p2p min-cost media streaming with network coding. IEEE Trans. Parallel and Distributed Systems, 20(12):1816--1829, December 2009.

Digital Library

Google Scholar

[4]

D. Guo and Y. K. Kwok. A new auction based approach to efficient p2p live streaming. International Conference on Parallel and Distributed Systems, 2011.

Digital Library

Google Scholar

[5]

Z. Han, Z. Ji, and K. R. Liu. Fair multiuser channel allocation for ofdma networks using nash bargaining solutions and coalitions. IEEE Trans. Communications, 53(8):1366--1376, August 2005.

Crossref

Google Scholar

[6]

R. Jain, D.-M. Chiu, and W. R. Hawe. A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer System. Eastern Research Laboratory, Digital Equipment Corporation, 1984.

Google Scholar

[7]

D. Qiu and R. Srikant. Modeling and performance analysis of bittorrent-like peer-to-peer networks. Distributed Information Systems, 34(4):367--378, October 2004.

Digital Library

Google Scholar

[8]

K. Stuhlmuller, N. Farber, M. Link, and B. Girod. Analysis of video transmission over lossy channels. IEEE Journal of Selected Areas in Communications, 18(6):1012--1032, August 2000.

Digital Library

Google Scholar

[9]

J. E. Suris, L. A. DaSilva, Z. Han, A. B. MacKenzie, and R. S. Komali. Asymptotic optimality for distributed spectrum sharing using bargaining solutions. IEEE Trans. Wireless Communications, 8(10):5225--5237, October 2009.

Digital Library

Google Scholar

[10]

C. Wu, Z. Li, X. Qiu, and F. Lau. Auction-based p2p vod streaming: Incentives and optimal scheduling. ACM Trans. Multimedia Computing, Communications, and Applications, 8(14), February 2012.

Digital Library

Google Scholar

[11]

L. Zhong, M. Kihl, and X. Wang. Topological model and analysis of the p2p bittorrent protocol. International Journal of System Control and Information Processing, 1(1):54--70, January 2012.

Crossref

Google Scholar

[12]

J. Zou and L. Chen. Joint bandwidth allocation, data scheduling and incentives for scalable video streaming over peer-to-peer networks. Multimedia Tools and Applications, pages 1--21, 2013.

Google Scholar

Cited By

View all

Ayub NRakocevic V(2019)Cooperative Smartphone Relay Selection Based on Fair Power Utilization for Network Coverage ExtensionInformation10.3390/info1012038110:12(381)Online publication date: 3-Dec-2019
https://doi.org/10.3390/info10120381
(2018)Game theory approach to peer-to-peer video streamingInternational Journal of Autonomous and Adaptive Communications Systems10.5555/3292675.329267811:4(333-364)Online publication date: 21-Dec-2018
https://dl.acm.org/doi/10.5555/3292675.3292678
Ayub NRakocevic V(2017)Fair battery power consumption algorithms for relay nodes in rural wireless networks2017 International Conference on Wireless Networks and Mobile Communications (WINCOM)10.1109/WINCOM.2017.8238176(1-6)Online publication date: Nov-2017
https://doi.org/10.1109/WINCOM.2017.8238176

Index Terms

Bandwidth Allocation for Video Streaming over Peer-to-Peer Networks with Nash Bargaining
1. Information systems
  1. Information systems applications

Recommendations

Nash equilibria in bandwidth allocation for non-cooperative peer-to-peer networks

In peer-to-peer networks, peers act as clients and servers, i.e., they can download files from others and allow others to download from them, at the same time. Since the bandwidth of a peer acting as server is shared among all its clients, the download ...
Joint bandwidth allocation, data scheduling and incentives for scalable video streaming over peer-to-peer networks

The overall performance of a peer-to-peer (P2P) scalable streaming system largely depends on the strategies employed in bandwidth allocation, data scheduling and incentives. In this paper, we develop a credit-based content-aware bandwidth auction model ...
An efficient Nash-implementation mechanism for network resource allocation

We propose a mechanism for auctioning bundles of multiple divisible goods in a network where buyers want the same amount of bandwidth on each link in their route. Buyers can specify multiple routes (corresponding to a source-destination pair). The total ...

Comments

Information & Contributors

Information

Published In

ICIMCS '14: Proceedings of International Conference on Internet Multimedia Computing and Service

July 2014

430 pages

ISBN:9781450328104

DOI:10.1145/2632856

General Chairs:
Hanzi Wang
Xiamen University, China
,
Larry Davis
University of Maryland, USA
,
Program Chairs:
Wenwu Zhu
Tsinghua University, China
,
Stephan Kopf
University of Mannheim, Germany
,
Yanyun Qu
Xiamen University, China
,
Publications Chairs:
Jun Yu
Xiamen University, China
,
Jitao Sang
Institute of Automation, CAS, China
,
Tao Mei
Microsoft Research Asia, China

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

NSF of China: National Natural Science Foundation of China
Beijing ACM SIGMM Chapter

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 July 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICIMCS '14

ICIMCS '14: International Conference on Internet Multimedia Computing and Service

July 10 - 12, 2014

Xiamen, China

Acceptance Rates

Overall Acceptance Rate 163 of 456 submissions, 36%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
100
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ayub NRakocevic V(2019)Cooperative Smartphone Relay Selection Based on Fair Power Utilization for Network Coverage ExtensionInformation10.3390/info1012038110:12(381)Online publication date: 3-Dec-2019
https://doi.org/10.3390/info10120381
(2018)Game theory approach to peer-to-peer video streamingInternational Journal of Autonomous and Adaptive Communications Systems10.5555/3292675.329267811:4(333-364)Online publication date: 21-Dec-2018
https://dl.acm.org/doi/10.5555/3292675.3292678
Ayub NRakocevic V(2017)Fair battery power consumption algorithms for relay nodes in rural wireless networks2017 International Conference on Wireless Networks and Mobile Communications (WINCOM)10.1109/WINCOM.2017.8238176(1-6)Online publication date: Nov-2017
https://doi.org/10.1109/WINCOM.2017.8238176

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Nash equilibria in bandwidth allocation for non-cooperative peer-to-peer networks

Joint bandwidth allocation, data scheduling and incentives for scalable video streaming over peer-to-peer networks

An efficient Nash-implementation mechanism for network resource allocation