TY - JOUR
T1 - Õ(Congestion + Dilation) hot-potato routing on leveled networks
AU - Busch, Costas
N1 - Funding Information:
ings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pages 20–29, Winnipeg, Manitoba, Canada, August 2002. This research was supported from research funds of the Rensselaer Polytechnic Institute.
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 -