Descending-order clique-based task scheduling for active measurements

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2007 IEEE Workshop on High Performance Switching and Routing, HPSR
Pages318-323
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2007 IEEE Workshop on High Performance Switching and Routing, HPSR - Brooklyn, NY, United States
Duration: May 30 2007Jun 1 2007

Publication series

Name2007 IEEE Workshop on High Performance Switching and Routing, HPSR

Other

Other2007 IEEE Workshop on High Performance Switching and Routing, HPSR
CountryUnited States
CityBrooklyn, NY
Period5/30/076/1/07

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Keywords

  • Active measurements
  • Graph coloring
  • Network measurements
  • Scheduling

Fingerprint Dive into the research topics of 'Descending-order clique-based task scheduling for active measurements'. Together they form a unique fingerprint.

Cite this