Nettle: Taking the sting out of programming network routers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6539 LNCS, Issue , 2011, Pages 235-249

  Voellmy, Andreas ^a   Hudak, Paul ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE ABSTRACTION; DOMAIN SPECIFIC LANGUAGES; ERROR PRONES; HASKELL; NETWORK CONTROL; NETWORK ROUTERS; NON-TRIVIAL; REACTIVE PROGRAMMING; FUNCTIONAL REACTIVE PROGRAMMING; OPENFLOW NETWORKS; OPENFLOW SWITCHES;

FUNCTIONAL PROGRAMMING; PROBLEM ORIENTED LANGUAGES; COMPUTER PROGRAMMING LANGUAGES;

ROUTERS;

EID: 79551600395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18378-2_19     Document Type: Conference Paper

References (16)

1. http://www.openflowswitch.org/
2. http://noxrepo.org/wp/
3. Caesar, M., Rexford, J.: BGP routing policies in ISP networks. IEEE Network 19(6), 5-11 (2005) (Pubitemid 46444788)
4. Elliott, C., Hudak, P.: Functional reactive animation. In: International Conference on Functional Programming, pp. 263-273 (June 1997)
5. Foster, N., Harrison, R., Meola, M.L., Freedman, M.J., Rexford, J., Walker, D.: Frenetic: A high-level langauge for openflow networks. In: ACM Workshop on Programmable Routers for Extensible Services of Tomorrow (PRESTO) (November 2010)
6. Griffin, T.G., Jaggard, A.D., Ramachandran, V.: Design principles of policy languages for path vector protocols. In: SIGCOMM 2003: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. pp. 61-72. ACM, New York(2003)
7. Hinrichs, T.L., Gude, N.S., Casado, M., Mitchell, J.C., Shenker, S.: Practical declarative network management. In: WREN 2009: Proceedings of the 1st ACM Workshop on Research on Enterprise Networking, pp. 1-10. ACM, New York (2009)
8. Hudak, P., Courtney, A., Nilsson, H., Peterson, J.: Robots, arrows, and functional reactive programming. In: Jeuring, J., Jones, S.L.P. (eds.) AFP 2002. LNCS, vol. 2638. Springer, Heidelberg (2003)
9. Hughes, J.: Generalising monads to arrows. Sci. Comput. Program. 37(1-3), 67-111 (2000)
10. Loo, B.T., Hellerstein, J.M., Stoica, I., Ramakrishnan, R.: Declarative routing: extensible routing with declarative queries. In: SIGCOMM 2005: Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 289-300. ACM, New York (2005)
11. Mahajan, R., Wetherall, D., Anderson, T.: Understanding BGP misconfiguration. In: SIGCOMM, Pittsburgh, PA, pp. 3-17 (August 2002)
12. Paterson, R.: A new notation for arrows. In: ICFP 2001: Proceedings of the sixth ACM SIGPLAN International Conference on Functional Programming, pp. 229-240. ACM, New York (2001)
13. Peterson, J., Hager, G., Hudak, P.: A language for declarative robotic programming. In: International Conference on Robotics and Automation (1999)
14. Ramachandran, V.: Foundations of Inter-Domain Routing. Ph.D. thesis, Yale University (May 2005)
15. Voellmy, A., Agarwal, A., Hudak, P., Feamster, N., Burnett, S., Launchbury, J.: Don't configure the network, program it! domain-specific programming languages for network systems. Tech. Rep. YALEU/DCS/RR-1432, Yale University (July 2010)
16. Voellmy, A., Hudak, P.: Nettle: A language for configuring routing networks. In: Taha, W.M. (ed.) DSL 2009. LNCS, vol. 5658, pp. 211-235. Springer, Heidelberg (2009)