Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36925
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Discover multicast network internal characteristics based on Hamming distance |
Author: | Tian, H. Shen, H. |
Citation: | Proceedings of 2005 IEEE International Conference on Communications (ICC 2005), Seoul, Korea, pp. 143-147 |
Publisher: | IEEE |
Publisher Place: | Online |
Issue Date: | 2005 |
ISBN: | 0780389395 |
ISSN: | 0536-1486 |
Conference Name: | IEEE International Conference on Communications (2005 : Seoul, Korea) |
Statement of Responsibility: | Hui Tian, Hong Shen |
Abstract: | One of the important techniques to monitor and control large-scale networks today is to implement only at the end. However end-based control needs to have the knowledge of network internal characteristics. The paper proposes a novel approach to discover network internal characteristics from end-to-end multicast traffic measurements, which requires no support from internal routers. Our approach is based on Hamming distance of sequences on receipt/loss of probe packets maintained at each pair of nodes. As we discuss in this paper, our approach mainly focuses on identification of network internal characteristics of routing topology and loss performance. The simulation shows that the Hamming distance-based approach can discover the routing topology which is more accurate and efficient with a finite number of probe packets than before. The Hamming distance matrix proposed in this paper can also effectively discover the loss performance of the network. |
Description: | Copyright © 2005 IEEE |
DOI: | 10.1109/ICC.2005.1494336 |
Published version: | http://dx.doi.org/10.1109/icc.2005.1494336 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
hdl_36925.pdf | 199.84 kB | Author's post-print | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.