Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2009 | Volume: 9 | Issue: 15 | Page No.: 2847-2851
DOI: 10.3923/jas.2009.2847.2851
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Determining Optimum Queue Length in Computer Networks by Using Memetic Algorithms

R. Ayanzadeh, E. Shahamatnia and S. Setayeshi

Making the choice of optimal queue length in manufacturing network equipments is one of the most significant fields of network researches. This study addresses the multi-objective problem of determining optimal queue length in computer networks which aims to trade off between cost and performance. In the proposed approach, first the parameter of the simulated queue model is estimated by a memetic algorithm, which makes the fitness function of a second memetic algorithm. In this phase optimum queue length is computed based on the trade off between cost and performance of system. To validate the proposed approach, several simulations are implemented. Simulation results show that by setting an appropriate limited length for network queue desired performance can be achieved. Employing the proposed method in designing and manufacturing of network equipments can be economically beneficial.
PDF Fulltext XML References Citation Report Citation
  •    Central Limit Theorem based Cellular Automata for Generating Normal Random Numbers
  •    Dynamic Parameters Optimization for Enhancing Performance and Stability of PSO
  •    Discrete Time Dynamic Neural Networks for Predicting Chaotic Time Series
  •    Fuzzy Honey Bees Foraging Optimization: Swarm Intelligence Approach for Clustering
How to cite this article:

R. Ayanzadeh, E. Shahamatnia and S. Setayeshi, 2009. Determining Optimum Queue Length in Computer Networks by Using Memetic Algorithms. Journal of Applied Sciences, 9: 2847-2851.

DOI: 10.3923/jas.2009.2847.2851






Curve Bottom