Scaling Bloom filter-based multicast via filter switching

Journal of Network and Computer Applications

Voulimeneas

2015

Self Cite

Abstract-In the past few years, many researchers have argued that the Internet should transition from its traditional endpointcentric architecture to an information-centric paradigm. One of the advantages of the information-centric model is that the network can easily aggregate requests for the same content and serve them via multicast. Indeed, most information-centric architectures proposed to date offer native support for multicast, promising a vast improvement in the efficiency of content distribution. However, designing efficient reliable transport protocols for multicast is a largely open issue, due to the problem of feedback implosion towards the sender as group size grows. In this paper we propose RMTPSI, a retransmission-based reliable error control protocol for multicast communication designed specifically for information-centric networks. We compare RMTPSI with existing approaches proposed for IP multicast and evaluate its performance via simulation, showing that our approach leads to more efficient content distribution and error recovery than previous solutions.

Section: B Wide Area Multicast In Psimentioning

confidence: 99%

“…In order to evaluate the performance of RMTPSI against PGM, we used extensive simulations over NS-3 [19], where the entire PSI architecture was implemented, including Bloom filter-based forwarding [14] and wide-area multicasting based on RPs [16]. We simulated a scenario where a single publisher distributes the desired content (e.g.…”

Section: A Simulator Setupmentioning

confidence: 99%

A reliable multicast transport protocol for information-centric networks

Stais

Journal of Network and Computer Applications

Voulimeneas

2015

Self Cite

“…There is no need to coordinate LID assignment, as LIDs do not need to be globally unique. In addition, source-routes are constructed in a distributed manner and no separate centralized module is required to construct the Bloom filters [17]. Nodes also remain anonymous, as in CCN.…”

Section: Semi-stateless Data Forwardingmentioning

confidence: 99%

Reducing forwarding state in content-centric networks with semi-stateless forwarding

Tsilopoulos

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

Thomas

2014

Self Cite

Abstract-Routers in the Content-Centric Networking (CCN) architecture maintain state for all pending content requests, so as to be able to later return the corresponding content. By employing stateful forwarding, CCN supports native multicast, enhances security and enables adaptive forwarding, at the cost of excessive forwarding state that raises scalability concerns. We propose a semi-stateless forwarding scheme in which, instead of tracking each request at every on-path router, requests are tracked at every d hops. At intermediate hops, requests gather reverse path information, which is later used to deliver responses between routers using Bloom filter-based stateless forwarding. Our approach effectively reduces forwarding state, while preserving the advantages of CCN forwarding. Evaluation results over realistic ISP topologies show that our approach reduces forwarding state by 54%-70% in unicast delivery, without any bandwidth penalties, while in multicast delivery it reduces forwarding state by 34%-55% at the expense of 6%-13% in bandwidth overhead.

“…To allow iBF-based forwarding to support larger multicast groups, we exploit iBF switching [11] at designated relay points. Relay points are routers that replace the iBF inside a packet with a new one before forwarding the packet.…”

Section: Multicast Error Controlmentioning

confidence: 99%

Towards an error control scheme for a publish/subscribe network

Stais

Voulimeneas

2013 IEEE International Conference on Communications (ICC)

2013

Self Cite

Abstract-Many proposals for the next generation of the Internet suggest moving from an end-point oriented to an informationcentric oriented architecture. Many of these proposals are based on the publish/subscribe paradigm, which lends itself naturally to native multicast support, a key factor for efficient content distribution. However, the design of efficient reliable transport protocols for multicast is a largely open problem, due to the problem of feedback implosion towards the sender as group size grows. In this paper we propose a hierarchical retransmissionbased error control scheme for a native publish/subscribe internetwork. We compare our protocol with similar approaches proposed for IP multicast and evaluate its performance against IP multicast with unicast-based error control.