Games with coupled propagated constraints in general topology optical networks

Yan Pan; Lacra  Pavel

1st International Conference on Game Theory for Networks

Research Article

Games with coupled propagated constraints in general topology optical networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/GAMENETS.2009.5137444,
    author={Yan Pan and Lacra  Pavel},
    title={Games with coupled propagated constraints in general topology optical networks},
    proceedings={1st International Conference on Game Theory for Networks},
    publisher={IEEE},
    proceedings_a={GAMENETS},
    year={2009},
    month={6},
    keywords={},
    doi={10.1109/GAMENETS.2009.5137444}
}

Yan Pan
Lacra Pavel
Year: 2009
Games with coupled propagated constraints in general topology optical networks
GAMENETS
IEEE
DOI: 10.1109/GAMENETS.2009.5137444

Yan Pan¹^,*, Lacra Pavel¹^,*

1: Department of Electrical and Computer Engineering, University of Toronto, 10 King’s College Road, Toronto, Canada.

*Contact email: yanpan@control.utoronto.ca, pavel@control.toronto.edu

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.

Published: 2009-06-26
Publisher: IEEE

: http://dx.doi.org/10.1109/GAMENETS.2009.5137444