METHOD FOR AUTOMATICALLY DETERMINING A GROUP OF PAIRS LOCATED CLOSE TO ANOTHER PAIR IN A COMMUNICATION NETWORK AND ASSOCIATED SERVER, ANALYSIS DEVICE AND COMMUNICATION DEVICE

• US 20100135168A1
• Filed: 07/04/2008
• Published: 06/03/2010
• Est. Priority Date: 07/10/2007
• Status: Abandoned Application

• Current Assignee: Thomson Licensing (Vantiva SA)
• Original Assignee: Thomson Licensing (Vantiva SA)
• Inventors: Chen, Yi-Ping, Straub, Gilles, Boudani, Ali
• Application Number:
  US12/452,554
• Publication Number:
  US 20100135168A1
• Time in Patent Office: Days
• US Class Current: 370/252
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1055 involving connection limits involving dynamic management of active down- or uploading connections H04L67/1085
• CPC Class Codes: H04L 67/52 specially adapted for the location of the user terminal
• CPC Class Codes: H04W 4/02 Services making use of location information

Abstract

A dedicated method for determining peers located close to another peer, each peer having at least one communication device connected to a communication node of a communication network including multiple communication nodes, of which some have a known fixed position and are known as “landmarks”. This method consists in, upon detection of a new peer, i) in determining in the communication network the closest landmark to the new peer, then ii) in determining from among the multiple nodes known as intermediary nodes that define the path linking this new peer to the pre-determined landmark, and iii) in determining a group of peers located close to the new peer as a function of at least the pre-determined path definition and the definitions of the paths linking other peers to at least the pre-determined landmark.

Claims

1. Method for determining peers located close to another peer, each peer having at least one item of communication equipment connected to a communication node of a communication network comprising multiple communication nodes of which some have a known fixed position and are known as “

landmarks”

, consisting, in the case of detection of a new peer in determining within said network the landmark that is closest to said new peer, then ii) in determining from among said multiple nodes known as intermediary nodes that define a path connecting said new peer to said determined landmark, and iii) in determining a group of peers located close to said new peer according to at least the definition of said path and of path definitions connecting other peers, connected to said network, to at least said determined landmark.

2. Method according to claim 1, wherein said landmark is determined that is closest to said new peer i) by transmitting from this latter to each of said network landmarks a first interrogation message requiring a response, then ii) by determining each time elapsed between the instant of transmission of a first interrogation message and the instant of reception of a response transmitted by one of said landmarks, and iii) by retaining the landmark that corresponds to the shortest time lapse.

3. Method according to claim 1, wherein said landmark is determined that is closest to said new peer i) by transmitting from this latter to each of said network landmarks that are designated in a list a first interrogation message requiring a response, then ii) by determining each time elapsed between the instant of transmission of a first interrogation message and the instant of reception of a response transmitted by one of said landmarks designated in the list, and iii) by retaining the landmark that corresponds to the shortest time lapse.

4. Method according to claim 2, wherein each first interrogation message is of “

ping”

type.

5. Method according to claim 1, wherein the intermediary nodes are determined that define a path i) by transmitting from said new peer to the determined landmark a second interrogation message requiring a response on its part and on the part of each intermediary node that precedes it, then ii) by retaining the identifier of each intermediary node having transmitted a response message to the new peer following the reception of said second interrogation message.

6. Method according to claim 5, wherein each second interrogation message is of “

traceroute”

type.

7. Method according to claim 1, wherein the group of peers located close to said new peer are determined according to at least peers associated with paths passing through at least one intermediary node through which also passes said path connecting said new peer to said determined landmark.

8. Method according to claim 1, wherein the group of peers located close to said new peer are also determined according to at least one criterion.

9. Method according to claim 8, wherein each criterion is selected in a group comprising at least the number of intermediary nodes separating a peer from said new peer and the size of the bandwidth available between a peer and said new peer.

10. Method according to claim 1, wherein a list of peers is constituted with the peers of the determined group, a list in which said peers are classed according to the number of skips required to connect them.

11. Method according to claim 1, wherein each peer signals its presence by transmitting a third message periodically.

12. Server (SR) for a communication network to which are connected items of communication equipment of peers and comprising multiple communication nodes of which some have a known fixed position and are known as “

landmarks”

, wherein it is arranged, in the case of detection of a new peer, to determine a group of peers located close to said new peer according at least to the knowledge i) of nodes of said multiple nodes, known as intermediary nodes, that define a path connecting said new peer to the landmark that is closest to said new peer, and ii) intermediary nodes of said multiple nodes that define paths connecting other peers, connected to said network, to at least said landmark that is closest to said new peer.

13. Server according to claim 12, wherein it is adapted to determine the group of peers located close to said new peer according to at least the peers associated with paths passing through at least one intermediary node through which also passes said path connecting said new peer to said landmark which is closest to said new peer.

14. Server according to claim 12, wherein it is adapted to determine the group of peers located close to said new peer also according to at least one criterion.

15. Server according to claim 14, wherein each criterion is selected in a group comprising at least the number of intermediary nodes separating a peer from said new peer and the size of the bandwidth available between a peer and said new peer.

16. Server according to claim 12, wherein it is adapted to constitute a list of peers with the peers of the determined group, said list being constituted of peers classed according to the number of skips required to connect them.

17. Server according to claim 12, wherein it is adapted to determine the group of peers from among peers that have signalled their presence to it by means of a third message.

18. Server according to claim 12, wherein it is adapted to reconstitute an entire topology representative of said communication network by aggregation of received paths.

19. Analysis device for an item of communication equipment of a peer connected to a communication node of a communication network comprising multiple communication nodes some of which have a known fixed position and are known as “

landmarks”

, wherein it is adapted i) to determine within said network the landmark that is closest to its peer communication equipment, then ii) to determine among said multiple nodes the nodes known as intermediary nodes that define a path connecting said peer communication equipment to said determined landmark.

20. Device according to claim 19, wherein it is adapted to determine said landmark, that is closest to its peer communication equipment i) by transmitting to each of said network landmarks a first interrogation message requiring a response, then ii) by determining each time elapsed between the instant of transmission of a first interrogation message and the instant of reception of a response transmitted by one of said landmarks, and iii) by retaining the landmark that corresponds to the shortest time lapse.

21. Device according to claim 19, wherein it is adapted to determine said landmark, that is closest to its peer communication equipment i) by transmitting to the network landmarks that are designated in a list a first interrogation message requiring a response, then ii) by determining each time elapsed between the instant of transmission of a first interrogation message and the instant of reception of a response transmitted by one of said landmarks designated in the list, and iii) by retaining the landmark that corresponds to the shortest time lapse.

22. Device according to claim 20, wherein each first interrogation message is of “

ping”

type.

23. Device according to claim 19, wherein it is adapted to determine the intermediary nodes that define a path i) by transmitting to said landmark, that is closest to its peer communication equipment, a second interrogation message requiring a response on its part and on the part of each intermediary node that precedes it, then ii) by retaining the identifier of each intermediary node having transmitted a response message to its peer communication equipment following the reception of said second interrogation message.

24. Device according to claim 23, wherein each second interrogation message is of “

traceroute”

type.

25. Communication equipment, intended to be connected to a communication network, wherein it comprises an analysis device according to claim 19.