Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Data Structures and Their Algorithms
Data Structures and Their Algorithms
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Providing public intradomain traffic matrices to the research community
ACM SIGCOMM Computer Communication Review
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Journal of Network and Systems Management
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Selfish routing and path coloring in all-optical networks
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory (TOCT)
Reducing the maximum latency of selfish ring routing via pairwise cooperations
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Atomic routing games on maximum congestion
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On nash equilibria in non-cooperative all-optical networks
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The efficiency of optimal taxes
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Fuzzy Optimization Models for the Design of WDM Networks
IEEE Transactions on Fuzzy Systems
Toward automated provisioning of advance reservation service in next-generation optical internet
IEEE Communications Magazine
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
Routing and wavelength assignment of scheduled lightpath demands
IEEE Journal on Selected Areas in Communications
Integrated IP/WDM routing in GMPLS-based optical networks
IEEE Network: The Magazine of Global Internetworking
Future Generation Computer Systems
| Hi-index | 0.24 |
The main challenge in developing large data network in the wide area is in dealing with the scalability of the underlying routing system. Accordingly, in this work we focus on the design of an effective and scalable routing and wavelength assignment (RWA) framework supporting advance reservation services in wavelength-routed WDM networks crossing multiple administrative domains. Our approach is motivated by the observation that traffic in large optical networks spanning several domains is not controlled by a central authority but rather by a large number of independent entities interacting in a distributed manner and aiming at maximizing their own welfare. Due to the selfish strategic behavior of the involved entities, non-cooperative game theory plays an important role in driving our approach. Here the dominant solution concept is the notion of Nash equilibria, which are states of a system in which no participant can gain by deviating unilaterally its strategy. On this concept, we developed a selfish adaptive RWA model supporting advance reservation in large-scale optical wavelength-routed networks and developed a distributed algorithm to compute approximate equilibria in computationally feasible times. We showed how and under which conditions such approach can give rise to a stable state with satisfactory solutions and analyzed its performance and convergence features.