Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Introduction to Algorithms
The subgraph homeomorphism problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Case for Resilient Overlay Networks
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Underlay-aware overlay networks
Underlay-aware overlay networks
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
A Taxonomy of QoS-Aware, Adaptive Event-Dissemination Middleware
IEEE Internet Computing
Self-stabilizing publish/subscribe systems: algorithms and evaluation
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Underlay Aware Resiliency in P2P Overlays
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
Event broker networks are P2P overlays constructed out of a few select nodes of the underlying physical network (aka underlay). Reliable event delivery on such networks requires the overlay to be highly available. While high availability is usually achieved by redundant paths between the rendezvous node and the subscriber, redundancy at the overlay level alone is insufficient to guarantee availability - redundant paths in the overlay have to correspond to node disjoint paths in the underlay network for true availability. In this paper, we propose two models of availability. In the Manifest Availability model, distinct paths at the overlay level are node disjoint at the underlay as well - this is a strong availability condition. We can weaken this to the Latent Availability model where it is only guaranteed that any two overlay nodes have a guaranteed number of node disjoint paths between them in the underlay. We analyze both the models for complexity of formation and maintenance, and prove that in the general case, both are NP-complete. We then identify a set of practical constraints applicable to large scale networks. We demonstrate that under these constraints, constructing latent availability overlays reduces to a polynomial time problem. We also introduce the concept of reduced underlays, and further reduce the complexity of the problem of determining latent availability overlays.