Genetic algorithm for optimizing and arrangement of queue in virtual networks

Heru Sukoco, Koji Okamura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Network visualization provides methods that simplify resource management, deal with connectivity and bandwidth constraints, and enable virtual network-connected machines through either a common layer 2 or layer 3 IP network of TCP/IP protocol suite. This paper presents an alternative optimization solution in maintaining the packets queue on a virtual router by using Genetic Algorithm. The objective of this research is to reduce a cost of network resources such as memory and time processes on a router. It is important for a company with limited cost when implements a network infrastructure. We defined a crossover probability and a mutation probability to 0.90 and 0.05. In our experiments, we still have unsatisfied results due to the average and the standard deviation of fitness values and slots needed in queues are 58,238.10 & 139,575.45 and 106.20 & 82.51, respectively. These values should be better by defining an appropriate fitness function in our next experiments. We still continue the research by examining an appropriate fitness function, Genetic Algorithm as a classifier, dynamic slot size, and also comparing with current queue managements such as first-in first-out and weighted fair queue.

Original languageEnglish
Title of host publicationIMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011
Pages670-675
Number of pages6
Publication statusPublished - Jul 26 2011
EventInternational MultiConference of Engineers and Computer Scientists 2011, IMECS 2011 - Kowloon, Hong Kong
Duration: Mar 16 2011Mar 18 2011

Publication series

NameIMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011
Volume1

Other

OtherInternational MultiConference of Engineers and Computer Scientists 2011, IMECS 2011
CountryHong Kong
CityKowloon
Period3/16/113/18/11

Fingerprint

Routers
Genetic algorithms
Costs
Classifiers
Visualization
Experiments
Bandwidth
Data storage equipment
Industry

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

Sukoco, H., & Okamura, K. (2011). Genetic algorithm for optimizing and arrangement of queue in virtual networks. In IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011 (pp. 670-675). (IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011; Vol. 1).

Genetic algorithm for optimizing and arrangement of queue in virtual networks. / Sukoco, Heru; Okamura, Koji.

IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. 2011. p. 670-675 (IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011; Vol. 1).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sukoco, H & Okamura, K 2011, Genetic algorithm for optimizing and arrangement of queue in virtual networks. in IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011, vol. 1, pp. 670-675, International MultiConference of Engineers and Computer Scientists 2011, IMECS 2011, Kowloon, Hong Kong, 3/16/11.
Sukoco H, Okamura K. Genetic algorithm for optimizing and arrangement of queue in virtual networks. In IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. 2011. p. 670-675. (IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011).
Sukoco, Heru ; Okamura, Koji. / Genetic algorithm for optimizing and arrangement of queue in virtual networks. IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011. 2011. pp. 670-675 (IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011).
@inproceedings{5011caa2e35441dbba74b3c707007bf4,
title = "Genetic algorithm for optimizing and arrangement of queue in virtual networks",
abstract = "Network visualization provides methods that simplify resource management, deal with connectivity and bandwidth constraints, and enable virtual network-connected machines through either a common layer 2 or layer 3 IP network of TCP/IP protocol suite. This paper presents an alternative optimization solution in maintaining the packets queue on a virtual router by using Genetic Algorithm. The objective of this research is to reduce a cost of network resources such as memory and time processes on a router. It is important for a company with limited cost when implements a network infrastructure. We defined a crossover probability and a mutation probability to 0.90 and 0.05. In our experiments, we still have unsatisfied results due to the average and the standard deviation of fitness values and slots needed in queues are 58,238.10 & 139,575.45 and 106.20 & 82.51, respectively. These values should be better by defining an appropriate fitness function in our next experiments. We still continue the research by examining an appropriate fitness function, Genetic Algorithm as a classifier, dynamic slot size, and also comparing with current queue managements such as first-in first-out and weighted fair queue.",
author = "Heru Sukoco and Koji Okamura",
year = "2011",
month = "7",
day = "26",
language = "English",
isbn = "9789881821034",
series = "IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011",
pages = "670--675",
booktitle = "IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011",

}

TY - GEN

T1 - Genetic algorithm for optimizing and arrangement of queue in virtual networks

AU - Sukoco, Heru

AU - Okamura, Koji

PY - 2011/7/26

Y1 - 2011/7/26

N2 - Network visualization provides methods that simplify resource management, deal with connectivity and bandwidth constraints, and enable virtual network-connected machines through either a common layer 2 or layer 3 IP network of TCP/IP protocol suite. This paper presents an alternative optimization solution in maintaining the packets queue on a virtual router by using Genetic Algorithm. The objective of this research is to reduce a cost of network resources such as memory and time processes on a router. It is important for a company with limited cost when implements a network infrastructure. We defined a crossover probability and a mutation probability to 0.90 and 0.05. In our experiments, we still have unsatisfied results due to the average and the standard deviation of fitness values and slots needed in queues are 58,238.10 & 139,575.45 and 106.20 & 82.51, respectively. These values should be better by defining an appropriate fitness function in our next experiments. We still continue the research by examining an appropriate fitness function, Genetic Algorithm as a classifier, dynamic slot size, and also comparing with current queue managements such as first-in first-out and weighted fair queue.

AB - Network visualization provides methods that simplify resource management, deal with connectivity and bandwidth constraints, and enable virtual network-connected machines through either a common layer 2 or layer 3 IP network of TCP/IP protocol suite. This paper presents an alternative optimization solution in maintaining the packets queue on a virtual router by using Genetic Algorithm. The objective of this research is to reduce a cost of network resources such as memory and time processes on a router. It is important for a company with limited cost when implements a network infrastructure. We defined a crossover probability and a mutation probability to 0.90 and 0.05. In our experiments, we still have unsatisfied results due to the average and the standard deviation of fitness values and slots needed in queues are 58,238.10 & 139,575.45 and 106.20 & 82.51, respectively. These values should be better by defining an appropriate fitness function in our next experiments. We still continue the research by examining an appropriate fitness function, Genetic Algorithm as a classifier, dynamic slot size, and also comparing with current queue managements such as first-in first-out and weighted fair queue.

UR - http://www.scopus.com/inward/record.url?scp=79960617333&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960617333&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:79960617333

SN - 9789881821034

T3 - IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011

SP - 670

EP - 675

BT - IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011

ER -