| | |
| | |
Stat |
Members: 3645 Articles: 2'504'928 Articles rated: 2609
25 April 2024 |
|
| | | |
|
Article overview
| |
|
Information Monitoring in Routing Networks | David Burstein
; Franklin Kenter
; Jeremy Kun
; Feng Shi
; | Date: |
18 Jul 2015 | Abstract: | Despite the large effort devoted to cybersecurity research over the last
decades, cyber intrusions and attacks are still increasing, constantly
challenging the design of the current system. The increasingly frequent events
of BGP (Border Gateway Protocol) route hijacking have brought the topic of
traffic interception into attention. While numerous edits and improvements are
proposed for BGP, a theoretical understanding of the fundamental design of this
system is missing. Here we define and analyze an abstract model of information
monitoring in routing networks. Specifically, we study algorithms that measure
the potential of groups of dishonest agents to divert traffic through their
infrastructure under the constraint that messages must reach their intended
destinations. We relate two variants of our model based on the allowed kinds of
lies, define strategies for colluding agents, and prove optimality in special
cases. In our main theorem we derive a provably optimal monitoring strategy for
subsets of agents in which no two are adjacent, and we extend this strategy to
the general case. Finally, we use our results to analyze the susceptibility of
real and synthetic networks to endogenous information monitoring. In the
Autonomous Systems (AS) graph of the United States, we show that compromising
only 18 random nodes in the AS graph surprisingly captures 10\% of all traffic
of the network in expectation. | Source: | arXiv, 1507.5206 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |