Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Optimization of globally convex functions
SIAM Journal on Control and Optimization
The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Analysis of shortest-path routing algorithms in a dynamic network environment
ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Queueing networks with blocking
Queueing networks with blocking
An introduction to genetic algorithms
An introduction to genetic algorithms
ROSS: a high-performance, low memory, modular time warp system
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Pop-level and access-link-level traffic dynamics in a tier-1 POP
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Stochastic Methods for Practical Global Optimization
Journal of Global Optimization
Global Optimization on Funneling Landscapes
Journal of Global Optimization
Understanding BGP misconfiguration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Searching in the Presence of Noise
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A recursive random search algorithm for large-scale network parameter configuration
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Learning evaluation functions to improve optimization by local search
The Journal of Machine Learning Research
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
NetScope: traffic engineering for IP networks
IEEE Network: The Magazine of Global Internetworking
Ad Hoc Distributed Simulation of Queueing Networks
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Goal-Directed Grid-Enabled Computing for Legacy Simulations
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
ACM SIGCOMM Computer Communication Review
Internet on the move: challenges and solutions
ACM SIGCOMM Computer Communication Review
Statistical issues in ad hoc distributed simulations
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
As the Internet infrastructure grows to support a variety of services, its legacy protocols are being overloaded with new functions such as traffic engineering. Today, operators engineer such capabilities through clever, but manual parameter tuning. In this paper, we propose a back-end support tool for large-scale parameter configuration that is based on efficient parameter state space search techniques and on-line simulation. The framework is useful when the network protocol performance is sensitive to its parameter settings, and its performance can be reasonably modeled in simulation. In particular, our system imports the network topology, relevant protocol models and latest monitored traffic patterns into a simulation that runs on-line in a network operations center (NOC). Each simulation evaluates the network performance for a particular setting of protocol parameters. We propose an efficient large-dimensional parameter state space search technique called "recursive random search (RRS)." Each sample point chosen by RRS results in a single simulation. An important feature of this framework is its flexibility: it allows arbitrary choices in terms of the simulation engines used (e.g., ns-2, SSFnet), network protocols to be simulated (e.g., OSPF, BGP), and in the specification of the optimization objectives. We demonstrate the flexibility and relevance of this framework in three scenarios: joint tuning of the RED buffer management parameters at multiple bottlenecks, traffic engineering using OSPF link weight tuning, and outbound load-balancing of traffic at peering/transit points using BGP LOCAL_PREF parameter.