Universal-stability results and performance bounds for greedy contention-resolution protocols

Full Text:

PDF

PDF

Buy this Article

Buy this Article

Authors:	Matthew Andrews	Bell Labs, Lucent Technologies, Murray Hill, NJ
	Baruch Awerbuch	Johns Hopkins Univ., Baltimore, MD
	Antonio Fernández	Massachusetts Institute of Technology, Cambridge
	Tom Leighton	Massachusetts Institute of Technology, Cambridge
	Zhiyong Liu	Massachusetts Institute of Technology, Cambridge
	Jon Kleinberg	Cornell Univ., Ithaca, NY

	2001 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 17 · Downloads (cumulative): 801 · Citation Count: 60

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 48 Issue 1, Jan. 2001
Pages 39-69
ACM New York, NY, USA
table of contents doi>10.1145/363647.363677

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: adversarial queuing theory algorithms end-to-end delay network stability packet scheduling packet-switching networks sequencing and scheduling store and forward networks theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Windows Media Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder