Belnap-Dunn logic (BD), sometimes also known as First Degree Entailment, is a four-valued propositional logic that complements the classical truth values of True and False with two non-classical truth values Neither and Both. The latter two are to account for the possibility of the available information being incomplete or providing contradictory evidence. In this paper, we present a probabilistic extension of BD that permits agents to have probabilistic beliefs about the truth and falsity of a proposition. We provide a sound and complete axiomatization for the framework defined and also identify policies for conditionalization and aggregation. Concretely, we introduce four-valued equivalents of Bayes’ and Jeffrey updating and also suggest mechanisms for aggregating information from different sources.

No abstract

No abstract

Software Defined Networking (SDN) is a new paradigm for communication networks which separates the control plane from the data plane of forwarding elements. This way, SDN constitutes a flexible architecture that allows quick and easy configuration of network devices. This ability is particularly useful when networks have to be adapted to changing traffic volumes of different applications running on the network. OpenFlow is currently the most prominent approach which implements the SDN concept and offers a high flexibility in the routing of network flows. In this paper, we describe the implementation of our model of the OpenFlow system in the INET framework for OMNeT++. We present performance results to show the correctness of our model. As a first application, we use the simulation model to assess the round-trip-times in a theoretical OpenFlow deployment in a real topology of a North-American Testbed.

The locator/identifier split is an approach for a new addressing and routing architecture to make routing in the core of the Internet more scalable. Based on this principle, we developed the GLI-Split framework, which separates the functionality of current IP addresses into a stable identifier and two independent locators, one for routing in the Internet core and one for edge networks. This makes routing in the Internet more stable and provides more flexibility for edge networks. GLI-Split can be incrementally deployed and it is backward-compatible with the IPv6 Internet. We describe its architecture, compare it to other approaches, present its benefits, and finally present a proof-of-concept implementation of GLI-Split