Rate vs. buffer size: greedy information gathering on the line

doi:10.1145/1248377.1248430

Rate vs. buffer size: greedy information gathering on the line

Full Text:

Pdf

Buy this Article

Authors:	Adi Rosén	CNRS - LRI, Université Paris Sud, Orsay, France
	Gabriel Scalosub	Technion - Israel Institute of Technology, Haifa, Israel

Published in:

	· Proceeding
	SPAA '07 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
	ACM New York, NY, USA ©2007 table of contents ISBN: 978-1-59593-667-7 doi>10.1145/1248377.1248430

	2007 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 9 · Citation Count: 2

Tools and Resources

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

Tags: algorithms buffer management competitive analysis competitive network throughput information gathering network problems online algorithms packet-switching networks performance routing and layout sequencing and scheduling store and forward networks theory

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

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player