Innovating R Tree to Create Summary Filter for Message Forwarding Technique in Service-Based Routing

Abstract

In service-oriented routing [5], the problem for storing routing table of filters includes search predicates received from subscribers through subscription messages is an important job. When a content request happens, subscriber will create one subscription message, the subscription message stores several kinds of information, the most important content is filter that is a conjunction of some constraints [5]. One filter is denoted by F character, that has mathematical formula: F=P₁ ΛP₂ Λ …Λ P_n (1), in which P₁ is service request, has format: P₁ = ‘Service_name = requested_service_name’. Every P_i (in which i= \({\overline{2..{\rm n}}}\)) is a constraint that is formed by three components: (Key, op, Value), Key is a keyword for searching, op is an operator, Value is searching condition. Key belongs to the set of name of properties of content that the requested service supplies. Op is operator that depends on the type of data of the Key. Therefore the routing table of the service based routing is a set of filters which are received from all subscribers on networks. The algorithms for inserting, updating, deleting and finding filters that match content messages have been published by service providers are very important. In this paper, We mention the technique on filter summary for storing and searching filter quickly that based on some previous researches and cluster routing [6] based on root’s summary filter.