Reliable Content Distribution via B.I.E.R.

@article{Desmouceaux2019,

title = {Reliable B.I.E.R. with Peer Caching},

author = {Yoann Desmouceaux and Juan Antonio Cordero and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2019/11/Reliable-B.I.E.R.-with-Peer-Caching.pdf},

doi = {10.1109/TNSM.2019.2950158},

issn = {1932-4537},

year  = {2019},

date = {2019-11-01},

journal = {IEEE Transactions on Network and Service Management},

abstract = {Multicast protocols usually require building multicast trees and maintaining state in intermediate routers, incurring operation complexity. B.I.E.R. (Bit-Indexed Explicit Replication) ambitions to alleviate this complexity by allowing for source-driven selection of destinations and state-less packet forwarding. B.I.E.R. can also be used to achieve reliable delivery of content, by retransmitting packet to the exact set of destinations which have missed it. While B.I.E.R.- based reliable multicast exhibits attractive performance attributes, repair of a lost packet is achieved through source retransmissions, which may be costly and even unnecessary if close peers are able to provide a copy of the packet. 

Thus, this paper extends the use of reliable B.I.E.R. multicast to allow recoveries from peers, using Segment Routing (SR) to steer retransmission requests through potential candidates. A 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 signaling is required to build a set of candidate peers.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Desmouceaux0000,

title = {Reliable Multicast with B.I.E.R.},

author = {Yoann Desmouceaux and Thomas Clausen and Juan Antonio Cordero and W. Mark Townsley },

url = {http://www.thomasclausen.net/wp-content/uploads/2018/03/jcn-2018.pdf},

year  = {2018},

date = {2018-02-28},

journal = {IEEE/KICS Journal of Communications and Networks (JCN)},

volume = {20},

number = {2},

pages = {182-197},

abstract = {Inter-network multicast protocols, which build and maintain multicast trees, incur both explicit protocol signalling, and maintenance of state in intermediate routers in the network. B.I.E.R. (Bit-Indexed Explicit Replication) is a technique which can provide a multicast service yet removes such complexities: in- termediate routers are unencumbered by group management, and no per-group state is to be maintained.

This paper explores the use of B.I.E.R. as a basis for develop- ing an efficient and reliable multicast mechanism, where redun- dant traffic is avoided, essential traffic is forwarded along shortest paths, and no per-flow state is required in intermediate routers. Evaluated by way of both an analytical model and network sim- ulation both in generic and in real network topologies with vary- ing background traffic loads, the proposed B.I.E.R.-based reliable multicast mechanism exhibits attractive performance attributes: it attains delivery success rates as high as any other reliable multicast service, but with significantly better link utilisation and no per-flow or per-group state in intermediate routers of the network.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}