Near-optimal hot-potato routing on trees

被引：0
|
作者：
Busch, C [1 ]
Magdon-Ismail, M
Mavronicolas, M
Wattenhofer, R
机构：
[1] Rensselaer Polytech Inst, Troy, NY 12180 USA
[2] Univ Cyprus, CY-1678 Nicosia, Cyprus
[3] ETH, CH-8092 Zurich, Switzerland
来源：
EURO-PAR 2004 PARALLEL PROCESSING, PROCEEDINGS | 2004年 / 3149卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within poly-logarithmic factors from optimal). Both algorithms are distributed and greedy; so, routing decisions are made locally, and packets are advanced towards their destinations whenever possible.
引用
收藏
页码：820 / 827
页数：8
相关论文
共 50 条
  • [1] Randomized greedy hot-potato routing
    Busch, C
    Herlihy, M
    Wattenhofer, R
    [J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 458 - 466
  • [2] HOT-POTATO ALGORITHMS FOR PERMUTATION ROUTING
    NEWMAN, I
    SCHUSTER, A
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (11) : 1168 - 1176
  • [3] Greedy dynamic hot-potato routing on arrays
    Caragiannis, I
    Kaklamanis, C
    Vergados, I
    [J]. I-SPAN 2000: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES ALGORITHMS AND NETWORKS, PROCEEDINGS, 2000, : 178 - 185
  • [4] A Fast-Convergence Routing of the Hot-Potato
    Luttringer, Jean-Romain
    Bramas, Quentin
    Pelsser, Cristel
    Merindol, Pascal
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021), 2021,
  • [5] Hot-potato routing using neural networks
    Nezu, N
    [J]. PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 977 - 980
  • [6] Potential function analysis of greedy hot-potato routing
    BenDor, A
    Halevi, S
    Schuster, A
    [J]. THEORY OF COMPUTING SYSTEMS, 1998, 31 (01) : 41 - 61
  • [7] Hot-potato routing algorithms for sparse optical torus
    Honkanen, R
    Leppänen, V
    Penttonen, M
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS, 2001, : 302 - 307
  • [8] Randomized single-target hot-potato routing
    BenAroya, I
    Newman, I
    Schuster, A
    [J]. JOURNAL OF ALGORITHMS, 1997, 23 (01) : 101 - 120
  • [9] A BGP solver for hot-potato routing sensitivity analysis
    Quoitin, B
    Tandel, S
    [J]. EUNICE 2005: NETWORKS AND APPLICATIONS TOWARDS A UBIQUITOUSLY CONNECTED WORLD, 2006, 196 : 75 - +
  • [10] Hot-potato routing on multi-dimensional tori
    aufderHeide, FM
    Westermann, M
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 209 - 221
12345