SIGN IN
SIGN UP
An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks
Full Text:
Pdf
Buy this Article
Authors:
Kalyan Kuppuswamy
Qualcomm Inc., San Diego, CA and Department of Electrical Engineering, University of Southern California, Los Angeles
Daniel C. Lee
School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada
Published in:
· Journal
IEEE/ACM Transactions on Networking (TON)
archive
Volume 17 Issue 2, April 2009
IEEE Press
Piscataway, NJ
, USA
table of contents
doi>
10.1109/TNET.2008.2001465
2009 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 43
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation
blocking probability
design
high-speed
knapsack approximation
loss networks
multiclass fixed-point approximation
optical wdm networks
performance
performance evaluation
routing protocols
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder