June 19, 2017

Kafka versus RabbitMQ, A comparative study of two industry reference publish/subscribe implementations

  • Dobbelaere P.
  • Sheykh Esmaili K.

Apache Kafka and RabbitMQ are two popular publish/subscribe implementations that can be used when a multitude of data streams need to be connected between a set of producers and a set of con- sumers. They have some functional and non-functional features in common, which encourages software architects to compare them head to head. They also have unique features not found in the alternative architecture, which means that a choice will always be driven by considerations of the application(s) that use these compo- nents. This paper explores these features and provides details. We will also present some use cases, and indicate how specifc use cases align with either of the two studied systems. Finally, we guide the reader in making his own choice based on a determination table.

View Original Article

Recent Publications

June 19, 2017

COMBINING BELIEF PROPAGATION AND SUCCESSIVE CANCELLATION LIST DECODING OF POLAR CODES ON A GPU PLATFORM

  • Cammerer S.
  • Hoydis J.
  • Leible B.
  • Stahl M.
  • Ten Brink S.

The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive cancellation list (SCL) decoder on a GPU and identify the bottlenecks of this algorithm with ...

June 04, 2017

A New PRACH Transmission Scheme in Unlicensed Spectrum

  • Luo Z.
  • Meng Y.
  • Tao T.

For the unlicensed spectrum, the occupied bandwidth requirement is demanded by some regulations. The legacy scheme of Physical Random Access Channel (PRACH) for Long Term Evolution (LTE) cannot satisfy it. In this paper, we propose a novel PRACH transmission scheme to satisfy the requirement of unlicensed spectrum based on preamble ...

June 01, 2017

Mutual service processes in Euclidean spaces: existence and ergodicity

  • Baccelli F.
  • Mathieu F.
  • Norros I.

Consider a set of objects, abstracted to points of a spatially stationary point process in R-d, that deliver to each other a service at a rate depending on their distance. Assume that the points arrive as a Poisson process and leave when their service requirements have been fulfilled. We show ...