Maximum Production of Transmission Messages Rate for Service Discovery Protocols
Intisar Al-Mejibli, Martin Colley

TL;DR
This paper introduces an algorithm to optimize message timing and queue sizes in network routers to reduce dropped UDP messages, particularly for service discovery protocols like UPnP, improving network reliability.
Contribution
It presents a novel algorithm for predicting minimum message intervals and queue sizes, enhancing message delivery in network protocols.
Findings
Reduced number of dropped messages in simulations
Effective in both centralized and decentralized router configurations
Improved network throughput and reliability
Abstract
Minimizing the number of dropped User Datagram Protocol (UDP) messages in a network is regarded as a challenge by researchers. This issue represents serious problems for many protocols particularly those that depend on sending messages as part of their strategy, such us service discovery protocols. This paper proposes and evaluates an algorithm to predict the minimum period of time required between two or more consecutive messages and suggests the minimum queue sizes for the routers, to manage the traffic and minimise the number of dropped messages that has been caused by either congestion or queue overflow or both together. The algorithm has been applied to the Universal Plug and Play (UPnP) protocol using ns2 simulator. It was tested when the routers were connected in two configurations; as a centralized and de centralized. The message length and bandwidth of the links among the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Software System Performance and Reliability · Real-Time Systems Scheduling
