An attacker-defender model for IP-based networks
Loading...
Authors
Barkley, Timothy R.
Subjects
Advisors
Alderson, David L.
Date of Issue
2008-03
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
Abstract
The Internet Protocol (IP) has emerged as the dominant technology for determining how data is routed across the Internet. Because IP flows are defined essentially in terms of origin-destination (O-D) pairs, we represent IP traffic engineering as a multi-commodity flow problem in which each O-D pair is treated as a separate commodity. We account for the diversity in IP routing by modeling opposite extremes of traffic engineering: "naive" traffic engineering where the IP routes data between any two users using only the shortest path between them, and "best case" traffic engineering where IP has the flexibility to route data using multiple paths in the network regardless of their length. We develop linear programming formulations that identify the maximum data flow for an IP network that satisfies proportionality constraints for traffic demand for each case of traffic engineering, and we also determine the optimal interdiction of those flows that reduces that maximum flow in the worst possible way.
Type
Thesis
Description
Series/Report No
Department
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
xiv, 61 p. : ill. ;
Citation
Distribution Statement
Approved for public release; distribution is unlimited.