Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms

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-01T01:51:35Z
dc.date.available	2014-03-01T01:51:35Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26368
dc.subject	Greedy Algorithm	en
dc.subject	Maximum Degree	en
dc.subject	Minimum Distance	en
dc.subject	Packet Routing	en
dc.subject	Potato	en
dc.subject	Upper Bound	en
dc.subject	Lower Bound	en
dc.title	Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms	en
heal.type	journalArticle	en
heal.identifier.primary	10.1093/comjnl/45.4.423	en
heal.identifier.secondary	http://dx.doi.org/10.1093/comjnl/45.4.423	en
heal.publicationDate	2002	en
heal.abstract	In this paper, we consider hot-potato packet routing of one-to-one routing patterns on n-node trees. By applying a 'charging argument', we show that any greedy hot-potato algorithm routes a one- to-one routing pattern within 2(n � 1) steps. On the other hand, a trivial lower bound suggests that at least 3n/2 steps are required by any oblivious greedy algorithm. As	en
heal.journalName	The Computer Journal	en
dc.identifier.doi	10.1093/comjnl/45.4.423	en