Srinivas R Kashyap

US Patent:

20080175169, Jul 24, 2008

Filed:

Jan 23, 2007

Appl. No.:

11/656465

Inventors:

Supratim Deb - Bangalore, IN
Srinivas Kashyap - Greenbelt MD, US
Naidu K V M - Bangalore, IN
Rajeev Rastogi - Bangalore, IN
Anand Srinivasan - Bangalore, IN

International Classification:

H04L 12/28

US Classification:

370255

Abstract:

A method of grouping nodes within a distributed network is provided. The example method includes performing a leader node self determination operation by which each node within the distributed network determines whether to become a leader node or a non-leader node, each leader node being the leader of a group including at least one node. Next, requests are sent, from each leader node, requesting at least one non-leader node to join the group associated with the leader node. First received requests are accepted, at each non-leader node, such that accepting non-leader nodes transition from a non-leader node to a dependent node dependent upon the requesting leader node. A next set of requests are sent, from each remaining non-leader node, requesting to join the group associated with at least one leader node. A determination is made, at each requested leader node, as to whether to accept the non-leader node into the group associated with the requested leader node. Based on the determination, at each requested leader node, the non-leader node is either accepted into the group associated with the requested leader node, or is alternatively rejected from the group.

US Patent:

20060136098, Jun 22, 2006

Filed:

Dec 17, 2004

Appl. No.:

11/015989

Inventors:

Krishna Chitrapura - Noida, IN
Srinivas Kashyap - Green belt MD, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

700262000

Abstract:

The World Wide Web (WWW) can be modelled as a labelled directed graph G(V,E,L), in which V is the set of nodes, E is the set of edges, and L is a label function that maps edges to labels. This model, when applied to the WWW, indicates that V is a set of hypertext documents or objects, E is a set of hyperlinks connecting the documents in V, and the edge-label function represents the anchor-text corresponding to the hyperlinks. One can find a probabilistic ranking of the nodes for any given label, a ranking of the labels for any given node, and rankings of labels and pages using flow based models. Further, the flows can be computing using sparse matrix operations.