Descending-order clique-based task scheduling for active measurements

Document Type

Conference Proceeding

Publication Date

12-1-2007

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. ©2007 IEEE.

Identifier

47649129493 (Scopus)

ISBN

[1424412064, 9781424412068]

Publication Title

2007 IEEE Workshop on High Performance Switching and Routing Hpsr

External Full Text Location

https://doi.org/10.1109/HPSR.2007.4281263

First Page

318

Last Page

323

This document is currently not available here.

Share

COinS