Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Practical Genetic Algorithms with CD-ROM
Practical Genetic Algorithms with CD-ROM
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
Introduction to Genetic Algorithms
Introduction to Genetic Algorithms
Carving research slices out of your production networks with OpenFlow
ACM SIGCOMM Computer Communication Review
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
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.