Games with coupled propagated constraints in general topology optical networks

Authors:
Yan Pan;Lacra Pavel
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada;Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada
Venue:
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Year:
2009

Citing 2
Cited 1

Matrix analysis

Matrix analysis
An extension of duality to a game-theoretic framework

Automatica (Journal of IFAC)

Nash equilibrium design and optimization

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider games with coupled utilities and constraints towards optimizing channel optical signal-to-noise ratio (OSNR) in optical networks with arbitrary topologies. By fully using the flexibility that channel powers are adjustable at optical switches, we partition the network into stages where each stage is a link. We formulate a partitioned Nash game composed of link Nash games where each link Nash game is played towards minimizing channel OSNR degradation across the link. By breaking quasi-closed loops and selecting one link as the start, links/games can be placed sequentially in a ladder-nested form. The partition is simple and scalable and leads to a three-level hierarchical algorithm towards computation of Nash equilibria.