{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/16762"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/16762","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Discovering network topology by correlating end-to-end delay measurements","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_html":"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_has_math":false,"creators":["Baron, Jason Ivan Howard, 1978-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Mark W. Garrett and Hari Balakrishnan."],"committee_chairs":[],"committee_members":[],"year":2001,"date_issued":"2001","date_published":"2001","updated_at":"2026-07-22T22:21:30Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/16762","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Mark W. Garrett and Hari Balakrishnan."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Baron, Jason Ivan Howard, 1978-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-05-19T14:30:19Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-05-19T14:30:19Z"]},{"key":"dc:date.issued","label":"Date","values":["2001"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/16762"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Discovering network topology by correlating end-to-end delay measurements"]}]}],"canonical_facts":{"dc:contributor.advisor":["Mark W. Garrett and Hari Balakrishnan."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Baron, Jason Ivan Howard, 1978-"],"dc:date.accessioned":["2005-05-19T14:30:19Z"],"dc:date.available":["2005-05-19T14:30:19Z"],"dc:date.issued":["2001"],"dc:description":["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."],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/16762"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Discovering network topology by correlating end-to-end delay measurements"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:30Z"}