Bayonet: Probabilistic inference for networks

Timon Gehr, Sasa Misailovic, Petar Tsankov, Laurent Vanbever, Pascal Wiesmann, Martin Vechev

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

Abstract

Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for probabilistic networks and an automated procedure for answering probabilistic inference queries. We present Bayonet, a novel approach that consists of: (i) a probabilistic network programming language and (ii) a system that performs probabilistic inference on Bayonet programs. The key insight behind Bayonet is to phrase the problem of probabilistic network reasoning as inference in existing probabilistic languages. As a result, Bayonet directly leverages existing probabilistic inference systems and offers a flexible and expressive interface to operators. We present a detailed evaluation of Bayonet on common network scenarios, such as network congestion, reliability of packet delivery, and others. Our results indicate that Bayonet can express such practical scenarios and answer queries for realistic topology sizes (with up to 30 nodes).

Original languageEnglish (US)
Title of host publicationPLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation
EditorsJeffrey S. Foster, Dan Grossman, Jeffrey S. Foster
PublisherAssociation for Computing Machinery
Pages586-602
Number of pages17
ISBN (Electronic)9781450356985
DOIs
StatePublished - Jun 11 2018
Event39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018 - Philadelphia, United States
Duration: Jun 18 2018Jun 22 2018

Publication series

NameProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Other

Other39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018
CountryUnited States
CityPhiladelphia
Period6/18/186/22/18

Fingerprint

Computer programming languages
Topology

Keywords

  • Computer networks
  • Probabilistic programming

ASJC Scopus subject areas

  • Software

Cite this

Gehr, T., Misailovic, S., Tsankov, P., Vanbever, L., Wiesmann, P., & Vechev, M. (2018). Bayonet: Probabilistic inference for networks. In J. S. Foster, D. Grossman, & J. S. Foster (Eds.), PLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 586-602). (Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)). Association for Computing Machinery. https://doi.org/10.1145/3192366.3192400

Bayonet : Probabilistic inference for networks. / Gehr, Timon; Misailovic, Sasa; Tsankov, Petar; Vanbever, Laurent; Wiesmann, Pascal; Vechev, Martin.

PLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation. ed. / Jeffrey S. Foster; Dan Grossman; Jeffrey S. Foster. Association for Computing Machinery, 2018. p. 586-602 (Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)).

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

Gehr, T, Misailovic, S, Tsankov, P, Vanbever, L, Wiesmann, P & Vechev, M 2018, Bayonet: Probabilistic inference for networks. in JS Foster, D Grossman & JS Foster (eds), PLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Association for Computing Machinery, pp. 586-602, 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, United States, 6/18/18. https://doi.org/10.1145/3192366.3192400
Gehr T, Misailovic S, Tsankov P, Vanbever L, Wiesmann P, Vechev M. Bayonet: Probabilistic inference for networks. In Foster JS, Grossman D, Foster JS, editors, PLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery. 2018. p. 586-602. (Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)). https://doi.org/10.1145/3192366.3192400
Gehr, Timon ; Misailovic, Sasa ; Tsankov, Petar ; Vanbever, Laurent ; Wiesmann, Pascal ; Vechev, Martin. / Bayonet : Probabilistic inference for networks. PLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation. editor / Jeffrey S. Foster ; Dan Grossman ; Jeffrey S. Foster. Association for Computing Machinery, 2018. pp. 586-602 (Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)).
@inproceedings{7b38dea4abc24c98bbae2ff5ffb23cb0,
title = "Bayonet: Probabilistic inference for networks",
abstract = "Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for probabilistic networks and an automated procedure for answering probabilistic inference queries. We present Bayonet, a novel approach that consists of: (i) a probabilistic network programming language and (ii) a system that performs probabilistic inference on Bayonet programs. The key insight behind Bayonet is to phrase the problem of probabilistic network reasoning as inference in existing probabilistic languages. As a result, Bayonet directly leverages existing probabilistic inference systems and offers a flexible and expressive interface to operators. We present a detailed evaluation of Bayonet on common network scenarios, such as network congestion, reliability of packet delivery, and others. Our results indicate that Bayonet can express such practical scenarios and answer queries for realistic topology sizes (with up to 30 nodes).",
keywords = "Computer networks, Probabilistic programming",
author = "Timon Gehr and Sasa Misailovic and Petar Tsankov and Laurent Vanbever and Pascal Wiesmann and Martin Vechev",
year = "2018",
month = "6",
day = "11",
doi = "10.1145/3192366.3192400",
language = "English (US)",
series = "Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)",
publisher = "Association for Computing Machinery",
pages = "586--602",
editor = "Foster, {Jeffrey S.} and Dan Grossman and Foster, {Jeffrey S.}",
booktitle = "PLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation",

}

TY - GEN

T1 - Bayonet

T2 - Probabilistic inference for networks

AU - Gehr, Timon

AU - Misailovic, Sasa

AU - Tsankov, Petar

AU - Vanbever, Laurent

AU - Wiesmann, Pascal

AU - Vechev, Martin

PY - 2018/6/11

Y1 - 2018/6/11

N2 - Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for probabilistic networks and an automated procedure for answering probabilistic inference queries. We present Bayonet, a novel approach that consists of: (i) a probabilistic network programming language and (ii) a system that performs probabilistic inference on Bayonet programs. The key insight behind Bayonet is to phrase the problem of probabilistic network reasoning as inference in existing probabilistic languages. As a result, Bayonet directly leverages existing probabilistic inference systems and offers a flexible and expressive interface to operators. We present a detailed evaluation of Bayonet on common network scenarios, such as network congestion, reliability of packet delivery, and others. Our results indicate that Bayonet can express such practical scenarios and answer queries for realistic topology sizes (with up to 30 nodes).

AB - Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for probabilistic networks and an automated procedure for answering probabilistic inference queries. We present Bayonet, a novel approach that consists of: (i) a probabilistic network programming language and (ii) a system that performs probabilistic inference on Bayonet programs. The key insight behind Bayonet is to phrase the problem of probabilistic network reasoning as inference in existing probabilistic languages. As a result, Bayonet directly leverages existing probabilistic inference systems and offers a flexible and expressive interface to operators. We present a detailed evaluation of Bayonet on common network scenarios, such as network congestion, reliability of packet delivery, and others. Our results indicate that Bayonet can express such practical scenarios and answer queries for realistic topology sizes (with up to 30 nodes).

KW - Computer networks

KW - Probabilistic programming

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

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

U2 - 10.1145/3192366.3192400

DO - 10.1145/3192366.3192400

M3 - Conference contribution

AN - SCOPUS:85049579215

T3 - Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

SP - 586

EP - 602

BT - PLDI 2018 - Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation

A2 - Foster, Jeffrey S.

A2 - Grossman, Dan

A2 - Foster, Jeffrey S.

PB - Association for Computing Machinery

ER -