Scipediacontent: Scipediacontent moved page Draft Content 585178614 to Roughan Zhang 2010a

2021-02-01T15:16:25Z

Scipediacontent moved page Draft Content 585178614 to Roughan Zhang 2010a

Scipediacontent: Created page with " == Abstract == There are a group of problems in networking that can most naturally be described as optimization problems (network design, traffic engineering, etc.). There h..."

2021-02-01T15:16:21Z

Created page with " == Abstract == There are a group of problems in networking that can most naturally be described as optimization problems (network design, traffic engineering, etc.). There h..."

New page

== 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.

== Original document ==

The different versions of the original document can be found in:

* [http://dx.doi.org/10.4108/icst.valuetools2008.4500 http://dx.doi.org/10.4108/icst.valuetools2008.4500]

* [http://eudl.eu/pdf/10.4108/ICST.VALUETOOLS2008.4500 http://eudl.eu/pdf/10.4108/ICST.VALUETOOLS2008.4500]

* [http://www.cs.utexas.edu/~yzhang/papers/gateway-gamecomm08.pdf http://www.cs.utexas.edu/~yzhang/papers/gateway-gamecomm08.pdf]

* [http://link.springer.com/content/pdf/10.1007/s11235-010-9298-y.pdf http://link.springer.com/content/pdf/10.1007/s11235-010-9298-y.pdf],
: [http://link.springer.com/article/10.1007/s11235-010-9298-y/fulltext.html http://link.springer.com/article/10.1007/s11235-010-9298-y/fulltext.html],
: [http://link.springer.com/content/pdf/10.1007/s11235-010-9298-y http://link.springer.com/content/pdf/10.1007/s11235-010-9298-y],
: [http://dx.doi.org/10.1007/s11235-010-9298-y http://dx.doi.org/10.1007/s11235-010-9298-y] under the license http://www.springer.com/tdm

* [http://www.cs.utexas.edu/~yzhang/papers/gateway-gamecomm08.pdf http://www.cs.utexas.edu/~yzhang/papers/gateway-gamecomm08.pdf],
: [http://www.cs.utexas.edu/~yzhang/papers/te-journal09.pdf http://www.cs.utexas.edu/~yzhang/papers/te-journal09.pdf],
: [https://link.springer.com/article/10.1007%2Fs11235-010-9298-y https://link.springer.com/article/10.1007%2Fs11235-010-9298-y],
: [https://dblp.uni-trier.de/db/conf/valuetools/valuetools2008.html#RoughanZ08 https://dblp.uni-trier.de/db/conf/valuetools/valuetools2008.html#RoughanZ08],
: [https://dl.acm.org/citation.cfm?id=1536970 https://dl.acm.org/citation.cfm?id=1536970],
: [https://eudl.eu/doi/10.4108/ICST.VALUETOOLS2008.4500 https://eudl.eu/doi/10.4108/ICST.VALUETOOLS2008.4500],
: [https://academic.microsoft.com/#/detail/2621353649 https://academic.microsoft.com/#/detail/2621353649]

* [https://core.ac.uk/display/21167946 https://core.ac.uk/display/21167946],
: [https://dblp.uni-trier.de/db/journals/telsys/telsys47.html#RoughanZ11 https://dblp.uni-trier.de/db/journals/telsys/telsys47.html#RoughanZ11],
: [https://link.springer.com/10.1007/s11235-010-9298-y https://link.springer.com/10.1007/s11235-010-9298-y],
: [https://dl.acm.org/citation.cfm?id=2728023 https://dl.acm.org/citation.cfm?id=2728023],
: [https://rd.springer.com/article/10.1007%2Fs11235-010-9298-y https://rd.springer.com/article/10.1007%2Fs11235-010-9298-y],
: [https://academic.microsoft.com/#/detail/2037895657 https://academic.microsoft.com/#/detail/2037895657]

DOIS: 10.4108/icst.valuetools2008.4500 10.1007/s11235-010-9298-y

← Older revision	Revision as of 15:16, 1 February 2021
(No difference)

Roughan Zhang 2010a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 585178614 to Roughan Zhang 2010a

Scipediacontent: Created page with " == Abstract == There are a group of problems in networking that can most naturally be described as optimization problems (network design, traffic engineering, etc.). There h..."