Õ(Congestion + Dilation) hot-potato routing on leveled networks

Costas Busch

doi:10.1007/s00224-004-1136-8

Õ(Congestion + Dilation) hot-potato routing on leveled networks

Costas Busch

Research output: Contribution to journal › Article

6 Scopus citations

Abstract

The packet routing problems while sending a set of packets through a path with congestion and dilation are discussed. Hot-potato routing in which nodes are bufferless so the packets may be delayed for more time is also analyzed. In hot-potato method, routing decisions are taken locally at each node while packets are routed in the network. It is found that the hot-potato algorithm is designed and analyzed in terms of congestion and dilation for leveled networks.

Original language	English (US)
Pages (from-to)	371-396
Number of pages	26
Journal	Theory of Computing Systems
Volume	37
Issue number	3
DOIs	https://doi.org/10.1007/s00224-004-1136-8
State	Published - May 2004
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s00224-004-1136-8

Fingerprint Dive into the research topics of 'Õ(Congestion + Dilation) hot-potato routing on leveled networks'. Together they form a unique fingerprint.

Cite this

Busch, C. (2004). Õ(Congestion + Dilation) hot-potato routing on leveled networks. Theory of Computing Systems, 37(3), 371-396. https://doi.org/10.1007/s00224-004-1136-8

@article{34e58dd45f1b44c886fded29d323e2f2,

title = "{\~O}(Congestion + Dilation) hot-potato routing on leveled networks",

abstract = "The packet routing problems while sending a set of packets through a path with congestion and dilation are discussed. Hot-potato routing in which nodes are bufferless so the packets may be delayed for more time is also analyzed. In hot-potato method, routing decisions are taken locally at each node while packets are routed in the network. It is found that the hot-potato algorithm is designed and analyzed in terms of congestion and dilation for leveled networks.",

author = "Costas Busch",

year = "2004",

month = may,

doi = "10.1007/s00224-004-1136-8",

language = "English (US)",

volume = "37",

pages = "371--396",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Õ(Congestion + Dilation) hot-potato routing on leveled networks

AU - Busch, Costas

PY - 2004/5

Y1 - 2004/5

N2 - The packet routing problems while sending a set of packets through a path with congestion and dilation are discussed. Hot-potato routing in which nodes are bufferless so the packets may be delayed for more time is also analyzed. In hot-potato method, routing decisions are taken locally at each node while packets are routed in the network. It is found that the hot-potato algorithm is designed and analyzed in terms of congestion and dilation for leveled networks.

AB - The packet routing problems while sending a set of packets through a path with congestion and dilation are discussed. Hot-potato routing in which nodes are bufferless so the packets may be delayed for more time is also analyzed. In hot-potato method, routing decisions are taken locally at each node while packets are routed in the network. It is found that the hot-potato algorithm is designed and analyzed in terms of congestion and dilation for leveled networks.

UR - http://www.scopus.com/inward/record.url?scp=7444256730&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=7444256730&partnerID=8YFLogxK

U2 - 10.1007/s00224-004-1136-8

DO - 10.1007/s00224-004-1136-8

M3 - Article

AN - SCOPUS:7444256730

VL - 37

SP - 371

EP - 396

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 3

ER -