Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
  • H04L41/12—Discovery or management of network topologies
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
  • H04L67/1044—Group management mechanisms 
  • H04L67/1046—Joining mechanisms
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
  • H04L67/1044—Group management mechanisms 
  • H04L67/1053—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers
  • H04L67/1055—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers involving connection limits
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/50—Network services
  • H04L67/52—Network services specially adapted for the location of the user terminal
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
  • H04W4/02—Services making use of location information

Definitions

• the invention relates to communication networks to which communication devices are connected capable of exchanging content data, possibly multimedia, in peer-to-peer mode (or P2P (for Peer-to-Peer)), and more precisely the P2P applications, in particular with time constraint (or real time), which are implemented in such networks.
• P2P peer-to-peer mode
• time constraint or real time
• the invention relates to all communication networks (or infrastructures), wired or wireless, capable of transmitting content data (possibly multimedia) between user communication equipment constituting peers. It may therefore be a wired network, such as a network with medium or high speed data transmission lines, for example xDSL lines (for "x Digital Subscriber Line") or cables or optical fibers, or a wireless network (for example mobile (or cellular) or local type (Wireless Local Area Network (WLAN) standards - IEEE 802.11a, Wi-Fi (802.11g), ETSI HiperLAN / 2), and WiMAX (IEEE 802.16, ETSI HiperMAN)).
• xDSL lines for "x Digital Subscriber Line”
• WLAN Wireless Local Area Network
• “communication equipment” here refers to any type of communication equipment that is part of or that can be connected to a wired or non-wired communication network. It may therefore be, for example, fixed or portable computers, fixed or mobile (or cellular) telephones, personal digital assistants (or PDAs, including “pocket PCs"), content receivers (such as decoders, residential gateways (or “residential gateways”) or STBs ("Set-Top Boxes”)), provided that they are equipped with communication means capable of exchanging content data.
• PDAs personal digital assistants
• content receivers such as decoders, residential gateways (or “residential gateways") or STBs ("Set-Top Boxes"
• content here refers to a set of data that defines a television or video or audio program (radio or musical) or games or multimedia, or a computer file (or "data").
• certain P2P applications such as video streaming (which groups video on demand (or VoD), for which the contents are pre-registered and fully available, and live broadcasting (or “live streaming”), for which the content is broadcast live as and when it is created), have strong time constraints, generally of a real-time nature, that require a recovery (or “download”). ”)
• Content data at a speed greater than the speed of data consumption.
• the network provides peers with a list of peers that receive the same content, and a peer can establish parallel connections with multiple peers in that list to increase its recovery rate.
• the network usually provides a peer only a truncated (or partial) list of peers (typically from a few tens to a few hundreds) randomly chosen.
• a peer Once a peer has a truncated list, it must determine the "right" peers that provide sufficient connection to its needs. To do this, it can for example use a "give-give” (or “tit-for-tat”) type algorithm that makes it possible to reject "bad" peers that do not offer a sufficient connection to its needs.
• the data recovery rate is relatively low. This does not affect the quality of service (or QoS) of a P2P file-sharing application (or "file sharing”), but this proves unacceptable for an application with a strong temporal constraint, for example of the VoD or live streaming type, since this introduces a relatively long start-up time (or “zapping time”).
• some peers may be selected to participate in a truncated list while they are (very) far from the peer that requires content data, which is not optimal in term use of network (communication) resources and can be costly for operators when connections are made over multiple networks.
• Vivaldi a decentralized network coordinate system
• SIGCOMM a decentralized network coordinate system
• RTT Round-Trip Tour
• the invention therefore aims to improve the situation.
• the invention firstly proposes a method dedicated to the determination of peers located in the neighborhood of another peer (in the physical sense of the term and not in the logical sense), each peer having from less a communication equipment connected to a communication node of a communication network comprising a multiplicity of communication nodes, some of which have a known fixed position and are called “landmark nodes" (or “landmarks").
• This method is characterized in that it consists, in case of detection of a new peer:
• determining a peer group located in the vicinity of the new peer based at least on the definition of that path and the definitions of the paths that connect other peers (connected to the network) to at least the determined reference node.
• new peer means a peer who has just connected for the first time to the network using equipment having a communication address, such as an IP address, or a peer that has already connected to the network under a communication address, such as an address, and which connects again under another communication address, such as for example another IP address, possibly by means of another device (if it has one many).
• the method according to the invention may comprise other characteristics that can be taken separately or in combination, and in particular:
• the reference node that is closest to the new peer i) by transmitting from it to each of the network nodes 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 message transmitted by one of the reference nodes, and iii) retaining the reference node which corresponds to the elapsed time elapsed;
• the reference node which is closest to the new peer i) by transmitting from it to network reference nodes which are designated in a list a first interrogation message requesting a response, then ii) determining each elapsed time between the instant of transmission of a first interrogation message and the instant of reception of a response message transmitted by one of the reference nodes designated in the list, and iii) retaining the reference node which corresponds to the elapsed time;
• each first interrogation message may for example be of the "ping" type
• the intermediate nodes which define a path i) can be determined by transmitting a new peer to the determined reference node a second interrogation message requesting a response from it and from each intermediate node which precedes it, then ii) retaining the identifier of each intermediate node having transmitted a response message to the new peer consecutively upon receipt of the second interrogation message;
• each second interrogation message may for example be of the "traceroute" type
• the peer group that are located in the vicinity of the new peer can be determined based at least on pairs that are associated with paths passing through at least one intermediate node through which also the path connecting the new peer to the determined landmark node ;
• the group of peers that are located in the neighborhood of the new peer can also be determined based also on at least one criterion, for example chosen from (at least) the number of intermediate nodes separating a peer from the new peer and the importance the bandwidth available between a peer and the new peer;
• a peer list can be created with peers in the particular group, in which peers are ranked according to the number of jumps required to reach them;
• each peer can signal its presence by transmitting a third message periodically.
• the invention also proposes a server for a communication network to which are connected peer communication equipment and having a plurality of communication nodes, some of which have a known fixed position and are called "landmark nodes".
• This server is characterized in that it is charged, in case of detection of a new peer, to determine a group of peers that are located in the vicinity of this new peer based at least on the knowledge, a on the other hand, nodes of the multiplicity, called intermediaries, which define a path connecting the new peer to the reference node which is closest to the latter, and secondly, intermediate nodes of the multiplicity which define paths connecting other peers (connected to the network) to at least the reference node that is closest to the new peer.
• the server according to the invention may comprise other characteristics that can be taken separately or in combination, and in particular:
• it may be responsible for determining the peer group located in the vicinity of the new peer based at least on pairs that are associated with paths passing through at least one intermediate node through which also the path that connects the new peer to the node landmark that is closest to the new peer;
• the peer group located in the vicinity of the new peer also according to at least one criterion, for example chosen from (at least) the number of intermediate nodes separating a peer the new peer and the importance of the available bandwidth between a peer and the new peer;
• it may be responsible for compiling a list of peers with the peers of the group determined, this list consisting of peers ranked according to the number of jumps required to reach them;
• - he may be responsible for determining the peer group among peers who have indicated their presence through a third message
• the invention also proposes an analysis device for a communication equipment of a peer connected to a communication node of a communication network comprising a multiplicity of communication nodes, some of which have a known fixed position and are called "nodes". landmark ".
• This analysis device is characterized in that it is responsible for determining, within the network, the reference node that is closest to its peer communication equipment, and then determining among the multiplicity the so-called intermediate nodes that define a network. path connecting this peer communication equipment to the determined landmark node.
• the device according to the invention may comprise other characteristics that can be taken separately or in combination, and in particular:
• the reference node (which is closest to its peer communication equipment) by generating destination nodes of the network that are designated in a list a first polling message requiring a response, then ii) by determining each time elapsed between the instant of transmission of a first polling message and the instant of reception a response message transmitted by one of the reference nodes designated in the list, and iii) retaining the reference node which corresponds to the elapsed time elapsed;
• each first interrogation message may for example be of the "ping" type
• the intermediate nodes which define a path i) by generating, at destination of the reference node (which is the closest to its peer communication equipment), a second interrogation message requiring a response from it and from each intermediate node which precedes it, then ii) retaining the identifier of each intermediate node having transmitted a response message to its peer communication equipment consecutively upon receipt of the second interrogation message;
• each second interrogation message may for example be of the "traceroute" type.
• the invention also proposes a communication equipment, intended to be connected to a communication network, and equipped with an analysis device of the type of that presented above.
• FIG. 1 very schematically and functionally illustrates peer communication equipment, equipped with an analysis device according to the invention, and a server according to the invention connected to a communication network,
• FIG. 2 schematically illustrates an exemplary determination by two new peers of the reference nodes which are closest to them
• FIG. 3 schematically illustrates an example of determination by two new peers of the paths that connect them to the reference node that is close to them.
• the object of the invention is to enable the determination of a peer group located in the vicinity of another peer for the purpose of retrieving content data, each peer having at least one communication device connected to a node communication network for peer-to-peer (or P2P) communications.
• P2P peer-to-peer
• the (communication) network is a wired network (for example of the ADSL type) offering IP access.
• the invention is not limited to this type of communication network. It concerns any type of communication network (or infrastructure) having at least one access network, wired or wireless, and capable of transmitting content data (possibly multimedia) between communication equipment constituting peers.
• the access network may therefore be a wired network, such as a cable or fiber optic network, or a wireless network, such as a mobile (or cellular) network or a local network (WLAN and WiMAX standards). .
• the invention relates both to situations in which a single communication network is involved, and to situations in which several (or even many) communication networks (possibly of different types) are interconnected, as it is by example the case of the network of networks called Internet. Furthermore, the invention also relates to situations in which a single communication network has several access networks, wired or not. wired, of different types.
• FIG. 1 schematically illustrates a (communication) network RC comprising a multiplicity of communication nodes Rj to which some of UEi communication equipments of users who constitute peer (or "peer") Pi are connected.
• index j here takes values between 1 and 7, but it can take any value greater than or equal to one.
• the index i here takes values between 1 and 4, but it can take any value greater than or equal to two.
• the communication nodes Rj are generally routers, and those to which the pe members Pi are attached are, for example, of the DSLAM multiplexer type (in the case of a xDSL type wired network). It will be understood that in other types of access network, such as for example a non-wired access network, the communication nodes Rj may be other access network equipment than routers.
• the communication nodes Rj to which the pe members Pi are connected are generally base stations (BS, BTS or Node B) or access points (in the case of a WLAN network). .
• the equipment (communication) UEi peer Pi are fixed or portable computers. But, the invention is not limited to this type of equipment (communication). It concerns indeed any type of communication equipment capable of exchanging content data, wired or wireless, with other communication equipment, via at least one network (communication) and P2P mode. It may therefore also be, for example, fixed or mobile phones (or cell phones), personal digital assistants (or PDAs, including "pocket PCs"), content receivers (such as decoders, residential gateways (or “residential gateways”) or STBs ("Set-Top Boxes”), provided that they are equipped with communication means capable of exchanging content data in P2P mode.
• PDAs personal digital assistants
• content receivers such as decoders, residential gateways (or “residential gateways" or STBs ("Set-Top Boxes"
• a UEi equipment Pi par constitutes within an RC network.
• contents may for example be broadcast to the UEi equipment continuously and directly as part of a video-on-demand (VoD) service or a program broadcasting service (for example television or radio or still musical) or files (or data), possibly created live (or live streaming).
• VoD video-on-demand
• program broadcasting service for example television or radio or still musical
• files or data
• the invention provides a method for determining a peer group Pi 'located in the vicinity of a new peer Pi (i ⁇ i') to enable the latter to retrieve content data in peer-to-peer mode. (or P2P).
• the term "new peer” means a peer Pi which has just connected for the first time to the network RC by means of a UEi device having a communication address, such as an IP address, or a peer which is already connected to the network RC under a communication address, such as for example an IP address, and which connects again under another communication address, such as for example another IP address, possibly by means of another UEi equipment (if he has several). Thanks to this definition, it is certain that a Pi P2P client who uses for example his UEi laptop in different places (for example his home, his office, a hotel and an airport) will not be systematically considered as located at a same and unique place. Each peer typically issues a (first) ping message and a (second) traceroute message each time it leaves a network or returns to a network, allowing for a determination of its geographic position.
• the method according to the invention comprises two main stages.
• a first main step comprises two substeps (i and ii). It is intended to determine (estimate) the topology of the part of the network RC to which a new peer Pi is attached. This first step is performed each time a new peer Pi connects to the RC network. It requires that the network RC comprises among its multiplicity of communication nodes Rj a number of nodes called “landmark nodes" (or “landmarks”) Lk having a known fixed position and therefore a communication address (by example IP) fixed and known.
• These nodes Lk landmark are for example network equipment that have a greater role than others in the RC network. It can for example be what the skilled person calls super nodes that deal with nodes located in their vicinity. They are preferably distributed throughout the RC network.
• the positions of the reference nodes Lk There is no constraint on the positions of the reference nodes Lk. But, it is preferable to place them in a central area of the RC network so that they are approximately the same distance from all the pe pairs Pi to reduce the traffic of second messages (for example of the traceroute type). Practically, these may be routers that are located in the core network (or "core network") of the RC network. It is sufficient for a communication node Rj to be able to respond to first messages (for example of the ping type) in order to become a reference node Lk.
• the first substep (i) of this first main step is, in case of detection of a new peer Pi, to determine within the RC network the reference node Lk which is closest to this new peer Pi.
• This first substep (i) is preferably performed by the new peer Pi.
• the equipment UEi that it uses to connect to the network RC must comprise (as illustrated), or be coupled to, a device of D analysis according to the invention.
• the analysis device D of the new peer Pi first generates, to each of the reference nodes Lk of the network RC, a first interrogation message requesting a response.
• Each first generated interrogation message may for example (although not exclusively) be of the "ping" type.
• each first interrogation message that is generated by an analysis device D is transmitted in the network RC by the equipment UEi with which it is associated.
• the analysis device D (or the associated equipment UEi is supposed to know the communication address of each reference node Lk of the network RC.
• the analysis device D triggers a time count which it interrupts when its equipment UEi receives from this reference node Lk a corresponding response message.
• the analysis device D can thus determine the time (RTT) which has elapsed between the instant of transmission of each first interrogation message and the instant of reception of each corresponding response message.
• the analysis device D determines for each reference node Lk the minimum elapsed time among all those it has obtained, then compares the minimum elapsed times corresponding to the different reference nodes Lk in order to retain the reference node. which is associated with the minimum elapsed time.
• Peers P1 to P6 are "old" peers already known to the RC network, while peers P7 and P8 are new peers who have just connected.
• the UE7 equipment of the new peer P7 just like the equipment UE8 of the new peer P8, addresses to the four nodes L1 to L4 respectively four first interrogation messages (for example ping type).
• the device D associated with the new peer P7 retains as the nearest reference node the one that is referenced L2 (and which is the node R1), while the device D associated with the new peer P8 retains as the nearest reference node the one that is referenced L4 (and which is the node R3).
• the analysis device D of the new peer Pi begins by generating, to destination nodes Lk which are designated in a list that it has for example received from the network RC, a first interrogation message requiring a reply.
• each first generated interrogation message may for example (although not exclusively) be of the "ping" type.
• the communication address of each reference node Lk of the list is contained in this list.
• the analysis device D triggers a time count which it interrupts when its equipment UEi receives from this reference node Lk a message of corresponding answer.
• the analysis device D has elapsed times for the different nodes Lk of the list, it only has to compare them to determine the one which is the shortest and which corresponds to the reference node Lk which is closest to his UEi equipment.
• the analysis device D determines for each reference node Lk of the list the minimum elapsed time among all those it has obtained, and then compares the minimum elapsed times corresponding to the different reference nodes Lk of the list to retain the node. reference that is associated with the minimum elapsed time.
• the second sub-step (ii) of the first main step consists of determine among the multiplicity of nodes Rj of the network RC those, said intermediaries, which define the path Cik which connects the new peer Pi to the index node Lk which has just been determined and which is closest to this new peer Pi.
• a path Cik is defined by the communication addresses of a new peer Pi and a reference node Lk, as well as generally of at least one intermediate node Rj.
• This second substep (ii) is also and preferably performed by the new peer Pi, and more specifically by the analysis device D UEi equipment it uses to connect to the RC network.
• the analysis device D of the new peer Pi first generates, to the nearest reference node Lk which has been determined and which is closest to it, a second interrogation message requiring a response from him and from each intermediate node Rj that precedes it.
• Each second interrogation message generated may for example (although not exclusively) be of the "traceroute" type.
• each second interrogation message that is generated by an analysis device D is transmitted in the network RC by the equipment UEi with which it is associated to the determined reference node Lk.
• this intermediate node Rj transmits to the new peer Pi a response message. containing its own communication address (or identifier).
• the analysis device D associated with the new peer Pi is thus informed of the communication addresses (or identifiers) of the intermediate nodes Rj which define the path Cik connecting its new peer Pi to the determined reference node Lk. It then has, so to speak, the network topology relative to its new peer Pi.
• FIG. 3 It is schematically represented in the nonlimiting example of the FIG. 3, four intermediate nodes R2, R4, R6 and R7 which are for example placed in the circle of FIG. 2 which contains the reference node L2 (R1) and the pairs P1, P3 and P7.
• the peers P3 and P7 are connected to the intermediate node R7, while the peer P1 is connected to the intermediate node R4.
• the UE7 device of the new peer P7 addresses to the node L2 reference a second interrogation message (for example traceroute type).
• the device D associated with the new peer P7, receives response messages at its second message from the intermediate nodes R7, R6 and R2, so that it deduces that the path C72 connecting the new peer P7 to the reference node L2 passes by these three intermediate nodes R7, R6 and R2.
• the second main step (iii) of the method according to the invention begins after the determination of the path Cik which connects a new peer Pi to a reference node Lk (the closest). It consists in determining a peer group Pi '(i' ⁇ i) which are located in the neighborhood (physical and non-logical) of the new peer Pi as a function at least of the definition of its path Cik (which has just been determined ) and (already known) definitions of the paths Ci'k which connect other pairs Pi '(connected to the network RC) to at least the reference node Lk determined during the first main step.
• the peer group Pi 'neighbors of a new peer Pi is determined based (at least) on the network topology relative to this new peer Pi (defined by its path Cik) and network topologies relating at least to the pairs Pi '(defined by their respective paths Ci'k) which have the nearest reference node the same as that Lk of the new peer Pi.
• this determination is made more precisely according to at least pairs Pi 'which are associated with paths Ci'k passing through at least one intermediate node Rj through which also the path Cik which links the new peer Pi to the fiducial node Lk determined (nearest).
• the peers P3 and P1 satisfy this constraint of intermediate node (s) Rj common with the new peer P7, since the path C32 of the peer P3 passes through the same intermediate nodes R7, R6 and R2 as the path C72 of the new peer P7 and the path C12 of the peer P1 passes through the same intermediate node R2 as the path C72 of the new peer P1 and P3 therefore constitute potential candidates for the peer group to be determined for the new peer Pl.
• each path definition Cik delivered by a device D is ordered.
• ordered definition is meant the ordered list of communication addresses (or identifiers) of a new peer Pi, then of the first intermediate node Rj to which it is connected, then of each possible other intermediate node Rj 'situated between this first node intermediate Rj and the reference node Lk determined, and finally the reference node Lk.
• pe 'Pi' which are reachable by a new peer Pi by means of a number of hops (or distance) lower (e) to a chosen threshold.
• it is possible first of all to classify all the pairs Pi 'by the number of jumps (or distance) increasing (e) and to select only the first N pairs Pi' (for example N 200).
• N 200
• the pe 'Pi' can for example be classified by increasing number of jumps.
• the (s) chter (s) used ( s) depends on the network parameter (s) that one wants to optimize, and therefore on the type of connection quality that one wants to obtain.
• These other criteria include the quality and / or the quantity of content data, the temporary availability of a pair Pi '(and therefore the contents it stores), and the behavior of a pair Pi' vis to other peers Pi "(eg defined by a note).
• the second main step is preferably performed by a server SR which is connected to the network RC (as shown in a nonlimiting manner in FIG. 1) or which is part of the network RC, and which acts centrally.
• a server SR which is connected to the network RC (as shown in a nonlimiting manner in FIG. 1) or which is part of the network RC, and which acts centrally.
• Each path definition Cik associated with a new peer Pi is therefore transmitted to this server SR which stores it in storage means, such as a memory or a database.
• the SR server thus has at every moment information that defines the current whole topology of the RC network.
• the server SR can reconstitute an entire "synthetic" topology by "aggregation" of paths Cik, which aims to represent the real communication network RC, and from from which he can make the selection of the pe 'Pi' which are located in the physical (and not logical) neighborhood of the Pi peers.
• each pair Pi connected to the network RC signals its presence by transmitting a third message to the server SR periodically.
• the latter can for example be of type "hello".
• the server SR can thus regularly update the information that defines the entire topology of the network RC.
• the server SR transmits to the new peer Pi, in a dedicated message, the list which designates pe 'Pi' group he has determined for him.
• the new peer Pi can then use it to establish connections with the best Pi 'peers of this list (for example those associated with the lowest numbers of jumps).
• analysis device D can be implemented in the form of software modules ("software”). But, it can also be realized partly or wholly in the form of electronic circuits ("hardware”) or a combination of software modules and electronic circuits.
• the invention offers a number of advantages, among which:
• the traffic caused by the Cik path determinations is limited because these determinations are intended to determine the reference nodes that are closest to the new peers,
• the invention is not limited to the analysis device, communication equipment, server and neighbor peering method embodiments described above, by way of example only, but encompasses all variants that may be considered by those skilled in the art within the scope of the claims below.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Physics & Mathematics (AREA)
• Computing Systems (AREA)
• Mathematical Physics (AREA)
• Theoretical Computer Science (AREA)
• Data Exchanges In Wide-Area Networks (AREA)
• Information Transfer Between Computers (AREA)
• Mobile Radio Communication Systems (AREA)

Priority Applications (1)

Applications Claiming Priority (4)

Publications (1)

Family

ID=39942877

Family Applications (1)

Country Status (7)

Cited By (1)

Families Citing this family (7)

Family Cites Families (11)

• 2008
  • 2008-07-04 BR BRPI0814556-3A2A patent/BRPI0814556A2/pt not_active IP Right Cessation
  • 2008-07-04 JP JP2010515567A patent/JP5011433B2/ja not_active Expired - Fee Related
  • 2008-07-04 US US12/452,554 patent/US20100135168A1/en not_active Abandoned
  • 2008-07-04 KR KR1020107000455A patent/KR101486418B1/ko not_active IP Right Cessation
  • 2008-07-04 CN CN200880023954.7A patent/CN101690133B/zh not_active Expired - Fee Related
  • 2008-07-04 EP EP08826198A patent/EP2163071A2/de not_active Withdrawn
  • 2008-07-04 WO PCT/FR2008/051243 patent/WO2009007658A2/fr active Application Filing

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events