End-to-end link power control in optical networks using Nash bargaining solution
Authors: 
Quanyan Zhu, Lacra PavelAuthors Info & Claims
Article No.: 10, Pages 1 - 9
Abstract
An efficient and intelligent resource allocation mechanism is the heart of any communication networks. Based on previous work on non-cooperative game approach and direct centralized optimization, this paper addresses the issue of efficiency and fairness in optical network power control. We use Nash bargaining solution (NBS) to achieve a fair and efficient solution for optical network power control at the end-to-end optical link level. We study different formulations based on Nash bargaining model and characterize their solutions.
References
[1]
G. Agrawal. Lightwave Technology. Wiley-Interscience, 2005.
[2]
G. Alyfantis, S. Hadjiefthymiades, and L. Merakos. A cooperative uplink power control scheme for elastic data services in wireless cdma systems. ACM SIGCOMM Computer Communication Review, 36(3):5 -- 14, July 2006.
[3]
A. Berman and R. Plemmons. Nonnegative Matrices in Mathematical Sciences. SIAM, 1994.
[4]
D. Bertsekas. Nonlinear Programming. Athena Scientific, 2003.
[5]
J. Correa, A. Schulz, and N. Stier-Moses. On the inefficiency of equilibria in congestion games. IPCO 2005, pages 167--181, 2005.
[6]
C. Touati, E. Altman, and J. Galtier. Generalized nash bargaining solution for bandwidth allocation. Comput. Networks, 50(17):3242--3263, 2006.
[7]
P. Dubey. Inefficiency of nash equilibria. Mathematics of Operations Research, 11(1), February 1986.
[8]
A. Fattahi and F. Paganini. New economic perspectives for resource allocation in wireless networks. Proceedings of 2005 American Control Conference, pages 3960--3965, June 2005.
[9]
A. Feiten and R. Mathar. Optimal power control for multi-user cdma. Proceedings of International Symposium on Information Theory, pages 1903 -- 1907, September 2005.
[10]
Z. Han, Z. Ji, and K. Liu. Fair multiuser channel allocation for ofdma networks using nash bargaining solutions and coalitions. IEEE Transactions on Communications, 53(8):1366--1376, August 2000.
[11]
R. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, 1990.
[12]
R. Johari and J. Tsitsiklis. Network resource allocation and a congestion game: The single link case. Proceedings of the 42nd IEEE Conference on Decision and Control (CDC), pages 2112--2117, December 2004.
[13]
E. Kalai. Proportional solutions to bargaining situations: Interpersonal utility comparison. Econometrica, 45(7), October 1977.
[14]
F. Kelly. Charging and rate control for elastic traffic. Eur. Trans. Telecom, 8:33--37, 1998.
[15]
F. Kelly, A. Maulloo, and D. Tan. Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 1998.
[16]
S. Kuntze, L. Pavel, and J. Aitchison. Controlling a semiconductor optical amplifier using a state-space model. IEEE Journal of Quantum Electronics, 43(2):123--129, Feb 2007.
[17]
S. Low and D. Lapsley. Optimization flow control, i: Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6):861--874, 1999.
[18]
L. Massoulie and J. Roberts. Bandwidth sharing: objectives and algoriths. IEEE Proceedings of INFOCOM, 3:1395--1403, 1999.
[19]
J. Mo and J. Walrand. Fair end-to-end window-based congestion control. SPIE International Symposium on Voice, Video and Data Communications, 1998.
[20]
M. Osborne. Introduction to Game Theory. MIT Press, 1995.
[21]
M. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994.
[22]
L. Pavel. Dynamics and stability in optical communication networks: A system theoretic framework. Automatica, 40(8):1361--1370, August 2004.
[23]
L. Pavel. A noncooperative game approach to osnr optimization in optical networks. IEEE Transactions on Automatic Control, 51(5):848--852, May 2006.
[24]
L. Pavel. Osnr optimization in optical networks: Modeling and distributed algorithms via a central cost approach. IEEE Journal on Selected Areas in Communications, 24(4):54--65, April 2006.
[25]
T. Roughgarden. Designing networks for selfish users is hard. Proceedings of the 42nd IEEE Symposium of Computer Science, 2002.
[26]
T. Roughgarden and E. Tardos. Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior, 47:389--403, 2004.
[27]
W. Rudin. Principal of Mathematical Analysis. McGraw-Hill, 1976.
[28]
C. Saraydar and D. Goodman. Pricing and power control in a multicell wireless data network. IEEE Journal of Selected Areas of Communications, 19(10).
[29]
C. Saraydar, N. Mandayam, and D. Goodman. Efficient power control via pricing in wireless data networks. IEEE Transactions on Communications, 50(2).
[30]
R. Srikant, E. Altman, T. Alpcan, and T. Basar. Cdma uplink power control as noncooperative game. Wireless Networks, 8:659--690, 2002.
[31]
N. Stefanovic and L. Pavel. Application of robust 12 control to erbium-doped fiber amplifier: input and state uncertainty. Proc. IEEE Conference on Control Applications, pages 686--692.
[32]
H. Yaiche, R. Mazumdar, and C. Rosenberg. A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transaction on Networking, 8(5):667--678, 2000.
[33]
A. Yassine, O. Kabranov, and D. Makrakis. Competitive game theoretic optimal routing in optical networks. Proc. SPIE on Optical Networking II, 4910(11):27--36, September 2002.
Index Terms
- End-to-end link power control in optical networks using Nash bargaining solution
Index terms have been assigned to the content through auto-classification.
Recommendations
Nash Bargaining Based Ad Networks for Sponsored Search Auctions
CEC '09: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise ComputingIn this paper, we consider an emerging scenario in sponsored web search auctions where ad networks would be involved as intermediaries between a search engine and its advertisers. In this context, we address the problem of the ad network identifying a ...
Bandwidth Allocation for Video Streaming over Peer-to-Peer Networks with Nash Bargaining
ICIMCS '14: Proceedings of International Conference on Internet Multimedia Computing and ServicePeer-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 ...
A Nash bargaining solution for cooperative network formation games
NETWORKING'11: Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part IThe Network Formation problem has received increasing attention in recent years. Previous works have addressed this problem considering almost exclusively networks designed by selfish users, which can be consistently suboptimal.
This paper addresses the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 22 October 2007
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Valuetools07
Sponsor:
Valuetools07: Second International Conference on Performance Evaluation Methodologies and Tools & Workshops
October 22 - 27, 2007
Nantes, France
Acceptance Rates
ValueTools '07 Paper Acceptance Rate 45 of 83 submissions, 54%;
Overall Acceptance Rate 90 of 196 submissions, 46%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 190Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in