QoS Allocation Algorithms for Publish-Subscribe Information Space Middleware

Abstract

Abstract. Information spaces have emerged as a powerful concept for providing managed exchange of information between members of communities of interest (COIs), including information brokering and dissemination by publishsubscribe-query middleware. To support COIs with real-time or critical information exchange requirements, information spaces require quality of service (QoS) management algorithms that consider the complex system dynamics within information spaces, that allocate multiple resources, and that scale to information spaces of reasonable size. This paper presents two algorithms for multi-resource QoS allocation within information spaces. The first algorithm always provides an optimal allocation and includes optimizations that enable it to scale to information spaces of moderate size. The second algorithm is an approximation algorithm that provides near optimal solutions in most situations and scales to much larger information spaces. The paper also presents analyses and experimental results of the effectiveness and efficiency of the algorithms.

CAEVA: A customizable and adaptive event aggregation framework for collaborative broker overlays

“…Over the past decade, various aspects of pub-sub systems have been widely studied including subscription mechanisms, architectures, quality-of-service, mobility, and reliability [6], [14], [2], [3], [15], [16], [17], [9], [18], [19], [7], [20]. Surprisingly, the issue of redundant and partial event messages, which are very common 8 in settings with human participants, has received little research attention.…”