Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Towards a logic for wide-area Internet routing
Nick Feamster, Hari Balakrishnan
Computer Science
Center for Information Technology Policy
Center for Statistics & Machine Learning
Research output
:
Contribution to conference
›
Paper
›
peer-review
6
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Towards a logic for wide-area Internet routing'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Routing Protocol
100%
Internet Routing
100%
Inter-domain Routing
50%
Global Reachability
50%
Area Routing
50%
BGP4
50%
Router
25%
Logic Rules
25%
Network Applications
25%
Fast Convergence
25%
Unintended Consequences
25%
Routing Configuration
25%
Distributed Computing
25%
Topological Information
25%
Routing Logic
25%
Policy Language
25%
Computing Task
25%
High-level Policies
25%
Policy Expression
25%
Failure Resilience
25%
Computer Science
Routing Protocol
100%
Interdomain Routing
66%
Fast Convergence
33%
Router Configuration
33%
Distributed Computing
33%
Policy Language
33%
High Level Policy
33%