Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10693
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pavlidou, Ioannis Gragopoulos | en |
dc.contributor.author | Evangelos Papapetrou | en |
dc.contributor.author | Fotini-Niovi | en |
dc.date.accessioned | 2015-11-24T17:00:01Z | - |
dc.date.available | 2015-11-24T17:00:01Z | - |
dc.identifier.issn | 0924-8625 | - |
dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10693 | - |
dc.rights | Default Licence | - |
dc.title | Performance study of adaptive routing algorithms for LEO satellite constellations under Self-Similar and Poisson traffic | en |
heal.type | journalArticle | - |
heal.type.en | Journal article | en |
heal.type.el | Άρθρο Περιοδικού | el |
heal.language | en | - |
heal.access | campus | - |
heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
heal.publicationDate | 2000 | - |
heal.abstract | A comparative study of routing techniques is carried out on complicated LEO constellations interconnecting high speed terrestrial networks. Shortest path routing as well as optimal routing (flow deviation) methods are applied for balanced and unbalanced traffic load and for uniform and non uniform distribution of the earth stations. The performance of flow deviation method is proved to be very successful even for these big networks after a modification of the algorithm regarding the selection of the number of paths we work with. It is proved that a k-paths flow deviation method is always easy to obtain and gives robust results at a very affordable algorithmic complexity. | en |
heal.journalName | Space Comms. | en |
heal.journalType | peer reviewed | - |
heal.fullTextAvailability | TRUE | - |
Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
papapetrou-1999-Performance Study of Routing Algorithms for.pdf | 108.21 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License