WO2015052818A1 - Dispositif d'acheminement de données, dispositif de traitement d'informations et procédé d'acheminement de données - Google Patents

Dispositif d'acheminement de données, dispositif de traitement d'informations et procédé d'acheminement de données Download PDF

Info

Publication number
WO2015052818A1
WO2015052818A1 PCT/JP2013/077671 JP2013077671W WO2015052818A1 WO 2015052818 A1 WO2015052818 A1 WO 2015052818A1 JP 2013077671 W JP2013077671 W JP 2013077671W WO 2015052818 A1 WO2015052818 A1 WO 2015052818A1
Authority
WO
WIPO (PCT)
Prior art keywords
destination
data
routing table
node
unit
Prior art date
Application number
PCT/JP2013/077671
Other languages
English (en)
Japanese (ja)
Inventor
達彦 根岸
Original Assignee
富士通株式会社
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 富士通株式会社 filed Critical 富士通株式会社
Priority to PCT/JP2013/077671 priority Critical patent/WO2015052818A1/fr
Priority to JP2015541387A priority patent/JP6098728B2/ja
Publication of WO2015052818A1 publication Critical patent/WO2015052818A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing

Definitions

  • the present invention relates to a data transfer device, an information processing device, and a data transfer method.
  • FIG. 12 is a diagram illustrating an information processing apparatus that transfers data using a routing table.
  • the information processing apparatus 9 includes a CPU (Central Processing Unit) 80 that performs information processing and a data transfer apparatus 90 that transfers data.
  • CPU Central Processing Unit
  • the data transfer device 90 receives the data transmitted by the CPU 80, and transmits the received data to another information processing device. In addition, the data transfer device 90 receives data transmitted from another information processing device, and transmits the received data to the CPU 80 or a transfer destination information processing device. Data transmission is performed between information processing apparatuses far apart by repeating data transfer by a plurality of information processing apparatuses.
  • the data transfer device 90 includes a transmission / reception unit 91 and a routing table 92 that transmit / receive data to / from other information processing devices and the CPU 80.
  • the routing table 92 is a search table that stores mapping information in which a data destination and a data transfer destination are associated with each other, and searches the data transfer destination from the data destination.
  • the transmission / reception unit 91 searches for the data transfer destination from the destination of the received data using the routing table 92, and transmits the data to the searched transfer destination.
  • the routing table there is a conventional technique in which the first table and the second table are independently searched in parallel (for example, see Patent Document 1). Also, some routing entries in the routing table are stored in the cache routing table. Conventionally, there is a router device including a first search unit that searches a routing table for cache and a second search unit that searches a routing table (see, for example, Patent Document 2).
  • a router device including a routing table and a cache table in which a cache entry indicating a correspondence relationship between a destination address of a packet whose route has already been determined using the routing entry and the route is registered (for example, a patent) Reference 3).
  • a conventional technique for storing route information corresponding to a destination address of a packet in a network address conversion table and selecting the route information from the route table when the network address conversion table is inspected and there is no route information for example, patents
  • routing table search Since the routing table has several thousand entries, there is a problem that it takes time to search the routing table. That is, in the routing table search, the destination in the routing table entry is compared with the destination of the packet to be transferred one entry at a time. Therefore, if the number of entries is large, the search process takes time.
  • the present invention aims to shorten the search time of the routing table.
  • the data transfer device disclosed in the present application includes, in one aspect, a first search unit, a second search unit, and a transfer unit.
  • the first search unit stores the data destination and the routing destination in association with each other, and searches the routing destination from the data destination one entry at a time.
  • the second search unit associates the data destination and the routing destination with each other and stores the data with a smaller storage capacity than the first search unit, and searches the routing destination from the data destination for all entries at once. Further, when the routing destination is searched by the second search unit, the transfer unit transfers the data to the searched routing destination, and when the routing destination is not searched by the second search unit. The data is transferred to the routing destination searched by the first search unit.
  • the routing table search time can be shortened.
  • FIG. 1 is a diagram illustrating a configuration of a node according to the embodiment.
  • FIG. 2 is a diagram illustrating the configuration of the wireless LAN controller.
  • FIG. 3 is a diagram illustrating an example of wireless LAN frame transfer.
  • FIG. 4 is a diagram illustrating an example of a wireless LAN frame.
  • FIG. 5 is a diagram showing an example of a large-capacity routing table composed of SRAM.
  • FIG. 6 is a diagram illustrating an example of a small-capacity routing table composed of FFs.
  • FIG. 7 is a diagram showing nodes that can transmit by short-range wireless communication.
  • FIG. 8 is a flowchart illustrating the flow of the routing process performed by the wireless LAN controller according to the embodiment.
  • FIG. 8 is a flowchart illustrating the flow of the routing process performed by the wireless LAN controller according to the embodiment.
  • FIG. 9 is a flowchart showing a flow of a mapping information creation process of the small capacity routing table by the management unit.
  • FIG. 10 is a diagram for explaining the effect of providing a small-capacity routing table in addition to the large-capacity routing table.
  • FIG. 11 is a diagram illustrating a hardware configuration of the management unit.
  • FIG. 12 is a diagram illustrating an information processing apparatus that transfers data using a routing table.
  • FIG. 1 is a diagram illustrating a configuration of a node according to the embodiment.
  • the node 10 is an information processing apparatus having a CPU 11, a memory controller 12, a memory 13, a storage controller 14, a storage 15, and a wireless LAN (Local Area Network) controller 100. Further, the node 10 includes a management unit 16 and an interconnect 17.
  • the CPU 11 is a central processing unit that reads and executes a program stored in the memory 13.
  • the memory controller 12 is a control device that controls writing of data to the memory 13 and reading of programs and data from the memory 13.
  • the memory 13 is a RAM (Random Access Memory) that stores programs and data.
  • the storage controller 14 is a control device that controls writing of data to the storage 15 and reading of programs and data from the storage 15.
  • the storage 15 is a magnetic disk device that stores programs and data.
  • the wireless LAN controller 100 is a device that communicates with other nodes using a wireless LAN.
  • the wireless LAN controller 100 is a data transfer device that transfers data to another node using a routing table.
  • the management unit 16 monitors and controls the node 10. Further, the management unit 16 manages routing information of the wireless LAN controller 100. Specifically, the management unit 16 manages routing information in a large-capacity routing table and a small-capacity routing table, which will be described later, and instructs the wireless LAN controller 100 to set routing information.
  • the interconnect 17 is a device that interconnects the node 10, the CPU 11, the memory controller 12, the storage controller 14, the wireless LAN controller 100, and the management unit 16.
  • FIG. 2 is a diagram illustrating a configuration of the wireless LAN controller 100.
  • the wireless LAN controller 100 includes a wireless LAN transmission / reception unit 110, a large capacity routing table 120, and a small capacity routing table 130.
  • the wireless LAN transmission / reception unit 110 transmits and receives wireless LAN frames to and from other nodes using the wireless LAN. Specifically, the wireless LAN transmission / reception unit 110 transmits data received from the CPU 11 via the interconnect 17 to another node using a wireless LAN frame. In addition, the wireless LAN transmission / reception unit 110 transmits data included in the wireless LAN frame received from another node to the CPU 11 via the interconnect 17. In addition, the wireless LAN transmission / reception unit 110 transfers a wireless LAN frame received from another node to another node.
  • FIG. 3 is a diagram illustrating an example of wireless LAN frame transfer.
  • FIG. 3 shows a case where the node A transmits a wireless LAN frame to the node O in the information processing system having the nodes A to P.
  • the node A transmits a wireless LAN frame to the node F using the mapping information that associates the next node F with the destination node O.
  • the next node indicates a destination node to be transmitted next in order to reach the destination node with the wireless LAN frame.
  • the node F that has received the wireless LAN frame of the destination node O transfers the wireless LAN frame to the node K using mapping information that associates the next node K with the destination node O. Also, the node K that has received the wireless LAN frame of the destination node O transfers the wireless LAN frame to the node O using mapping information that associates the next node O with the destination node O. As described above, each node transfers the wireless LAN frame using the mapping information, so that the wireless LAN frame is transmitted to the destination node.
  • FIG. 3 shows a case in which a wireless LAN frame is transferred using short-range wireless communication.
  • some nodes included in the information processing system have a function of communicating by long-range wireless communication in addition to short-range wireless communication.
  • wireless LAN frames can also be transferred using long-distance radio.
  • Near field wireless is high speed wireless communication between short distance nodes
  • long distance wireless is low speed wireless communication between long distance nodes.
  • a transmission source node transmits to a node having a function of performing communication with a long-distance wireless by a short-range wireless.
  • the node having the function of communicating by the long-distance radio performs transfer by the long-distance radio to the node having the function of communicating by the long-distance radio near the destination node.
  • a node having a function of communicating with a long-distance wireless near the destination node performs transfer to the destination node with a short-range wireless.
  • FIG 3 shows an information processing system having 16 nodes from node A to node P for convenience of explanation, the information processing system may have a larger number of nodes, for example, thousands. it can.
  • FIG. 4 is a diagram illustrating an example of a wireless LAN frame.
  • the wireless LAN frame has a source MAC (Media Access Control) address, a destination MAC address, and a next node MAC address in the header part.
  • the node that has received the wireless LAN frame discards other than the wireless LAN frame whose next node MAC address is equal to its own MAC address.
  • each node discards the received wireless LAN frame other than the wireless LAN frame whose next node MAC address is equal to its own MAC address, so that the wireless LAN frame is transmitted only to the next node.
  • the wireless LAN transmission / reception unit 110 includes a control unit 111.
  • the control unit 111 determines the destination node of the wireless LAN frame from the data destination using the large capacity routing table 120 and the small capacity routing table 130.
  • control unit 111 issues a search instruction to the large capacity routing table 120 and the small capacity routing table 130 at the same time.
  • “simultaneously” means “substantially simultaneously”, and the wireless LAN transmitting / receiving unit 110 does not need to issue a search instruction at exactly the same timing.
  • control unit 111 controls writing of mapping information to the large capacity routing table 120 and the small capacity routing table 130 based on an instruction from the management unit 16.
  • the large-capacity routing table 120 is a large-capacity routing table that stores mapping information for all destination nodes.
  • the large capacity routing table 120 can refer to only one entry at a time.
  • the large capacity routing table 120 is constituted by, for example, SRAM or DRAM.
  • FIG. 5 is a diagram showing an example of the large-capacity routing table 120 configured with SRAM.
  • the large-capacity routing table 120 includes an entry unit 121 having 4096 entries and a control unit 122. Each entry associates the next node MAC address with the destination node MAC address.
  • the control unit 122 receives the MAC address x of the destination node from the wireless LAN transmission / reception unit 110, refers to the entries in the entry unit 121 one by one, and compares the received MAC address x with the destination node MAC address. When the control unit 122 finds a destination node MAC address that matches the received MAC address x, the control unit 122 passes the MAC address y of the next node associated with the destination node MAC address x to the wireless LAN transmission / reception unit 110.
  • the small capacity routing table 130 is a small capacity routing table that stores part of the mapping information.
  • the small capacity routing table 130 can refer to all entries at once, and searches for the MAC address of the next node at a higher speed than the large capacity routing table 120.
  • the small capacity routing table 130 is composed of, for example, a flip-flop (FF).
  • FIG. 6 is a diagram showing an example of the small-capacity routing table 130 composed of FFs.
  • the small-capacity routing table 130 includes an entry unit 131 having 32 entries and a control unit 132. Each entry associates the next node MAC address with the destination node MAC address.
  • the control unit 132 receives the destination node MAC address x from the wireless LAN transmission / reception unit 110, refers to all entries in the entry unit 131 at once, and compares the received MAC address x with each destination node MAC address at a time. . When the control unit 132 finds a destination node MAC address that matches the received MAC address x, the control unit 132 passes the MAC address y of the next node associated with the MAC address x of the destination node to the wireless LAN transmission / reception unit 110.
  • the small-capacity routing table 130 has the number of entries within a range that can process the destination node MAC address matching process in about one cycle of the frequency of the operation clock.
  • the small-capacity routing table 130 stores mapping information in which a node that can communicate by near field communication is a destination node.
  • the number of entries in the small capacity routing table 130 can be 32 as a number of 24 or more and 64 or less.
  • the number of entries in the large-capacity routing table 120 can be set to 1024.
  • mapping information stored in the large-capacity routing table 120 is created by a management apparatus that manages the entire information processing system, and is managed by the management unit 16 of each node. Further, the management unit 16 of each node instructs the wireless LAN controller 100 to set the mapping information in the large-capacity routing table 120.
  • the mapping information stored in the small-capacity routing table 130 is that the management unit 16 of each node extracts the short-range wireless communication range from the large-capacity routing table 120 and sets the small-capacity routing table 130 in the wireless LAN controller 100. To instruct. The management unit 16 extracts the entry having the same destination node MAC address and the next node MAC address from the entries of the large-capacity routing table 120 as the communication range of the short-range wireless communication.
  • FIG. 8 is a flowchart illustrating the flow of the routing process performed by the wireless LAN controller 100 according to the embodiment.
  • the wireless LAN controller 100 starts the search simultaneously in the small capacity routing table 130 and the large capacity routing table 120 (step S1).
  • the wireless LAN controller 100 determines whether the MAC address of the destination node is found in the small capacity routing table 130 (step S2). If the MAC address of the destination node is not found in the small capacity routing table 130, the wireless LAN controller 100 determines whether the MAC address of the destination node is found in the large capacity routing table 120 (step) S3).
  • the wireless LAN controller 100 does not find the MAC address of the destination node in the routing table, and processes it as an abnormal case (step S4). .
  • the wireless LAN controller 100 acquires the MAC address of the next node from the mapping information in the found entry (step S5). Then, the wireless LAN controller 100 transmits the frame to the next node (step S6).
  • step S7 If the MAC address of the destination node is found in the small capacity routing table 130, the wireless LAN controller 100 cancels the search of the large capacity routing table 120 (step S7) and moves to step S5.
  • the wireless LAN controller 100 can search the routing destination at a high speed by simultaneously starting the search in the small capacity routing table 130 and the large capacity routing table 120.
  • FIG. 9 is a flowchart showing a flow of the mapping information creation process of the small capacity routing table 130 by the management unit 16.
  • the management unit 16 searches the mapping information in the large-capacity routing table 120 to extract mapping information in which the destination node is included in the communication range of the short-range wireless (step S11).
  • the management unit 16 includes information on entries having the same MAC address between the destination node and the next node in the mapping information of the large-capacity routing table 120, and mapping information in which the destination node is included in the communication range of the short-range wireless communication. Extract as
  • the management unit 16 instructs the wireless LAN controller 100 to set the extracted mapping information in the small capacity routing table 130 (step S12).
  • the management unit 16 sets the information of the entry having the same MAC address between the destination node and the next node in the mapping information of the large capacity routing table 120 as the mapping information of the small capacity routing table 130. Therefore, the wireless LAN controller 100 can automatically set the small capacity routing table 130.
  • FIG. 10 is a diagram for explaining the effect of including the small capacity routing table 130 in addition to the large capacity routing table 120.
  • FIG. 10A shows a case where only the large-capacity routing table 120 is used as the routing table
  • FIG. 10B shows a case where the small-capacity routing table 130 is used in addition to the large-capacity routing table 120.
  • the wireless LAN controller searches for a routing destination using the routing table.
  • the routing table can refer to only one entry at a time, the entry is referred to many times until a destination node is found.
  • the wireless LAN controller 100 uses the small capacity routing table 130 and the large capacity routing table 120 to specify a routing destination. Search for.
  • the small-capacity routing table 130 refers to all entries at once, if the destination node is registered in the small-capacity routing table 130, it is only necessary to refer to the entry once. Therefore, the wireless LAN controller 100 can shorten the latency caused by searching for the routing destination.
  • FIG. 11 is a diagram illustrating a hardware configuration of the management unit 16. As illustrated in FIG. 11, the management unit 16 includes an MPU 161, a flash memory 162, and a RAM 163.
  • the MPU 161 is an arithmetic processing unit that reads and executes a program from the flash memory 162.
  • the flash memory 162 is a nonvolatile memory that stores programs.
  • the RAM 163 is a memory that stores intermediate results of the program.
  • the wireless LAN controller 100 includes the large-capacity routing table 120 that refers to only one entry at a time and the small-capacity routing table 130 that refers to all entries at a time. Then, the wireless LAN controller 100 searches both routing tables at the same time, and when the destination node is registered in the small capacity routing table 130, acquires the MAC address of the next node by one search. Therefore, the wireless LAN controller 100 can search for a routing destination at a higher speed than when only the large-capacity routing table 120 is provided.
  • the small-capacity routing table 130 stores mapping information with a node in a range that can be communicated by short-range wireless as a destination node. Therefore, the node 10 can search for a routing destination at a higher speed than the other nodes with respect to a node in a range where communication can be performed by short-range wireless communication.
  • the management unit 16 uses the mapping information of the large-capacity routing table 120 as the mapping information of the small-capacity routing table 130 for the entry having the same MAC address between the destination node and the next node. Therefore, the wireless LAN controller 100 can automatically set the small capacity routing table 130.
  • the small-capacity routing table 130 stores routing information destined for a node within a certain distance range, instead of a destination capable of communication by short-range wireless communication.
  • the present invention is not limited to this, and can be similarly applied to a case where n routing tables are used in which the capacity decreases in order while the search speed is high.
  • the small-capacity routing table 130 stores mapping information whose destination node is a node that can communicate by short-range wireless communication.
  • the present invention is not limited to this, and can be similarly applied to a case where destination nodes that are frequently used are registered in the small-capacity routing table using an LRU (Least Recently Used) algorithm.
  • the small capacity routing table can be registered or replaced by a method of expelling a destination node that is not frequently used (not present) from the small capacity routing table.
  • the management unit 16 creates the mapping information of the small capacity routing table 130 .
  • the present invention is not limited to this.
  • the present invention can be similarly applied to a case where the OS operating on the CPU 11 creates mapping information of the small capacity routing table 130.
  • the management unit 16 extracts the mapping information of the small capacity routing table 130 from the mapping information of the large capacity routing table 120 has been described.
  • the present invention is not limited to this, and the management unit 16 also creates mapping information of the small capacity routing table 130 based on the position of each node in the housing and the communication range of the short-range wireless communication. The same can be applied.
  • the present invention is not limited to this, and can be similarly applied to the case where another identifier is used as an identifier for identifying the destination node.
  • Information processing device Node 11, 80 CPU DESCRIPTION OF SYMBOLS 12 Memory controller 13 Memory 14 Storage controller 15 Storage 16 Management part 17 Interconnect 90 Data transfer apparatus 91 Transmission / reception part 92 Routing table 100 Wireless LAN controller 110 Wireless LAN transmission / reception part 111 Control part 120 Large capacity routing table 121 Entry part 122 Control part 130 Small Capacity routing table 131 Entry unit 132 Control unit 161 MPU 162 Flash memory 163 RAM

Landscapes

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

Abstract

Selon la présente invention, un contrôleur de LAN sans fil (100) est pourvu d'une table de routage de grande capacité (120), dont un seul élément est référencé à la fois, et d'une table de routage de petite capacité (130), dont tous les éléments sont consultés en une fois. Ledit contrôleur de LAN sans fil (100) consulte simultanément la table de routage de grande capacité (120) et la table de routage de petite capacité (130), et si la table de routage de petite capacité (130) contient un nœud de destination, une recherche unique est utilisée pour obtenir l'adresse MAC du nœud suivant.
PCT/JP2013/077671 2013-10-10 2013-10-10 Dispositif d'acheminement de données, dispositif de traitement d'informations et procédé d'acheminement de données WO2015052818A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/JP2013/077671 WO2015052818A1 (fr) 2013-10-10 2013-10-10 Dispositif d'acheminement de données, dispositif de traitement d'informations et procédé d'acheminement de données
JP2015541387A JP6098728B2 (ja) 2013-10-10 2013-10-10 データ転送装置、情報処理装置及びデータ転送方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2013/077671 WO2015052818A1 (fr) 2013-10-10 2013-10-10 Dispositif d'acheminement de données, dispositif de traitement d'informations et procédé d'acheminement de données

Publications (1)

Publication Number Publication Date
WO2015052818A1 true WO2015052818A1 (fr) 2015-04-16

Family

ID=52812665

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2013/077671 WO2015052818A1 (fr) 2013-10-10 2013-10-10 Dispositif d'acheminement de données, dispositif de traitement d'informations et procédé d'acheminement de données

Country Status (2)

Country Link
JP (1) JP6098728B2 (fr)
WO (1) WO2015052818A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH1056474A (ja) * 1996-08-08 1998-02-24 Hitachi Ltd マルチレイヤスイッチ
JP2000083055A (ja) * 1998-09-04 2000-03-21 Hitachi Ltd ルータ
JP2006135660A (ja) * 2004-11-05 2006-05-25 Alaxala Networks Corp 連想メモリ及びパケット転送装置
JP2011523334A (ja) * 2008-06-19 2011-08-04 マーベル ワールド トレード リミテッド 検索のためのカスケード型メモリテーブル

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH1056474A (ja) * 1996-08-08 1998-02-24 Hitachi Ltd マルチレイヤスイッチ
JP2000083055A (ja) * 1998-09-04 2000-03-21 Hitachi Ltd ルータ
JP2006135660A (ja) * 2004-11-05 2006-05-25 Alaxala Networks Corp 連想メモリ及びパケット転送装置
JP2011523334A (ja) * 2008-06-19 2011-08-04 マーベル ワールド トレード リミテッド 検索のためのカスケード型メモリテーブル

Also Published As

Publication number Publication date
JPWO2015052818A1 (ja) 2017-03-09
JP6098728B2 (ja) 2017-03-22

Similar Documents

Publication Publication Date Title
KR102162730B1 (ko) 분산형 라우팅 테이블 탐색 기술
JP6581277B2 (ja) データパケット転送
US9444743B2 (en) Network system, switch and connected terminal detection method
KR101476940B1 (ko) 스위치 시스템, 및 데이터 전송 방법
CN108173691B (zh) 一种跨设备聚合的方法及装置
JP6928076B2 (ja) パケット監視
JP6122971B2 (ja) イーサネットパケットの転送
JP7053798B2 (ja) パケット転送方法及び装置
US9379979B2 (en) Method and apparatus for establishing a virtual interface for a set of mutual-listener devices
JP2012146201A (ja) オンチップルータ及びそれを用いたマルチコアシステム
KR20160060551A (ko) 솔리드 스테이트 드라이브 메모리 캐시 점유 예측 시스템 및 그 방법
JP6195014B2 (ja) 通信システム、通信方法、中継装置、および、通信プログラム
CN104954271A (zh) Sdn网络中的数据包处理方法和装置
US9979643B2 (en) Communication apparatus, communication method, and computer-readable recording medium
US20150188815A1 (en) Packet Forwarding Method and System
CN104363084A (zh) 一种链路状态同步方法及装置
CN107977160B (zh) 交换机存取资料的方法
JP2012235400A5 (fr)
JP6098728B2 (ja) データ転送装置、情報処理装置及びデータ転送方法
US20140372502A1 (en) Communication device searching method, communication device, and ad hoc network system
CN109995678A (zh) 报文传输方法及装置
WO2017028806A1 (fr) Procédé et dispositif de transfert de message
US10320661B2 (en) Communication device and communication method
JP6470640B2 (ja) 通信装置及びその制御方法、コンピュータプログラム
JP2019536382A (ja) パケット転送

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: 13895283

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2015541387

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13895283

Country of ref document: EP

Kind code of ref document: A1