Packet transmission optimisation using genetic algorithms
Pages 653 - 661
Abstract
A Genetic Algorithm (GA) is used to optimise the parameters for a sequence of packets sent over the Internet. Only the parameters that a client machine can change are used and the fitness is based on the delay time returned by the Traceroute program. The GA performance is compared to a fixed packet size with no priority used to assess the status of the network. The GA generally performed to the same level as the control settings but in some cases significant improvements were made.
References
[1]
Bremermann H.J. (1962). Optimization through evolution and recombination. in {19}. pp. 93-106.
[2]
Cooper J.L. & Hinde C.J. (2003). Improving the performance of Genetic Algorithms Using Partial Fitness Functions. Submitted to GECCO 2003.
[3]
Cooper J.L. Withall M.S. Hinde C.J. & Stone R.G. (2003). Investigation into the effects of varying the parameters of packets travelling across the Internet. Loughborough University Department of Computer Science Internal Report no. 1070.
[4]
Corne D. Smith G. & Oates M. (2000). Telecommunications Optimization: Heuristic and Adaptive Techniques. John Wiley and Sons Ltd.
[5]
Darwin C. (1996). The Origin of Species. Oxford University Press. First published 1859.
[6]
Di Caro G. & Dorigo M. (1998). AntNet: Distributed Stigmergetic Control for Communications Networks. In Journal of Artificial Intelligence Research, 9:317- 365.
[7]
Fraser A.S. (1957a). Simulation of Genetic Systems by Automatic Digital Computers 1, Introduction. Australian J. of Biol. Sci., Vol. 10, pp. 484-491.
[8]
Fraser A.S. (1957b). Simulation of Genetic Systems by Automatic Digital Computers 2, Effects of Linkage on Rate of Advance under Selection. Australian J. of Biol. Sci., Vol. 10, pp. 492-499.
[9]
Goldberg D.E. (1989). Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley Publishing Co. Inc.
[10]
Holland J.H. (1973). Genetic Algorithms and the Optimal Allocation of Trials. In SIAM Journal on Computing, 2(2):88-105, June.
[11]
Holland J.H. (1975). Adaption in Natural and Artificial Systems. MIT Press.
[12]
Holland J.H. (1992). Adaption in Natural and Artificial Systems. MIT Press, Second Edition.
[13]
Langdon W.B., (2002). Proceedings of the Genetic and Evolutionary Computation Conference 2002, Morgan Kaufmann.
[14]
Liang S. Zincir-Heywood A.N. & Heywood M.I. (2002). Intelligent Packets for Dynamic NetworkR outing using Distributed Genetic Algorithm. In {13}. pp. 88- 96.
[15]
Mendel G. (1865). Experiments in Plant Hybridization.
[16]
Syswerda G. (1989). Uniform Crossover in Genetic Algorithms. In Schaffer D., editor, Proceedings of the Third International Conference on Genetic Algorithms, 2-9. Morgan Kaufmann.
[17]
Wall L. Christiansen T. & Schwartz R.L. (1996). Programming Perl. O'Reilly & Associates, Inc., Second Edition.
[18]
Wallace A.R. (1858). On the Tendency of Varieties to Depart Indefinitely From the Original Type. In Journal of the Proceedings of the Linnean Society: Zoology 3(9):53-62.
[19]
Yovits M.C., Jacobi G.T. & Goldstein G.D. (1962). Self Organizing Systems. Spartan Books, Washuington D.C.
Index Terms
- Packet transmission optimisation using genetic algorithms
Recommendations
Neural network crossover in genetic algorithms using genetic programming
AbstractThe use of genetic algorithms (GAs) to evolve neural network (NN) weights has risen in popularity in recent years, particularly when used together with gradient descent as a mutation operator. However, crossover operators are often omitted from ...
Using messy genetic algorithms for solving the winner determination problem
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computationThe paper presents a study on the application of messy genetic algorithms for the winner determination problem in the combinatorial auction realm. Messy genetic algorithms operate explicitly on building blocks in order to obtain good solutions. Since ...
Biased random-key genetic algorithms for combinatorial optimization
Random-key genetic algorithms were introduced by Bean (ORSA J. Comput. 6:154---160, 1994) for solving sequencing problems in combinatorial optimization. Since then, they have been extended to handle a wide class of combinatorial optimization problems. ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Springer Springer Verlag Inc
Publication History
Published: 23 June 2003
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025