Method and system for finding related nodes in a social network

Details Method and system for finding related nodes in a social network Method and system for finding related nodes in a social network

2006-03-21

2006-03-21

Hsu, Alpus H. (Department: 2665)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S254000, C709S220000, C709S241000

Reexamination Certificate

active

07016307

ABSTRACT:
A process for reducing the resources employed in real time to communicate a message between related nodes that are separated by multiple degrees of separation in a social network. At least a portion of the shortest path for the multiple degrees of separation between at least two related nodes in a social network is determined out of band prior to the initiation of a process to communicate between the related nodes. By pre-processing at least a portion of the degrees of separation for the shortest path between the nodes, the actual resources employed in real time to calculate the entire shortest path can be reduced. Typically, approximately fifty percent or more of the shortest paths for the degrees of separation between related nodes in the social network are pre-processed. Since the amount of resources for determining the shortest path for each degree of separation can exponentially increase with each degree, the pre-processing of a portion of the degrees of separation along a shortest path can significantly reduce the resources required in real time to complete the determination of the shortest path. Also, if a common intermediate node is identified in the pre-processing of the shortest paths for two nodes in the social network, the intermediate shortest paths can be stored for reuse as a complete shortest path between these two nodes.

REFERENCES:
patent: 6704320 (2004-03-01), Narvaez et al.
patent: 2004/0122855 (2004-06-01), Ruvolo et al.
patent: 2004/0148275 (2004-07-01), Achlioptas
patent: 2004/0215793 (2004-10-01), Ryan et al.
patent: 2004/0218536 (2004-11-01), Yasukawa et al.
patent: 2005/0080924 (2005-04-01), Shang et al.
patent: 2005/0083858 (2005-04-01), Loa et al.
Caldwell, Chris, 1995, “Graph Theory Glossary.” Available at: http://www.utm.edu/departments/math/graph/glossary.html (Nov. 14, 2003, pp 1-4).
Rodrigue, Dr. Jean-Paul, “Graph Theory: Definition and Properties.” Available at: http://people.hofstra.edu/geotrans/eng/ch2en/meth2en/ch2m1en.html (Nov. 14, 2003, pp. 1-8).

Affiliated with

Also associated with

Rating

Method and system for finding related nodes in a social network does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for finding related nodes in a social network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for finding related nodes in a social network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3539899