dc.contributor.author |
Saltouros, M |
en |
dc.contributor.author |
Markaki, M |
en |
dc.contributor.author |
Taskaris, A |
en |
dc.contributor.author |
Theologou, M |
en |
dc.contributor.author |
Venieris, I |
en |
dc.date.accessioned |
2014-03-01T02:48:49Z |
|
dc.date.available |
2014-03-01T02:48:49Z |
|
dc.date.issued |
2000 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/34114 |
|
dc.subject |
Cost Function |
en |
dc.subject |
Fitness Cost |
en |
dc.subject |
Genetic Algorithm |
en |
dc.subject |
Load Balance |
en |
dc.subject |
Route Selection |
en |
dc.subject |
Routing Algorithm |
en |
dc.subject |
Time Varying |
en |
dc.title |
A New Route Selection Approach Using Scaling Techniques: An Application to Hierarchical QoS-Based Routing |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1109/LCN.2000.891118 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/LCN.2000.891118 |
en |
heal.publicationDate |
2000 |
en |
heal.abstract |
In this short paper an approach to the ATM hierarchical (PNNI) routing issue is presented based on a simple algorithm that chooses a route for a connection request out of a predefined list of possible routes between a specific source-destination pair in a probabilistic way. A route fitness (cost) function is used to assign selection probabilities to every candidate path |
en |
heal.journalName |
IEEE Conference on Local Computer Networks |
en |
dc.identifier.doi |
10.1109/LCN.2000.891118 |
en |