Paraconsistent Annotated Logic Algorithms Applied in Management and Control of Communication Network Routes

This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computat...

Full description

Saved in:
Bibliographic Details
Published inSensors (Basel, Switzerland) Vol. 21; no. 12; p. 4219
Main Authors Da Silva Filho, João Inácio, Abe, Jair Minoro, Marreiro, Alessandro de Lima, Martinez, Angel Antonio Gonzalez, Torres, Cláudio Rodrigo, Rocco, Alexandre, Côrtes, Hyghor Miranda, Mario, Mauricio Conceição, Pacheco, Marcos Tadeu Tavares, Garcia, Dorotéa Vilanova, Blos, Maurício Fontoura
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 20.06.2021
MDPI
Subjects
Online AccessGet full text
ISSN1424-8220
1424-8220
DOI10.3390/s21124219

Cover

Loading…
Abstract This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computational structure, the denominated paraconsistent data analyzer (PDAPAL2v), was constructed to perform routing management in communication networks. Direct comparisons of PDAPAL2v with a classical logic system that simulates routing conditions were made in the laboratory. In the conventional system, the paraconsistent algorithms were considered as binary logic gates, and in the tests, the same adjustment limits of PDAPAL2v were applied. Using a database with controlled insertion of noise, we obtained an efficacy of 97% in the detection of deteriorated packets with PDAPAL2v and 72% with the conventional simulation system. Functional tests were carried out, showing that PDAPAL2v is able to assess the conditions and degradation of links and perform the analysis and correlation of various inputs and variables, even if the signals have contradictory values. From practical tests in the laboratory, the proposed method represents a new way of managing and controlling communication network routes with good performance.
AbstractList This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computational structure, the denominated paraconsistent data analyzer (PDAPAL2v), was constructed to perform routing management in communication networks. Direct comparisons of PDAPAL2v with a classical logic system that simulates routing conditions were made in the laboratory. In the conventional system, the paraconsistent algorithms were considered as binary logic gates, and in the tests, the same adjustment limits of PDAPAL2v were applied. Using a database with controlled insertion of noise, we obtained an efficacy of 97% in the detection of deteriorated packets with PDAPAL2v and 72% with the conventional simulation system. Functional tests were carried out, showing that PDAPAL2v is able to assess the conditions and degradation of links and perform the analysis and correlation of various inputs and variables, even if the signals have contradictory values. From practical tests in the laboratory, the proposed method represents a new way of managing and controlling communication network routes with good performance.
This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computational structure, the denominated paraconsistent data analyzer (PDAPAL2v), was constructed to perform routing management in communication networks. Direct comparisons of PDAPAL2v with a classical logic system that simulates routing conditions were made in the laboratory. In the conventional system, the paraconsistent algorithms were considered as binary logic gates, and in the tests, the same adjustment limits of PDAPAL2v were applied. Using a database with controlled insertion of noise, we obtained an efficacy of 97% in the detection of deteriorated packets with PDAPAL2v and 72% with the conventional simulation system. Functional tests were carried out, showing that PDAPAL2v is able to assess the conditions and degradation of links and perform the analysis and correlation of various inputs and variables, even if the signals have contradictory values. From practical tests in the laboratory, the proposed method represents a new way of managing and controlling communication network routes with good performance.This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computational structure, the denominated paraconsistent data analyzer (PDAPAL2v), was constructed to perform routing management in communication networks. Direct comparisons of PDAPAL2v with a classical logic system that simulates routing conditions were made in the laboratory. In the conventional system, the paraconsistent algorithms were considered as binary logic gates, and in the tests, the same adjustment limits of PDAPAL2v were applied. Using a database with controlled insertion of noise, we obtained an efficacy of 97% in the detection of deteriorated packets with PDAPAL2v and 72% with the conventional simulation system. Functional tests were carried out, showing that PDAPAL2v is able to assess the conditions and degradation of links and perform the analysis and correlation of various inputs and variables, even if the signals have contradictory values. From practical tests in the laboratory, the proposed method represents a new way of managing and controlling communication network routes with good performance.
This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication networks. Paraconsistent logic (PL) was used to create an algorithmic structure whose main property is to accept contradiction. Moreover, a computational structure, the denominated paraconsistent data analyzer (PDA PAL2v ), was constructed to perform routing management in communication networks. Direct comparisons of PDA PAL2v with a classical logic system that simulates routing conditions were made in the laboratory. In the conventional system, the paraconsistent algorithms were considered as binary logic gates, and in the tests, the same adjustment limits of PDA PAL2v were applied. Using a database with controlled insertion of noise, we obtained an efficacy of 97% in the detection of deteriorated packets with PDA PAL2v and 72% with the conventional simulation system. Functional tests were carried out, showing that PDA PAL2v is able to assess the conditions and degradation of links and perform the analysis and correlation of various inputs and variables, even if the signals have contradictory values. From practical tests in the laboratory, the proposed method represents a new way of managing and controlling communication network routes with good performance.
Author Rocco, Alexandre
Abe, Jair Minoro
Martinez, Angel Antonio Gonzalez
Garcia, Dorotéa Vilanova
Da Silva Filho, João Inácio
Marreiro, Alessandro de Lima
Mario, Mauricio Conceição
Blos, Maurício Fontoura
Torres, Cláudio Rodrigo
Côrtes, Hyghor Miranda
Pacheco, Marcos Tadeu Tavares
AuthorAffiliation 1 Laboratory of Applied Paraconsistent Logic, Santa Cecilia University, Oswaldo Cruz Street, 288, Santos 11045-100, Brazil; jairabe@uol.com.br (J.M.A.); alessandro.marreiro@sp.senai.br (A.d.L.M.); c.r.t@uol.com.br (C.R.T.); a.rocco@unisanta.br (A.R.); hyghorcortes@gmail.com (H.M.C.); cmario@unisanta.br (M.C.M.); marcttadeu@unisanta.br (M.T.T.P.); dora@unisanta.br (D.V.G.); mauricioblos@unisanta.br (M.F.B.)
2 Graduate Program in Production Engineering, Paulista University, José Maria Whitaker Avenue, 320, São Paulo 04057-000, Brazil; angel.martinez@docente.unip.br
AuthorAffiliation_xml – name: 1 Laboratory of Applied Paraconsistent Logic, Santa Cecilia University, Oswaldo Cruz Street, 288, Santos 11045-100, Brazil; jairabe@uol.com.br (J.M.A.); alessandro.marreiro@sp.senai.br (A.d.L.M.); c.r.t@uol.com.br (C.R.T.); a.rocco@unisanta.br (A.R.); hyghorcortes@gmail.com (H.M.C.); cmario@unisanta.br (M.C.M.); marcttadeu@unisanta.br (M.T.T.P.); dora@unisanta.br (D.V.G.); mauricioblos@unisanta.br (M.F.B.)
– name: 2 Graduate Program in Production Engineering, Paulista University, José Maria Whitaker Avenue, 320, São Paulo 04057-000, Brazil; angel.martinez@docente.unip.br
Author_xml – sequence: 1
  givenname: João Inácio
  orcidid: 0000-0001-9715-8928
  surname: Da Silva Filho
  fullname: Da Silva Filho, João Inácio
– sequence: 2
  givenname: Jair Minoro
  orcidid: 0000-0003-2088-9065
  surname: Abe
  fullname: Abe, Jair Minoro
– sequence: 3
  givenname: Alessandro de Lima
  surname: Marreiro
  fullname: Marreiro, Alessandro de Lima
– sequence: 4
  givenname: Angel Antonio Gonzalez
  surname: Martinez
  fullname: Martinez, Angel Antonio Gonzalez
– sequence: 5
  givenname: Cláudio Rodrigo
  surname: Torres
  fullname: Torres, Cláudio Rodrigo
– sequence: 6
  givenname: Alexandre
  surname: Rocco
  fullname: Rocco, Alexandre
– sequence: 7
  givenname: Hyghor Miranda
  orcidid: 0000-0002-7508-9404
  surname: Côrtes
  fullname: Côrtes, Hyghor Miranda
– sequence: 8
  givenname: Mauricio Conceição
  surname: Mario
  fullname: Mario, Mauricio Conceição
– sequence: 9
  givenname: Marcos Tadeu Tavares
  surname: Pacheco
  fullname: Pacheco, Marcos Tadeu Tavares
– sequence: 10
  givenname: Dorotéa Vilanova
  surname: Garcia
  fullname: Garcia, Dorotéa Vilanova
– sequence: 11
  givenname: Maurício Fontoura
  surname: Blos
  fullname: Blos, Maurício Fontoura
BookMark eNptkk1v1DAQhi3Uin5x4B9E4gKHpf6K41yQVqsClbaAUDlbE9tJvU3sxXZA_ff1dquKVpxmNPPOo3ntOUEHPniL0FuCPzLW4vNECaGckvYVOiac8oWkFB_8kx-hk5Q2GFPGmHyNjhinmLa1PEa3PyCCDj65lK3P1dL7kCFbU63D4HS1HIcQXb6ZUrXcbkdXGs5XV-BhsNNuALypVsHnGMYq9CWdptk7DdkFX32z-W-It9XPMGebztBhD2Oybx7jKfr1-eJ69XWx_v7lcrVcLzTnIi-4oFb0RmDGauiIhGKgsXVnRGuaRjAigOlW9F0x0TNDQDDcCal1x3tsGGWn6HLPNQE2ahvdBPFOBXDqoRDioCBmp0erNGt5g3lracE1BjpJegMaS8usxbIrrE971nbuJmt0sRxhfAZ93vHuRg3hj5KUccxxAbx_BMTwe7Ypq8klbccRvA1zUrTmkhNe122Rvnsh3YQ5-vJUO1VNZM3kzt2HvUrHkFK0_dMyBKvdOaincyja8xda7fLD15Rd3fifiXsQRLhO
CitedBy_id crossref_primary_10_3390_robotics12030069
crossref_primary_10_1016_j_eswa_2023_120536
crossref_primary_10_1016_j_engappai_2023_107342
crossref_primary_10_1016_j_tsep_2023_101773
crossref_primary_10_3390_en16041934
Cites_doi 10.4236/jsea.2011.410067
10.1109/ACCESS.2021.3080176
10.4236/jsea.2014.75034
10.3390/s21010134
10.1109/TSE.1976.233837
10.1016/j.vibspec.2019.102929
10.3390/electronics9020342
10.1109/ICoICT.2014.6914113
10.1109/TLA.2016.7483545
10.1109/NETSOFT.2015.7116149
10.1109/ICOEI.2017.8300886
10.1109/ACCESS.2019.2946256
10.1016/j.conengprac.2018.11.007
10.1007/978-3-319-19722-7_6
10.1109/MCOM.2002.1039866
10.2307/2583863
10.1007/10722777
10.1109/ISCC.2014.6912503
10.1109/TLA.2016.7483524
10.1142/S0219525998000168
10.1016/j.ins.2010.04.013
10.3390/s21010203
10.1016/j.comnet.2020.107368
10.1109/ICCCN.2019.8847124
10.1016/j.ins.2017.08.074
10.1007/s11517-016-1471-3
ContentType Journal Article
Copyright 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
2021 by the authors. 2021
Copyright_xml – notice: 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
– notice: 2021 by the authors. 2021
DBID AAYXX
CITATION
3V.
7X7
7XB
88E
8FI
8FJ
8FK
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
FYUFA
GHDGH
K9.
M0S
M1P
PHGZM
PHGZT
PIMPY
PJZUB
PKEHL
PPXIY
PQEST
PQQKQ
PQUKI
PRINS
7X8
5PM
DOA
DOI 10.3390/s21124219
DatabaseName CrossRef
ProQuest Central (Corporate)
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
Medical Database (Alumni Edition)
ProQuest Hospital Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest One Community College
ProQuest Central
Health Research Premium Collection
Health Research Premium Collection (Alumni)
ProQuest Health & Medical Complete (Alumni)
ProQuest Health & Medical Collection
Medical Database
ProQuest Central Premium
ProQuest One Academic
ProQuest Publicly Available Content
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
MEDLINE - Academic
PubMed Central (Full Participant titles)
DOAJ Open Access Full Text
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
ProQuest Central China
ProQuest Central
ProQuest Health & Medical Research Collection
Health Research Premium Collection
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
Health & Medical Research Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
Health Research Premium Collection (Alumni)
ProQuest Hospital Collection (Alumni)
ProQuest Health & Medical Complete
ProQuest Medical Library
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
MEDLINE - Academic
DatabaseTitleList Publicly Available Content Database
MEDLINE - Academic


CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals - NZ
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1424-8220
ExternalDocumentID oai_doaj_org_article_c3947049e2fb47dab81fdac08e3ee08b
PMC8234040
10_3390_s21124219
GroupedDBID ---
123
2WC
53G
5VS
7X7
88E
8FE
8FG
8FI
8FJ
AADQD
AAHBH
AAYXX
ABDBF
ABUWG
ACUHS
ADBBV
ADMLS
AENEX
AFKRA
AFZYC
ALIPV
ALMA_UNASSIGNED_HOLDINGS
BENPR
BPHCQ
BVXVI
CCPQU
CITATION
CS3
D1I
DU5
E3Z
EBD
ESX
F5P
FYUFA
GROUPED_DOAJ
GX1
HH5
HMCUK
HYE
IAO
ITC
KQ8
L6V
M1P
M48
MODMG
M~E
OK1
OVT
P2P
P62
PHGZM
PHGZT
PIMPY
PQQKQ
PROAC
PSQYO
RNS
RPM
TUS
UKHRP
XSB
~8M
3V.
7XB
8FK
AZQEC
DWQXO
K9.
PJZUB
PKEHL
PPXIY
PQEST
PQUKI
PRINS
7X8
PUEGO
5PM
ID FETCH-LOGICAL-c446t-462e6fd60335ab18a2207e5bd69d776316a3c96fb420f3d1a630b68ccb4f0d323
IEDL.DBID M48
ISSN 1424-8220
IngestDate Wed Aug 27 01:28:46 EDT 2025
Thu Aug 21 17:19:40 EDT 2025
Sun Aug 24 03:53:25 EDT 2025
Fri Jul 25 19:52:20 EDT 2025
Tue Jul 01 03:56:14 EDT 2025
Thu Apr 24 22:58:18 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 12
Language English
License https://creativecommons.org/licenses/by/4.0
Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c446t-462e6fd60335ab18a2207e5bd69d776316a3c96fb420f3d1a630b68ccb4f0d323
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ORCID 0000-0003-2088-9065
0000-0002-7508-9404
0000-0001-9715-8928
OpenAccessLink http://journals.scholarsportal.info/openUrl.xqy?doi=10.3390/s21124219
PMID 34202958
PQID 2545185382
PQPubID 2032333
ParticipantIDs doaj_primary_oai_doaj_org_article_c3947049e2fb47dab81fdac08e3ee08b
pubmedcentral_primary_oai_pubmedcentral_nih_gov_8234040
proquest_miscellaneous_2548414559
proquest_journals_2545185382
crossref_primary_10_3390_s21124219
crossref_citationtrail_10_3390_s21124219
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20210620
PublicationDateYYYYMMDD 2021-06-20
PublicationDate_xml – month: 6
  year: 2021
  text: 20210620
  day: 20
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Sensors (Basel, Switzerland)
PublicationYear 2021
Publisher MDPI AG
MDPI
Publisher_xml – name: MDPI AG
– name: MDPI
References Nascimento (ref_37) 2014; 7
(ref_32) 2012; 4
ref_36
ref_35
ref_11
ref_33
Fortz (ref_6) 2002; 40
Garcia (ref_27) 2019; 103
ref_19
ref_18
ref_17
ref_16
ref_15
(ref_26) 2016; 14
Ferrara (ref_30) 2011; 04
Heusse (ref_12) 1998; 1
Seyfollahi (ref_13) 2020; 179
ref_25
Camargo (ref_28) 2016; 14
Smith (ref_9) 1994; 45
ref_22
Nunes (ref_34) 2016; 54
ref_21
ref_20
ref_1
ref_3
ref_2
Favieiro (ref_31) 2019; 7
Abe (ref_10) 1991; 37
Li (ref_14) 2010; 180
Justo (ref_24) 2021; 9
ref_8
Pena (ref_23) 2017; 420
ref_5
ref_4
Coelho (ref_29) 2019; 84
ref_7
References_xml – ident: ref_7
– volume: 04
  start-page: 579
  year: 2011
  ident: ref_30
  article-title: Paraconsistent Algorithm Extractor of Contradiction Effects—Paraextrctrctr
  publication-title: J. Softw. Eng. Appl.
  doi: 10.4236/jsea.2011.410067
– volume: 9
  start-page: 74155
  year: 2021
  ident: ref_24
  article-title: Rotary Inverted Pendulum Identification for Control by Paraconsistent Neural Network
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2021.3080176
– volume: 7
  start-page: 371
  year: 2014
  ident: ref_37
  article-title: An Application of Paraconsistent Annotated Logic for Design Software Testing Strategies
  publication-title: J. Softw. Eng. Appl.
  doi: 10.4236/jsea.2014.75034
– ident: ref_3
– ident: ref_4
  doi: 10.3390/s21010134
– ident: ref_35
  doi: 10.1109/TSE.1976.233837
– ident: ref_11
– volume: 103
  start-page: 102929
  year: 2019
  ident: ref_27
  article-title: Analysis of Raman spectroscopy data with algorithms based on paraconsistent logic for characterization of skin cancer lesions
  publication-title: Vib. Spectrosc.
  doi: 10.1016/j.vibspec.2019.102929
– ident: ref_16
– ident: ref_20
  doi: 10.3390/electronics9020342
– ident: ref_17
  doi: 10.1109/ICoICT.2014.6914113
– volume: 14
  start-page: 1993
  year: 2016
  ident: ref_28
  article-title: Support at Decision in Electrical Systems of subtransmission through selection of Topologies by a Paraconsistent Simulator
  publication-title: IEEE Lat. Am. Trans.
  doi: 10.1109/TLA.2016.7483545
– ident: ref_19
  doi: 10.1109/NETSOFT.2015.7116149
– ident: ref_18
– ident: ref_36
  doi: 10.1109/ICOEI.2017.8300886
– volume: 7
  start-page: 147914
  year: 2019
  ident: ref_31
  article-title: Paraconsistent Random Forest: An Alternative Approach for Dealing with Uncertain Data
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2946256
– volume: 84
  start-page: 112
  year: 2019
  ident: ref_29
  article-title: Hybrid PI controller constructed with paraconsistent annotated logic
  publication-title: Control. Eng. Pract.
  doi: 10.1016/j.conengprac.2018.11.007
– ident: ref_33
  doi: 10.1007/978-3-319-19722-7_6
– volume: 40
  start-page: 118
  year: 2002
  ident: ref_6
  article-title: Traffic engineering with traditional IP routing protocols
  publication-title: IEEE Commun. Mag.
  doi: 10.1109/MCOM.2002.1039866
– ident: ref_8
– ident: ref_25
– ident: ref_2
– volume: 45
  start-page: 1340
  year: 1994
  ident: ref_9
  article-title: Network Flows: Theory, Algorithms, and Applications
  publication-title: J. Oper. Res. Soc.
  doi: 10.2307/2583863
– ident: ref_1
  doi: 10.1007/10722777
– ident: ref_22
  doi: 10.1109/ISCC.2014.6912503
– volume: 14
  start-page: 1842
  year: 2016
  ident: ref_26
  article-title: A Method with Paraconsistent Partial Differential Equation used in Explicit Solution of one-dimensional Heat Conduction
  publication-title: IEEE Lat. Am. Trans.
  doi: 10.1109/TLA.2016.7483524
– volume: 4
  start-page: 144
  year: 2012
  ident: ref_32
  article-title: Treatment of Uncertainties with Algorithms of the Paraconsistent Annotated Logic
  publication-title: J. Intell. Learn. Syst. Appl.
– ident: ref_15
– volume: 1
  start-page: 237
  year: 1998
  ident: ref_12
  article-title: Adaptive Agent-Driven Routing and Load Balancing in Communication Networks
  publication-title: Adv. Complex Syst.
  doi: 10.1142/S0219525998000168
– volume: 180
  start-page: 2960
  year: 2010
  ident: ref_14
  article-title: Novel alarm correlation analysis system based on association rules mining in telecommunication networks
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2010.04.013
– ident: ref_5
  doi: 10.3390/s21010203
– volume: 37
  start-page: 561
  year: 1991
  ident: ref_10
  article-title: Remarks on annotated logic
  publication-title: Z. Math. Logik Grundl. Math.
– volume: 179
  start-page: 107368
  year: 2020
  ident: ref_13
  article-title: A lightweight load balancing and route minimizing solution for routing protocol for low-power and lossy networks
  publication-title: Comput. Networks
  doi: 10.1016/j.comnet.2020.107368
– ident: ref_21
  doi: 10.1109/ICCCN.2019.8847124
– volume: 420
  start-page: 313
  year: 2017
  ident: ref_23
  article-title: Anomaly detection using the correlational paraconsistent machine with digital signatures of network segment
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2017.08.074
– volume: 54
  start-page: 1453
  year: 2016
  ident: ref_34
  article-title: Paraconsistent analysis network applied in the treatment of Raman spectroscopy data to support medical diagnosis of skin cancer
  publication-title: Med. Biol. Eng. Comput.
  doi: 10.1007/s11517-016-1471-3
SSID ssj0023338
Score 2.356778
Snippet This paper presents a computational method based on non-classical logic dedicated to routing management and information stream control in communication...
SourceID doaj
pubmedcentral
proquest
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Enrichment Source
Index Database
StartPage 4219
SubjectTerms adaptive algorithms
Algorithms
Bandwidths
Communication
communication networks
Communications networks
Logic
Multimedia
paraconsistent analysis network
paraconsistent logic
Quality of service
R&D
Research & development
routing management system
Software
Traffic congestion
Wide area networks
SummonAdditionalLinks – databaseName: DOAJ Open Access Full Text
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NSyQxEA3iSQ-iruL4RXbx4KUxnaTTyXEUZRB28KDgrclXr7JuWpzx_1vV3TNOw4IXr50Q0lWVpB55eUXImWDMMaFVxg1XmbS1zazTIXMsGMZdHUSJ751_T9XkQd4-Fo8rpb6QE9bJA3eGu_DCyBLS2MhrJ8sAA-V1sJ7pKGJk2uHuC2feAkz1UEsA8up0hASA-osZwBy8-zSD06cV6R9klkNe5MpBc7NNtvoMkY67me2QtZh2yeaKbuAP8vcOVZaR2go-SnM6TqnBpDFQLJ3s6fjlTwOg_-nfjPZZJn1O9JPpQm0K9KojqdOmpoNXInTaMcMpkoXibI883FzfX02yvmpC5gHazTOpeFR1UEyIwrpcW85ZGQsXlAkl7Ca5ssIbBdbkrBYht0owp7T3TtYsCC72yXpqUjwgNIDvpFOOld7CsMYpy1VhoongyFyoETlfWLPyvaQ4VrZ4qQBaoOGrpeFH5Ney62uno_G_TpfokmUHlL5uP0BAVH1AVF8FxIgcLxxa9etxVgEMLjAz0XxEfi6bYSXh9YhNsXlv-2iJuu0wj3IQCIMJDVvS81Orya25kLAfHn7HHxyRDY7MGQYriB2T9fnbezyB1GfuTtso_wAVhwaN
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: ProQuest Technology Collection
  dbid: 8FG
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Lb9QwELagXOCAeIqlBRnEgUtUx3Yc-4SWiqVCouJApd4iv9JWLU5p0v_fmcSbNhLiGo8Sx_O2x98Q8kkw5pjQquCGq0La1hbW6VA4Fgzjrg2ixvvOP4_U4bH8cVKd5A23PpdVbm3iaKhD53GPfB8SmQp9i-Zfrv4W2DUKT1dzC42H5FEJngYlXG--zwmXgPxrQhMSkNrv95Ds4AmoWfigEap_EV8uqyPvuZvNM_I0x4l0PTH2OXkQ0wvy5B564Ety8QuxlrHAFTiVBrpOqcPQMVBsoOzp-vIUfmA4-9PTHGvS80Tv6l2oTYEeTKXqtGvp4q4IPZrqwymWDMX-FTnefPt9cFjk3gmFhwRvKKTiUbVBMSEq60ptOWd1rFxQJtRgU0plhTeqdZKzVoTSKsGc0t472bIguHhNdlKX4htCA3BQOuVY7S281jhluapMNBHYWQq1Ip-3q9n4DCyO_S0uG0gwcOGbeeFX5ONMejWhafyL6CuyZCZAAOzxQXd92mR9arwwsobsJnL4hTqAfJVtsJ7pKGJk2q3I3pahTdbKvrmToRX5MA-DPuEhiU2xuxlptET0dphHvRCExYSWI-n8bETm1lxIsIpv___xXfKYY2UMAw1he2RnuL6J7yC0Gdz7UX5vASj9_MQ
  priority: 102
  providerName: ProQuest
Title Paraconsistent Annotated Logic Algorithms Applied in Management and Control of Communication Network Routes
URI https://www.proquest.com/docview/2545185382
https://www.proquest.com/docview/2548414559
https://pubmed.ncbi.nlm.nih.gov/PMC8234040
https://doaj.org/article/c3947049e2fb47dab81fdac08e3ee08b
Volume 21
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwELb6uMAB8RQLZWUQBy4Br-3YzgGhbdWlQuqqQqy0t8iOnXbF4rS7qQT_npkkGxqpBy45JBPLmYdnJh5_Q8h7wZhjwqiEZ1wl0pY2sc74xDGfMe5KLzSedz6fq7OF_LZMl3tk12OzY-D23tQO-0ktNuuPv2_-fAGD_4wZJ6Tsn7aQxODOZrZPDsEhaezgcC77zQQuRNPQGs90JeAPWQswNHx14JYa9P5ByDksmLzjgWaPyaMudKTTVtZPyF6IT8nDO4CCz8jPC4RfxppXEF6s6TTGCqNJT7GnckGn68tqs6qvfm1pF37SVaT_SmCojZ6etNXrtCrp4PgInbcl4xSriML2OVnMTn-cnCVdO4WkgJyvTqTiQZVeMSFS6ybGAit0SJ1XmdewzEyUFUWmSic5K4WfWCWYU6YonCyZF1y8IAexiuEloR6EKp1yTBcWhs2cslylWcgCSHgi1Ih82HEzLzqscWx5sc4h50DG5z3jR-RdT3rdAmzcR3SMIukJEBO7uVFtLvPOxPJCZFJDwhM4fIL2oHKT0tuCmSBCYMaNyNFOoPlOz3LIj1MMWQwfkbf9YzAx3DexMVS3DY2RCOgO89ADRRhMaPgkrq4asG7DhYSF8tV_jP6aPOBYMcPActgROag3t-ENhDy1G5N9vdRwNbOvY3J4fDq_-D5ufh-MG1X_C9mWBnM
linkProvider Scholars Portal
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaqcgAOiKdYWsAgkLhEdezEiQ8ILYVqS9sVh1baW_ArbdXWKU0qxJ_iNzKTx24jIW69JtZuMv5mPBN__oaQd4Ixw0QuI664jBJd6kib3EWGOcW4KZ3I8LzzwVzOjpJvi3SxRv4MZ2GQVjnExDZQu8riN_ItKGRSXFty_unyZ4Rdo3B3dWih0cFiz__-BSVb_XH3C8zve853vh5uz6K-q0BkofRpokRyL0snmRCpNnGuOWeZT42TymXgbbHUwipZmoSzUrhYS8GMzK01ScmcQKEDCPl3YOFlSCHMFqsCT0C916kXCaHYVg3FFe64qtGa17YGGOWzYzbmjeVt5yF50OeldNoB6RFZ8-ExuX9DrfAJOfuO2s5IqAVkhIZOQ6gwVXUUGzZbOj0_BoM1Jxc17XNbehroil9DdXB0u6PG06qko7MpdN7x0SlSlHz9lBzdilWfkfVQBf-cUAeISYw0LLMaflYZqblMlVce4BMLOSEfBmsWthcyx34a5wUUNGj4Ymn4CXm7HHrZqXf8a9BnnJLlABTcbi9UV8dF77-FFSrJoJryHF4hc4DnuHTastwL71luJmRzmNCijwJ1scLshLxZ3gb_xU0ZHXx13Y7JE1SLh-fIRkAYPdD4Tjg9aZXAcy4SiMIv_v_nr8nd2eHBfrG_O9_bIPc4snIYeCfbJOvN1bV_CWlVY161WKbkx207z19SRTj0
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaqIiE4IJ5iaQGDQOISrWMnTnxAaGlZtRRWPVBpb8GvtBXFaZtUiL_Gr2Mmj91GQtx6TazdZPzNeCb-_A0hbwRjholcRlxxGSW61JE2uYsMc4pxUzqR4Xnnrwu5d5R8XqbLDfJnOAuDtMohJraB2lUWv5FPoZBJcW3J-bTsaRGHu_MP5xcRdpDCndahnUYHkQP_-xeUb_X7_V2Y67eczz9929mL-g4DkYUyqIkSyb0snWRCpNrEueacZT41TiqXgefFUgurZGkSzkrhYi0FMzK31iQlcwJFDyD838oELJvgS9lyXewJqP06JSMhFJvWUGjh7qsarX9tm4BRbjtmZl5b6ub3yb0-R6WzDlQPyIYPD8nda8qFj8iPQ9R5RnItoCQ0dBZChWmro9i82dLZ2TEYrDn5WdM-z6Wnga65NlQHR3c6mjytSjo6p0IXHTedIl3J14_J0Y1Y9QnZDFXwTwl1gJ7ESMMyq-FnlZGay1R55QFKsZAT8m6wZmF7UXPsrXFWQHGDhi9Whp-Q16uh552Sx78GfcQpWQ1A8e32QnV5XPS-XFihkgwqK8_hFTIH2I5Lpy3LvfCe5WZCtocJLfqIUBdr_E7Iq9Vt8GXcoNHBV1ftmDxB5Xh4jmwEhNEDje-E05NWFTznIoGI_Oz_f_6S3Aa3Kb7sLw62yB2OBB0Gjsq2yWZzeeWfQ4bVmBctlCn5ftO-8xeWij0q
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Paraconsistent+Annotated+Logic+Algorithms+Applied+in+Management+and+Control+of+Communication+Network+Routes&rft.jtitle=Sensors+%28Basel%2C+Switzerland%29&rft.au=Da+Silva+Filho%2C+Jo%C3%A3o+In%C3%A1cio&rft.au=Abe%2C+Jair+Minoro&rft.au=Marreiro%2C+Alessandro+de+Lima&rft.au=Martinez%2C+Angel+Antonio+Gonzalez&rft.date=2021-06-20&rft.issn=1424-8220&rft.eissn=1424-8220&rft.volume=21&rft.issue=12&rft_id=info:doi/10.3390%2Fs21124219&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1424-8220&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1424-8220&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1424-8220&client=summon