Evolutionary Programming in a Distributed Packet Scheduling Architecture

Min Song, Sachin Shetty, Weiying Zhu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a distributed scheduling architecture for a multi-service routing switch, based on evolutionary algorithms to solve a multi-objective optimization problem. The aim of the two-level scheduler is to ensure better quality of service for individual flows and achieve near 100% throughput with minimal delay at the switch level under uniform traffic conditions. It is shown that Evolutionary Algorithm provides an efficient scheduling mechanism, because the decision-making is dependent on the real traffic conditions. Simulation results show the performance of the distributed evolutionary scheduler is much better than the conventional fair queuing schemes and efficiently integrates flow and switch level scheduling. The scheduling scheme is simple to design and fairly inexpensive when implemented using FPGA technology.

Original languageEnglish
Title of host publication16th International Conference on Computer Applications in Industry and Engineering 2003, CAINE 2003
EditorsKendall E. Nygard
Pages230-233
Number of pages4
ISBN (Electronic)9781618395368
StatePublished - 2003
Event16th International Conference on Computer Applications in Industry and Engineering, CAINE 2003 - Las Vegas, United States
Duration: 11 Nov 200313 Nov 2003

Publication series

Name16th International Conference on Computer Applications in Industry and Engineering 2003, CAINE 2003

Conference

Conference16th International Conference on Computer Applications in Industry and Engineering, CAINE 2003
Country/TerritoryUnited States
CityLas Vegas
Period11/11/0313/11/03

Keywords

  • Evolutionary programming
  • network measurements
  • packet switches
  • simulations

Fingerprint

Dive into the research topics of 'Evolutionary Programming in a Distributed Packet Scheduling Architecture'. Together they form a unique fingerprint.

Cite this