Abstract
In service based routing (SBR) [5], the problem for storing forwarding table that includes searching predicates received from subscribers through subscription messages is an important job. When a content request happens, the subscriber will create a subscription message. The subscription message stores several kinds of information, the most important content is a filter that is a conjunction of some constraints [5]. A filter is denoted by F character, that has mathematical formula: F = ⋀n i=1C1, in which C1 is service request, has the format: C1= ‘Service_name = requested service name’. Every C1 (i=¯(2..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 messages that the requested service supplies. Op is an operator that depends on the type of data of the Key. Therefore the forwarding table 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 a technique for forwarding technique on the basic of summary filter for storing and searching filter quickly. This technique is based on some previous researches. In section 8, give an algorithm for finding all network nodes that have matched filters with a content message. Section 7 introduces a cluster routing technique based on summary filter.
Highlights
Forwarding technique is a searching technique that finds in service based routing table of each service the nodes that have matched subscription messages with each content message received from network
The summary filter is determined by the formula: =
The number of constraints of a filter is the level of this filter
Summary
The subscription/ un-subscription message consists of subscriber’s address and its content request. Content request is a set of some constraints that have a common form: (key, operator, value). A constraint is denoted by C: C = (Key, Operator, Value). In which: Key is a keyword to search content in content message. Operator determines the operation between a pair of a Key and a value. Value is a condition on a property of content message. Each subscription/ un-subscription message contains a set of constraints that is called a filter that is denoted by F character. Service based address of a network node is a set of some filters received from this node that is called a predicate that is denoted by P: P =.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
