Reliable BIER With Peer Caching

Abstract

BIER (Bit-Indexed Explicit Replication) alleviates the operational complexities of multicast protocols (associated to the multicast tree and the incurred state in intermediate routers), by allowing for source-driven, per-packet destination selection, efficient encoding thereof in packet headers, and stateless forwarding along shortest-path multicast trees. BIER perpacket destination selection enables efficient reliable multicast delivery: packets not received by a subset of intended destinations can be efficiently BIER-retransmitted to only that subset. While BIER-based reliable multicast exhibits attractive performance attributes, relying on source retransmissions for packet recovery may be costly-even unnecessary, if topologically close peers are able to provide a copy of the packet. Thus, this paper extends the use of reliable BIER multicast to allow recovery also from peers, using Segment Routing (SR) to steer retransmission requests through a set of potential (local) candidates, before requesting retransmissions from the source as a last resort only. A general framework is introduced, which can accommodate different policies for the selection of candidate peers for retransmissions. Simple (both static and adaptive) policies are introduced and analyzed, both (i) theoretically and (ii) by way of simulations in data-center-like and real-world topologies. Results indicate that local peer recovery is able to substantially reduce the overall retransmission traffic, and that this can be achieved through simple policies, where no signalling is required to build a set of candidate peers.

On the Dynamics of Single-Orbit Requester-Provider Systems

“…is paper focuses on the theoretical and experimental study of stability in distributed, decentralized systems for resource discovery and allocation in non-deterministic, heterogenous, time-variant networking and communication infrastructures. is analysis can be relevant for a number of use cases: multicast content distribution in data centers [1] or in other constrained infrastructures, distributed applications and systems including information-centric architectures [2], mechanisms for dynamic allocation of workloads in the cloud [3], computing resources in data centers [4] or in other deployments of the Internet edge [5]. In all these systems, the study of performance is challenging as these systems increasingly rely on distributed multi-party architectures, involving uncoordinated or loosely coordinated agents that interact to each other, may have partial, possibly inconsistent views of the environment, and follow autonomous, possibly con icting policies.…”

Reliable Multicast Based on Congestion-Aware Cache in ICN

“…However, it relies on source to retransmit the recovery packets. To solve this problem, the reliable BIER mechanism was extended to support recovery from peers in [31]. Rather than being directly sent to the source, NACKs can be first transmitted through an ordered set of peers, each of which may provide retransmission if they have a cached copy of the lost packet.…”

“…ICN enables rapid data retrieval due to its native in-network caching mechanism, thus shares properties with cache-based reliable multicast protocols, by enabling data recovery from nearby routers [31]. In [44], the authors found that using ICN in-network packet-level cache for retransmission can reduce the expected retransmission latency and is a valuable error control method.…”

A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks

“…This solution completely relies therefore on the unicast routing to forward multicast packets to the destination nodes. Since its first appearance, BIER attracted much attention for its simplicity, and works have been presented to enhance its basic functionality, for instance, with reliable multicast transmission [31], packet caching for fast retransmission [32], and fast reroute in case of failure [33].…”