The upsurge of Industrial Internet of Things is forcing industrial information systems to enable less hierarchical information flow. The connections between humans, devices, and their digital twins are growing in numbers, creating a need for new kind of security and trust solutions. To address these needs, industries are applying distributed ledger technologies, aka blockchains. A significant number of use cases have been studied in the sectors of logistics, energy markets, smart grid security, and food safety, with frequently reported benefits in transparency, reduced costs, and disintermediation. However, distributed ledger technologies have challenges with transaction throughput, latency, and resource requirements, which render the technology unusable in many cases, particularly with constrained Internet of Things devices.To overcome these challenges within the Industrial Internet of Things, we suggest a set of interledger approaches that enable trusted information exchange across different ledgers and constrained devices. With these approaches, the technically most suitable ledger technology can be selected for each use case while simultaneously enjoying the benefits of the most widespread ledger implementations. We present state of the art for distributed ledger technologies to support the use of interledger approaches in industrial settings.

Several recently proposed multicast protocols use in-packet Bloom filters to encode multicast trees. These mechanisms are in principle highly scalable because no per-flow state is required in the routers and because routing decisions can be made efficiently by simply checking for the presence of outbound links in the filter. Yet, the viability of previous approaches is limited by the possibility of forwarding anomalies caused by false positives inherent in Bloom filters. This paper explores such anomalies, namely (1) packets storms, (2) forwarding loops and (3) flow duplication. We propose stateless solutions that increase the robustness and the scalability of Bloom filter-based multicast protocols. In particular, we show that the parameters of the filter need to be varied to guarantee the stability of the packet forwarding, and we present a bit permutation technique that effectively prevents both accidental and maliciously created anomalies. We evaluate our solutions in the context of BloomCast, a source-specific inter-domain multicast protocol, using analytical methods and simulations.

A large fraction of today's Internet applications are internally publish/subscribe in nature; the current architecture makes it cumbersome and inept to support them. In essence, supporting efficient publish/subscribe requires data-oriented naming, efficient multicast, and in-network caching. Deployment of native IP-based multicast has failed, and overlay-based multicast systems are inherently inefficient. We surmise that scalable and efficient publish/subscribe will require substantial architectural changes, such as moving from endpoint-oriented systems to information-centric architectures.

Several new, data-oriented internetworking architectures have been proposed recently. However, the practical deployability of such designs is an open question. In this paper, we consider data-oriented network designs in the light of the policy and incentive structures of the present internetworking economy. A main observation of our work is that none of the present proposals is both policy-compliant and incentive-compatible with the current internetworking market, which makes their deployment very challenging if not impossible. This difficulty stems from the unfounded implicit assumption that data-oriented routing policies directly reflect the underlying packet-level inter-domain policies. We find that to enable the more effective network utilization promised by data-oriented networking, essential caching incentives need to exist, and that data-oriented peering needs be considered separately from peering for packet forwarding.

The session initiation protocol (SIP) is an application-layer protocol to establish and manage sessions. SIP provides user mobility by having user agents register their location with a server in the network. The host identity protocol (HIP) is a shim layer between the network and the transport layers to establish and manage secure connections between hosts which may be mobile. In this paper, we propose a framework to combine SIP and HIP, and discuss the advantages of doing so. The advantages this framework provides relate to security, mobility, and multihoming. Additionally, we discuss how a P2P SIP (peer- to-peer SIP) system can be implemented on top of a HIP-based overlay network and the characteristics of such a system. We also offer some insights into an experimental prototype implemented as a proof-of-concept of the SIP-HIP interaction.

The Stream Control Transmission Protocol (SCTP) is a reliable message-based transport protocol developed by the IETF that could replace TCP in some applications. SCTP allows endpoints to have multiple IP addresses for the purposes of fault tolerance. There is on-going work to extend the SCTP multihoming functions to support dynamic addressing and endpoint mobility. This paper explains how the multihoming and mobility features can be exploited for denial-of-service attacks, connection hijacking, and packet flooding. We propose implementation guidelines for SCTP and changes to the mobility extensions that prevent most of the attacks. The same lessons apply to multihomed TCP variants and other transport-layer protocols that incorporate some flavor of dynamic addressing.

Problems with securing ad hoc services are discussed. How authentication and key exchange for ad hoc services can be performed are shown. We use a simple trust model for the participants in an ad hoc network. We show how to create an authenticated secure ad hoc connection using, for example, the Java/Jini environment.