University of Cambridge > > Computer Laboratory Opera Group Seminars > Distributed Event Routing in Publish/Subscribe Systems

Distributed Event Routing in Publish/Subscribe Systems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Pedro Brandao.

Slides available .


Distributed event routing has emerged as a key technology for achieving scalable information dissemination. In particular it has been used as preferential communication backbone within publish/subscribe communication system. Its aim is to reduce the network and computational overhead per event diffusion to a set of interested recipients. This talk introduces to modern publish/subscribe systems through an overview on current techniques for event dissemination. We then focus on a few approaches developed in Rome for event based routing, and possible overlay infrastructures in wired and mobile systems.


Roberto Baldoni is Full Professor of Distributed Systems at the University of Rome “La Sapienza” where he chairs the local PhD program in Computing Science and Engineering. He is the founder of MIDdleware LABoratory (MIDLAB) and he has been PI of several large national and european research projects. Currently he is the the coordinator person of SM4ALL an EU project designing middleware infrastructures for Networked Embedded Systems and he is the Technical CoDirector of COMIFIN an EU project on the protection of the Financial Infrastructure. Recently, he has been the General Chair of DEBS 2008 . This year he is the PC-Chair of the track on “Reliable and Dependable Systems” at ICDCS08 . Roberto Baldoni is a member of the IFIP WG 10 .4 and belongs to the Scientific Committee of Sapienza Innovazione where he is Director of the Joint-Lab on Security Research .

This talk is part of the Computer Laboratory Opera Group Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity