Preliminary results in routing games

Hespanha, João P.; Bohacek, Stephan

doi:10.1109/acc.2001.946017

Cited by 26 publications

(35 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most related results presented in the literature are [5,17,19,20]. In [17], users send their request either to the server or to the other users rather than directly to the server.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In [17], users send their request either to the server or to the other users rather than directly to the server. In [5], the author first proposed SSR (Security Stochastic Routing), which takes multiple paths with some probability instead of single path routing. In [19,20], the author extends the result in [5] by considering more general attacks.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In [5], the author first proposed SSR (Security Stochastic Routing), which takes multiple paths with some probability instead of single path routing. In [19,20], the author extends the result in [5] by considering more general attacks. However, all these results are based on wired networks, which do not have the interference constraints when scheduling links for transmission.…”

Section: Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

Stochastic Security in Wireless Mesh Networks via Saddle Routing Policy

Wang

2007

International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)

View full text Add to dashboard Cite

The security problem in multihop wireless networks is more severe than that in wired networks since its transmission media is the unprotected air. In this paper, we show how to increase the effective throughput via carefully choosing the multi-path routing for given source and destination nodes, where we call the total packets from the mesh routers to the gateway nodes that are not attacked by an attacker as effective throughput. We assume that the attacker has limited resources for attacking while attacking a node or a link will incur some certain costs. We show that it is NP-hard to find an optimum multipath routing policy even if the attacking strategy is given a prior. We model the problem as a two-player game between the routing policy designer and the attacker and propose a randomized multi-path routing protocol that achieves good effective throughputs under several possible attacking scenarios. More specifically, we theoretically prove that our routing protocols can achieve an effective network throughput (with packets which are not attacked) within a constant factor of the optimum in the worst case. Our theoretic results are confirmed by extensive simulations studies.

show abstract

“…The most related results presented in the literature are [5,17,19,20]. In [17], users send their request either to the server or to the other users rather than directly to the server.…”

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Stochastic Security in Wireless Mesh Networks via Saddle Routing Policy

Wang

2007

International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)

View full text Add to dashboard Cite

show abstract

“…Finding the least-cost path in their problem is analogous to finding a best defense strategy. Hespanha & Bohacek in [30] discussed routing games in which an adversary tries to intersect data packets in a computer network. The designer of the network has to find routing policies that avoid links that are under the attacker's surveillance.…”

Section: Related Workmentioning

confidence: 99%

DSGM-Based Analysis of Computer Networks Security

Alese¹,

Babatunde²,

Israel³

2013

IJISR

View full text Add to dashboard Cite

-The computer game framework is an extension of attack graphs based on game theory. It is used for the anticipation and analysis of intruder and administrator concurrent interactions within the network. Like attack-graph-based model checking, the goal of an anticipation game is to prove that a safety property holds. However, using this kind of game is tedious and error prone on large networks since it is based on the assumption that the analyst has prior and complete knowledge of critical network services. This work presents a non-zero, Deterministic Stochastic Game-theoretic Modeling (DSGM) method for analyzing the security of computer networks. The interaction between an attacker and a defender is viewed as two-player non-zero deterministic game whose model is constructed using a saddle point solution (non-linear program) to compute the value of the game. The probability of possible attack on a network given available attacker strategy or best-response strategies for the attacker and the defender was demonstrated. The simulation of the model was achieved using Java, which is a high level language with object oriented programming capabilities and features. The backend is implemented using MySQL, which is a widely used Relational Database Management System (RDBMS). Selected results of the games played were presented with analysis showing some likely attacker activities and the counter measures from the defender.

show abstract

“…The distributed solution enhances traditional centralized solutions for secure multipath routing such as [4], [6], [18] in different ways. First, it does not require any network node to have full knowledge of the entire network topology.…”

Section: Introductionmentioning

confidence: 99%

Distributed Algorithms for Secure Multipath Routing in Attack-Resistant Networks

Lee

Misra

Rubenstein

2007

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: (1) routing decisions are made locally by network nodes without the centralized information of the entire network topology, (2) routing decisions minimize throughput loss under a single-link attack with respect to different session models, and (3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, both of which provide provably optimal solutions. Experiments show that the Bound-Control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the Lex-Control algorithm further enhances the Bound-Control algorithm by countering severe single-link attacks and various types of multi-link attacks. Moreover, the Lex-Control algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attack-resistant network and analyze how the algorithms address resiliency and security in different network settings.

show abstract

Preliminary results in routing games

Cited by 26 publications

References 9 publications

Stochastic Security in Wireless Mesh Networks via Saddle Routing Policy

Stochastic Security in Wireless Mesh Networks via Saddle Routing Policy

DSGM-Based Analysis of Computer Networks Security

Distributed Algorithms for Secure Multipath Routing in Attack-Resistant Networks

Contact Info

Product

Resources

About