SIGN IN
SIGN UP
A model of configuration languages for routing protocols
Full Text:
Pdf
SIGN IN to get this Article
Authors:
Philip J. Taylor
University of Cambridge, Cambridge, United Kingdom
Timothy G. Griffin
University of Cambridge, Cambridge, United Kingdom
Published in:
· Proceeding
PRESTO '09
Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow
Pages 55-60
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-446-1
doi>
10.1145/1592631.1592645
2009 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 16
· Downloads (cumulative): 78
· Citation Count: 1
Tools and Resources
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGCOMM'13
Share:
|
Tags:
graph algorithms
languages
routing algebra
routing protocol configuration
routing protocols
theory
verification
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