Solving constrained OSNR Nash game in WDM optical networks with a fictitious player

Quanyan Zhu, Lacra Pavel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Non-cooperative game theory is a powerful modeling tool for resource allocation problems in modern communication networks. However, practical concerns of capacity constraints and allocation efficiency have been a challenge for network engineers. In this paper, we base our results in the context of link-level power control of optical networks and propose a special form of games with an additional player to overcome these difficulties. We introduce a novel framework with a fictitious player (GFP) to extend the current OSNR Nash game framework with capacity constraints. We characterize a more analytically tractable solution in comparison to other approaches and propose a first-order iterative algorithm to find the equilibrium.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets
Pages922-927
Number of pages6
DOIs
StatePublished - 2007
Event4th International Conference on Broadband Communications, Networks, Systems, BroadNets - Raleigh, NC, United States
Duration: Sep 10 2007Sep 14 2007

Other

Other4th International Conference on Broadband Communications, Networks, Systems, BroadNets
CountryUnited States
CityRaleigh, NC
Period9/10/079/14/07

Fingerprint

Level control
Game theory
Fiber optic networks
Wavelength division multiplexing
Power control
Resource allocation
Telecommunication networks
Engineers

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Zhu, Q., & Pavel, L. (2007). Solving constrained OSNR Nash game in WDM optical networks with a fictitious player. In Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets (pp. 922-927). [4550534] https://doi.org/10.1109/BROADNETS.2007.4550534

Solving constrained OSNR Nash game in WDM optical networks with a fictitious player. / Zhu, Quanyan; Pavel, Lacra.

Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets. 2007. p. 922-927 4550534.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhu, Q & Pavel, L 2007, Solving constrained OSNR Nash game in WDM optical networks with a fictitious player. in Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets., 4550534, pp. 922-927, 4th International Conference on Broadband Communications, Networks, Systems, BroadNets, Raleigh, NC, United States, 9/10/07. https://doi.org/10.1109/BROADNETS.2007.4550534
Zhu Q, Pavel L. Solving constrained OSNR Nash game in WDM optical networks with a fictitious player. In Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets. 2007. p. 922-927. 4550534 https://doi.org/10.1109/BROADNETS.2007.4550534
Zhu, Quanyan ; Pavel, Lacra. / Solving constrained OSNR Nash game in WDM optical networks with a fictitious player. Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets. 2007. pp. 922-927
@inproceedings{4d1e281feb0a4587bda5541885b65803,
title = "Solving constrained OSNR Nash game in WDM optical networks with a fictitious player",
abstract = "Non-cooperative game theory is a powerful modeling tool for resource allocation problems in modern communication networks. However, practical concerns of capacity constraints and allocation efficiency have been a challenge for network engineers. In this paper, we base our results in the context of link-level power control of optical networks and propose a special form of games with an additional player to overcome these difficulties. We introduce a novel framework with a fictitious player (GFP) to extend the current OSNR Nash game framework with capacity constraints. We characterize a more analytically tractable solution in comparison to other approaches and propose a first-order iterative algorithm to find the equilibrium.",
author = "Quanyan Zhu and Lacra Pavel",
year = "2007",
doi = "10.1109/BROADNETS.2007.4550534",
language = "English (US)",
isbn = "1424414334",
pages = "922--927",
booktitle = "Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets",

}

TY - GEN

T1 - Solving constrained OSNR Nash game in WDM optical networks with a fictitious player

AU - Zhu, Quanyan

AU - Pavel, Lacra

PY - 2007

Y1 - 2007

N2 - Non-cooperative game theory is a powerful modeling tool for resource allocation problems in modern communication networks. However, practical concerns of capacity constraints and allocation efficiency have been a challenge for network engineers. In this paper, we base our results in the context of link-level power control of optical networks and propose a special form of games with an additional player to overcome these difficulties. We introduce a novel framework with a fictitious player (GFP) to extend the current OSNR Nash game framework with capacity constraints. We characterize a more analytically tractable solution in comparison to other approaches and propose a first-order iterative algorithm to find the equilibrium.

AB - Non-cooperative game theory is a powerful modeling tool for resource allocation problems in modern communication networks. However, practical concerns of capacity constraints and allocation efficiency have been a challenge for network engineers. In this paper, we base our results in the context of link-level power control of optical networks and propose a special form of games with an additional player to overcome these difficulties. We introduce a novel framework with a fictitious player (GFP) to extend the current OSNR Nash game framework with capacity constraints. We characterize a more analytically tractable solution in comparison to other approaches and propose a first-order iterative algorithm to find the equilibrium.

UR - http://www.scopus.com/inward/record.url?scp=51249118139&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249118139&partnerID=8YFLogxK

U2 - 10.1109/BROADNETS.2007.4550534

DO - 10.1109/BROADNETS.2007.4550534

M3 - Conference contribution

SN - 1424414334

SN - 9781424414338

SP - 922

EP - 927

BT - Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets

ER -