Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The commercial Internet consists of three major type-ofrelationships (ToR) beten neighboring ASes: customer-toprovider (c2p), peer-to-peer (p2p), and sibling-to-sibling (s2s). Since ToRs are regarded as proprietary information, deducing them is an important yet difficult problem. Gao [7] was the first to study the AS relationships inference problem and deduced that every BGP path must comply with a hierarchical valleyfree (or valid) structure: an uphill segment of zero or more c2p or s2s links, follod by zero or one p2p links, follod by a downhill segment of zero or more p2c or s2s links. Current relationships inference algorithms solve the ToR problem either using heuristic assumptions or by optimizing some aspects of ToR assignments. Optimization is usually achieved by minimizing the number of paths that violate valley free routing [10] while not allowing cycles to be created [4] in the directed relationships’ graph. Inference using heuristic assumptions causes the erroneous ToRs to be spread over all inferred links. Optimization models might fail to capture the true Internet hierarchy [6] and have a relatively low p2p inference accuracy [12]. Hence, both solutions fail to provide an insight or a bound on inference errors.  aims to improve on existing methods by providing a near-deterministic inference scheme (ND-ToR )f or solving the ToR problem. The input for ND-ToR is the Internet Core, a sub-graph that consists of the globally top-level providers of the Internet and their interconnecting links with their already inferred relationship types. Theoretically, given an accurately classified core, the algorithm deterministically infers most of the remaining AS relationships using the ASlevel paths relative to this core, without incurring additional inference errors. In real-world scenarios, where the core and AS-level paths can contain errors (due to misconfigurations or measurements mistakes), the algorithm introduces minimal inference mistakes.  show that ND-ToR has relaxed requirements from the core, and proves to be robust under changes in its definition, size and density.
['Udi Weinsberg', 'Yuval Shavitt', 'Eran Shir']
I am writing a research paper on a idea Near-Deterministic Inference of AS Relationships
[{"from": "human", "value": "I am writing a research paper on a idea Near-Deterministic Inference of AS Relationships"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The commercial Internet consists of three major type-ofrelationships (ToR) beten neighboring ASes: customer-toprovider (c2p), peer-to-peer (p2p), and sibling-to-sibling (s2s). Since ToRs are regarded as proprietary information, deducing them is an important yet difficult problem. Gao [7] was the first to study the AS relationships inference problem and deduced that every BGP path must comply with a hierarchical valleyfree (or valid) structure: an uphill segment of zero or more c2p or s2s links, follod by zero or one p2p links, follod by a downhill segment of zero or more p2c or s2s links. Current relationships inference algorithms solve the ToR problem either using heuristic assumptions or by optimizing some aspects of ToR assignments. Optimization is usually achieved by minimizing the number of paths that violate valley free routing [10] while not allowing cycles to be created [4] in the directed relationships\u2019 graph. Inference using heuristic assumptions causes the erroneous ToRs to be spread over all inferred links. Optimization models might fail to capture the true Internet hierarchy [6] and have a relatively low p2p inference accuracy [12]. Hence, both solutions fail to provide an insight or a bound on inference errors.  aims to improve on existing methods by providing a near-deterministic inference scheme (ND-ToR )f or solving the ToR problem. The input for ND-ToR is the Internet Core, a sub-graph that consists of the globally top-level providers of the Internet and their interconnecting links with their already inferred relationship types. Theoretically, given an accurately classified core, the algorithm deterministically infers most of the remaining AS relationships using the ASlevel paths relative to this core, without incurring additional inference errors. In real-world scenarios, where the core and AS-level paths can contain errors (due to misconfigurations or measurements mistakes), the algorithm introduces minimal inference mistakes.  show that ND-ToR has relaxed requirements from the core, and proves to be robust under changes in its definition, size and density."}]