ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Sharpness, a tight condition for throughput scalability
Full text PdfPdf (136 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing table of contents
Portland, Oregon, USA
SESSION: Brief announcements - track A table of contents
Pages: 346 - 347  
Year of Publication: 2007
ISBN:978-1-59593-616-5
Author
Augustin CHAINTREAU  Thomson, Paris, France
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1281100.1281165
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
F. Baccelli, A. Chaintreau, Z. Liu, and A. Riabov, "The one-to-many TCP overlay: A scalable and reliable multicast architecture," in Proceedings of IEEE INFOCOM, 2005.
2
Richard M. Karp , Raymond E. Miller , Shmuel Winograd, The Organization of Computations for Uniform Recurrence Equations, Journal of the ACM (JACM), v.14 n.3, p.563-590, July 1967  [doi>10.1145/321406.321418]
 
3
F. Baccelli, A. Borovkov, and J. Mairesse, "Asymptotic results on infinite tandem queuing networks," Probability Theory and Related Fields, vol. 118, pp. 365--405, 2000.
 
4
James B. Martin, Large Tandem Queueing Networks with Blocking, Queueing Systems: Theory and Applications, v.41 n.1-2, p.45-72, June 2002  [doi>10.1023/A:1015729701521]
 
5
A. Chaintreau, "Processes of interaction in data networks," Ph.D. dissertation, INRIA-ENS, 2006. {Online}. Available: www.di.ens.fr/~chaintre/research/AugustinChaintreauPhD.pdf
 
6
P. Jelenkovic, P. Momcilovic, and M. S. Squillante, "Buffer scalability of wireless networks," in Proceedings of IEEE INFOCOM, 2006.
7
Cathy H. Xia , Zhen Liu , Don Towsley , Marc Lelarge, Scalability of fork/join queueing networks with blocking, Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, June 12-16, 2007, San Diego, California, USA

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design


General Terms:
Performance, Theory


Keywords:
last-passage percolation, lattice animals, scalability, uniform recurrence equations

Collaborative Colleagues:
Augustin CHAINTREAU: colleagues

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player