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
    Event8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010 - Kuching
    Duration: 2010 Jun 152010 Jun 18

    Other

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

    Fingerprint

    Graph theory
    Topology

    Keywords

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

    ASJC Scopus subject areas

    • Computer Networks and Communications

    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]

    Application of graph theory to clustering in delay space. / Zhanikeev, Marat; Tanaka, Yoshiaki.

    8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010. 2010. 5532047.

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

    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, Kuching, 10/6/15.
    Zhanikeev M, Tanaka Y. Application of graph theory to clustering in delay space. In 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010. 2010. 5532047
    Zhanikeev, Marat ; Tanaka, Yoshiaki. / Application of graph theory to clustering in delay space. 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010. 2010.
    @inproceedings{12a26ae16dfc4d59bab4a1b6424832a1,
    title = "Application of graph theory to clustering in delay space",
    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.",
    keywords = "Clustering, End-to-end delay space, Graph theory, Matrix transform, Network embedding",
    author = "Marat Zhanikeev and Yoshiaki Tanaka",
    year = "2010",
    language = "English",
    isbn = "9781424464135",
    booktitle = "8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010",

    }

    TY - GEN

    T1 - Application of graph theory to clustering in delay space

    AU - Zhanikeev, Marat

    AU - Tanaka, Yoshiaki

    PY - 2010

    Y1 - 2010

    N2 - 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.

    AB - 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.

    KW - Clustering

    KW - End-to-end delay space

    KW - Graph theory

    KW - Matrix transform

    KW - Network embedding

    UR - http://www.scopus.com/inward/record.url?scp=77956478677&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77956478677&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:77956478677

    SN - 9781424464135

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

    ER -