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 = ⋀ni=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.
| Published in | Internet of Things and Cloud Computing (Volume 3, Issue 3) |
| DOI | 10.11648/j.iotcc.s.2015030601.17 |
| Page(s) | 59-65 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2015. Published by Science Publishing Group |
Service Based Routing, Filter, Constraint, Service, Routing, Tree, Split, Summary, R, Hierarchical, Cluster, Head
| [1] | J T Robmson, The K-D-B Tree A Search Structure for Large Multldimenslonal Dynarmc Indexes, 4CM-SIGMOD Conference Proc, April 1981, 10-18. |
| [2] | Antonin Guttman, R-TREES - A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING, University of California Berkeley. |
| [3] | Antonin Guttman and StonebrakerM., Using a Relational Database Management System for Computer Added Design Data, IEEE Database Engineering 5, 2 (June 1982). |
| [4] | G. Yuval, Finding Near Neighbors in k-dimensional Space, Inf Proc Lett 3, 4 (March 1975), 113-114. |
| [5] | Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, “Research on Innovating, Evaluating and Applying Multicast Routing Technique for Routing messages in Service-oriented Routing”, Springer, ISBN: 978-1-936968-65-7, Volume Number 109, 2012. |
| [6] | Summary-based Routing for Content-based Event Distribution Networks,Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das, and Paul Larson Microsoft Research, Redmond, WA, USA, 200. |
| [7] | Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, Research on Applying Hierachical Clustered Based Routing Technique Using Artificial Intelligence Algorithms for Quality of Service of Service Based Routing, Internet of Things and Cloud Computing. Special Issue:Quality of Service of Service Based Routing. Vol. 3, No. 6-1, 2015, pp. 1-8. doi: 10.11648/j.iotcc.s.2015030601.11. |
| [8] | Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, Research on Innovating and Applying Evolutionary Algorithms Based Hierarchical Clustering and Multiple Paths Routing for Guaranteed Quality of Service on Service Based Routing, Internet of Things and Cloud Computing. Special Issue:Quality of Service of Service Based Routing. Vol. 3, No. 6-1, 2015, pp. 9-15. doi: 10.11648/j.iotcc.s.2015030601.12. |
| [9] | Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, “Innovating R Tree to Create Summary Filter for Message Forwarding Technique in Service-Based Routing”, Springer, ISBN: 978-3-642-41773-3, LNICST 121, p. 178, 2013. |
| [10] | Research on Innovating, Applying Multiple Paths Routing Technique Based on Fuzzy Logic and Genetic Algorithm for Routing Messages in Service - Oriented Routing: Long Thanh Nguyen, Tam Nguyen The, Chien Tran, Thuy Nguyen Duc. Journal: Scalable Information Systems EAI. |
APA Style
Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang. (2015). Innovating R Tree for Message Forwarding Technique and Hierarchical Network Clustering in Service Based Routing. Internet of Things and Cloud Computing, 3(3), 59-65. https://doi.org/10.11648/j.iotcc.s.2015030601.17
ACS Style
Nguyen Thanh Long; Nguyen Duc Thuy; Pham Huy Hoang. Innovating R Tree for Message Forwarding Technique and Hierarchical Network Clustering in Service Based Routing. Internet Things Cloud Comput. 2015, 3(3), 59-65. doi: 10.11648/j.iotcc.s.2015030601.17
AMA Style
Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang. Innovating R Tree for Message Forwarding Technique and Hierarchical Network Clustering in Service Based Routing. Internet Things Cloud Comput. 2015;3(3):59-65. doi: 10.11648/j.iotcc.s.2015030601.17
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.iotcc.s.2015030601.17,
author = {Nguyen Thanh Long and Nguyen Duc Thuy and Pham Huy Hoang},
title = {Innovating R Tree for Message Forwarding Technique and Hierarchical Network Clustering in Service Based Routing},
journal = {Internet of Things and Cloud Computing},
volume = {3},
number = {3},
pages = {59-65},
doi = {10.11648/j.iotcc.s.2015030601.17},
url = {https://doi.org/10.11648/j.iotcc.s.2015030601.17},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.iotcc.s.2015030601.17},
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 = ⋀ni=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.},
year = {2015}
}
TY - JOUR T1 - Innovating R Tree for Message Forwarding Technique and Hierarchical Network Clustering in Service Based Routing AU - Nguyen Thanh Long AU - Nguyen Duc Thuy AU - Pham Huy Hoang Y1 - 2015/10/12 PY - 2015 N1 - https://doi.org/10.11648/j.iotcc.s.2015030601.17 DO - 10.11648/j.iotcc.s.2015030601.17 T2 - Internet of Things and Cloud Computing JF - Internet of Things and Cloud Computing JO - Internet of Things and Cloud Computing SP - 59 EP - 65 PB - Science Publishing Group SN - 2376-7731 UR - https://doi.org/10.11648/j.iotcc.s.2015030601.17 AB - 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 = ⋀ni=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. VL - 3 IS - 3 ER -
Email: