Universal stability results for greedy contention-resolution protocols
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A general approach to dynamic packet routing with bounded buffersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Greedy Dynamic Routing on ArraysJournal of Algorithms, 1998
- Distributed packet switching in arbitrary networksPublished by Association for Computing Machinery (ACM) ,1996
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- Bounds on the greedy routing algorithm for array networksPublished by Association for Computing Machinery (ACM) ,1994
- A calculus for network delay. II. Network analysisIEEE Transactions on Information Theory, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Graph minors. IV. Tree-width and well-quasi-orderingJournal of Combinatorial Theory, Series B, 1990
- Average case analysis of greedy routing algorithms on arraysPublished by Association for Computing Machinery (ACM) ,1990
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986