dc.contributor.author |
Pantziou, G |
en |
dc.contributor.author |
Roberts, A |
en |
dc.contributor.author |
Symvonis, A |
en |
dc.date.accessioned |
2014-03-01T02:48:22Z |
|
dc.date.available |
2014-03-01T02:48:22Z |
|
dc.date.issued |
1996 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/33765 |
|
dc.subject |
Dynamic Routing |
en |
dc.subject |
Natural Extension |
en |
dc.subject |
On-line Algorithm |
en |
dc.title |
Dynamic Tree Routing under the ``Matching with Consumption'' Model |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1007/BFb0009504 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1007/BFb0009504 |
en |
heal.publicationDate |
1996 |
en |
heal.abstract |
. In this paper we consider dynamic routing on trees under the "matching with consumption"routing model, a natural extension of the matching routing model introduced by Alon, Chung and Graham[1, 2], which allows for the consumption of packets when they reach their destination. We present anasymptotically optimal on-line algorithm that routes k packets to their destination within d(k \Gamma 1) |
en |
heal.journalName |
International Symposium on Algorithms and Computation |
en |
dc.identifier.doi |
10.1007/BFb0009504 |
en |