Application of graph theory to clustering in delay space

Marat Zhanikeev*, Yoshiaki Tanaka

*この研究の対応する著者

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010
出版ステータスPublished - 2010 9 16
イベント8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010 - Kuching, Malaysia
継続期間: 2010 6 152010 6 18

出版物シリーズ

名前8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010

Conference

Conference8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010
国/地域Malaysia
CityKuching
Period10/6/1510/6/18

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信

フィンガープリント

「Application of graph theory to clustering in delay space」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル