Queueing analysis of oblivious packet-routing networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Mor Harchol-Balter Computer Science Division, UC Berkeley, CA
Paul E. Black Computer Science Division, UC Berkeley, CA
Published in:
· Proceeding
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Pages 583-592
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1994
table of contents ISBN:0-89871-329-3
Queueing analysis of oblivious packet-routing networks 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 8
· Downloads (cumulative): 235
· Citation Count: 16


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder