Grouping packet scheduling for virtual networks by genetic algorithm

Heru Sukoco, Koji Okamura

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

Abstract

This paper proposed a design of group-based packet scheduling to maintain virtual network resources such as queue, bandwidth, and process time on routers. We attempt to improve our previous approach, a Packet and Slot Size-based, by creating network slicing and flow priority level done by OpenFlow Protocol to define parameters needed by Genetic Algorithm. We desire to get better results compared to our previous approach that only involved 2 parameters, namely packet size and the number of slots. The problem will arise when the networks connected to other types of networks that do not support packet priority mechanisms. We expect that this problem can be accommodated by using virtual switch that integrated to virtual OpenFlow switch.

Original languageEnglish
Title of host publicationProceedings of the 6th International Conference on Future Internet Technologies, CFI11
Pages59-65
Number of pages7
DOIs
Publication statusPublished - Aug 16 2011
Event6th International Conference on Future Internet Technologies, CFI 2011 - Seoul, Korea, Republic of
Duration: Jun 13 2011Jun 15 2011

Publication series

NameProceedings of the 6th International Conference on Future Internet Technologies, CFI11

Other

Other6th International Conference on Future Internet Technologies, CFI 2011
CountryKorea, Republic of
CitySeoul
Period6/13/116/15/11

Fingerprint

Genetic algorithms
Scheduling
Switches
Routers
Bandwidth

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Sukoco, H., & Okamura, K. (2011). Grouping packet scheduling for virtual networks by genetic algorithm. In Proceedings of the 6th International Conference on Future Internet Technologies, CFI11 (pp. 59-65). (Proceedings of the 6th International Conference on Future Internet Technologies, CFI11). https://doi.org/10.1145/2002396.2002413

Grouping packet scheduling for virtual networks by genetic algorithm. / Sukoco, Heru; Okamura, Koji.

Proceedings of the 6th International Conference on Future Internet Technologies, CFI11. 2011. p. 59-65 (Proceedings of the 6th International Conference on Future Internet Technologies, CFI11).

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

Sukoco, H & Okamura, K 2011, Grouping packet scheduling for virtual networks by genetic algorithm. in Proceedings of the 6th International Conference on Future Internet Technologies, CFI11. Proceedings of the 6th International Conference on Future Internet Technologies, CFI11, pp. 59-65, 6th International Conference on Future Internet Technologies, CFI 2011, Seoul, Korea, Republic of, 6/13/11. https://doi.org/10.1145/2002396.2002413
Sukoco H, Okamura K. Grouping packet scheduling for virtual networks by genetic algorithm. In Proceedings of the 6th International Conference on Future Internet Technologies, CFI11. 2011. p. 59-65. (Proceedings of the 6th International Conference on Future Internet Technologies, CFI11). https://doi.org/10.1145/2002396.2002413
Sukoco, Heru ; Okamura, Koji. / Grouping packet scheduling for virtual networks by genetic algorithm. Proceedings of the 6th International Conference on Future Internet Technologies, CFI11. 2011. pp. 59-65 (Proceedings of the 6th International Conference on Future Internet Technologies, CFI11).
@inproceedings{fd99ed2035a247f4b48adfc6ab190002,
title = "Grouping packet scheduling for virtual networks by genetic algorithm",
abstract = "This paper proposed a design of group-based packet scheduling to maintain virtual network resources such as queue, bandwidth, and process time on routers. We attempt to improve our previous approach, a Packet and Slot Size-based, by creating network slicing and flow priority level done by OpenFlow Protocol to define parameters needed by Genetic Algorithm. We desire to get better results compared to our previous approach that only involved 2 parameters, namely packet size and the number of slots. The problem will arise when the networks connected to other types of networks that do not support packet priority mechanisms. We expect that this problem can be accommodated by using virtual switch that integrated to virtual OpenFlow switch.",
author = "Heru Sukoco and Koji Okamura",
year = "2011",
month = "8",
day = "16",
doi = "10.1145/2002396.2002413",
language = "English",
isbn = "9781450308212",
series = "Proceedings of the 6th International Conference on Future Internet Technologies, CFI11",
pages = "59--65",
booktitle = "Proceedings of the 6th International Conference on Future Internet Technologies, CFI11",

}

TY - GEN

T1 - Grouping packet scheduling for virtual networks by genetic algorithm

AU - Sukoco, Heru

AU - Okamura, Koji

PY - 2011/8/16

Y1 - 2011/8/16

N2 - This paper proposed a design of group-based packet scheduling to maintain virtual network resources such as queue, bandwidth, and process time on routers. We attempt to improve our previous approach, a Packet and Slot Size-based, by creating network slicing and flow priority level done by OpenFlow Protocol to define parameters needed by Genetic Algorithm. We desire to get better results compared to our previous approach that only involved 2 parameters, namely packet size and the number of slots. The problem will arise when the networks connected to other types of networks that do not support packet priority mechanisms. We expect that this problem can be accommodated by using virtual switch that integrated to virtual OpenFlow switch.

AB - This paper proposed a design of group-based packet scheduling to maintain virtual network resources such as queue, bandwidth, and process time on routers. We attempt to improve our previous approach, a Packet and Slot Size-based, by creating network slicing and flow priority level done by OpenFlow Protocol to define parameters needed by Genetic Algorithm. We desire to get better results compared to our previous approach that only involved 2 parameters, namely packet size and the number of slots. The problem will arise when the networks connected to other types of networks that do not support packet priority mechanisms. We expect that this problem can be accommodated by using virtual switch that integrated to virtual OpenFlow switch.

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

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

U2 - 10.1145/2002396.2002413

DO - 10.1145/2002396.2002413

M3 - Conference contribution

AN - SCOPUS:80051556349

SN - 9781450308212

T3 - Proceedings of the 6th International Conference on Future Internet Technologies, CFI11

SP - 59

EP - 65

BT - Proceedings of the 6th International Conference on Future Internet Technologies, CFI11

ER -