Method, System, and Devices for Network Sharing or Searching Of Resources

• US 20100095009A1
• Filed: 10/01/2007
• Published: 04/15/2010
• Est. Priority Date: 10/02/2006
• Status: Abandoned Application

• Current Assignee: Nokia Corporation
• Original Assignee: Nokia Corporation
• Inventors: Garcia, Miguel Angel, Matuszewski, Marcin Wieslaw
• Application Number:
  US12/443,922
• Publication Number:
  US 20100095009A1
• Time in Patent Office: Days
• US Class Current: 709/228
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1059 Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
• CPC Class Codes: H04L 67/1065 Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] pre-configuration of logical or physical connections H04L67/1053
• CPC Class Codes: H04L 67/306 User profiles

Abstract

The invention presents an architecture of a distributed communication system that combines strengths of Distributed Hash Table (DHT) algorithms and social networks. The system forms a cost efficient platform for providing innovative mobile Services. Possible implementations of the proposed system in the IP Multimedia Subsystem and as a standalone SIP based system are presented. The architecture may also be deployed in other systems. Further, a content sharing inside community service is provided.

Claims

1-35. -35. (canceled)

36. A method, comprising:

storing, for each user, information related to resources provided by the user and/or his social contacts to other users;

receiving, from a first user host, a first resource request requesting a resource from a second user host;

if the second user host does not provide the requested resource, generating a second resource request to a third user host indicated as a stored social contact of the second user; and

locating and forwarding the second resource request based on distributed hash table algorithm.

37. The method according to claim 36, further comprising receiving information related to resources provided by one of the users, and/or to his social contacts to other users.

38. The method according to claim 36, further comprising sending, by the third user host, the requested resource to the first user host.

39. The method according to claim 36, wherein each user has a unique user identifier.

40. Method according to claim 39, wherein the user identifier forms a key used to identify the user or resource.

41. Method according to claim 39, wherein the information per user is stored in the form of a pair of the key and a value used in distributed hash table algorithm.

42. Method according to claim 41, wherein the value of a key comprises at least one of:

a list of resources the user makes available to other users;

metadata associated with the list of resources;

a list of groups the user is member of; and

for each group the user is member of, a list of users that belong to the same group.

43. The method according to claim 36, wherein the resource requests are transmitted using a session initiation protocol as a signaling protocol by a protocol processor.

44. The method according to claim 39, wherein the user identifier is a session initiation protocol uniform resource identifier.

45. The method according to claim 37, wherein the information is received based on a session initiation protocol.

46. The method according to claim 36, wherein the social contact information of the user are stored in the user'"'"'s address book or an email list on the user host.

47. The method according to claim 36, wherein the user hosts are within a peer to peer networks.

48. Computer program product embodied on a computer-readable storage medium having computer-executable components that perform, when the program is run on a computer:

storing, for each user, information related to resources provided by the user and/or his social contacts to other users;

receiving, from a first user host, a first resource request requesting a resource of a second user;

if the second user host does not provide the requested resource, generating a second resource request to a third user host indicated as a stored social contact of the second user; and

locating and forwarding the second resource request based on distributed hash table algorithm.

49. An apparatus, comprising:

a memory with a database configured to store, for each user, information related to resources provided by the user and/or his social contacts to other users;

a receiving processor configured to receive, from a first user host, a first resource request requesting a resource from a second user;

a request processor configured to generate, if the second user does not provide the requested resource, a second resource request to a third user host indicated as a stored social contact of the second user; and

a transmitting processor configured to locate and forward the second resource request based on distributed hash table algorithm.

50. The apparatus according to claim 49, the receiving processor is further configured to receive information related to resources provided by one of the users, and/or to his social contacts to other users.

51. The apparatus according to claim 49, wherein the information per user is stored in the form of a pair of the key and a value used in distributed hash table algorithm.

52. The apparatus according to claim 49, wherein the social contact information of the user are stored in the user'"'"'s address book or an email list.

53. The apparatus according to claim 51, wherein the value of a key comprises at least one of:

a list of resources the user makes available to other users;

metadata associated with the list of resources;

a list of groups the user is member of; and

for each group the user is member of, a list of users that belong to the same group.

54. The apparatus according to claim 49, wherein the apparatus comprises at least one of a chipset, device, node, terminal, a mobile terminal, and a network gateway node chipset.

55. The apparatus according to claim 49, further comprising a protocol processor configured to process a session initiation protocol as a signaling protocol.

56. The apparatus according to claim 49, wherein each user has a unique user identifier and the user identifier forms a key used to identify the user or resource.

57. The apparatus according to claim 56, wherein the user identifier is session initiation protocol uniform resource identifier.