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 | |
State | Published - May 2004 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics