Many-to-Many Routing 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:44:24Z
dc.date.available	2014-03-01T01:44:24Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24358
dc.subject	On-line Algorithm	en
dc.title	Many-to-Many Routing on Trees via Matchings	en
heal.type	journalArticle	en
heal.publicationDate	1996	en
heal.abstract	In this paper we present an extensive study of many-to-many routing on trees under thematching routing model. Our study includes on-line and off-line algorithms. We present anasymptotically optimal on-line algorithm which routes k packets to their destination withind(k \Gamma 1) + d \Delta dist routing steps, where d is the degree of tree T on which the routing takes placeand	en