Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Special Section: Intelligent Data Aggregation Inspired Paradigm and Approaches in IoT Applications
Guest editors: Xiaohui Yuan and Mohamed Elhoseny
Article type: Research Article
Authors: Uma Maheswari, P.a | Manickam, P.b | Sathesh Kumar, K.b | Maseleno, Andinoc; d | Shankar, K.b; *
Affiliations: [a] Department of Computer Applications, Anna University Regional Campus Madurai, Madurai, India | [b] School of Computing, Kalasalingam Academy of Research and Education, Krishnankoil, India | [c] Institute of Informatics and Computing Energy, Universiti Tenaga Nasional, Malaysia | [d] Department of Information Systems, STMIK Pringsewu, Lampung, Indonesia
Correspondence: [*] Corresponding author. Shankar Kathiresan, School of Computing, Kalasalingam Academy of Research and Education, Krishnankoil, India. E-mail: shankarcrypto@gmail.com.
Abstract: Named Data Networking (NDN) is a recent Internet model, takes the advantages and resolves the drawbacks of traditional TCP/IP architecture to satisfy the increasing demands on communication. Every NDN router has a pending interest table (PI) to store all the interest packets (I-pkts) waiting for the arrival of data packets (D-pkts). In case of the arrival of enormous I-pkts, it might be hard for an NDN router to store all I-pkts in the limited PIT space. So, a novel PIT management scheme becomes essential for effective PIT utilization. This paper presents a new PIT sharing algorithm based on the hybridization of bat optimization (BO) algorithm and fuzzy logic (BFPIT), to accommodate number of I-pkts in a sharing NDN (SN) node. The BFPIT algorithm intends to identify the optimal SN node sharing node to store I-pkts of a requestor NDN (RN) node. The proposed BFPIT algorithm operates in two stages: BO algorithm for preliminary SN (PSN) node selection and fuzzy logic for final SN (FSN) node selection. For validation, the proposed method is implemented, and the simulation results are compared with the k-nearest neighbor (k-NN) algorithm. The experimental results revealed that the BFPIT algorithm significantly increases the CHR and minimizes the average content delivery time.
Keywords: Network, NDN, fuzzy logic, PIT, bat optimization
DOI: 10.3233/JIFS-179086
Journal: Journal of Intelligent & Fuzzy Systems, vol. 37, no. 1, pp. 293-300, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl