Show simple item record

dc.contributor.authorPitsillides, Andreasen
dc.contributor.authorStylianou, Georgiosen
dc.contributor.authorPattichis, Constantinos S.en
dc.contributor.authorSekercioglu, Y. Ahmeten
dc.contributor.authorVasilakos, Athanasios V.en
dc.creatorPitsillides, Andreasen
dc.creatorStylianou, Georgiosen
dc.creatorPattichis, Constantinos S.en
dc.creatorSekercioglu, Y. Ahmeten
dc.creatorVasilakos, Athanasios V.en
dc.description.abstractWe investigate the performance of a classical constrained optimization (CCO) algorithm and a constrained optimization Genetic Algorithm (GA) for solving the Bandwidth Allocation for Virtual Paths (BAVP) problem. We compare throughput, fairness and time complexity of GA-BAVP and CCO-BAVP for several node topologies. The results on maximizing the throughput obtained with GA-BAVP and CCO-BAVP are in close agreement, however when considering fairness GA-BAVP outperforms CCO-BAVP, especially for more complex topologies, like the 7-node network, without abundant link capacity. Convergence of the two algorithms appears similar, with GA-BAVP outperforming CCO-BAVP in initial stages, and vice-versa for longer time scales. However as the problem complexity increases the solution time for the Genetic Algorithm does not increase as fast as the classical constrained optimization algorithm. A hybrid scheme is also introduced, combining the benefits of both algorithms. It exhibited better overall convergence rate but the same solution as CCO-BAVP.en
dc.sourceProceedings - IEEE INFOCOMen
dc.source19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications'en
dc.subjectGenetic algorithmsen
dc.subjectComputational complexityen
dc.subjectConvergence of numerical methodsen
dc.subjectFrequency allocationen
dc.subjectVoice/data communication systemsen
dc.subjectBandwidth allocation for virtual paths (BAVP)en
dc.subjectClassical constrained optimization (CCO) algorithmen
dc.subjectConstrained optimization genetic algorithmen
dc.titleBandwidth Allocation for Virtual Paths (BAVP): Investigation of performance of classical constrained and genetic algorithm based optimization techniquesen
dc.description.endingpage1510 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: IEEEen
dc.description.notesConference code: 56703en
dc.description.notesCited By :24</p>en
dc.contributor.orcidPitsillides, Andreas [0000-0001-5072-2851]
dc.contributor.orcidPattichis, Constantinos S. [0000-0003-1271-8151]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record