Many-to-Many Routings on Trees via Matchings

Pantziou, G; Roberts, A; Symvonis, A

dc.contributor.author	Pantziou, G	en
dc.contributor.author	Roberts, A	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:45:38Z
dc.date.available	2014-03-01T01:45:38Z
dc.date.issued	1997	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24676
dc.subject	Asymptotic Optimality	en
dc.subject	Close Relationships	en
dc.subject	On-line Algorithm	en
dc.subject	Packet Routing	en
dc.subject	Potato	en
dc.title	Many-to-Many Routings on Trees via Matchings	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0304-3975(97)00049-2	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0304-3975(97)00049-2	en
heal.publicationDate	1997	en
heal.abstract	In this paper we present an extensive study of many-to-many routing on trees under the matching routing model. Our study includes on-line and off-line algorithms. We present an asymptotically optimal on-line algorithm which routes k packets to their destination within d(k − 1) + d · dist routing steps, where d is the degree of tree T on which the	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.doi	10.1016/S0304-3975(97)00049-2	en