Duplicate packet detection algorithm based on balanced binary tree
In order to apply to a wider range of scenarios, multicast packets are required from the infrastructure. The gateway nodes in the network are more complex than regular nodes, both in terms of joining multicast groups and forwarding packets between networks. The current detection of duplicate packets generally follows the same principle and varies a bit more in terms of resource consumption. In this paper, we propose an algorithm for data duplicate packet detection using a data structure, balanced binary tree, and compare it with conventional routing algorithms for detecting duplicate packets and analyze that the linear mapping relationship between priority and waiting time leads to the transmission of duplicate packets, which increases energy consumption and reduces the throughput of the network.
Authors
- Changying Li
Institutions
- Wenhua College
Publication Details
- Published
- 2025-01-16
- DOI
- https://doi.org/10.1117/12.3051993
- Primary Topic
- Network Packet Processing and Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.00