Probing based topology inference for large scale community networks

Marat Zhanikeev; Yoshiaki Tanaka; Tomohiko Ogishi

doi:10.1007/978-3-540-88623-5_10

Probing based topology inference for large scale community networks

Marat Zhanikeev^*, Yoshiaki Tanaka, Tomohiko Ogishi

^*Corresponding author for this work

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings
Publisher	Springer Verlag
Pages	92-101
Number of pages	10
ISBN (Print)	3540886222, 9783540886228
DOIs	https://doi.org/10.1007/978-3-540-88623-5_10
Publication status	Published - 2008
Event	11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008 - Beijing, China Duration: 2008 Oct 22 → 2008 Oct 24

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5297 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008
Country/Territory	China
City	Beijing
Period	08/10/22 → 08/10/24

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-88623-5_10

Cite this

Zhanikeev, M., Tanaka, Y., & Ogishi, T. (2008). Probing based topology inference for large scale community networks. In Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings (pp. 92-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5297 LNCS). Springer Verlag. 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.
Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings. Springer Verlag, 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 proceeding › Conference contribution

Zhanikeev, M, Tanaka, Y & Ogishi, T 2008, Probing based topology inference for large scale community networks. in Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5297 LNCS, Springer Verlag, pp. 92-101, 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Beijing, China, 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 Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings. Springer Verlag. 2008. p. 92-101. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-88623-5_10

Zhanikeev, Marat ; Tanaka, Yoshiaki ; Ogishi, Tomohiko. / Probing based topology inference for large scale community networks. Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings. Springer Verlag, 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",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "92--101",

booktitle = "Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings",

}

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

AN - SCOPUS:57049173342

SN - 3540886222

SN - 9783540886228

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

SP - 92

EP - 101

BT - Challenges for Next Generation Network Operations and Service Management - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008, Proceedings

PB - Springer Verlag

T2 - 11th Asia-Pacific Network Operations and Management Symposium, APNOMS 2008

Y2 - 22 October 2008 through 24 October 2008

ER -

Probing based topology inference for large scale community networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this