Paths and Distance in the Web Using a Behavioral Web Graph

• US 20080313125A1
• Filed: 03/14/2008
• Published: 12/18/2008
• Est. Priority Date: 06/12/2007
• Status: Abandoned Application

• Current Assignee: Tethys Prime, Inc.
• Original Assignee: Tethys Prime, Inc.
• Inventors: McCord, Alan, Boys, Donald R., Galvin, Brian
• Application Number:
  US12/048,341
• Publication Number:
  US 20080313125A1
• Time in Patent Office: Days
• US Class Current: 706/52
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A method for determining distance between two nodes in a network has steps for (a) creating a map of nodes in the network, the map having points representing pairs of nodes; (b) determining a probability at individual points that an entity connected to one of the nodes of the pair associated with the point will next connect to the other node associated with the point; (c) selecting a first and second node in the network for determining a distance; and (d) beginning with one of the two nodes selected, using the map with probabilities, determining the path of highest probability from the first node to the second node, regardless of the number of jumps required in the path, as the distance between the first and the second node.

Claims

1. A method for determining distance between two nodes in a network, comprising steps of:

(a) creating a map of nodes in the network, the map having points representing pairs of nodes;

(b) determining a probability at individual points that an entity connected to one of the nodes of the pair associated with the point will next connect to the other node associated with the point;

(c) selecting a first and second node in the network for determining a distance; and

(d) beginning with one of the two nodes selected, using the map with probabilities, determining the path of highest probability from the first node to the second node, regardless of the number of jumps required in the path, as the distance between the first and the second node.

2. The method of claim 1 wherein the network is a data packet network.

3. The method of claim 1 wherein the network is the Internet network.

4. A system operating on a computer for determining distance between two nodes in a network, comprising:

a map comprising a plurality of points representing first and second nodes in the network, each point annotated with a probability that a user connected at one of the nodes associated with the point will next connect to the other node associated with the point;

a mechanism for selecting a pair of points in the map to determine a path; and

a mechanism for determining the path of highest probability from the first node to the second node, regardless of the number of jumps required in the path, as the distance between the first and the second node.

5. The system of claim 4 wherein the network is a data packet network.

6. The system of claim 4 wherein the network is the Internet network.