An asymptotically optimal greedy algorithm for large optical burst switching systems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Lachlan L. H. Andrew The University of Melbourne, Australia
Yuliy Baryshnikov Bell Labs, Lucent Technologies
E. G. Coffman Columbia University
Stephen V. Hanly
Jolyon White
An asymptotically optimal greedy algorithm for large optical burst switching systems Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 323
· Citation Count: 0

Published in:
Cover Image
 
· Newsletter
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003) Homepage archive
Volume 31 Issue 2, September 2003
Pages 14-16
ACM New York, NY, USA
table of contents doi>10.1145/959143.959152

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