[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

WO2009006831A1 - Procédé et équipement servant à limiter la transition d'un paquet de données - Google Patents

Procédé et équipement servant à limiter la transition d'un paquet de données Download PDF

Info

Publication number
WO2009006831A1
WO2009006831A1 PCT/CN2008/071537 CN2008071537W WO2009006831A1 WO 2009006831 A1 WO2009006831 A1 WO 2009006831A1 CN 2008071537 W CN2008071537 W CN 2008071537W WO 2009006831 A1 WO2009006831 A1 WO 2009006831A1
Authority
WO
WIPO (PCT)
Prior art keywords
data packet
hop limit
packet
condition
hop
Prior art date
Application number
PCT/CN2008/071537
Other languages
English (en)
Chinese (zh)
Inventor
Yongjun Liu
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 WO2009006831A1 publication Critical patent/WO2009006831A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H04L47/286—Time to live

Definitions

  • the present invention relates to the field of network communications, and in particular, to a method and a device for relaying a packet. Background technique
  • Direct transmission is usually done when two devices are close together and can communicate directly with each other, but if they are far apart, they must be relayed by other devices.
  • the device that completes the data transfer function may be one or more. These devices that complete the data transfer function are called routers, and the data packets are relayed through the router, which greatly expands the scope of data transmission.
  • Data transmission usually has three methods: unicast, multicast, and broadcast:
  • Unicast refers to sending data to a single device, including direct transmission and transmission through a router.
  • Multicast refers to sending data to multiple devices at one time, and multiple times. Different unicasts, multicast source devices are sent only once; broadcast refers to sending data to all devices at once. After receiving the data packet, the device can decide whether to discard or continue forwarding to other devices according to the algorithm, or decide whether to continue forwarding when it is unicast, multicast, or broadcast.
  • this data transfer function also increases the amount of data on the network and brings certain security problems. Due to the imperfections in the routing algorithm mentioned above, or due to the characteristics of the data transmission method itself, a large number of unnecessary packet forwarding, or even unlimited forwarding, may be caused.
  • the unicast mode for example, if there is a routing ring in the network at a certain moment, that is, the path of data transmission forms a loop, for example, router A thinks that it should be forwarded to router B, and router B thinks that it should be forwarded to router A. In the absence of restrictions on the forwarding of packets, it will result in unlimited data transmission. There are many reasons for routing loops, such as bad routing algorithms or routing information that cannot be updated in time.
  • Changes in network equipment can also affect the network topology, and may cause a large number of unnecessary packet forwarding, such as the destination device failure, but other devices are not known, then the data packet is sent to the destination device's last hop device and found to be unreachable. For the purpose, other path forwarding will be selected, and other paths will not reach the destination device. This will cause the packets to be forwarded continuously and try all possible paths. For multicast and broadcast methods, it is also possible to cause a large amount of unnecessary packet forwarding. For example, the way of broadcasting, because of the transmission to all devices, the scope of influence is very large.
  • the devices of the entire network can receive the data packets, and it may cause the infinite transfer of the broadcast data packets, forming a "broadcast storm". For the above reasons, it is necessary to limit the transit of the data packet.
  • the trick is to add a hop limit when the source device sends a data packet. The number of remaining hops per transfer is reduced by one. If the remaining hop count is reduced to zero, the packet is discarded and not forwarded. However, only the source device hop limit will still cause a lot of redundant packets.
  • the transmission mode since the transmission mode itself has no directionality, even if the hop limit is limited from the source device, the maximum hop count of the data packet in all directions is the same, but in reality, the device may only be for a certain Devices in specific directions are broadcast, and packets sent in other directions are redundant. Summary of the invention
  • the embodiment of the invention provides a data packet transfer restriction method and device, which can limit redundant data packet transfer, reduce the amount of redundant data in the network, and improve network efficiency.
  • an embodiment of the present invention provides a data packet transfer restriction method, including the following steps:
  • a data packet including hop limit information is received, and when the data packet does not meet the hop limit restriction condition, a predetermined processing operation is performed on the data packet.
  • a data packet transfer restriction device including:
  • a data packet receiving module configured to receive a data packet including hop limit information
  • a data packet processing module configured to perform a predetermined processing operation on the data packet when the data packet does not meet the hop limit restriction condition.
  • the embodiment of the present invention can conveniently limit the hop count of the received data packet according to a specific network condition, thereby greatly reducing the amount of redundant data in the network and improving the utilization efficiency of the network.
  • FIG. 1 is a schematic diagram of a network topology structure of a data packet transfer according to an embodiment of the present invention
  • FIG. 2 is a schematic flowchart of a first embodiment of a data packet transfer restriction method according to the present invention
  • 2 is a schematic flowchart of a third embodiment of a packet transfer restriction method according to the present invention
  • FIG. 5 is a schematic flowchart of a fourth embodiment of a packet transfer restriction method according to the present invention
  • FIG. 7 is a schematic structural diagram of a fifth embodiment of a data packet transfer restriction method
  • FIG. 7 is a schematic structural diagram of an information service network to which an embodiment of the present invention is applied;
  • FIG. 8 is a schematic structural diagram of a first embodiment of a data packet transfer restriction device according to the present invention
  • FIG. 9 is a schematic structural diagram of a second embodiment of a data packet transfer restriction device according to the present invention. Schematic diagram of the structure of the three embodiments. detailed description
  • FIG. 1 it is a schematic flowchart of a first embodiment of a data packet transfer restriction method according to the present invention. The embodiment includes the following steps:
  • Step 101 The transit device receives the data packet sent by the neighboring device, and the data packet includes the hop limit information.
  • the hop limit information is generally set by the source device, and may also be transited by another device. Device settings;
  • Step 102 The transit device determines whether the data packet meets the hop limit threshold, that is, whether it is less than or equal to the hop limit threshold, if yes, step 103 is performed; otherwise, step 104 is performed;
  • Step 103 The transit device forwards the data packet to the next device in the path.
  • Step 104 The relay device performs a predetermined processing operation on the data packet, for example, discarding the data packet or re-setting the hop limit information of the data packet.
  • the relay device determines whether the data packet meets the hop limit threshold, and may be based on a restriction field added in the neighbor table or the routing table stored by itself, or may be specifically established to identify the neighbor.
  • the transit device usually stores the information of some neighboring devices in itself and stores them in a table, which is usually called a neighbor table.
  • a limit field for the hop count is added to the neighbor table, that is, the hop limit threshold. .
  • Some transit devices do not necessarily store a neighbor table, but there may be a routing table.
  • the routing table may store not only the information of the neighboring device but also the device information of the remote device.
  • the routing table may also be used. Set the hop limit threshold for source devices other than neighbors. This embodiment is also applicable to the case where the transit device has both the routing table and the neighbor table. The order of which table or table lookup can be selected according to the specific situation, and both tables are required to be satisfied.
  • the hop limit threshold is usually set according to service needs and topology. For example, the hop limit threshold is determined according to the service level that the newly joined node may reach. In the setting of the hop limit threshold, it is also considered that the hop limit information in the received packet is decremented by 1 or compared with the hop limit threshold before the comparison, for example: if the packet is first The hop limit information is reduced and compared again, and the hop limit threshold corresponding to the result of the hop limit information minus one is required to be set. If the hop limit information in the packet is decremented by one after comparison, the hop limit threshold corresponding to the hop limit information needs to be set.
  • FIG. 3 is a transit of the data packet of the present invention
  • the transit device E itself stores a neighbor table
  • the hop limit threshold of the device adjacent to the E is set in the neighbor table, as follows:
  • the Device A sets the hop limit information to 5 in the packet.
  • the relay device When the packet is forwarded to the relay device D, the relay device! The hop limit information is decremented by 1 to get 4, and then the data packet is forwarded to the relay device E.
  • the transit device E After receiving the data packet, the transit device E searches for the neighbor table stored in step 102a, and finds that the hop limit threshold corresponding to D is 3, and the hop limit information in the data packet is 4, which exceeds the hop limit limit threshold of the transit device D. Therefore, the packet hop limit information that does not meet the restricted device forwarding by the restricted device cannot exceed the hop limit threshold. Condition, this needs to perform the operation of discarding the packet in step 104a.
  • an error response indicating that the data packet does not meet the forwarding condition may be returned to the source device or the relay device D, but this response is not required, and is generally directed to some relay devices that need feedback.
  • the packet may be sent repeatedly.
  • the command format for an error notification is given below as an example:
  • FIG. 4 is a schematic flowchart diagram of a third embodiment of a data packet transfer restriction method according to the present invention. As shown in FIG. 4, this embodiment can limit the hop count of non-adjacent devices, and still take the network topology structure of FIG. 1 as an example.
  • the transit device E stores a routing table (as follows), and the transit device jumps to the source device. The number is limited.
  • the hop limit information contained in the data packet is 5, and after the transit device D, the hop limit information is decremented by 1 to obtain 4, and the data packet is forwarded to the relay device E.
  • the transit device E queries the routing table stored in the packet in step 102b, and finds that the source address of the data packet is device A, and the hop limit threshold of the device A is 2, and the hop in the data packet is The number limit information exceeds the hop limit threshold, and therefore the forwarding condition is not satisfied.
  • the processing method of dropping the packet in the previous embodiment may be used, or the threshold according to the hop limit threshold in step 104b may be used again. Set the hop limit information in the packet so that the hop limit information meets the hop limit threshold.
  • a hop limit restriction threshold of a neighboring device may be stored in a routing table, and a neighbor table may also be routed.
  • the table is independent.
  • the routing table and the neighbor table are queried to determine whether the hop limit information in the data packet meets the hop limit threshold of the neighboring device or the source device.
  • the routing table and the neighbor table are inconsistent, the judgment is made according to the minimum threshold of the device in the routing table and the neighbor table, so that the hop limit threshold is satisfied at the same time.
  • step 1 04b performs step 1 04b to reset the hop limit information in the data packet, and then determine in step 104c whether the hop limit information meets the conditions for allowing the forwarding to continue, for example, determining whether the hop limit information is still greater than 0. If yes, follow step 1 03 to forward, otherwise discard the packet (step 1 04d).
  • the relay device may use different processing strategies, as shown in FIG. 6, which is a schematic flowchart of the fifth embodiment of the data packet transfer restriction method of the present invention, where the source device There are two types of packets that can be issued: data frames and command frames.
  • the data frame needs to be strictly controlled by the hop count, but not for the command frame. Therefore, before the relay device determines the hop limit, the type of the data packet can be determined first in step 101a, if the data packet is a data frame. Then, step 102 is performed to determine the hop limit; if the data packet is a command frame, the command frame is directly forwarded.
  • the method of determining the type may be to check the frame header of the data packet, and the general frame header includes the type of the data packet.
  • the type of the device can reduce the burden of some specific functions of the network, for example, the device responsible for security processing in the network device, the device can generally only process commands related to authentication and keys, if other
  • the data frame sent by the relay device greatly increases the burden. Therefore, the data frame can be restricted by the embodiment, so that the data frame cannot interfere with the normal operation of the security device.
  • FIG. 7 it is a schematic structural diagram of an information service network to which the embodiment of the present invention is applied.
  • g is a mobile terminal
  • some devices related to the mobile terminal can also constitute a network, such as a wireless function MP3, a wireless headset, etc.
  • g and the terminal side network nodes h, i, j form a terminal side network
  • the network joins the original carrier network and merges into a new network.
  • f, d, e, b, and c are information access points
  • a is a gateway.
  • the infrastructure (information access point and gateway) of the information service network needs to be added to the limit of the number of hops of the terminal. For example, setting the information access point f to set the hop limit threshold of all mobile terminals is 1
  • the information access point f uses the method of judging after receiving the data packet, and does not impose restrictions on other information access points and gateways.
  • the source device may not know the specific conditions and requirements in the network, and it is difficult to set the most reasonable hop limit, thereby causing redundant data packets.
  • this scheme can only limit the hop count of the source device. When the malicious device is used as the source device, this hop limit may not be implemented, resulting in a large number of redundant data packets.
  • the embodiment of the present invention can make the excess data packet from the mobile terminal g be discarded at the information access point, and does not enter the information service network and affect the network operation, and is useful. Packets (such as service requests sent by the endpoint to the access point) are accepted and processed.
  • the embodiment of the present invention also mitigates the harm of malicious devices to a certain extent. Even if a malicious device joins the network and continuously sends a broadcast message, the broadcast message arrives because of the hop limit of the information access point and the gateway. After the access point or gateway is discarded, the malicious device is prevented from invading the network.
  • the device set the hop limit threshold to 1 , which can greatly reduce the path through the transit device during the routing process, and avoid establishing some theoretically the shortest but not feasible path.
  • the hop limit threshold in the above embodiment of the present invention is not unadjustable, and the hop limit restriction threshold of the neighboring device or the source device in the routing table and/or the neighbor table or the hop limit table may be modified.
  • the basis for the modification may be the network layer authority of the source device, the network layer authority of the neighboring device, or other basis, such as a network access policy.
  • the relay device needs to set a very low hop limit threshold to limit the threat that the mobile terminal may bring;
  • the mobile terminal can modify the jump limit threshold in the neighbor table or the routing table in the transit device when the verification is passed, so that the mobile terminal can send the data packet to the network side to implement more functions.
  • the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.
  • FIG. 8 is a schematic structural diagram of a first embodiment of a data packet transfer restriction device according to the present invention.
  • the embodiment includes the following functional modules: a data packet receiving module 1, a determining module 2, and a data packet processing module 4, wherein the data packet
  • the receiving module 1 is configured to receive a data packet including hop limit information
  • the determining module 2 is configured to determine whether the data packet meets a hop limit condition
  • the data packet processing module 4 is configured to: when the data packet does not meet the hop limit condition, A predetermined processing operation is performed on the data packet.
  • the embodiment may further include a first forwarding module 3, configured to perform a forwarding operation on the data packet when the data packet meets the hop limit constraint condition.
  • FIG. 9 is a schematic structural diagram of a second embodiment of a packet transfer restriction device according to the present invention.
  • the embodiment further includes a storage module 7 configured to store a routing table and/or a neighbor table, or a hop limit table, where the hop count of the neighboring device or the source device is included in the routing table.
  • Limiting the threshold, the neighbor table includes a hop limit threshold of the neighboring device, and the hop limit table includes a hop limit threshold of the neighboring device or the source device.
  • the embodiment may further include a setting module 5, configured to set a hop limit threshold of the neighboring device or the source device to the routing table in the storage module 7, or set a hop limit of the neighboring device in the neighbor table in the storage module 7. Threshold, or set the hop limit limit threshold of the neighboring device or source device to the hop limit table in the storage module 7.
  • FIG. 10 it is a schematic structural diagram of a third embodiment of a packet transfer restriction device of the present invention.
  • the embodiment further includes a type determining module 6 configured to determine the type of the data packet before determining whether the data packet meets the hop limit, and select whether to use the data packet according to the type. Perform a hop limit.
  • the data packet processing module 4 in the above three device embodiments may specifically include: a first data packet discarding unit, configured to discard the data packet when the data packet does not meet the hop limit threshold. Or specifically, the threshold reset unit, the data packet determining unit, and the second data packet discarding unit, wherein the threshold resetting unit is configured to reset the threshold according to the hop limit threshold when the data packet does not meet the hop limit threshold.
  • the hop limit information in the data packet is configured to determine whether the re-set hop limit information meets the condition for allowing the continuation of forwarding; the second packet discarding unit is configured to limit the hop after resetting When the information does not meet the conditions that allow forwarding to continue, the packet is discarded.
  • Centralized management that is, setting a topology controller in the network, recording the hop limit threshold of each device in the network, can realize the transfer restriction of the data packet, and can also be implemented
  • the purpose of managing network device permissions is not only to control the physical topology of the network, but also to control the logical topology of the network, and to adjust according to the change of permissions.
  • E is a topology controller.
  • the network is divided into two parts: A, B, C, and D are part, and F, G, H, and I are another part.
  • E manages and connects these two parts. Set the hop limit threshold of all neighbors on the topology controller E to 1, and send the maximum hop change command to C, D, F, and G.
  • the command has the changed hop limit threshold and target device.
  • the hop limit threshold is 1 when the setting is changed in the command
  • the target devices are F, G, C, D respectively.

Landscapes

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

Abstract

Cette invention a pour objet un procédé et un équipement impliqués par le mode de réalisation de l'invention consistant à limiter un paquet de données lorsqu'il transite. Le procédé consiste à : recevoir le paquet de données contenant les informations du nombre limité de bonds ; mettre en place une opération prédéterminée sur le paquet de données lorsque le paquet de données n'est pas identique à la condition de limitation du nombre de bonds. L'équipement dans le mode de réalisation comprend : un module de réception de paquet de données, recevant le paquet de données contenant les informations du nombre limité de bonds ; un module de traitement de paquet de données, une opération prédéterminée qui est mise en place sur le paquet de données lorsque le paquet de données n'est pas identique à la condition de limitation du nombre de bonds. Le mode de réalisation selon l'invention met en place la limitation du nombre de bonds sur le paquet de données reçu en fonction de la situation spécifique du réseau, réduit largement la quantité de données redondantes dans le réseau, et améliore l'efficacité d'utilisation dans le réseau.
PCT/CN2008/071537 2007-07-05 2008-07-03 Procédé et équipement servant à limiter la transition d'un paquet de données WO2009006831A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007101293777A CN101340361B (zh) 2007-07-05 2007-07-05 数据包中转限制方法及设备
CN200710129377.7 2007-07-05

Publications (1)

Publication Number Publication Date
WO2009006831A1 true WO2009006831A1 (fr) 2009-01-15

Family

ID=40214319

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/071537 WO2009006831A1 (fr) 2007-07-05 2008-07-03 Procédé et équipement servant à limiter la transition d'un paquet de données

Country Status (2)

Country Link
CN (1) CN101340361B (fr)
WO (1) WO2009006831A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112506880A (zh) * 2020-12-18 2021-03-16 深圳智慧林网络科技有限公司 数据处理方法及相关设备
CN116232959A (zh) * 2023-02-21 2023-06-06 荣耀终端有限公司 网络质量检测方法和装置

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102165451B1 (ko) * 2013-01-17 2020-10-14 엘지전자 주식회사 근접 기반 서비스의 그룹 통신을 위한 방법 및 장치
CN104702583B (zh) * 2013-12-10 2018-11-06 拓二股份有限公司 应用于网络架构的请求信息处理方法及系统
CN106658355B (zh) * 2016-09-26 2019-11-12 珠海格力电器股份有限公司 一种在蓝牙ble组网中转发广播包的方法及系统
CN115412480B (zh) * 2022-09-01 2024-02-23 芯象半导体科技(北京)有限公司 通信方法和电子设备

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1435968A (zh) * 2002-01-30 2003-08-13 株式会社Ntt都科摩 检测触发以重选路由的方法、终端和路由器
CN1642144A (zh) * 2004-01-13 2005-07-20 通用汽车公司 用于移动无线自组网的高效轻量信息传播方法和系统
CN1694429A (zh) * 2005-05-20 2005-11-09 北京交通大学 一种IPv6传感器网络中支持压缩包并行传输的实现方法
US20060159009A1 (en) * 2005-01-14 2006-07-20 Jin-Hyoung Kim Fast rerouting apparatus and method for MPLS multicast
CN1889517A (zh) * 2006-07-14 2007-01-03 清华大学 覆盖路由网络中数据转发的方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1299478C (zh) * 2004-03-26 2007-02-07 清华大学 无线自组织网络中基于节点的度的路由搜寻和维护方法
CN1929420A (zh) * 2006-09-22 2007-03-14 东南大学 基于跳数的无线传感器网络广播路由方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1435968A (zh) * 2002-01-30 2003-08-13 株式会社Ntt都科摩 检测触发以重选路由的方法、终端和路由器
CN1642144A (zh) * 2004-01-13 2005-07-20 通用汽车公司 用于移动无线自组网的高效轻量信息传播方法和系统
US20060159009A1 (en) * 2005-01-14 2006-07-20 Jin-Hyoung Kim Fast rerouting apparatus and method for MPLS multicast
CN1694429A (zh) * 2005-05-20 2005-11-09 北京交通大学 一种IPv6传感器网络中支持压缩包并行传输的实现方法
CN1889517A (zh) * 2006-07-14 2007-01-03 清华大学 覆盖路由网络中数据转发的方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112506880A (zh) * 2020-12-18 2021-03-16 深圳智慧林网络科技有限公司 数据处理方法及相关设备
CN116232959A (zh) * 2023-02-21 2023-06-06 荣耀终端有限公司 网络质量检测方法和装置
CN116232959B (zh) * 2023-02-21 2023-11-21 荣耀终端有限公司 网络质量检测方法和装置

Also Published As

Publication number Publication date
CN101340361A (zh) 2009-01-07
CN101340361B (zh) 2012-04-25

Similar Documents

Publication Publication Date Title
US7856001B2 (en) Wireless mesh routing protocol utilizing hybrid link state algorithms
US7778204B2 (en) Automatic maintenance of a distributed source tree (DST) network
EP3055950B1 (fr) Acheminement ad hoc à la demande par contrôle central
US20110317559A1 (en) Notifying a Controller of a Change to a Packet Forwarding Configuration of a Network Element Over a Communication Channel
US9060322B2 (en) Method and system for preventing loops in mesh networks
US11477114B2 (en) Packet forwarding method and apparatus
WO2021227561A1 (fr) Procédé et appareil de communication
CN110692268A (zh) 混合网状网络中的岛拓扑和路由
WO2009006831A1 (fr) Procédé et équipement servant à limiter la transition d'un paquet de données
WO2012130083A1 (fr) Procédé et dispositif de configuration d'entrée de table de protocole de résolution d'adresses (protocole arp)
US8761176B2 (en) Path control method adapted to autonomous system routing protocol for communication network
US20230291682A1 (en) Method and device for processing data packet, storage medium, and electronic device
US12052165B2 (en) Fault diagnosis method and apparatus thereof
WO2008098506A1 (fr) Procédé, système et dispositif de multidiffusion
WO2015010519A1 (fr) Procédé et dispositif de découverte de structures de topologie
Jin et al. MANET for Disaster Relief based on NDN
US6615273B1 (en) Method for performing enhanced target identifier (TID) address resolution
US20240381095A1 (en) Prevention of subscriber identity module spoofing for mobile user plane
US20240381093A1 (en) Prevention of subscriber identity module spoofing for mobile user plane
US20240381094A1 (en) Prevention of subscriber identity module spoofing for mobile user plane
JP6061303B2 (ja) ブリッジ装置、通信制御装置、通信制御方法、ブリッジプログラム及び通信制御プログラム
JP5861424B2 (ja) 通信システム、制御装置、通信方法およびプログラム
CN117240703A (zh) 一种5g lan中基于sfc的网络功能配置方法及系统
JP2011151718A (ja) ネットワークシステム、通信方法、装置およびプログラム
WO2011120454A2 (fr) Procédé et hôte destinés à mettre en place une transmission sécurisée de paquets de données dans un réseau à espace multi-adresses et multi-ralliement

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

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

Country of ref document: EP

Kind code of ref document: A1