test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works

Advanced Search
& Collections
Issue Date   
Sign on to:   
Receive email
My Account
authorized users
Edit Profile   
About T-Space   

T-Space at The University of Toronto Libraries >
School of Graduate Studies - Theses >
Doctoral >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/17476

Title: A Game Theoretical Approach to Constrained OSNR Optimization Problems in Optical Networks
Authors: Pan, Yan
Advisor: Pavel, Lacra
Department: Electrical and Computer Engineering
Keywords: Game theory
Constrained optimization
Optical Networks
Issue Date: 17-Jul-2009
Abstract: Optical signal-to-noise ratio (OSNR) is considered as the dominant performance parameter at the physical layer in optical networks. This thesis is interested in control and optimization of channel OSNR by using optimization and game-theoretic approaches, incorporating two physical constraints: the link capacity constraint and the channel OSNR target. To start, we study OSNR optimization problems with link capacity constraints in single point-to-point fiber links via two approaches. We first present a framework of a Nash game between channels towards optimizing individual channel OSNR. The link capacity constraint is imposed as a penalty term to each cost function. The selfish behavior in a Nash game degrades the system performance and leads to the inefficiency of Nash equilibria. From the system point of view, we formulate a system optimization problem with the objectives of achieving an OSNR target for each channel while satisfying the link capacity constraint. As an alternative to study the efficiency of Nash equilibria, we use the system framework to investigate the effects of parameters in cost functions in the game-theoretic framework. Then extensions to multi-link and mesh topologies are carried out. We propose a partition approach by using the flexibility of channel power adjustment at optical switches. The multi-link structure is partitioned into stages with each stage being a single sink. By fully using the flexibility, a more natural partition approach is applied to mesh topologies where each stage is a single link. The closed loop in mesh topologies can be unfolded by selecting a starting link. Thus instead of maximization of channel OSNR from end to end, we consider minimization of channel OSNR degradation between stages. We formulate a partitioned Nash game which is composed of ladder-nested stage Nash games. Distributed algorithms towards the computation of a Nash equilibrium solution are developed for all different game frameworks. Simulations and experimental implementations provide results to validate the applicability of theoretical results.
URI: http://hdl.handle.net/1807/17476
Appears in Collections:Doctoral
The Edward S. Rogers Sr. Department of Electrical & Computer Engineering - Doctoral theses

Files in This Item:

File Description SizeFormat
Pan_Yan_Y_200903_PhD_thesis.pdf1.95 MBAdobe PDF

This item is licensed under a Creative Commons License
Creative Commons

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.