Stochastic global optimization methods. part 1: clustering methods
Mathematical Programming: Series A and B
Optimization of globally convex functions
SIAM Journal on Control and Optimization
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An introduction to genetic algorithms
An introduction to genetic algorithms
Application of stochastic global optimization algorithms to practical problems
Journal of Optimization Theory and Applications
`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
A New Version of the Price‘s Algorithm for Global Optimization
Journal of Global Optimization
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
Searching in the Presence of Noise
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Learning evaluation functions to improve optimization by local search
The Journal of Machine Learning Research
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
A smart hill-climbing algorithm for application server configuration
Proceedings of the 13th international conference on World Wide Web
A model of BGP routing for network engineering
Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the 35th conference on Winter simulation: driving innovation
Designing BGP-based outbound traffic engineering techniques for stub ASes
ACM SIGCOMM Computer Communication Review
A recursive random search algorithm for network parameter optimization
ACM SIGMETRICS Performance Evaluation Review
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Finding probably better system configurations quickly
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
A case study in meta-simulation design and performance analysis for large-scale networks
WSC '04 Proceedings of the 36th conference on Winter simulation
Explanation Exploration: Exploring Emergent Behavior
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
Network-wide prediction of BGP routes
IEEE/ACM Transactions on Networking (TON)
Large-scale network parameter configuration using an on-line simulation framework
IEEE/ACM Transactions on Networking (TON)
Boosting the performance of computing systems through adaptive configuration tuning
Proceedings of the 2009 ACM symposium on Applied Computing
No one (cluster) size fits all: automatic cluster sizing for data-intensive analytics
Proceedings of the 2nd ACM Symposium on Cloud Computing
Reliability-Latency tradeoffs for data gathering in random-access wireless sensor networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
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)
Stubby: a transformation-based optimizer for MapReduce workflows
Proceedings of the VLDB Endowment
Gunther: search-based auto-tuning of mapreduce
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Hi-index | 0.00 |
Parameter configuration is a common procedure used in large-scale network protocols to support multiple operational goals. It can be formulated as a black-box optimization problem and solved with an efficient search algorithm. This paper proposes a new heuristic search algorithm, Recursive Random Search(RRS), for large-scale network parameter optimization. The RRS algorithm is based on the initial high-efficiency feature of random sampling and it attempts to maintain this high efficiency by constantly "restarting" random sampling with adjusted sample spaces. Besides the high efficiency, the RRS algorithm is robust to the effect of random noise and trivial parameters in the objective function because of its root in random sampling. These features are very important for the efficient optimization of network protocol configuration. The performance of RRS is demonstrated with the tests on a suite of benchmark functions. The algorithm has been applied to the configuration of several network protocols, such as RED, OSPF and BGP. One example application in OSPF routing algorithm is presented.