2026-09-22T03:42:15Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/167622022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Mark W. Garrett and Hari Balakrishnan.
Baron, Jason Ivan Howard, 1978-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-05-19T14:30:19Z
2005-05-19T14:30:19Z
2001
2001
http://hdl.handle.net/1721.1/16762
48982828
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
Includes bibliographical references (leaves 88-89).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Conventional methods of discovering network topology require the cooperation of network elements. We present a method of network topology discovery based solely upon end-to-end delay measurements that requires only the cooperation of end systems. Previous work using end-to-end measurements has focused on discovering tree topologies; the method here discovers more general networks. The discovery method is based on two algorithms: the matroid algorithm and the correlation algorithm. This work develops and validates the correlation algorithm for three increasingly sophisticated network models using simulation. We also develop an indicator of the quality of a particular result.
by Jason Ivan Howard Baron.
M.Eng.
89 leaves
607023 bytes
606756 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Discovering network topology by correlating end-to-end delay measurements
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6cb6c3b0-f00b-4ebe-ac78-17269ceb66bf">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Discovering network topology by correlating end-to-end delay measurements</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2001</PublicationDate>
<Authors>
<Author>
<DisplayName>Baron, Jason Ivan Howard, 1978-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Conventional methods of discovering network topology require the cooperation of network elements. We present a method of network topology discovery based solely upon end-to-end delay measurements that requires only the cooperation of end systems. Previous work using end-to-end measurements has focused on discovering tree topologies; the method here discovers more general networks. The discovery method is based on two algorithms: the matroid algorithm and the correlation algorithm. This work develops and validates the correlation algorithm for three increasingly sophisticated network models using simulation. We also develop an indicator of the quality of a particular result.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>