SIGN IN
SIGN UP
Compact policy routing
Full Text:
PDF
Buy this Article
Authors:
Gábor Rétvári
Budapest University of Technology and Economics, Budapest, Hungary
András Gulyás
Budapest University of Technology and Economics, Budapest, Hungary
Zalán Heszberger
Budapest University of Technology and Economics, Budapest, Hungary
Márton Csernai
Budapest University of Technology and Economics, Budapest, Hungary
József J. Bíró
Budapest University of Technology and Economics, Budapest, Hungary
2011 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 38
· Downloads (cumulative): 107
· Citation Count: 0
Published in:
· Proceeding
PODC '11
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Pages 149-158
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0719-2
doi>
10.1145/1993806.1993828
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
compact routing
packet-switching networks
policy routing
routing algebras
routing and layout
store and forward networks
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