WO2009039736A1 - Procédé de calcul de route et routeur - Google Patents

Procédé de calcul de route et routeur Download PDF

Info

Publication number
WO2009039736A1
WO2009039736A1 PCT/CN2008/071633 CN2008071633W WO2009039736A1 WO 2009039736 A1 WO2009039736 A1 WO 2009039736A1 CN 2008071633 W CN2008071633 W CN 2008071633W WO 2009039736 A1 WO2009039736 A1 WO 2009039736A1
Authority
WO
WIPO (PCT)
Prior art keywords
bandwidth
link
cost value
traffic
calculating
Prior art date
Application number
PCT/CN2008/071633
Other languages
English (en)
Chinese (zh)
Inventor
Lixing Wang
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2009039736A1 publication Critical patent/WO2009039736A1/fr

Links

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
    • 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/125—Shortest path evaluation based on throughput or bandwidth

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a route calculation method and a router.
  • the core routers in the backbone network use MPLS-TE (Multi Protocol Label Switching Traffic Engineer) technology to ensure the bandwidth of various services.
  • MPLS-TE Multi Protocol Label Switching Traffic Engineer
  • a router runs OSPF (Open Shortest Path First Protocol) / ISIS (Intermediate System to Intermediate System Routing Protocol) for route calculation, it is based on each link.
  • the COST (path cost) value is used to select the path, and the COST values of the links reaching the destination are added together, and the link set where the minimum COST value is obtained is the shortest path and is used to guide the forwarding of network traffic.
  • the pre-occupied bandwidth is allocated to the TE-Tunnel (Traffic Engineering Tunnel).
  • TE-Tunnel Traffic Engineering Tunnel
  • the forwarding of non-TE-Tunnel traffic and TE-Tunnel traffic occurs on the network.
  • TE-Tunnel traffic forwarding it is MPLS forwarding, specified by the user, and uses a link that has reserved bandwidth.
  • the reference base is a set value, which is usually set to be greater than the maximum link bandwidth, and the physical bandwidth is the total bandwidth allocated for the link.
  • the COST values of the links that reach the destination are added, and the link set where the minimum COST value is located is the shortest path, which is used to guide the non-TE-Tunnel traffic. Forward.
  • MPLS-TE technology is used to perform bandwidth guarantee for various services
  • a link is one or more
  • the OSPF/ISIS protocol is used for route calculation
  • the COST value of the link used is calculated according to the existing formula, but in the prior art formula.
  • the shortest path obtained by the route calculation is the shortest path that the TE-Tunnel has occupied.
  • the TE-Tunnel traffic will be forwarded preferentially, resulting in non-TE.
  • - Tunnel traffic is partially or even discarded when bandwidth resources are insufficient. Therefore, for non-TE-Tunnel traffic forwarding, if the calculation method of the prior art is continued, the shortest path finally obtained is not accurate. Therefore, the method of routing calculation in the prior art cannot accurately reflect the actual routing of the network.
  • the embodiment of the invention provides a route calculation method and a router, which can accurately reflect the actual route of the network and reliably guide the forwarding of network traffic.
  • An embodiment of the present invention provides a route calculation method, including: calculating a remaining bandwidth, and calculating a path cost value of the link according to the remaining bandwidth; calculating a sum of path cost values of each link reaching the destination; Selecting a path cost value and a minimum link set in the link as the optimal path guides the forwarding of the non-traffic engineering tunnel traffic.
  • An embodiment of the present invention provides a router, including: a first calculating unit, configured to calculate a remaining bandwidth, and calculate a path cost value of the link according to the remaining bandwidth; and a second calculating unit, configured to calculate each chain that reaches the destination The sum of the path cost values of the paths, and selecting a link set from the links as the optimal path to guide the forwarding of the non-traffic engineering tunnel traffic.
  • the COST value does not take into account the bandwidth occupied by the TE-Tunnel.
  • the COST value used in the route calculation in the embodiment of the present invention is calculated by considering the TE-Tunnel occupied bandwidth, and the COST value of the link is calculated. The remaining bandwidth is calculated, and the path cost value of the link is calculated according to the remaining bandwidth. Therefore, the shortest path calculated according to the COST value is the shortest path that meets the actual routing condition, and the actual route of the network is accurately reflected, and the network is reliably guided. Forwarding of network traffic.
  • FIG. 2 is a flowchart of a route calculation method according to Embodiment 2 of the present invention.
  • FIG. 3 is a flowchart of a method for calculating a route according to Embodiment 3 of the present invention.
  • FIG. 4 is a schematic structural diagram of a router according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a router 2 according to an embodiment of the present invention. detailed description
  • the embodiment of the invention provides a route calculation method, which can accurately reflect the actual route of the network.
  • the COST value used in the calculation of the route in the embodiment of the present invention is calculated by considering the occupied bandwidth of the TE-Tunnel.
  • the shortest path calculated according to the COST value is the shortest path that conforms to the actual routing situation.
  • the following is an example of dynamically adjusting the COST value according to the TE-Tunnel occupied bandwidth and dynamically adjusting the COST value according to the actual bandwidth usage.
  • the embodiment of the present invention is not limited thereto, and the COST value adjustment may also be performed by other management methods. , such as user-defined methods.
  • each router is simply referred to as a node in the network.
  • the network topology one or more reachable links exist between each node, so route calculation is required, and the shortest path is selected. To guide the forwarding of traffic.
  • FIG. 1 is a flowchart of a route calculation method according to an embodiment of the present invention.
  • the first embodiment is to dynamically adjust the COST value according to the occupied bandwidth of the TE-Tunnel, and the following includes: 101. After the TE-Tunnel is deployed on the network, the pre-occupied bandwidth of the TE-Tunnel is recorded.
  • the pre-occupied bandwidth information of the TE-Tunnel is transmitted to each node.
  • Each node in the network runs the OSPF/ISIS protocol to calculate the COST value of the link of the node.
  • the COST value is calculated as:
  • the TE-Tunnel reserved bandwidth is the pre-occupied bandwidth of the TE-Tunnel after the TE-Tunnel is deployed on the network.
  • the node runs the OSPF/ISIS protocol and subtracts the TE-Tunnel reserved bandwidth from the physical bandwidth to obtain the TE-Tunnel. After occupying the remaining bandwidth, and then dividing the reference base by the remaining bandwidth, calculate the COST value of the updated link of the node, and flood the link state information of the local node carrying the COST value to the entire network. .
  • Each node collects updated link state information of all nodes, runs OSPF/ISIS protocol, calculates the shortest path to the destination according to the link COST value in the received link state information, and finally uses it to guide non-TE. - Forwarding of tunnel traffic.
  • FIG. 2 it is a flowchart of a route calculation method according to Embodiment 2 of the present invention.
  • the second embodiment also dynamically adjusts the COST value according to the TE-Tunnel occupied bandwidth.
  • the COST value calculated in the first embodiment is flooded to the entire network through the OSPF/ISIS protocol itself, and the node can directly receive the COST value.
  • the COST value of the link calculated by other nodes in the network, and the second embodiment is to obtain the bandwidth usage of the nodes of the entire network according to the occupied bandwidth information of the TE-Tunnel flooded to the entire network, and calculate each node at the node.
  • the COST value of the link is then calculated by the route to obtain the shortest path, which guides the forwarding of non-TE-Tunnel traffic.
  • Figure 2 specifically includes:
  • the pre-occupied bandwidth of the TE-Tunnel is recorded.
  • the pre-occupied bandwidth information of the TE-Tunnel is transmitted to each node, and each node floods the network to the entire network.
  • Each node may also flood the remaining bandwidth information to the entire network after subtracting the pre-occupied bandwidth of the TE-Tunnel.
  • Each node in the network runs the OSPF/ISIS protocol to calculate the COST value of the link of the node and the COST value of the link of other nodes in the network.
  • the reserved bandwidth of the TE-Tunnel is the pre-occupied bandwidth of the TE-Tunnel after the TE-Tunnel is deployed on the network.
  • the OSPF/ISIS protocol is used to reduce the physical bandwidth and the reserved bandwidth of the TE-Tunnel.
  • the remaining bandwidth is then divided by the reference base by the remaining bandwidth to calculate the updated COST value for each node.
  • Each node runs the OSPF/ISIS protocol, and calculates the shortest path to the destination according to the calculated COST value of the link of each node, and finally guides the forwarding of non-TE-Tunnel traffic.
  • FIG. 3 it is a flowchart of a method for calculating a route in the third embodiment of the present invention.
  • the third embodiment dynamically adjusts the COST value according to actual network traffic, which specifically includes:
  • the actual bandwidth of the network refers to the actual bandwidth occupied by the network, including the actual bandwidth used by the TE-Tunnel reserved bandwidth and the actual bandwidth used by non-TE-Tunnel traffic.
  • the occupied bandwidth is reserved for the TE-Tunnel.
  • the TE-Tunnel does not occupy the reserved bandwidth, or is reserved but is not occupied. Therefore, the TE-Tunnel is not used in this embodiment. How much occupied bandwidth is reserved, and each node only calculates the bandwidth actually occupied by the network.
  • the actual network traffic is divided into different levels, and different thresholds are set according to the actual traffic volume, and the COST value is updated when the threshold is reached. For example, according to the bandwidth occupied by the actual traffic, set a few thresholds. For example, you can set three thresholds. The value of the threshold is based on the ratio of the actual traffic bandwidth of the network to the physical bandwidth. The proportion is 30%, 60% and 90%.
  • Each node runs the OSPF/ISIS protocol, and calculates the COST value of the updated link of the local node according to the bandwidth occupied by the actual traffic.
  • the COST value changes, the link state information of the local node carrying the COST value is obtained. Flooding to the entire network.
  • each node After collecting the updated link state information of all the nodes, each node runs the OSPF/ISIS protocol, calculates the shortest path to the destination according to the link COST value in the received link state information, and finally uses it to guide Forwarding of non-TE-Tunnel traffic.
  • the method of the embodiment of the present invention is also applicable to the CSPF (Constrained Shortest Path First) algorithm for routing calculation in the TE, which can be implemented by modifying the CSPF algorithm, and collecting the network according to the CSPF algorithm.
  • the COST value is associated with the bandwidth information. In this way, the impact of the bandwidth can be no longer considered when performing the route calculation, and the COST value obtained according to the occupied bandwidth is directly used for the route calculation.
  • the specific process of the existing CSPF algorithm is to first select a link according to the COST value, and then calculate the current actual physical bandwidth minus the remaining bandwidth of the TE-TU EL occupied bandwidth, and then determine whether the calculated result satisfies the reserved link bandwidth. If you are not satisfied, you will find the short path, and then see if it is satisfied. Look in this order, and the COST value is constant during this process.
  • the process of calculating the current actual physical bandwidth minus the remaining bandwidth after the TE-TU EL occupies the bandwidth may be merged with the first step according to the COST value, that is, according to the The occupied bandwidth update calculates the COST value, thereby directly finding the appropriate link based on the updated COST value.
  • the embodiment of the present invention provides a router.
  • FIG. 4 is a schematic structural diagram of a router according to an embodiment of the present invention.
  • the router in FIG. 4 includes a first computing unit 401 and a second computing unit 402.
  • the first calculating unit 401 is configured to obtain a traffic engineering tunnel reserved bandwidth and calculate a remaining bandwidth, and calculate a path cost value of the link according to the remaining bandwidth.
  • the remaining bandwidth is calculated by subtracting the physical bandwidth from the reserved bandwidth of the traffic engineering tunnel to obtain the remaining bandwidth.
  • the second calculating unit 402 is configured to calculate a sum of path cost values of each link to the destination, and select a link set from the links as the optimal path to guide the forwarding of the non-traffic engineering tunnel traffic, for example, selecting And the link set that is the minimum value is used as the optimal path to guide the forwarding of non-traffic engineering tunnel traffic.
  • the first calculating unit 401 calculates the path cost value according to the following formula:
  • the reserved bandwidth of the TE-Tunnel is the pre-occupied bandwidth of the TE-Tunnel after the TE-Tunnel is deployed on the network.
  • the router runs the 0SPF/ISIS protocol.
  • the first computing unit subtracts the TE-Tunnel reserved bandwidth from the physical bandwidth to obtain each interface of the router. After the TE-Tunnel occupies the remaining bandwidth, and then divides the reference base by the remaining bandwidth, the COST value of the updated link of the router is calculated.
  • the first calculating unit 401 can only calculate the COST value of the link of the router, and then flood the link state information of the router carrying the COST value to the entire network, and the other routers can receive the calculated COST value;
  • the first calculating unit 401 may also calculate the COST value of the link of each router in the network according to the bandwidth usage of each router in the entire network.
  • the second calculating unit 402 calculates the shortest path
  • the first calculating unit 401 only calculates the COST value of the link of the local router, the COST value of the link that is calculated and flooded to the entire network is further obtained according to the received other routers.
  • the shortest path which guides the forwarding of non-TE-Tunnel traffic. If the first calculation unit 401 has calculated the COST value of the link of each router in the network, the shortest path can be obtained according to the calculated COST value of the link, and the non-TE-Tunnel traffic is forwarded.
  • FIG. 5 is a schematic structural diagram of a router 2 according to an embodiment of the present invention.
  • the router in FIG. 5 includes a threshold unit 501, a first calculation unit 502, and a second calculation unit.
  • the threshold unit 501 is used to set a threshold for the actual traffic bandwidth setting of the network. Specifically, the actual network traffic is divided into different levels, and different thresholds are set according to the actual traffic volume. The value of the threshold is based on the ratio of the actual traffic bandwidth of the network to the physical bandwidth. For example, it can be set. The three broad values are set at 30%, 60% and 90% respectively.
  • the first calculating unit 502 is configured to calculate a remaining bandwidth after the network actual traffic bandwidth reaches a set threshold set by the threshold unit 501, and calculate a path cost value of the link according to the remaining bandwidth, where the actual traffic bandwidth of the network includes The actual bandwidth used by the traffic engineering tunnel reserved bandwidth and the actual bandwidth used by the non-traffic engineering tunnel traffic. Calculating the remaining bandwidth specifically reduces the physical bandwidth by subtracting the actual bandwidth of the network to obtain the remaining bandwidth.
  • the second calculating unit 503 is configured to calculate a sum of path cost values of the links that reach the destination, and select a link set from the links as the optimal path to guide the forwarding of the non-traffic engineering tunnel traffic, for example, selecting And the link set that is the minimum value is used as the optimal path to guide the forwarding of non-traffic engineering tunnel traffic.
  • the first calculating unit 502 calculates the path cost value according to the following formula:
  • the threshold unit 501 sets 3 thresholds, the proportions are set to 30%, 60%, and 90%, respectively.
  • the actual traffic occupies 30% of the entire physical bandwidth it is dynamically adjusted according to the above formula.
  • COST value; and so on, when the actual traffic occupies 60% of the entire physical bandwidth dynamically adjust the COST value according to the above formula.
  • the actual traffic occupies 90% of the entire physical bandwidth press the above formula. Dynamically adjust the COST value once.
  • the first calculating unit 502 calculates the COST value of the link of the router, and then floods the link state information of the router carrying the COST value to the entire network, and the other routers can receive the calculated COST value.
  • the first calculating unit 502 When the second calculating unit 503 calculates the shortest path, the first calculating unit 502 has calculated the COST value of the link of the local router, and further obtains the shortest COST value of the link that is calculated and flooded to the entire network according to the received other routers. Path, which guides the forwarding of non-TE-Tunnel traffic.
  • the TE-Tunnel calculates the COST value of the link.
  • the bandwidth of the traffic engineering tunnel is obtained and the remaining bandwidth is calculated.
  • the path cost value of the link is calculated according to the remaining bandwidth, or the actual network traffic is calculated. After the bandwidth reaches the set threshold, the remaining bandwidth is calculated, and the path cost value of the link is calculated according to the remaining bandwidth, where the actual traffic bandwidth of the network includes the actual bandwidth used by the traffic engineering tunnel reserved bandwidth and the non-traffic engineering tunnel traffic.
  • the actual bandwidth, so the shortest path calculated according to the COST value at this time is the shortest path that conforms to the actual routing situation, accurately reflects the actual routing of the network, and can reliably guide the forwarding of network traffic.
  • the path cost value of the link of the local node may be calculated, and then the calculated path cost value of the link of the local node is flooded to the entire network; or The bandwidth usage of each node flooded to the entire network calculates the path cost value of the link of each node in the network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention porte sur un procédé de calcul de route qui comprend : le calcul de la largeur de bande restante ; le calcul de la valeur de coût de trajet de liaisons selon la largeur de bande restante ; le calcul de la somme des valeurs de coût de trajet de toutes les liaisons jusqu'à la destination ; la sélection d'une agrégation de liaisons ayant la somme minimale des valeurs de coût de trajet à partir de toutes les liaisons en tant que route optimale pour diriger la transmission de trafic hors d'un tunnel d'écoulement du trafic (TE). L'invention porte également sur un routeur.
PCT/CN2008/071633 2007-09-25 2008-07-14 Procédé de calcul de route et routeur WO2009039736A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007101513391A CN101399748B (zh) 2007-09-25 2007-09-25 路由计算方法和路由器
CN200710151339.1 2007-09-25

Publications (1)

Publication Number Publication Date
WO2009039736A1 true WO2009039736A1 (fr) 2009-04-02

Family

ID=40510752

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/071633 WO2009039736A1 (fr) 2007-09-25 2008-07-14 Procédé de calcul de route et routeur

Country Status (2)

Country Link
CN (1) CN101399748B (fr)
WO (1) WO2009039736A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104333881A (zh) * 2014-10-10 2015-02-04 杭州华三通信技术有限公司 一种流量工程隧道建立方法及装置

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103841040A (zh) * 2012-11-20 2014-06-04 英业达科技有限公司 网络系统及负载平衡方法
CN103346979B (zh) * 2013-06-21 2017-02-08 杭州华三通信技术有限公司 一种spbm网络中的流量分配方法及设备
CN103312620A (zh) * 2013-06-26 2013-09-18 华为技术有限公司 一种网络拥塞处理的方法及装置
CN103650435B (zh) * 2013-08-14 2016-11-09 华为技术有限公司 路由流量调整方法、装置及控制器
WO2015196494A1 (fr) * 2014-06-28 2015-12-30 华为技术有限公司 Procédé et appareil de calcul de chemin
CN104283807B (zh) * 2014-09-17 2018-07-24 新华三技术有限公司 一种te隧道建立方法和装置
CN104618256B (zh) * 2015-01-22 2018-07-10 盛科网络（苏州）有限公司 Ospf动态调整链路负载的方法
CN106961399B (zh) * 2016-01-08 2021-01-08 中兴通讯股份有限公司 隧道出端口预留带宽的分配方法及系统
CN108259342B (zh) * 2018-03-09 2021-11-30 华洋通信科技股份有限公司 一种基于ospf协议的网络局部拥塞处理方法
CN112671631B (zh) * 2020-12-15 2022-03-04 湖北工业大学 一种分组传送网的优化方法和系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1649315A (zh) * 2004-01-30 2005-08-03 富士通株式会社 网络控制设备及其路径控制方法
CN1705286A (zh) * 2004-06-03 2005-12-07 华为技术有限公司 一种数据报文传输的方法
CN1736060A (zh) * 2003-01-13 2006-02-15 摩托罗拉公司(在特拉华州注册的公司) 通信网络中的分段式和分布式路径优化

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6724722B1 (en) * 1999-03-19 2004-04-20 Lucent Technologies Inc. Managing congestion and potential traffic growth in an information network
CN1592302A (zh) * 2004-06-10 2005-03-09 上海交通大学 实现无源光网络运行和管理的方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1736060A (zh) * 2003-01-13 2006-02-15 摩托罗拉公司(在特拉华州注册的公司) 通信网络中的分段式和分布式路径优化
CN1649315A (zh) * 2004-01-30 2005-08-03 富士通株式会社 网络控制设备及其路径控制方法
CN1705286A (zh) * 2004-06-03 2005-12-07 华为技术有限公司 一种数据报文传输的方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104333881A (zh) * 2014-10-10 2015-02-04 杭州华三通信技术有限公司 一种流量工程隧道建立方法及装置
CN104333881B (zh) * 2014-10-10 2018-06-12 新华三技术有限公司 一种流量工程隧道建立方法及装置

Also Published As

Publication number Publication date
CN101399748A (zh) 2009-04-01
CN101399748B (zh) 2012-07-04

Similar Documents

Publication Publication Date Title
WO2009039736A1 (fr) Procédé de calcul de route et routeur
US9001672B2 (en) System, method and apparatus conforming path cost criteria across multiple ABRs
US8477629B2 (en) Relaxed constrained shortest path first (R-CSPF)
US7903584B2 (en) Technique for dynamically splitting MPLS TE-LSPs
US6956821B2 (en) Path determination in a data network
US8189482B2 (en) Probing-based mechanism to reduce preemption perturbation caused by higher priority tunnel establishment in a computer network
US7693055B2 (en) Optimization of distributed tunnel rerouting in a computer network with intermediate node feedback
US9270426B1 (en) Constrained maximally redundant trees for point-to-multipoint LSPs
US8576720B2 (en) Global provisioning of zero-bandwidth traffic engineering label switched paths
EP2689563B1 (fr) Utilisation d'éléments d'entretien de sous-chemin (spme) pour la protection de réseaux partagés en commutation multiprotocolaire par étiquetage (mpls)
US8355368B2 (en) Method and system for automatic selection of detour paths in a wireless mesh network
Lin et al. QoS routing granularity in MPLS networks
Antonakopoulos et al. Full protection made easy: The DisPath IP fast reroute scheme
Jamali et al. An enhanced MPLS-TE for transferring multimedia packets
Kulkarni et al. New QoS routing algorithm for MPLS networks using delay and bandwidth constraints
Alidadi et al. A new low-complexity QoS routing algorithm for MPLS traffic engineering
Bongale et al. Analysis of link utilization in MPLS enabled network using OPNET IT Guru
Zhang et al. Explicit routing for traffic engineering in labeled optical burst-switched WDM networks
Adami et al. A new path computation algorithm and its implementation in NS2
Kulkarni et al. New bandwidth guaranteed QoS routing algorithm for MPLS networks
Alparslan et al. AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing
WO2023065756A1 (fr) Procédé et appareil de calcul de routage déterministe, support de stockage et dispositif électronique
Phang et al. Traffic engineering with rerouting in diffserv mpls networks
KR20050001972A (ko) 제한 기반 라우팅 다중 프로토콜 레이블 스위칭 망에서최선형 서비스를 위한 라우팅 방법
Yuan et al. Adaptive load balancing scheme in ad hoc networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08783694

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08783694

Country of ref document: EP

Kind code of ref document: A1