Lower bounds for hot-potato permutation routing on trees

Roberts, A; Symvonis, A; Wood, D

dc.contributor.author	Roberts, A	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Wood, D	en
dc.date.accessioned	2014-03-01T02:48:58Z
dc.date.available	2014-03-01T02:48:58Z
dc.date.issued	2000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34179
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/sirocco2000.html#RobertsSW00	en
dc.relation.uri	http://147.102.205.75/~symvonis/publications/conferences/rsw-sirocco00.update.pdf	en
dc.subject	Minimum Distance	en
dc.subject	Packet Routing	en
dc.subject	Permutation Routing	en
dc.subject	Potato	en
dc.subject	Lower Bound	en
dc.title	Lower bounds for hot-potato permutation routing on trees	en
heal.type	conferenceItem	en
heal.publicationDate	2000	en
heal.abstract	In this paper we consider hot-potato packet routing on trees. As a lower bound, for all sufficiently largen we construct a permutation routing problem on an n-node tree for which an oblivious greedy hot-potato algorithm requires at least 2n o n time steps. This lower bound is also valid for the minimum- distance heuristic. Applying the charging argument of Borodin	en
heal.journalName	Colloquium on Structural Information & Communication Complexity	en