Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Cryptographic techniques for privacy-preserving data mining
ACM SIGKDD Explorations Newsletter
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic engineering with estimated traffic matrices
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Network sensitivity to hot-potato disruptions
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
TIE breaking: tunable interdomain egress selection
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Simplifying the synthesis of internet traffic matrices
ACM SIGCOMM Computer Communication Review
Negotiation-based routing between neighboring ISPs
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Using redistribution communities for interdomain traffic engineering
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Privacy-Preserving graph algorithms in the semi-honest model
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Traffic matrix reloaded: impact of routing changes
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Making IGP routing robust to link failures
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Interdomain traffic engineering with BGP
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Rehoming edge links for better traffic engineering
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
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 measurements and control available within a domain. This paper presents an alternative: we propose a method for traffic engineering that doesn't 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.