A protocol to maintain a minimum spanning tree in a dynamic topology
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
SemCast: Semantic Multicast for Content-Based Data Dissemination
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Extensible optimization in overlay dissemination trees
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Dynamic load balancing without packet reordering
ACM SIGCOMM Computer Communication Review
Self-organizing broker topologies for publish/subscribe systems
Proceedings of the 2007 ACM symposium on Applied computing
Scalable and Efficient End-to-End Network Topology Inference
IEEE Transactions on Parallel and Distributed Systems
A fast algorithm for computing minimum routing cost spanning trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Multicast in Overlay Networks with Linear Capacity Constraints
IEEE Transactions on Parallel and Distributed Systems
Reliable publish/subscribe middleware for time-sensitive internet-scale applications
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic publish/subscribe to meet subscriber-defined delay and bandwidth constraints
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Green Resource Allocation Algorithms for Publish/Subscribe Systems
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Meeting subscriber-defined QoS constraints in publish/subscribe systems
Concurrency and Computation: Practice & Experience
INTERNET TOPOLOGY DISCOVERY: A SURVEY
IEEE Communications Surveys & Tutorials
On Maximizing Tree Bandwidth for Topology-Aware Peer-to-Peer Streaming
IEEE Transactions on Multimedia
Deployment of an Algorithm for Large-Scale Topology Discovery
IEEE Journal on Selected Areas in Communications
Distributed spectral cluster management: a method for building dynamic publish/subscribe systems
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Tutorial: event-based systems meet software-defined networking
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
Content-based publish/subscribe has gained high popularity for large-scale dissemination of dynamic content. Yet it is highly challenging to enable communication-efficient dissemination of content in such systems, especially in the absence of a broker infrastructure. This paper presents a novel approach that exploits the knowledge of event traffic, user subscriptions and topology of the underlying physical network to perform efficient routing in a publish/subscribe system. In particular, mechanisms are developed to discover the underlay topology among subscribers and publishers in a distributed manner. The information of the topology and the proximity between the subscribers to receive similar events is then used to construct a routing overlay with low communication cost. Our evaluations show that for internet-like topologies the proposed inference mechanisms are capable of modeling an underlay in an efficient and accurate manner. Furthermore, the approach yields a significant reduction in routing cost in comparison to the state of the art.