METHOD AND APPARATUS FOR TRANSMITTING DATA IN A PEER-TO-PEER NETWORK

• US 20120209915A1
• Filed: 04/23/2012
• Published: 08/16/2012
• Est. Priority Date: 04/16/2007
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: LEE, Sang-kwon, CHOI, Hyok-sung
• Granted Patent: US 8,984,096 B2
• Time in Patent Office: Days
• US Class Current: 709/204
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/107 with limitation or expansion of the discovery scope
• CPC Class Codes: H04L 67/1072 Discovery involving ranked list compilation of candidate peers
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing

Abstract

An apparatus for transmitting data which includes a management unit that manages network-topology information of clients participating in the P2P service, and an interface unit that provides to a first client a peer list including information of a client having the minimum network distance to the first client, based on the network topology information, when receiving a request for content from the first client.

Claims

1. An apparatus for transmitting data, the apparatus comprising:

a management unit that manages network-topology information of clients participating in peer-to-peer (P2P) service; and

an interface unit that provides to a first client a peer list including information of at least one client having a minimum network distance to the first client, based on the network topology information, when receiving a request for content from the first client.

2. An apparatus for transmitting data, the apparatus comprising:

a management unit that manages network-topology information of clients participating in a peer-to-peer (P2P) service according to autonomous networks to which the clients belongs;

a path-retrieving unit that determines a shortest path between a first client that belongs to a first autonomous network, and has sent a request for content, and a second client that belongs to a second autonomous network, and shares the content, with reference to a result of measuring data-transmission speed; and

an interface unit that provides a peer list including the shortest path to the first client.

3. The apparatus of claim 2, wherein the path-retrieving unit selects a path having a minimum sum of results of measuring the data-transmission speed between autonomous networks existing on each path among all paths connecting the first autonomous network and the second autonomous network.

4. The apparatus of claim 2, further comprising:

a control unit that selects clients included in different autonomous networks in order to measure the data-transmission speed.

5. The apparatus of claim 4, wherein the data-transmission speed is a ping-response time between the selected clients.

6. The apparatus of claim 4, wherein the control unit selects the clients included in different autonomous networks for measuring the data-transmission speed in a case where a new client participating in the P2P service does not belong to an existing autonomous network.

7. The apparatus of claim 4, wherein the control unit selects clients included in different networks according to a predetermined period for measuring the data-transmission speed.

8. A method of transmitting data, the method comprising:

managing network-topology information of clients participating in a peer-to-peer (P2P) service according to the autonomous network to which the client belongs;

retrieving a shortest path between a first client that belongs to a first autonomous network, and has sent a request for content, and a second client that belongs to a second autonomous network and shares the content with reference to a result of measuring a data-transmission speed; and

providing a peer list including the shortest path to the first client.

9. The method of claim 8, wherein the retrieving includes selecting a path having a minimum sum of results of measuring the data-transmission speed between autonomous networks existing on each path among all paths connecting the first autonomous network and the second autonomous network.

10. The method of claim 8, further comprising:

selecting clients included in different autonomous networks in order to measure the data-transmission speed.

11. The method of claim 10, wherein the data-transmission speed is a ping-response time between the selected clients.

12. The method of claim 10, wherein the selecting of clients included in different autonomous networks includes measuring the data-transmission speed in a case where a new client participating in the P2P service does not belong to an existing autonomous network.

13. The method of claim 10, wherein the selecting of clients included in different autonomous networks includes selecting clients included in different autonomous networks according to predetermined periods in order to measure the data-transmission speed.