Wireless Internet. 7th International ICST Conference, WICON 2013, Shanghai, China, April 11-12, 2013, Revised Selected Papers

Research Article

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

Download
436 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-41773-3_19,
        author={Nguyen Long and Nguyen Thuy and Pham Hoang and Tran Chien},
        title={Innovating R Tree to Create Summary Filter for Message Forwarding Technique in Service-Based Routing},
        proceedings={Wireless Internet. 7th International ICST Conference, WICON 2013, Shanghai, China, April 11-12, 2013, Revised Selected Papers},
        proceedings_a={WICON},
        year={2013},
        month={10},
        keywords={Service based routing filter constraint service routing tree split summary R cluster head},
        doi={10.1007/978-3-642-41773-3_19}
    }
    
  • Nguyen Long
    Nguyen Thuy
    Pham Hoang
    Tran Chien
    Year: 2013
    Innovating R Tree to Create Summary Filter for Message Forwarding Technique in Service-Based Routing
    WICON
    Springer
    DOI: 10.1007/978-3-642-41773-3_19
Nguyen Long1,*, Nguyen Thuy2,*, Pham Hoang3,*, Tran Chien1,*
  • 1: Informatic Center of Hanoi Telecommunications
  • 2: Research Institute of Posts and Telecommunications
  • 3: Hanoi University of Science and Technology
*Contact email: longptpm@vnpt-hanoi.com.vn, thuynd@ptit.edu.vn, hoangph@soict.hut.edu.vn, chientd@vnpt-hanoi.com.vn

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 (1), in which P is service request, has format: P = ‘Servicename = requestedservice_name’. Every P (in which i= ) 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.