Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36961
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tian, H. | - |
dc.contributor.author | Shen, H. | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | High performance computing : 5th International Symposium, ISHPC 2003, Tokio-Odaiba, Japan, October 20-22, 2003 : proceedings / Alex Veidenbaum ... [et al.] (eds.), pp. 376-384 | - |
dc.identifier.isbn | 3540203591 | - |
dc.identifier.isbn | 9783540397076 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://hdl.handle.net/2440/36961 | - |
dc.description | The original publication is available at www.springerlink.com | - |
dc.description.abstract | Multicast topology inference from end-to-end measurements has been widely used recently. Algorithms of inference on loss distribution show good performance in inference accuracy and time complexity. However, to our knowledge, the existing results produce logical topology structures that are only in the complete binary tree form, which differ in most cases significantly from the actual network topology. To solve this problem, we propose an algorithm that makes use of an additional measure of hop count. The improved algorithm of incorporating hop count in binary tree topology inference is helpful to reduce time complexity and improve inference accuracy. Through comparison and analysis, it is obtained that the time complexity of our algorithm in the worst case is O (l 2) that is much better than O (l 3) required by the previous algorithm. The expected time complexity of the algorithm is estimated at , while that of the previous algorithm is O (l 3). | - |
dc.description.statementofresponsibility | Hui Tian and Hong Shen | - |
dc.language.iso | en | - |
dc.publisher | Springer | - |
dc.relation.ispartofseries | Lecture notes in computer science, 2858 | - |
dc.source.uri | http://www.springerlink.com/content/n9dcreh9gm3k06dq/ | - |
dc.subject | Multicast | - |
dc.subject | topology inference | - |
dc.subject | end-to-end measurement | - |
dc.subject | hop count | - |
dc.title | An improved algorithm of multicast topology inference from end-to-end measurements | - |
dc.type | Conference paper | - |
dc.contributor.conference | International Symposium on High Performance Computing (5th : 2003 : Tokyo, Japan) | - |
dc.identifier.doi | 10.1007/978-3-540-39707-6_32 | - |
dc.publisher.place | Berlin | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648] | - |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.