Abstract
In this work, the authors propose a routing algorithm based on information entropy theory for calculating the metric, considering theprobability of packet loss. Information entropy theory serves as a robust foundation for evaluating uncertainty and disorder in data transmission, facilitating the development of a more resilient and intelligent routing strategy. In contrast to existing algorithms, the proposed approach enables a more accurate assessment of data transmission quality within the network, optimizing the routing process for maximum efficiency. The experimental results demonstrate a significant enhancement in network service quality while maintaining high performance. To validate the algorithm's effectiveness, a series of experiments were conducted, evaluating key performance metrics such as throughput, delay, and packet loss. A comparative analysis with established routing algorithms was also carried out, allowing for the assessment of advantages and drawbacks in relation to well-known algorithms. The findings suggest that the proposed algorithm surpasses traditional routing methods in optimizing data transmission quality and overall network efficiency.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.