Practical Intrusion-Tolerant Networks Daniel Obenshain∗ , Thomas Tantillo∗ , Amy Babay, John Schultz, Andrew Newell, Md. Endadul Hoque, Yair Amir, and Cristina Nita-Rotaru Johns Hopkins University — {dano, tantillo

Source URL: www.cnds.jhu.edu

• Computing
• Concurrent computing
• Computer architecture
• Routing algorithms
• Distributed data storage
• Network architecture
• File sharing
• Routing protocols
• Overlay network
• Distributed hash table
• Routing
• Link-state routing protocol

APT: A Practical Transit-Mapping Service Dan Jen, Michael Meisel, Dan Massey, Lan Wang, Beichuan Zhang, and Lixia Zhang Motivation

Source URL: irl.cs.ucla.edu

• Computing
• Network architecture
• Internet
• Routing
• Internet Standards
• Internet protocols
• Computer networking
• Multihoming
• Border Gateway Protocol
• Router
• Network packet

An Industrial-Scale Software Defined Internet Exchange Point Arpit Gupta?, Robert MacDavid?, R¨udiger Birkner†, Marco Canini, Nick Feamster?, Jennifer Rexford?, Laurent Vanbever† ?Princeton University †ETH Z¨ur

Source URL: vanbever.eu

• Computing
• Network architecture
• Internet
• Computer networking
• Routing
• Internet Standards
• Internet protocols
• Border Gateway Protocol
• Forwarding plane
• Software-defined networking
• Router
• Control plane

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 1, FEBRUARYAn Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks

Source URL: disco.ethz.ch

• Routing algorithms
• Wireless networking
• Routing protocols
• Geographic routing
• Routing
• Wireless ad hoc network
• Optimized Link State Routing Protocol
• Destination-Sequenced Distance Vector routing
• Greedy Perimeter Stateless Routing in Wireless Networks
• Shortest path problem
• Flooding
• Link-state routing protocol

11276_2007_45_14_5-web

Source URL: disco.ethz.ch

• Graph theory
• Routing algorithms
• Mathematics
• Computing
• Wireless networking
• Routing protocols
• Network theory
• Edsger W. Dijkstra
• Geographic routing
• Shortest path problem
• Routing
• Unit disk graph

Analysis of a forwarding game without payments George Karakostas McMaster University Abstract—We consider a forwarding game on directed graphs

Source URL: www.cas.mcmaster.ca

• Graph theory
• Mathematics
• Discrete mathematics
• Network flow
• Flow network
• Operations research
• Directed graph
• Nash equilibrium
• Routing
• Networks
• Wireless ad hoc network
• Maximum flow problem

A Heuristic Routing Mechanism Using a New Addressing Scheme M. Ravanbakhsh1, Y. Abbasi-Yadkori1, M. Abbaspour1,3, H. Sarbazi-Azad1,2 1 IPM, School of Computer Science, Tehran, Iran Department of Computer Engineering, Sha

Source URL: webdocs.cs.ualberta.ca

Consistent Updates in Software Defined Networks: On Dependencies, Loop Freedom, and Blackholes Klaus-Tycho F¨orster Ratul Mahajan

Source URL: www.tik.ee.ethz.ch

• Routing algorithms
• Network management
• Computing
• Routing protocols
• Network architecture
• Routing
• Link-state routing protocol
• Routing loop problem
• Temporally ordered routing algorithm
• Wireless Routing Protocol

Selfish routing in the presence of side constraints George Karakostas? and Stavros G. Kolliopoulos?? Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada Abstract. The natural ap

Source URL: www.cas.mcmaster.ca

• Mathematical optimization
• Mathematical analysis
• Analysis
• Operations research
• Partial differential equations
• Game theory
• Price of anarchy
• Mathematics
• Variational inequality
• KarushKuhnTucker conditions
• Route assignment
• Convex optimization

APT: A Practical Tunneling Architecture ∗ for Routing Scalability Dan Jen Michael Meisel

Source URL: fmdb.cs.ucla.edu

• Routing
• Router
• IP forwarding
• Internet Protocol
• Hop
• Locator/Identifier Separation Protocol