A general approach to dynamic packet routing with bounded buffers
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Adversarial queueing theoryPublished by Association for Computing Machinery (ACM) ,1996
- Dynamic deflection routing on arrays (preliminary version)Published by Association for Computing Machinery (ACM) ,1996
- Bounding delays in packet-routing networksPublished by Association for Computing Machinery (ACM) ,1995
- The efficiency of greedy routing in hypercubes and butterfliesIEEE Transactions on Communications, 1994
- Bounds on the greedy routing algorithm for array networksPublished by Association for Computing Machinery (ACM) ,1994
- Simple algorithms for routing on butterfly networks with bounded queuesPublished by Association for Computing Machinery (ACM) ,1992
- Average case analysis of greedy routing algorithms on arraysPublished by Association for Computing Machinery (ACM) ,1990
- How to emulate shared memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Efficient Schemes for Parallel CommunicationJournal of the ACM, 1984