dc.contributor.author | Busch, Costas | en |
dc.contributor.author | Magdon-Ismail, M. | en |
dc.contributor.author | Mavronicolas, Marios | en |
dc.contributor.author | Wattenhofer, R. | en |
dc.creator | Busch, Costas | en |
dc.creator | Magdon-Ismail, M. | en |
dc.creator | Mavronicolas, Marios | en |
dc.creator | Wattenhofer, R. | en |
dc.date.accessioned | 2019-11-13T10:38:50Z | |
dc.date.available | 2019-11-13T10:38:50Z | |
dc.date.issued | 2004 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53663 | |
dc.description.abstract | In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within poly-logarithmic factors from optimal). Both algorithms are distributed and greedy | en |
dc.description.abstract | so, routing decisions are made locally, and packets are advanced towards their destinations whenever possible. © Springer-Verlag 2004. | en |
dc.source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-35048829948&partnerID=40&md5=581149c436d27311fed2478f6fe76c05 | |
dc.subject | Computers | en |
dc.subject | Artificial intelligence | en |
dc.subject | Poly-logarithmic factors | en |
dc.subject | Hot-potato routing | en |
dc.subject | Hot-potato | en |
dc.subject | Near-optimal | en |
dc.subject | Routing decisions | en |
dc.subject | Routing problems | en |
dc.subject | Tree topology | en |
dc.title | Near-optimal hot-potato routing on trees | en |
dc.type | info:eu-repo/semantics/article | |
dc.description.volume | 3149 | |
dc.description.startingpage | 820 | |
dc.description.endingpage | 827 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Cited By :5</p> | en |
dc.source.abbreviation | Lect. Notes Comput. Sci. | en |
dc.contributor.orcid | Busch, Costas [0000-0002-4381-4333] | |
dc.gnosis.orcid | 0000-0002-4381-4333 | |