Networks Utilization Improvements for Service Discovery Performance
Intisar Al-Mejibli, Martin Colley Salah Al-Majeed

TL;DR
This paper introduces an algorithm that improves service discovery protocol performance by spacing message bursts based on network resources, tested in different router configurations and under varying network loads.
Contribution
It proposes a novel algorithm to optimize service discovery message flow, reducing congestion and message loss in networked environments.
Findings
The algorithm reduces message congestion and loss.
Performance improves in both decentralised and centralised router setups.
Increasing clients and network load impacts algorithm effectiveness.
Abstract
Service discovery requests' messages have a vital role in sharing and locating resources in many of service discovery protocols. Sending more messages than a link can handle may cause congestion and loss of messages which dramatically influences the performance of these protocols. Re-send the lost messages result in latency and inefficiency in performing the tasks which user(s) require from the connected nodes. This issue become a serious problem in two cases: first, when the number of clients which performs a service discovery request is increasing, as this result in increasing in the number of sent discovery messages; second, when the network resources such as bandwidth capacity are consumed by other applications. These two cases lead to network congestion and loss of messages. This paper propose an algorithm to improve the services discovery protocols performance by separating each…
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 · Mobile Agent-Based Network Management · Optimization and Search Problems
