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
T2 - International MultiConference of Engineers and Computer Scientists 2011, IMECS 2011
Y2 - 16 March 2011 through 18 March 2011
ER -