Please use this identifier to cite or link to this item:
http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/4830
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kayaturan, Gokce Caylak | - |
dc.contributor.author | Ozcelik, Gokhan | - |
dc.contributor.author | Gokce, Aytuel | - |
dc.date.accessioned | 2024-03-20T13:51:11Z | - |
dc.date.available | 2024-03-20T13:51:11Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | Kayaturan, GÇ., Özçelik, G., Gökçe, A. (2023). Decision-aided evaluation of paths for routing on multi-attribute computer network consisting of encoded paths under uncertainty. Expert Syst. Appl., 223. https://doi.org/10.1016/j.eswa.2023.119881 | en_US |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.issn | 1873-6793 | - |
dc.identifier.uri | http://dx.doi.org/10.1016/j.eswa.2023.119881 | - |
dc.identifier.uri | https://www.webofscience.com/wos/woscc/full-record/WOS:000961526700001 | - |
dc.identifier.uri | http://earsiv.odu.edu.tr:8080/xmlui/handle/11489/4830 | - |
dc.description | WoS Categories: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Operations Research & Management Science | en_US |
dc.description | Web of Science Index: Science Citation Index Expanded (SCI-EXPANDED) | en_US |
dc.description | Research Areas: Computer Science; Engineering; Operations Research & Management Science | en_US |
dc.description.abstract | The network users need to evaluate the alternative transmission pathways to avoid some routing problems such as possible network attacks, data traffic, etc. in computer networks. In order to provide a mathematical solution to this situation, in this paper the computer network system is considered as a graph, and a random data structure denoted by Bloom filter is used to forward data between computers in the network. The Bloom filter has been used for encoding the routes minimises the query response time, although it has a significant risk of producing errors indicated by false positives (FP). The study aims to assess all paths between two distinct computers on a multi-attribute computer network considering risk and FP values regarding paths. These considerations are inherently vagueness. That being the case, a novel two-stage research methodology is presented to determine the desired pathways during message transmission on a multi-attribute computer network under uncertainty. At this point, the values of the possible risks and the probability of FP of the transmission edges are defined by employing triangular fuzzy numbers to reach the theoretical solutions. The novelty of the study is proposing a research methodology based on fuzzy Multi-Criteria Decision Making (MCDM) techniques to offer alternative routes during data transmission on any multi-attribute computer network under uncertainty for the first time. Further, a sensitivity analysis is implemented. In all computational analyses, the most appropriate and reliable transmission pathways are listed, and some managerial insights and main findings are provided for the network users. | en_US |
dc.description.sponsorship | Ordu University [A-2113] | en_US |
dc.language.iso | eng | en_US |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD-OXFORD | en_US |
dc.relation.isversionof | 10.1016/j.eswa.2023.119881 | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Fuzzy environment, Bloom filter, Multi-criteria decision making, Computer network | en_US |
dc.subject | BLOOM FILTERS, FUZZY, TOPSIS, HASH | en_US |
dc.title | Decision-aided evaluation of paths for routing on multi-attribute computer network consisting of encoded paths under uncertainty | en_US |
dc.type | article | en_US |
dc.relation.journal | EXPERT SYSTEMS WITH APPLICATIONS | en_US |
dc.contributor.department | Ordu Üniversitesi | en_US |
dc.contributor.authorID | 0000-0001-5314-8576 | en_US |
dc.identifier.volume | 223 | en_US |
Appears in Collections: | Matematik |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.