Application of graph theory to clustering in delay space

Marat Zhanikeev, Yoshiaki Tanaka

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

Abstract

In recent years, many methods have been proposed for analysis of end-to-end delay space generated when end-to-end measurements are conducted among a large number of globally distributed nodes without the knowledge of underlying network topology. Most analysis in this area concludes that coordinate space generated from end-to-end delay has from 4 to 7 dimensions, based on frequency components found by PCA or similar techniques. This paper takes a traditional graph theory approach to clustering and proves that even with small number of end-to-end measurement data it is possible to detect clusters.

Original languageEnglish
Title of host publication8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010
Publication statusPublished - 2010 Sep 16
Event8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010 - Kuching, Malaysia
Duration: 2010 Jun 152010 Jun 18

Publication series

Name8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010

Conference

Conference8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010
CountryMalaysia
CityKuching
Period10/6/1510/6/18

Keywords

  • Clustering
  • End-to-end delay space
  • Graph theory
  • Matrix transform
  • Network embedding

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Application of graph theory to clustering in delay space'. Together they form a unique fingerprint.

  • Cite this

    Zhanikeev, M., & Tanaka, Y. (2010). Application of graph theory to clustering in delay space. In 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010 [5532047] (8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010).