Probing based topology inference for large scale community networks

Marat Zhanikeev, Yoshiaki Tanaka, Tomohiko Ogishi

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

    Abstract

    Traditional research in on-demand topological solutions is gathered around the two main clusters, - wireless ad-hoc networks and fixed overlay networks. Both are very different in nature, but they both deal with the same problem which is to create a topology out of an arbitrary set of nodes. This paper considers the case of an arbitrary set of mixed-technology nodes which are to be joined in a topology based on end-to-end delay measurements among nodes. The core of the proposal is topology inference based on triangular inequality of end-to-end delay which is finalized in form of an algorithm that allows for efficient detection of a logical topology of a network with no initial topology. The algorithm is scalable and could be a practical solution for many scenarios involving community services created on-demand and intended for a short lifespan.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Pages92-101
    Number of pages10
    Volume5297 LNCS
    DOIs
    Publication statusPublished - 2008
    Event11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008 - Beijing
    Duration: 2008 Oct 222008 Oct 24

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume5297 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008
    CityBeijing
    Period08/10/2208/10/24

    Fingerprint

    Topology
    End-to-end Delay
    Vertex of a graph
    Overlay networks
    Wireless Ad Hoc Networks
    Overlay Networks
    Life Span
    Wireless ad hoc networks
    Arbitrary
    Triangular
    Community
    Scenarios
    Demand

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Zhanikeev, M., Tanaka, Y., & Ogishi, T. (2008). Probing based topology inference for large scale community networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5297 LNCS, pp. 92-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5297 LNCS). https://doi.org/10.1007/978-3-540-88623-5-10

    Probing based topology inference for large scale community networks. / Zhanikeev, Marat; Tanaka, Yoshiaki; Ogishi, Tomohiko.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5297 LNCS 2008. p. 92-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5297 LNCS).

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

    Zhanikeev, M, Tanaka, Y & Ogishi, T 2008, Probing based topology inference for large scale community networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5297 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5297 LNCS, pp. 92-101, 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Beijing, 08/10/22. https://doi.org/10.1007/978-3-540-88623-5-10
    Zhanikeev M, Tanaka Y, Ogishi T. Probing based topology inference for large scale community networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5297 LNCS. 2008. p. 92-101. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-88623-5-10
    Zhanikeev, Marat ; Tanaka, Yoshiaki ; Ogishi, Tomohiko. / Probing based topology inference for large scale community networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5297 LNCS 2008. pp. 92-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{74a5018be9684b099de54bac563cae39,
    title = "Probing based topology inference for large scale community networks",
    abstract = "Traditional research in on-demand topological solutions is gathered around the two main clusters, - wireless ad-hoc networks and fixed overlay networks. Both are very different in nature, but they both deal with the same problem which is to create a topology out of an arbitrary set of nodes. This paper considers the case of an arbitrary set of mixed-technology nodes which are to be joined in a topology based on end-to-end delay measurements among nodes. The core of the proposal is topology inference based on triangular inequality of end-to-end delay which is finalized in form of an algorithm that allows for efficient detection of a logical topology of a network with no initial topology. The algorithm is scalable and could be a practical solution for many scenarios involving community services created on-demand and intended for a short lifespan.",
    author = "Marat Zhanikeev and Yoshiaki Tanaka and Tomohiko Ogishi",
    year = "2008",
    doi = "10.1007/978-3-540-88623-5-10",
    language = "English",
    isbn = "3540886222",
    volume = "5297 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "92--101",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - Probing based topology inference for large scale community networks

    AU - Zhanikeev, Marat

    AU - Tanaka, Yoshiaki

    AU - Ogishi, Tomohiko

    PY - 2008

    Y1 - 2008

    N2 - Traditional research in on-demand topological solutions is gathered around the two main clusters, - wireless ad-hoc networks and fixed overlay networks. Both are very different in nature, but they both deal with the same problem which is to create a topology out of an arbitrary set of nodes. This paper considers the case of an arbitrary set of mixed-technology nodes which are to be joined in a topology based on end-to-end delay measurements among nodes. The core of the proposal is topology inference based on triangular inequality of end-to-end delay which is finalized in form of an algorithm that allows for efficient detection of a logical topology of a network with no initial topology. The algorithm is scalable and could be a practical solution for many scenarios involving community services created on-demand and intended for a short lifespan.

    AB - Traditional research in on-demand topological solutions is gathered around the two main clusters, - wireless ad-hoc networks and fixed overlay networks. Both are very different in nature, but they both deal with the same problem which is to create a topology out of an arbitrary set of nodes. This paper considers the case of an arbitrary set of mixed-technology nodes which are to be joined in a topology based on end-to-end delay measurements among nodes. The core of the proposal is topology inference based on triangular inequality of end-to-end delay which is finalized in form of an algorithm that allows for efficient detection of a logical topology of a network with no initial topology. The algorithm is scalable and could be a practical solution for many scenarios involving community services created on-demand and intended for a short lifespan.

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

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

    U2 - 10.1007/978-3-540-88623-5-10

    DO - 10.1007/978-3-540-88623-5-10

    M3 - Conference contribution

    SN - 3540886222

    SN - 9783540886228

    VL - 5297 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 92

    EP - 101

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    ER -