Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
Full metadata record
|dc.identifier.citation||Proceedings of the 2nd International Workshop on Game Theory in Communication Networks (GameComm 2008), October 2008.||en|
|dc.description||Copyright © 2008 ICST||en|
|dc.description.abstract||There are a group of problems in networking that can most naturally be described as optimization problems (network design, traffic engineering, etc.). There has been a great deal of research devoted to solving these problems, but this research has been concentrated on intra-domain problems where one network operator has complete information and control. An emerging field is inter-domain engineering, for instance, traffic engineering between large autonomous networks. Extending intra-domain optimization techniques to inter-domain problems is often impossible without the information available within a domain, and providers are often unwilling to share such information. This paper presents an alternative: we propose a method for traffic engineering that does not require sharing of important information across domains. The method extends the idea of genetic algorithms to allow symbiotic evolution between two parties. Both parties may improve their performance without revealing their data, other than what would be easily observed in any case. We show the method provides large reductions in network congestion, close to the optimal shortest path routing across a pair of networks. The results are highly robust to measurement noise, the method is very flexible, and it can be applied using existing routing.||en|
|dc.description.statementofresponsibility||Matthew Roughan and Yin Zhang||en|
|dc.title||GATEway: Symbiotic inter-domain traffic engineering||en|
|dc.contributor.conference||International Workshop on Game Theory in Communication Networks (2nd : 2008 : Athens, Greece)||en|
|Appears in Collections:||Aurora harvest|
Mathematical Sciences publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.