1. A method of locating a prefix hijacker within a one-hop neighborhood, the method comprising: generating, using a computing system, one-hop neighborhoods from autonomous system-level paths to a destination prefix, the autonomous system-level paths associated with a plurality of monitors, each of the one-hop neighborhoods including autonomous system identifiers that are in an autonomous system-level path and autonomous system-level identifiers that are within one-hop of the autonomous system identifiers in the autonomous system-level path; determining, using the computing system, a suspect set of autonomous system identifiers resulting from a union of the one-hop neighborhoods, determining the suspect set of autonomous system identifiers further comprising: selecting an autonomous system identifier from a one-hop neighborhood of a selected monitor from the plurality of monitors; determining whether the selected autonomous system identifier is in the suspect set of autonomous system identifiers; inserting selectively the selected autonomous system identifier into the suspect set of autonomous system identifiers if the selected autonomous system identifier is not in the suspect set of autonomous system identifiers; and performing iteratively the selecting, determining and inserting selectively for other selected monitors from the plurality of monitors; calculating, using the computing system, a count and a distance associated with each autonomous system identifier in the suspect set of autonomous system identifiers, the count representing how often an autonomous system identifier appears in the one-hop neighborhoods, the distance representing a total number of autonomous system identifiers from the autonomous system identifier to autonomous system identifiers associated with the plurality of monitors; and generating, using the computing system, a one-hop suspect set including autonomous system identifiers in the suspect set that have a greatest sum of the count and the distance.