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

• US 20080256175A1
• Filed: 10/01/2007
• Published: 10/16/2008
• 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,180,853 B2
• Time in Patent Office: Days
• US Class Current: 709/203
• 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. The apparatus of claim 1, wherein the management unit manages the network-topology information according to autonomous networks including the clients participating in the P2P service.

3. The apparatus of claim 1, further comprising:

a peer-list-generation unit that generates the peer list,

wherein the peer list includes information of the at least one client having the minimum network distance to the first client among clients sharing the content.

4. The apparatus of claim 3, wherein the peer-list-generation unit adds to the peer list information of a third client sharing the content in at least one third autonomous network having a second-shortest network distance to a first autonomous network next to at least one second autonomous network in a case where there does not exist a second client sharing the content in the at least one second autonomous network having the minimum network distance to the first autonomous network to which the first client belongs.

5. The apparatus of claim 3, wherein the peer-list-generation unit adds information of a second client to the peer list in a case where there exists the second client sharing the content in the at least one second autonomous network having the minimum network distance to a first autonomous network to which the first client belongs.

6. The apparatus of claim 5, wherein the peer-list-generation unit adds to the peer list information of a third client sharing the content in at least one third autonomous network having a second-shortest network distance to the first autonomous network next to the at least one second autonomous network in the case where a number of clients included in the peer list is less than a critical value.

7. The apparatus of claim 1, wherein the interface unit provides the peer list to the first client in the case where a number of clients included in the peer list is the same as a critical value.

8. The apparatus of claim 1, wherein the network distance is determined by a hop count between autonomous networks including the clients.

9. 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.

10. The apparatus of claim 9, 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.

11. The apparatus of claim 9, further comprising:

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

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

13. The apparatus of claim 11, 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.

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

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

an interface unit that receives a peer list generated by at least one of the network distance between autonomous networks to which clients participating in peer-to-peer (P2P) service belong, and a result of measuring data-transmission speed between the autonomous networks from a server; and

a control unit that receives the requested content by connecting to the client included in the peer list.

16. The apparatus of claim 15, wherein the network distance is determined by a hop count between the autonomous networks.

17. The apparatus of claim 15, wherein the result of measuring the data-transmission speed is a ping-response time between clients selected in two different autonomous networks.

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

managing network-topology information of clients participating in a peer-to-peer (P2P) service; and

providing 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.

19. The method of claim 18, wherein the managing of the network-topology information includes managing by autonomous networks including the clients participating in the P2P service.

20. The method of claim 18, further comprising:

generating the peer list,

wherein the peer list includes information of the at least one client having the minimum network distance to the first client among clients sharing the content.

21. The method of claim 20, wherein the generating of the peer list includes:

retrieving at least one third autonomous network having a second-shortest network distance to the first autonomous network next to at least one second autonomous network in a case where there does not exist a second client sharing the content in the at least one second autonomous network having the minimum network distance to the first autonomous network to which the first client belongs; and

adding to the peer list information of a third client sharing the content among clients belonging to the at least one third autonomous network.

22. The method of claim 20, wherein the generating of the peer list includes adding to the peer list information of a second client in a case where there exist the second client sharing the content in the at least one second autonomous network having the minimum network distance to the first autonomous network to which the first client belongs.

23. The method of claim 22, further comprising:

adding to the peer list the information of a third client sharing the content in at least one third autonomous network having a second-shortest distance to the first autonomous network next to the at least one second autonomous network in the case where a number of clients included in the peer list is less than a critical value.

24. The method of claim 18, wherein the providing of the peer list to the first client includes providing the peer list to the first client in a case where a number of clients included in the peer list is the same as a critical value.

25. The method of claim 18, wherein the network distance is determined by a hop count between autonomous networks to which the clients belong.

26. 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.

27. The method of claim 26, 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.

28. The method of claim 26, further comprising:

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

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

30. The method of claim 28, 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.

31. The method of claim 28, 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.

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

receiving a peer list generated by at least one network distance between autonomous networks to which clients participating in a peer-to-peer (P2P) service belong, and a result of measuring data-transmission speed between the autonomous networks from server; and

receiving a requested content by connecting to the clients included in the peer list.

33. The method of claim 32, wherein the network distance is determined by a hop count between the autonomous networks.

34. The method of claim 32, wherein the result of measuring the data-transmission speed is a ping-response time between clients selected from two different autonomous networks.