Optimal Algorithms for Packet Routing on Trees

Symvonis, A

dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:42:25Z
dc.date.available	2014-03-01T01:42:25Z
dc.date.issued	1994	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/23820
dc.subject	Optimal Algorithm	en
dc.subject	Packet Routing	en
dc.title	Optimal Algorithms for Packet Routing on Trees	en
heal.type	journalArticle	en
heal.publicationDate	1994	en
heal.abstract	In this paper, we study the permutation packet routing problem on trees.We show that every permutation can be routed on a tree of n vertices in n \Gamma1 routing steps. We provide an algorithm which produces in O(n2) time aschedule that needs O(n2) bits for its description. Moreover, we describe anon-line algorithm that completes the routing of any permutation in	en