Publication:
Bat optimization algorithm with fuzzy based PIT sharing (BF-PIT) algorithm for Named Data Networking (NDN)

Simple item page
dc.citedby25
dc.contributor.authorUma Maheswari P.en_US
dc.contributor.authorManickam P.en_US
dc.contributor.authorSathesh Kumar K.en_US
dc.contributor.authorMaseleno A.en_US
dc.contributor.authorShankar K.en_US
dc.contributor.authorid57219557698en_US
dc.contributor.authorid57209506053en_US
dc.contributor.authorid56112102200en_US
dc.contributor.authorid55354910900en_US
dc.contributor.authorid56884031900en_US
dc.date.accessioned2023-05-29T07:29:54Z
dc.date.available2023-05-29T07:29:54Z
dc.date.issued2019
dc.descriptionComputer circuits; Nearest neighbor search; Network architecture; Networks (circuits); Content delivery; Data packet; Internet modeling; K Nearest Neighbor (k NN) algorithm; Management scheme; Named data networkings; Node selection; Optimization algorithms; Fuzzy logicen_US
dc.description.abstractNamed 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. � 2019 - IOS Press and the authors. All rights reserved.en_US
dc.description.natureFinalen_US
dc.identifier.doi10.3233/JIFS-179086
dc.identifier.epage300
dc.identifier.issue1
dc.identifier.scopus2-s2.0-85069434701
dc.identifier.spage293
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85069434701&doi=10.3233%2fJIFS-179086&partnerID=40&md5=12e453073ba3077970671e4e5a7d479b
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/24987
dc.identifier.volume37
dc.publisherIOS Pressen_US
dc.sourceScopus
dc.sourcetitleJournal of Intelligent and Fuzzy Systems
dc.titleBat optimization algorithm with fuzzy based PIT sharing (BF-PIT) algorithm for Named Data Networking (NDN)en_US
dc.typeArticleen_US
dspace.entity.typePublication
Files
Collections
SCOPUS