METHOD AND SYSTEM FOR DATA MANAGEMENT IN COMMUNICATION NETWORKS

• US 20100128731A1
• Filed: 07/02/2007
• Published: 05/27/2010
• Est. Priority Date: 07/02/2007
• Status: Active Grant

• Current Assignee: Telecom Italia S.p.A.
• Original Assignee: Telecom Italia S.p.A.
• Inventors: Alfano, Rosario, Manzalini, Antonio
• Granted Patent: US 8,165,130 B2
• Time in Patent Office: Days
• US Class Current: 370/395.700
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1059 Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
• CPC Class Codes: H04L 67/1068 Discovery involving direct consultation or announcement among potential requesting and potential source peers

Abstract

A method for operating a node of a communication network including a plurality of peer-to-peer nodes, the node being linked with predetermined neighbour nodes among the plurality of peer-to-peer nodes, includes: a) storing, on a first storage area, node information indicative of predetermined data required by the node to become an information provider node; b) waiting to receive from at least one information provider node of the neighbour nodes describing information of data that can be provided by the information provider node; c) at the receipt of the describing information from the at least one information provider node, checking in the first storage area if the data that can be provided by the at least one information provider node match at least in part the predetermined data required by the node; d) in the affirmative, deleting in the first storage area the node information indicative of the matching data; and e) in the negative, forwarding the describing information received in c) to at least one of the plurality of peer-to-peer nodes.

Claims

1-27. -27. (canceled)

28. A method for operating a node of a communication network comprising a plurality of peer-to-peer nodes, the node being linked with predetermined neighbour nodes among said plurality of peer-to-peer nodes, comprising:

a) storing, on a first storage area, node information indicative of predetermined data required by the node to become an information provider node;

b) waiting to receive from at least one information provider node of the neighbour nodes, describing information of data that can be provided by said information provider node;

c) at the receipt of said describing information from said at least one information provider node, checking in said first storage area if the data that can be provided by said at least one information provider node match at least in part the predetermined data required by the node;

d) in the affirmative, deleting in the first storage area the node information indicative of the matching data; and

e) in the negative, forwarding the describing information received in c) to at least one of the plurality of peer-to-peer nodes.

29. The method according to claim 28, further comprising a1) receiving from at least one requiring node of the neighbour nodes, neighbour information indicative of predetermined data required by said at least one requiring node to become an information provider node.

30. The method according to claim 29, further comprising, a2) storing the neighbour information received in a1) in a second storage area.

31. The method according to claim 30, wherein, at the receipt of said describing information from said information provider node and before execution of e), further comprising, f) checking in said second storage area if the data that can be provided by said at least one information provider node match at least in part the predetermined data required by the requiring node.

32. The method according to claim 31, wherein, in the affirmative case of f), further comprising deleting in the second storage area, the neighbour information indicative of the matching data and sending the describing information received in c) to the requiring node.

33. The method according to claim 32, further comprising requesting the at least one information provider node to link itself with the requiring node.

34. The method according to claim 31, wherein, in the negative case of f), step e) is executed.

35. The method according to claim 28, wherein, in e), the at least one of the plurality of peer-to-peer nodes to which the describing information received in c) is forwarded, is a node different from the neighbour nodes.

36. The method according to claim 28, wherein e) further comprises requesting the at least one information provider node to link itself with the at least one of the plurality of peer-to-peer nodes to which the describing information received in c) is forwarded.

37. The method according to claim 28, wherein e) further comprises requesting the at least one information provider node to eliminate its link with the node.

38. The method according to claim 28, wherein e) further comprises eliminating a link of the node with the at least one information provider node.

39. The method according to claim 28, wherein e) further comprises linking the node with the at least one of the plurality of peer-to-peer nodes to which the describing information received in c) is forwarded.

40. The method according to claim 28, wherein a) further comprises sending to the plurality of neighbour nodes, the node information indicative of said predetermined data required by the node.

41. The method according to claim 40, wherein d) further comprises notifying the plurality of neighbour nodes about matching data.

42. The method according to claim 28, wherein d) further comprises g) checking in said first storage area if all the predetermined data required by the node to become an information provider node matched.

43. The method according to claim 42, wherein, in the affirmative case of g), the node becomes an information provider node capable of providing predetermined data.

44. The method according to claim 43, further comprising sending to at least part of the neighbour nodes, describing information of the predetermined data that can be provided by the node.

45. The method according to claim 44, wherein the describing information of the predetermined data that can be provided by the node is sent to the neighbour nodes other than information provider nodes.

46. The method according to claim 42, wherein, in the negative case of g), returning to the execution of b).

47. The method according to claim 43, wherein, when information indicative of predetermined data required by a requiring node of the neighbour nodes is received, further comprising sending to the requiring node the describing information of data that can be provided by the node.

48. The method according to claim 43, wherein, when at least part of the predetermined data required to become an information provider node fail, returning to the execution of a).

49. The method according to claim 43, wherein, when a request is received to link the node with a node of the plurality of peer-to-peer nodes, further comprising creating a link with said node and sending the describing information of the data that can be provided by the node to the newly linked node.

50. The method according to claim 43, wherein, when describing information is received of data that can be provided by an information provider node of the neighbour nodes, further comprising eliminating the link with said information provider node.

51. A node for a communication network, the node capable of being adapted to establish a link with predetermined neighbour nodes among a plurality of peer-to-peer nodes of the communication network, comprising a first storage area and modules capable of being adapted to:

a) store, on said first storage area, node information indicative of predetermined data required by a node to become an information provider node;

b) wait to receive from at least one information provider node of linked neighbour nodes describing information of data that can be provided by said at least one information provider node;

c) at the of receipt of said describing information from said information provider node, check in said first storage area if data that can be provided by said at least one information provider node match at least in part the predetermined data required by the node;

d) in the affirmative, delete in the first storage area, node information indicative of the matching data; and

e) in the negative, forward the describing information received in c) to at least one of the plurality of peer-to-peer nodes.

52. A communication network comprising a plurality of peer-to-peer nodes, each node capable of being adapted to establish a link with predetermined neighbour nodes among the plurality of peer-to-peer nodes of the communication network, wherein at least one of said plurality of peer-to-peer nodes, requiring predetermined data to become an information provider node, comprises modules capable of being adapted to:

a) store, on a first storage area, node information indicative of said predetermined data required by the node to become an information provider node;

b) wait to receive from at least one information provider node of the linked neighbour nodes describing information of data that can be provided by said at least one information provider node;

c) at the receipt of said describing information from said at least one information provider node, check in said first storage area if the data that can be provided by said at least one information provider node match at least in part the predetermined data required by the node;

d) in the affirmative, delete in the first storage area the node information indicative of the matching data; and

e) in the negative, forward the describing information received in c) to at least one of the plurality of peer-to-peer nodes,

wherein at least one information provider node of said plurality of peer-to-peer nodes, that is able to provide predetermined data, comprises modules capable of being adapted to send to at least part of respective neighbour nodes describing information indicative of said data that it is able to provide.