SIGN IN
SIGN UP
Bounding delays in packet-routing networks
Full Text:
PDF
Buy this Article
Authors:
Mor Harchol-Balter
Computer Science Division, University of California at Berkeley, Berkeley, California
David Wolfe
Computer Science Division, University of California at Berkeley, Berkeley, California
Published in:
· Proceeding
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Pages 248-257
ACM
New York, NY
, USA
©1995
table of contents
ISBN:0-89791-718-9
doi>
10.1145/225058.225133
1995 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 227
· Citation Count: 19
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
network problems
packet-switching networks
performance
probabilistic algorithms
routing and layout
theory
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