EP1705841A1 - Procede de generation de topologie de reseau, et noeud - Google Patents

Procede de generation de topologie de reseau, et noeud Download PDF

Info

Publication number
EP1705841A1
EP1705841A1 EP04807767A EP04807767A EP1705841A1 EP 1705841 A1 EP1705841 A1 EP 1705841A1 EP 04807767 A EP04807767 A EP 04807767A EP 04807767 A EP04807767 A EP 04807767A EP 1705841 A1 EP1705841 A1 EP 1705841A1
Authority
EP
European Patent Office
Prior art keywords
node
nodes
metric value
connection
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP04807767A
Other languages
German (de)
English (en)
Other versions
EP1705841A4 (fr
Inventor
Haoyi Wan
Norihiro Ishikawa
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NTT Docomo Inc
Original Assignee
NTT Docomo Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NTT Docomo Inc filed Critical NTT Docomo Inc
Publication of EP1705841A1 publication Critical patent/EP1705841A1/fr
Publication of EP1705841A4 publication Critical patent/EP1705841A4/fr
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • 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
    • 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

Definitions

  • the present invention relates to a method for generating a network topology in which a new node joins a network formed by a plurality of nodes.
  • the present invention also relates to a node which newly joins a network formed by a plurality of nodes.
  • FIGS. 1 to 5 a conventional method for generating a network topology (a method used in the "Gnutella") will be explained. To be more specific, an operation in which a node 105 newly joins a network including nodes 101 to 104.
  • the node 105 selects a node 101 which IP address or URL the node 105 knows, among from a plurality of nodes 101 to 104 which forms the network, so as to establish a connection with the node 101.
  • the node 105 transmits a PING message including an IP address of the node 105 to the node 101.
  • the node 101 returns a PONG message including an IP address of the node 101 to the node 105, and transfers the PING message including the IP address of the node 105 to nodes 102 to 104.
  • each of the nodes 102 to 104 returns PONG messages including respective IP addresses to the node 105.
  • the node 105 can acquire the IP address of nodes in the range designated in the TTL (Time to Live) field of the PING message, by repeating the above mentioned procedure.
  • the node 105 establishes connections with each of the nodes 101 to 104 which forms the network, by referring to the IP address included in the received PONG messages.
  • the node 105 can newly join the network formed by the nodes 101 to 104.
  • the new node 105 is configured to join the network randomly, by using the PING message and the PONG message.
  • a first aspect of the present invention is summarized as a node which newly joins a network formed by a plurality of nodes.
  • the node includes a virtual connection establisher unit configured to establish virtual connections with the plurality of nodes; an average metric value calculator unit configured to calculate an average metric value of routes to the plurality of nodes via each of the virtual connections; and a connection establisher unit configured to establish a connection with the node to which the virtual connection having the smallest average metric value is established.
  • the node can further include an acquirer unit configured to acquire node-node connection information of an adjacent node to any node forming the network, from the any node.
  • the average metric value calculator unit can be configured to calculate the average metric value in accordance with the node-node connection information.
  • the node-node connection information can include a node ID for identifying the adjacent node, a metric value of a route between the any node and the adjacent node, and the number of nodes adjacent to the adjacent node.
  • the metric value can include at least one of the number of hops, network bandwidth, communication costs, delay, load, MTU, or reliability.
  • the acquirer unit can be configured to notify, to the any node, a type of a metric value or a combination of metric values to be included in the node-node connection information.
  • a second aspect of the present invention is summarized as a method for generating a network topology in which a new node joins a network formed by a plurality of nodes.
  • the method includes establishing a virtual connection between the new node and each of the plurality of nodes; calculating an average metric value of routes from the new node to the plurality of nodes via each of the virtual connections; and establishing a connection between the new node and the node to which the virtual connection having the smallest average metric value is established, so that the new node joins the network.
  • a node X is configured to be able to newly join a network including a plurality of nodes A to D.
  • a node X includes a node-node connection information acquiring unit 11, a virtual connection establishing unit 12, an average metric value calculating unit 13, a connection establishing unit 14 and metric value designating unit 15.
  • the node-node connection information acquiring unit 11 is configured to acquire, from any node forming the network (for example, node A), node-node connection information of adjacent nodes (for example, nodes B to D) to the any node.
  • the node-node connection information includes a "node name (node ID)" for identifying the adjacent node, a "node address (for example, an IP address)" of the adjacent node, a "metric value” of a route between the any node and the adjacent node, and "the number of nodes” adjacent to the adjacent node.
  • the metric value includes at least one of "the number of hops", “network bandwidth”, “communication costs", “delay”, “load”, “MTU”, or "reliability".
  • the number of hops means the number of hops in a physical layer, in other words, the number of hops such as routers in a link established between the nodes.
  • the "network bandwidth” means communication bandwidth (for example, 64 kbps) which is available in the link established between the nodes.
  • the “communication costs” means communication fees of the link established between the nodes.
  • the “delay” means a transmission delay time in the link established between the nodes.
  • the “load” means usage condition (for example, 50%) in the link established between the nodes.
  • the "MTU” means a size of minimum transfer block (MTU: Minimum Transfer Unit) used in the link established between the nodes.
  • the "reliability” means a rate of occurrence of failure in the link established between the nodes.
  • the node-node connection information acquiring unit 11 can be configured to notify, to the any node, a type of a metric value or a combination of metric values designated by the metric value designating unit 15, when acquiring the node-node connection information form the any node.
  • the virtual connection establishing unit 12 is configured to establish virtual connections with a plurality of nodes A to D, by referring to node addresses included in the node-node connection information acquired by the node-node connection information acquiring unit 11.
  • the average metric value calculating unit 13 is configured to calculate an average metric value of routes to the plurality of nodes A to D via each of the virtual connections, by using the node-node connection information acquired by the node-node connection information acquiring unit 11. A specific method for calculating the average metric value will be described later.
  • the connection establishing unit 14 is configured to establish a connection with the node to which the virtual connection having the smallest average metric value is established.
  • the metric value designating unit 15 is configured to designate a type of a metric value (or a combination of metric values) to be included in the node-node connection information which is acquired from the any node, when the node X newly joins the network.
  • a metric value (or a combination of metric values) set as a default is included in the node-node connection information provided by the any node.
  • a node A includes a node-node connection information acquiring unit 31, a node-node connection information storing unit 32, a virtual connection establishing unit 33, a node-node connection information providing unit 34 and a connection establishing unit 35.
  • the node-node connection information acquiring unit 31 is configured to acquire, from adjacent nodes (for example, nodes B to D) to the node X, node-node connection information of the adjacent nodes, in the network.
  • a metric value in each link between nodes is updated arbitrarily.
  • the node-node connection information acquiring unit 31 can be configured to acquire the updated result of the node-node connection information periodically, by broadcasting an update notification packet to all nodes in the network.
  • the node-node connection information acquiring unit 31 can be configured to acquire the updated result of the node-node connection information periodically, by transmitting the update notification packet in a range which is set by TTL (Time To Live).
  • the node-node connection information storing unit 32 is configured to store the node-node connection information acquired by the node-node connection information acquiring unit 31.
  • the virtual connection establishing unit 33 is configured to establish a virtual link with the node X, in response to a virtual connection establishment request from the node X.
  • the node-node connection information providing unit 34 is configured to acquire, from the node-node connection information storing unit 32, the node-node connection information of adjacent nodes to the node A, and to provide the acquired node-node connection information to node X via the virtual connection established with the node X by the virtual connection establishing unit 33.
  • the node-node connection information providing unit 34 can be configured to provide the node-node connection information including the notified metric value (or combination of metric values).
  • the node-node connection information providing unit 34 can be configured to provide the node-node connection information including the metric value (or combination of metric values) set as a default.
  • the connection establishing unit 35 is configured to establish a virtual connection with the node X, in response to a connection establishment request from the node X.
  • FIGS. 7 to 17 an operation of the network topology generation method according to the embodiment will be explained. To be more specific, an operation in which the node X newly joins the network including the nodes A to D will be explained.
  • the node-node connection information acquiring unit 11 of the node X acquires node-node connection information managed by the node A (the above described "any node"), from the node A.
  • the node-node connection information acquiring unit 11 of the node X can be configured to notify a type of a metric value or a combination of metric values to be included in the acquired node-node connection information.
  • FIG. 9 shows the node-node connection information managed by the node A, in this embodiment. As shown in FIG. 9, the adjacent nodes to the node A is the nodes B to D.
  • the node address of the node B is "B IP "
  • the node address of the node C is “C IP”
  • the node address of the node D is "D IP ".
  • the metric value between the node A and the node B is “2”
  • the metric value between the node A and the node C is "3”
  • the metric value between the node A and the node D is "2”.
  • the number of nodes adjacent to the node B is "2”
  • the number of nodes adjacent to the node C is "2”
  • the number of nodes adjacent to the node D is "3".
  • step S2 the virtual connection establishing unit 12 of the node X establishes virtual connections with the nodes A to D, in accordance with the "node addresses" included in the acquired node-node connection information.
  • step S3 the average metric value calculating unite 13 of the node X calculates an average metric value of routes from the node C to each of the nodes A to D via each virtual connection, in accordance with the "metric values" and "the numbers of the nodes" included in the included in the acquired node-node connection information.
  • the average metric value is calculated as follows.
  • the metric value of the virtual connection #1 established between the node X and the node D is "1"
  • the metric value of the virtual connection #2 established between the node X and the node A is "5"
  • the metric value of the virtual connection #3 established between the node X and the node B is "3”
  • the metric value of the virtual connection #4 established between the node X and the node C is "1".
  • FIG. 11 shows route information for associating the "metric value" of the routes #A1 to #D1 from the node X to the each of the nodes A to D via the virtual connection #1, with "the number of nodes” adjacent to each of the nodes A to D.
  • FIG. 12 shows route information for associating the "metric value" of the routes #A2 to #D2 from the node X to the each of the nodes A to D via the virtual connection #2, with "the number of nodes” adjacent to each of the nodes A to D.
  • FIG. 13 shows route information for associating the "metric value" of the routes #A3 to #D3 from the node X to the each of the nodes A to D via the virtual connection #3, with "the number of nodes" adjacent to each of the nodes A to D.
  • FIG. 14 shows route information for associating the "metric value" of the routes #A4 to #D4 from the node X to the each of the nodes A to D via the virtual connection #4, with "the number of nodes” adjacent to each of the nodes A to D.
  • the average metric value calculating unit 13 calculates an average metric value V i of routes from the node X to the node i via each of the virtual connections #1 to #4, by the expression as shown in FIG. 15 with the route information as shown in FIGS. 11 to 14.
  • n means the total number of nodes belonging to the network
  • V Mi means a metric value of a route from the node X to the node i
  • N i means a value calculated by adding "1" to the number of nodes adjacent to the node i.
  • the node A corresponds to the node 1
  • the node B corresponds to the node 2
  • the node C corresponds to the node 3
  • the node D corresponds to the node 4.
  • FIG. 16 shows an example of a situation where the average metric value calculating unit 13 of the node X calculates the average metric value of routes from the node X to each of the nodes A to D via each of the virtual connections #1 to #4, by referring to the route information as shown in FIGS. 11 to 14.
  • the average metric value of the routes from the node X to the each of the nodes A to D via the virtual connection #2 established between the node X and the node A is "78/11".
  • the average metric value of the routes from the node X to the each of the nodes A to D via the virtual connection #3 established between the node X and the node B is "59/11".
  • the average metric value of the routes from the node X to the each of the nodes A to D via the virtual connection #4 established between the node X and the node C is "50/11".
  • the average metric value of the routes from the node X to the each of the nodes A to D via the virtual connection #1 established between the node X and the node D is "40/11".
  • step S4 the connection establishing unit 14 of the node X establishes a connection with the node D to which the virtual connection #1 having the smallest average metric value ("40/11") is established, as shown in FIG. 17.
  • the node X joins the network and the network topology is changed.
  • the node X can communicate with all nodes in the network such as the nodes A to D, via the virtual connection #1.
  • the connection establishing unit 14 of the node X establishes a connection with the node D to which the virtual connection #1 is established, so that the average metric value calculated by considering the network condition in the physical layer is the smallest. Therefore, it is possible to reduce the network delay fairly and minimally, upon generating a new network topology.
  • the present invention can provide a network topology generating method and a node which can reduce a network delay fairly and minimally, upon generating a new network topology, by considering a network condition in a physical layer.

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)
EP04807767A 2003-12-24 2004-12-24 Procede de generation de topologie de reseau, et noeud Withdrawn EP1705841A4 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2003427892 2003-12-24
PCT/JP2004/019411 WO2005062549A1 (fr) 2003-12-24 2004-12-24 Procede de generation de topologie de reseau, et noeud

Publications (2)

Publication Number Publication Date
EP1705841A1 true EP1705841A1 (fr) 2006-09-27
EP1705841A4 EP1705841A4 (fr) 2010-07-21

Family

ID=34708917

Family Applications (1)

Application Number Title Priority Date Filing Date
EP04807767A Withdrawn EP1705841A4 (fr) 2003-12-24 2004-12-24 Procede de generation de topologie de reseau, et noeud

Country Status (6)

Country Link
US (1) US7870292B2 (fr)
EP (1) EP1705841A4 (fr)
JP (1) JP4362481B2 (fr)
CN (1) CN1898921B (fr)
TW (1) TWI279110B (fr)
WO (1) WO2005062549A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2591118A (en) * 2020-01-16 2021-07-21 Sony Corp A controller, computer program and method

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5473827B2 (ja) * 2010-08-20 2014-04-16 パナソニック株式会社 ネットワーク遅延推定装置およびネットワーク遅延推定方法
US10530748B2 (en) * 2016-10-24 2020-01-07 Fisher-Rosemount Systems, Inc. Publishing data across a data diode for secured process control communications
US10454809B2 (en) * 2017-06-08 2019-10-22 Vmware, Inc. Automatic network topology detection for merging two isolated networks
CN114268552B (zh) * 2021-12-16 2023-10-13 云南电网有限责任公司电力科学研究院 一种复杂网络节点预测方法

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030012216A1 (en) * 2001-07-16 2003-01-16 Ibm Corporation Methods and arrangements for building a subsource address multicast distribution tree using network bandwidth estimates

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6363319B1 (en) * 1999-08-31 2002-03-26 Nortel Networks Limited Constraint-based route selection using biased cost
WO2002057917A2 (fr) * 2001-01-22 2002-07-25 Sun Microsystems, Inc. Plate-forme de reseau entre homologues
US7039701B2 (en) * 2002-03-27 2006-05-02 International Business Machines Corporation Providing management functions in decentralized networks
JP3823867B2 (ja) 2002-04-11 2006-09-20 日本電気株式会社 通信ネットワーク制御システム、制御方法、ノード及びプログラム
CN1153417C (zh) * 2002-10-25 2004-06-09 清华大学 基于穿通－末端网络模型的路由协议测试方法及系统
JP2004258747A (ja) * 2003-02-24 2004-09-16 Nippon Telegr & Teleph Corp <Ntt> 接続先ピア選択装置及びその方法
US7643408B2 (en) * 2003-03-31 2010-01-05 Alcatel-Lucent Usa Inc. Restoration time in networks
US7706282B2 (en) * 2003-06-25 2010-04-27 Leping Huang Bluetooth personal area network routing protocol optimization using connectivity metric
JP2005073067A (ja) * 2003-08-26 2005-03-17 Nippon Telegr & Teleph Corp <Ntt> 通信装置、並びに通信装置におけるネットワークの分断抑制方法及びネットワークの分断復旧方法
US7386606B2 (en) * 2003-09-12 2008-06-10 Microsoft Corporation Self-organizing overlay networks

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030012216A1 (en) * 2001-07-16 2003-01-16 Ibm Corporation Methods and arrangements for building a subsource address multicast distribution tree using network bandwidth estimates

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
BANERJEE S ET AL: "Service adaptive multicast for media distribution networks" INTERNET APPLICATIONS. WIAPP 2003. PROCEEDINGS. THE THIRD IEEE WORKSHO P ON 23-24 JUNE 2003, PISCATAWAY, NJ, USA,IEEE LNKD- DOI:10.1109/WIAPP.2003.1210286, 23 June 2003 (2003-06-23), pages 50-60, XP010643755 ISBN: 978-0-7695-1972-2 *
KWANGWOOK SHIN ET AL: "Grapes: topology-based hierarchical virtual network for peer-to-peer lookup services" PARALLEL PROCESSING WORKSHOPS, 2002. PROCEEDINGS. INTERNATIONAL CONFER ENCE ON 18-21 AUGUST 2002, PISCATAWAY, NJ, USA,IEEE, 18 August 2002 (2002-08-18), pages 159-165, XP010608444 ISBN: 978-0-7695-1680-6 *
SCHMIDT C ET AL: "Flexible information discovery in decentralized distributed systems" HIGH PERFORMANCE DISTRIBUTED COMPUTING, 2003. PROCEEDINGS. 12TH IEEE I NTERNATIONAL SYMPOSIUM ON 22-24 JUNE 2003, PISCATAWAY, NJ, USA,IEEE, 22 June 2003 (2003-06-22), pages 226-235, XP010643727 ISBN: 978-0-7695-1965-4 *
See also references of WO2005062549A1 *
SRINIVASAN S ET AL: "M-coop: a scalable infrastructure for network measurement" INTERNET APPLICATIONS. WIAPP 2003. PROCEEDINGS. THE THIRD IEEE WORKSHO P ON 23-24 JUNE 2003, PISCATAWAY, NJ, USA,IEEE, 23 June 2003 (2003-06-23), pages 35-39, XP010643942 ISBN: 978-0-7695-1972-2 *
TIM HSIN-TING HU ET AL: "General clusters in peer-to-peer networks" NETWORKS, 2003. ICON2003. THE 11TH IEEE INTERNATIONAL CONFERENCE ON SEPT. 28-OCT. 1, 2003, PISCATAWAY, NJ, USA,IEEE, 28 September 2003 (2003-09-28), pages 277-282, XP010683538 ISBN: 978-0-7803-7788-2 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2591118A (en) * 2020-01-16 2021-07-21 Sony Corp A controller, computer program and method
US11711295B2 (en) 2020-01-16 2023-07-25 Sony Group Corporation Controller, computer program and method for calculating host specific network paths

Also Published As

Publication number Publication date
CN1898921A (zh) 2007-01-17
US7870292B2 (en) 2011-01-11
JPWO2005062549A1 (ja) 2007-12-13
WO2005062549A1 (fr) 2005-07-07
EP1705841A4 (fr) 2010-07-21
JP4362481B2 (ja) 2009-11-11
US20080016224A1 (en) 2008-01-17
CN1898921B (zh) 2010-09-29
TW200527862A (en) 2005-08-16
TWI279110B (en) 2007-04-11

Similar Documents

Publication Publication Date Title
CN101606341B (zh) 用于在穿过提供商网络的ce-ce路径上高效路由ip流量的技术
EP2911348B1 (fr) Découverte de dispositif de commande dans des réseaux ayant des dispositifs d&#39;acheminement et de commande distincts
US7961650B2 (en) Network architecture
EP1748604B1 (fr) Réseau de communication, procédé de routage des paquets et procédé de localisation et sécurisation de données d&#39;une ressource desirée dans un tel réseau
JP5049344B2 (ja) ランデブーフェデレーション内の近傍域間通信
EP2548341B1 (fr) Chemins descendants de rechange pour un routage de graphe acyclique orienté (dag)
CN108809847B (zh) 实现负载均衡的方法、装置和网络系统
JPH0936873A (ja) リンクステートルーティング装置
WO2009043256A1 (fr) Procédé, système et dispositif d&#39;obtention de trajets à commutation par étiquette
US7245640B2 (en) Packet origination
EP1721414A1 (fr) Architecture de réseau
EP1705841A1 (fr) Procede de generation de topologie de reseau, et noeud
Chang et al. An efficient service discovery system for dual-stack cloud file service
EP1440529B1 (fr) Systeme et procede d&#39;acheminement d&#39;objets d&#39;information dans des reseaux informatiques
US20100238939A1 (en) Intermediate node device, method of controlling intermediate node device, and network system
US20080013552A1 (en) Methods, systems and computer program products for communication load routing at a user location
JP3965202B1 (ja) ネットワーク通信機器およびリング型ネットワーク用通信プログラム。
CN113193988B (zh) 一种多pce的路径计算交互方法和系统
KR100795941B1 (ko) 네트워크 토폴로지 생성 방법 및 노드
JP3965201B1 (ja) ネットワーク通信機器および双方向リング型ネットワーク用通信プログラム。
CA2558002C (fr) Architecture de reseau
JP2006238113A (ja) パケット転送方法、ルータ装置、および端末装置
Yu Peer-to-peer approach for global deployment of voice over IP service
JP2011045101A (ja) 帯域管理装置および帯域管理方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20060724

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU MC NL PL PT RO SE SI SK TR

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20100618

17Q First examination report despatched

Effective date: 20100927

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20110208