On security-aware transmission scheduling

Ting He, Ameya Agaskar, Lang Tong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

The problem of interest is to characterize to what extent nodes independently following certain transmission schedules can be hijacked to relay flows of information packets. Information flows can be embedded in given transmission schedules by properly adding delays and inserting dummy packets. Such hidden flows are usually indicators of network intrusion, and it is of interest to know their rates. The maximum rate of information flow that can be transmitted without causing the transmission activities to deviate from given transmission schedules is used to measure the covert capacity under these schedules. Based on the assumption that information flows have bounded delays, a theoretical framework is constructed to quantitively analyze the covert capacity under transmission schedules modeled by renewal processes. Explicit solution is obtained for Poisson processes. The results suggest a close correlation between the covert capacity and the traffic burstiness.

Original languageEnglish (US)
Title of host publication2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Pages1681-1684
Number of pages4
DOIs
StatePublished - Sep 16 2008
Event2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP - Las Vegas, NV, United States
Duration: Mar 31 2008Apr 4 2008

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
CountryUnited States
CityLas Vegas, NV
Period3/31/084/4/08

Fingerprint

Scheduling

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

He, T., Agaskar, A., & Tong, L. (2008). On security-aware transmission scheduling. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP (pp. 1681-1684). [4517951] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2008.4517951
He, Ting ; Agaskar, Ameya ; Tong, Lang. / On security-aware transmission scheduling. 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. pp. 1681-1684 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).
@inproceedings{bd685c7fb43b4e81a3df98ab0a52b780,
title = "On security-aware transmission scheduling",
abstract = "The problem of interest is to characterize to what extent nodes independently following certain transmission schedules can be hijacked to relay flows of information packets. Information flows can be embedded in given transmission schedules by properly adding delays and inserting dummy packets. Such hidden flows are usually indicators of network intrusion, and it is of interest to know their rates. The maximum rate of information flow that can be transmitted without causing the transmission activities to deviate from given transmission schedules is used to measure the covert capacity under these schedules. Based on the assumption that information flows have bounded delays, a theoretical framework is constructed to quantitively analyze the covert capacity under transmission schedules modeled by renewal processes. Explicit solution is obtained for Poisson processes. The results suggest a close correlation between the covert capacity and the traffic burstiness.",
author = "Ting He and Ameya Agaskar and Lang Tong",
year = "2008",
month = "9",
day = "16",
doi = "10.1109/ICASSP.2008.4517951",
language = "English (US)",
isbn = "1424414849",
series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
pages = "1681--1684",
booktitle = "2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP",

}

He, T, Agaskar, A & Tong, L 2008, On security-aware transmission scheduling. in 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP., 4517951, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, pp. 1681-1684, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, Las Vegas, NV, United States, 3/31/08. https://doi.org/10.1109/ICASSP.2008.4517951

On security-aware transmission scheduling. / He, Ting; Agaskar, Ameya; Tong, Lang.

2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. p. 1681-1684 4517951 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - On security-aware transmission scheduling

AU - He, Ting

AU - Agaskar, Ameya

AU - Tong, Lang

PY - 2008/9/16

Y1 - 2008/9/16

N2 - The problem of interest is to characterize to what extent nodes independently following certain transmission schedules can be hijacked to relay flows of information packets. Information flows can be embedded in given transmission schedules by properly adding delays and inserting dummy packets. Such hidden flows are usually indicators of network intrusion, and it is of interest to know their rates. The maximum rate of information flow that can be transmitted without causing the transmission activities to deviate from given transmission schedules is used to measure the covert capacity under these schedules. Based on the assumption that information flows have bounded delays, a theoretical framework is constructed to quantitively analyze the covert capacity under transmission schedules modeled by renewal processes. Explicit solution is obtained for Poisson processes. The results suggest a close correlation between the covert capacity and the traffic burstiness.

AB - The problem of interest is to characterize to what extent nodes independently following certain transmission schedules can be hijacked to relay flows of information packets. Information flows can be embedded in given transmission schedules by properly adding delays and inserting dummy packets. Such hidden flows are usually indicators of network intrusion, and it is of interest to know their rates. The maximum rate of information flow that can be transmitted without causing the transmission activities to deviate from given transmission schedules is used to measure the covert capacity under these schedules. Based on the assumption that information flows have bounded delays, a theoretical framework is constructed to quantitively analyze the covert capacity under transmission schedules modeled by renewal processes. Explicit solution is obtained for Poisson processes. The results suggest a close correlation between the covert capacity and the traffic burstiness.

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

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

U2 - 10.1109/ICASSP.2008.4517951

DO - 10.1109/ICASSP.2008.4517951

M3 - Conference contribution

SN - 1424414849

SN - 9781424414840

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 1681

EP - 1684

BT - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP

ER -

He T, Agaskar A, Tong L. On security-aware transmission scheduling. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. p. 1681-1684. 4517951. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2008.4517951