Abstract
Network active measurement is a required process in high performance networks for efficient QoS provisioning. The contention of the active measurement processes in a network can jeopardize measurement and overload network and computation resources. In this paper, we propose a novel scheduling algorithm to resolve contention of measurement tasks. Our proposed scheme is based on graph-coloring theory and uses a descending order of a clique (a set of contending nodes) in a graph. We evaluate our proposed scheme under different measurement task assignment scenarios. The simulation results demonstrate that our proposed scheme produces effective contention resolution and decreases the number of assigned colors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
