EUVIMEDEUVIMED entdecken
Crossref

Error Elimination From Bloom Filters in Computer Networks Represented by Graphs

Gokce CAYLAK KAYATURAN

Fundamental Journal of Mathematics and Applications · 2022

DOI: 10.33401/fujma.1091736 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Fundamental Journal of Mathematics and Applications, 2022. Verfasst von Gokce CAYLAK KAYATURAN. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 17 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

An undirected mathematical graph, $G = (V, E)$ where $V$ is a set of vertices and $E = V \times V$ is the set of edges, can model a computer network. By this consideration we search for solutions to real computer network problems with a theoretical approach. This approach is based on labelling each edge by a subset of a universal set, and then encoding a path as the union of the labels of its edges. We label each vertex $v \in V$ by using a subset of universal set $U$, then we present a way to encode shortest paths in the graph $G$ by using a way optimizing the data. By mathematical approach, it is provable that the labelling method we introduced eliminates the errors from the shortest paths in the graph. We aim to obtain the results in a more efficient use of network resources and to reduce network traffic. This shows how our theoretical approach works in real world network systems.

Zitieren

APA

KAYATURAN, G. C. (2022). Error Elimination From Bloom Filters in Computer Networks Represented by Graphs. Fundamental Journal of Mathematics and Applications. https://doi.org/10.33401/fujma.1091736

Vancouver

KAYATURAN GC. Error Elimination From Bloom Filters in Computer Networks Represented by Graphs. Fundamental Journal of Mathematics and Applications. 2022. doi:10.33401/fujma.1091736

BibTeX
@article{KAYATURAN2022,
  author = {KAYATURAN, Gokce CAYLAK},
  title = {Error Elimination From Bloom Filters in Computer Networks Represented by Graphs},
  journal = {Fundamental Journal of Mathematics and Applications},
  year = {2022},
  doi = {10.33401/fujma.1091736}
}
Kostenlos starten →