Randomized Routing and Sorting on Fixed-Connection Networks

@article{Leighton1994RandomizedRA,
  title={Randomized Routing and Sorting on Fixed-Connection Networks},
  author={Frank Thomson Leighton and Bruce M. Maggs and Abhiram G. Ranade and Satish Rao},
  journal={J. Algorithms},
  year={1994},
  volume={17},
  pages={157-205}
}
This paper presents a general paradigm for the design of packet routing algorithms for xed-connection networks. Its basis is a randomized on-line algorithm for scheduling any set of N packets whose paths have congestion c on any bounded-degree leveled network with depth L in O(c+ L+ logN ) steps, using constant-size queues. In this paradigm, the design of a routing algorithm is broken into three parts: (1) showing that the underlying network can emulate a leveled network, (2) designing a path… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
90 Citations
38 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…