Toward Optimal Adaptive Online Shortest Path Routing With Acceleration Under Jamming Attack

Pan Zhou, Jie Xu, Wei Wang, Yuchong Hu, Dapeng Oliver Wu, Shouling Ji

Research output: Contribution to journalArticle

Abstract

We consider the online shortest path routing (SPR) of a network with stochastically time varying link states under potential adversarial attacks. Due to the denial of service (DoS) attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any a priori, designing an adaptive and optimal DoS-proof SPR protocol to thwart all possible adversarial attacks is a very challenging issue. In this paper, we present the first such integral solution based on the multi-armed bandit (MAB) theory, where jamming is the adversarial strategy. By introducing a novel control parameter into the exploration phase for each link, a martingale inequality is applied in our formulated combinatorial adversarial MAB framework. The proposed algorithm could automatically detect the specific jammed and un-jammed links within a unified framework. As a result, the adaptive online SPR strategies with near-optimal learning performance in all possible regimes are obtained. Moreover, we propose the accelerated algorithms by multi-path route probing and cooperative learning among multiple sources, and study their implementation issues. Comparing to existing works, our algorithm has the respective 30.3% and 87.1% improvements of network delay for oblivious jamming and adaptive jamming given a typical learning period and a 81.5% improvement of learning duration under a specified network delay on average, while it enjoys almost the same performance without jamming. Lastly, the accelerated algorithms can achieve a maximal of 150.2% improvement in network delay and a 431.3% improvement in learning duration.

Original languageEnglish (US)
JournalIEEE/ACM Transactions on Networking
DOIs
StateAccepted/In press - Jan 1 2019

Fingerprint

Jamming
Routing protocols

Keywords

  • Acceleration
  • Adaptive systems
  • Delays
  • Jamming
  • jamming attack
  • multi-armed bandits
  • online learning
  • Protocols
  • Routing
  • Shortest path routing
  • Stochastic processes
  • wireless networks.

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Toward Optimal Adaptive Online Shortest Path Routing With Acceleration Under Jamming Attack. / Zhou, Pan; Xu, Jie; Wang, Wei; Hu, Yuchong; Wu, Dapeng Oliver; Ji, Shouling.

In: IEEE/ACM Transactions on Networking, 01.01.2019.

Research output: Contribution to journalArticle

@article{e14fdfe9a2ba452ea3e80ef8208addf5,
title = "Toward Optimal Adaptive Online Shortest Path Routing With Acceleration Under Jamming Attack",
abstract = "We consider the online shortest path routing (SPR) of a network with stochastically time varying link states under potential adversarial attacks. Due to the denial of service (DoS) attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any a priori, designing an adaptive and optimal DoS-proof SPR protocol to thwart all possible adversarial attacks is a very challenging issue. In this paper, we present the first such integral solution based on the multi-armed bandit (MAB) theory, where jamming is the adversarial strategy. By introducing a novel control parameter into the exploration phase for each link, a martingale inequality is applied in our formulated combinatorial adversarial MAB framework. The proposed algorithm could automatically detect the specific jammed and un-jammed links within a unified framework. As a result, the adaptive online SPR strategies with near-optimal learning performance in all possible regimes are obtained. Moreover, we propose the accelerated algorithms by multi-path route probing and cooperative learning among multiple sources, and study their implementation issues. Comparing to existing works, our algorithm has the respective 30.3{\%} and 87.1{\%} improvements of network delay for oblivious jamming and adaptive jamming given a typical learning period and a 81.5{\%} improvement of learning duration under a specified network delay on average, while it enjoys almost the same performance without jamming. Lastly, the accelerated algorithms can achieve a maximal of 150.2{\%} improvement in network delay and a 431.3{\%} improvement in learning duration.",
keywords = "Acceleration, Adaptive systems, Delays, Jamming, jamming attack, multi-armed bandits, online learning, Protocols, Routing, Shortest path routing, Stochastic processes, wireless networks.",
author = "Pan Zhou and Jie Xu and Wei Wang and Yuchong Hu and Wu, {Dapeng Oliver} and Shouling Ji",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/TNET.2019.2930464",
language = "English (US)",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Toward Optimal Adaptive Online Shortest Path Routing With Acceleration Under Jamming Attack

AU - Zhou, Pan

AU - Xu, Jie

AU - Wang, Wei

AU - Hu, Yuchong

AU - Wu, Dapeng Oliver

AU - Ji, Shouling

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We consider the online shortest path routing (SPR) of a network with stochastically time varying link states under potential adversarial attacks. Due to the denial of service (DoS) attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any a priori, designing an adaptive and optimal DoS-proof SPR protocol to thwart all possible adversarial attacks is a very challenging issue. In this paper, we present the first such integral solution based on the multi-armed bandit (MAB) theory, where jamming is the adversarial strategy. By introducing a novel control parameter into the exploration phase for each link, a martingale inequality is applied in our formulated combinatorial adversarial MAB framework. The proposed algorithm could automatically detect the specific jammed and un-jammed links within a unified framework. As a result, the adaptive online SPR strategies with near-optimal learning performance in all possible regimes are obtained. Moreover, we propose the accelerated algorithms by multi-path route probing and cooperative learning among multiple sources, and study their implementation issues. Comparing to existing works, our algorithm has the respective 30.3% and 87.1% improvements of network delay for oblivious jamming and adaptive jamming given a typical learning period and a 81.5% improvement of learning duration under a specified network delay on average, while it enjoys almost the same performance without jamming. Lastly, the accelerated algorithms can achieve a maximal of 150.2% improvement in network delay and a 431.3% improvement in learning duration.

AB - We consider the online shortest path routing (SPR) of a network with stochastically time varying link states under potential adversarial attacks. Due to the denial of service (DoS) attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any a priori, designing an adaptive and optimal DoS-proof SPR protocol to thwart all possible adversarial attacks is a very challenging issue. In this paper, we present the first such integral solution based on the multi-armed bandit (MAB) theory, where jamming is the adversarial strategy. By introducing a novel control parameter into the exploration phase for each link, a martingale inequality is applied in our formulated combinatorial adversarial MAB framework. The proposed algorithm could automatically detect the specific jammed and un-jammed links within a unified framework. As a result, the adaptive online SPR strategies with near-optimal learning performance in all possible regimes are obtained. Moreover, we propose the accelerated algorithms by multi-path route probing and cooperative learning among multiple sources, and study their implementation issues. Comparing to existing works, our algorithm has the respective 30.3% and 87.1% improvements of network delay for oblivious jamming and adaptive jamming given a typical learning period and a 81.5% improvement of learning duration under a specified network delay on average, while it enjoys almost the same performance without jamming. Lastly, the accelerated algorithms can achieve a maximal of 150.2% improvement in network delay and a 431.3% improvement in learning duration.

KW - Acceleration

KW - Adaptive systems

KW - Delays

KW - Jamming

KW - jamming attack

KW - multi-armed bandits

KW - online learning

KW - Protocols

KW - Routing

KW - Shortest path routing

KW - Stochastic processes

KW - wireless networks.

UR - http://www.scopus.com/inward/record.url?scp=85071851046&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85071851046&partnerID=8YFLogxK

U2 - 10.1109/TNET.2019.2930464

DO - 10.1109/TNET.2019.2930464

M3 - Article

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

ER -