Probing Based Topology Inference for Large Scale Community Networks

Authors:
Marat Zhanikeev;Yoshiaki Tanaka;Tomohiko Ogishi
Affiliations:
School of International Liberal Studies, Waseda University, Tokyo, Japan 169-0051;Global Information and Telecommunication Institute, Waseda University, Tokyo, Japan 169-0051 and Research Institute for Science and Engineering, Waseda University, Tokyo, Japan 162-0044;KDDI R&D Laboratories, Saitama, Japan 356-8502
Venue:
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Year:
2008

Citing 4
Cited 0

Vivaldi: a decentralized network coordinate system

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Meridian: a lightweight network location service without virtual coordinates

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-End Delay Behavior in the Internet

MASCOTS '06 Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation
Measurement based analysis, modeling, and synthesis of the internet delay space

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

Quantified Score

Hi-index	0.00

Visualization

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.