Finding a path subject to many additive QoS constraints

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Guoliang Xue Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Arunabha Sen Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Weiyi Zhang Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Jian Tang Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Krishnaiya Thulasiraman School of Computer Science, University of Oklahoma, Norman, OK
Finding a path subject to many additive QoS constraints 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 21
· Downloads (cumulative): 472
· Citation Count: 22

Published in:
· Journal
IEEE/ACM Transactions on Networking (TON) archive
Volume 15 Issue 1, February 2007
Pages 201-211
IEEE Press Piscataway, NJ, USA
table of contents doi>10.1109/TNET.2006.890089

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