[go: up one dir, main page]

WO2010037291A1 - Routing method and router in hierarchical and sequential address packet network - Google Patents

Routing method and router in hierarchical and sequential address packet network Download PDF

Info

Publication number
WO2010037291A1
WO2010037291A1 PCT/CN2009/073558 CN2009073558W WO2010037291A1 WO 2010037291 A1 WO2010037291 A1 WO 2010037291A1 CN 2009073558 W CN2009073558 W CN 2009073558W WO 2010037291 A1 WO2010037291 A1 WO 2010037291A1
Authority
WO
WIPO (PCT)
Prior art keywords
router node
hsapn
address
current
level
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.)
Ceased
Application number
PCT/CN2009/073558
Other languages
French (fr)
Chinese (zh)
Inventor
刘恩慧
王歆平
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.)
Huawei Technologies Co Ltd
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 WO2010037291A1 publication Critical patent/WO2010037291A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing

Definitions

  • the present invention relates to the field of communications, and in particular, to a method and a router for routing in a Hierarchical and Sequential Address Packet (HSAP) network.
  • HSAP Hierarchical and Sequential Address Packet
  • the telecommunication network has successfully completed the first step from analog technology to digital technology, and the second step of TDM (Time-Division Multiplexing) technology to packet switching technology is underway.
  • ATM Asynchronous Transfer Mode
  • the second step of the TDM technology from packet-switched technology to Telecommunication technology has not been realized. .
  • IP Internet Protocol, IP protocol
  • IP packet technology is a free and open packet network without unified management mechanism, which also causes the Internet to be insecure, untrustworthy, lack of management and The lack of quality of service and other issues, so that many important commercial service networks and data security services and real-time video services with high quality of service requirements cannot be safely loaded onto the public IP network. Therefore, IP packet technology cannot be used. The transition from TDM technology to packet technology.
  • the HSAPN network is a packet network used for telecommunication purposes. It is used to carry all existing telecommunication services and can guarantee the telecommunication services it carries. The same quality of service for telecommunication services. In addition, it can also carry the interconnection
  • the network service provides the same capabilities as the existing Internet, supports all existing Internet services, and can also be used to carry other services that may arise in the future.
  • the HSAPN network adopts hierarchical and orderly coding and hierarchical routing. Therefore, a certain path can be determined according to the address.
  • the current routing table needs to provide the whole routing table.
  • the routing information of the router nodes in the network is large, and all of them are implemented by static manual configuration. The configuration is complex and error-prone.
  • the embodiment of the invention provides a method and a router for routing in an HSAPN network.
  • the router node in the HSAPN network only needs to obtain the link state information of the directly connected neighboring router node, and determine the route according to the link state information of the directly connected neighboring router node. path.
  • a method for routing a route in an HSAPN network includes: receiving, by a current router node, a packet that needs to be forwarded, and obtaining an HSAPN address of the destination router node from the packet; Whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, and if yes, the routing of the packet is ended. If not, the next hop is determined according to the routing rule and the routing table. Connect to the neighbor router node and route to the next hop directly connected neighbor router node.
  • a router in a layered and ordered address HSAPN network which is further provided by the embodiment of the present invention, includes a receiving unit, configured to receive an advertisement packet sent by a directly connected neighboring router node, where the advertisement packet carries the packet Link state information of the router node; establishing unit: establishing a routing table according to the link state information of the directly connected neighboring router node received by the receiving unit; and selecting a unit, configured to determine the next hop direct connection according to the routing rule and the routing table Neighbor router node, and routes to the next hop directly connected neighbor router node.
  • the link state information of the router node directly connected to the neighbor is obtained by transmitting the link state advertisement message between the directly connected neighboring router nodes in the HSAPN network, and only needs to obtain the link state information according to the obtained
  • the link state information of the neighboring router node is directly generated to generate a routing table, and the routing table is searched according to the routing rule to forward the packet.
  • the router node in the HSAPN network only needs to obtain the link state information of the directly connected neighboring router node. That is, the current router node only needs to know how to route to the next hop router node according to the routing rule, and does not need to acquire the chain of the router node of the entire network.
  • the road status information determines the routing path of the entire network, which not only reduces the configuration information of the routing table, but also simplifies the current The complexity of the router node.
  • FIG. 1 is a schematic diagram of an HSAPN architecture according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of hierarchical hierarchical addressing of an HSAPN network according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a state of an HSAPN network port according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a routing method in an HSAPN according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a data packet routing method in an HSAPN according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a routing method when data packets are forwarded to the downstream in the HSAPN according to the embodiment of the present invention.
  • FIG. 7 is a schematic structural diagram of a router in an HSAPN according to an embodiment of the present invention.
  • the embodiments of the present invention provide a method and a router for routing in an HSAPN network, and a preferred embodiment of the present invention is described in detail below with reference to the accompanying drawings.
  • the HSAPN architecture includes at least one HSAPN network, a plurality of IP networks, an ATM network or an FR (Frame Relay) network, and a plurality of EDs (Edge Devices), each of which is HSAPN.
  • the network also includes at least one ADT (Address Translation Entity).
  • the service network of the HSAPN network may be an IP network, an ATM network, or a FR network. Since the IP network is currently the most widely used network, the following mainly describes the IP network as an example.
  • the IP network is connected to the HSAPN network through the ED device. All devices and ED devices in the HSAPN network are assigned HSAPN addresses. All devices and ED devices in the IP network are assigned.
  • the mapping between the IP address, HSAPN address and IP address is stored in the address mapping table in the ADT.
  • the HSAPN address is addressed in a hierarchical manner according to the carrier and the area.
  • the address is hierarchical and ordered.
  • the HSAPN network can obtain a certain path according to the address.
  • the HSAPN network routing system is in the embodiment of the present invention.
  • the HSAPN network system uses four levels as an example.
  • the encoding format and length of each level are in a binary/hexadecimal encoding format, but are not limited thereto. According to the situation, the HSAPN network system can also be divided into five levels, six levels, etc.
  • the encoding format and length of each level are also set according to the situation. It is recommended to use the binary encoding format.
  • A, B, C, and D are addressing forms of HSAPN addresses, and A, B, C, and D respectively represent different network layers, that is, A represents Nuclear Heart area (country domain, level 1), B represents the aggregation domain (provincial domain, level 2), C represents the access domain (city-level domain, level 3), and D represents the boundary domain (gateway domain, level 4) ).
  • the network level of the router that is, the address allocation rule, can be determined according to the HSAPN address. For example: From A1.0.0.0, the router can be known to be in the first-level (top-level) A1 domain, from A1.B2.
  • the network level address mask of the core domain address A1.0.0.0 is Fx xxR0.0.0, and the aggregation domain address A1.
  • the network level address mask of B2.0.0 is Fx X xRFxx xRO.O
  • the network level address mask of access domain address Al.B2.C3.0 is Fx xxF.FxxxF.Fxx xF.O, boundary domain address A1.
  • the network level address mask for B2.C3.D1 is FRF RF RF xF.
  • the embodiments of the present invention are based on the HSAPN network, and the neighboring router nodes in the HSAPN network send advertisement packets to each other to perform neighbor dynamic discovery and link state information acquisition.
  • Each router obtains direct connection with the router node.
  • the link state information of the parent node router, the child node router, and the peer node router dynamically generates a routing table.
  • the routing table can also be statically configured through manual planning.
  • the routing rule can be defined whether the routing table is dynamically generated or the routing table is statically generated. The routing table is searched according to the routing rule to forward data packets.
  • the routing method in the HSAPN network includes:
  • the neighbor router node dynamically discovers and directly obtains link state information of the neighbor router node
  • the HSAPN router node includes at least one port, and the HSAPN router node sends an advertisement packet from all its own ports, and the advertisement message is used for dynamically discovering and advertising link state information of the neighboring router node.
  • the advertisement message uses a Hello data packet. If two routers share a common data link and can successfully negotiate with each other some of the parameters specified in their respective Hello data messages, they become direct neighbors.
  • the Hello data packet carries information related to the link state.
  • the specific link state information parameter includes the HSAPN address, the port number, and the network level address mask of the router.
  • the Hello data packet also carries information related to dynamic discovery of the neighbor. Specific neighbor dynamic discovery information parameters include Hello data packets.
  • the neighbor establishment failure is considered.
  • the HSAPN router can also calculate the port state information parameters of each port based on the HSAPN address of the neighbor router port and its own HSAPN address carried in the Hello data packet received from the directly connected neighboring router. The port status is used to identify the port.
  • Each port of the router is an uplink port (parent port), a downlink port (child port), or a peer port.
  • the specific calculation method is as follows:
  • the HSAPN address of the router A is Al.Bl.Cl.O, and there are three ports 1, 2, and 3, and the HSAPN of the router B carried in the Hello data packet received from the port 1 is received.
  • the address A1.B1.0.0 compared with its own HSAPN address Al.Bl.Cl.O, can be judged according to the address allocation rule, A1.B1.0.0 is the parent address of Al.Bl.Cl.O, ie It can be known that port 1 of router A is an uplink port; similarly, according to the HSAPN address A1.B1.C2.0 of router C carried in the Hello data packet received from port 2, and its own HSAPN address Al.Bl.
  • A1.B1.C2.0 and Al.Bl.Cl.O are addresses of the same network level, and it can be known that port 2 of router A is a peer port;
  • the address allocation rule can be determined according to the address allocation rule.
  • A1.B1.C1.D1 is the child address of Al.Bl.Cl.O, and it can be known that port 3 of router A is the downlink port.
  • the Hello data packet is transmitted only one hop between the neighboring nodes.
  • the status information of the HSAPN router node is only advertised between the neighboring nodes and is not flooded.
  • the routing table is established based on the link state information parameters carried in the Hello data packet sent by the directly connected neighbor router node and the calculated port state information parameters.
  • the routing table is established based on the neighbor router HSAPN address in the link and port status information and the port number of the local router connected to it.
  • the routing table may further include information for setting a priority level to the router nodes in the HSAPN network according to the situation, and is used to identify the priority of the router node routes in the same level (such as primary, secondary, tertiary, and tertiary).
  • the priority level may be determined by using a potential energy level, the potential energy level is high, the priority level is high, the potential energy level is low, and the priority is low, that is, during the forwarding process, According to the message, the packet is preferentially forwarded from the current router node to the peer router node with the high potential level.
  • the potential level can be set uniformly according to the network plan. If the potential energy level is high, it is preferred, the primary route, and the potential energy level is low, and the primary route is faulty, and the secondary route is optional.
  • the routing rule provided by the embodiment of the present invention is a routing rule for routing and forwarding of the current HSAPN router node, and each HSAPN router node performs the data packet routing and forwarding according to the HSAPN address of the current router node and the HSAPN address and route of the destination router node. Rules, look up the routing table, and determine the forwarding path.
  • the packet does not need to be routed, that is, the data packet has been delivered to the destination router node.
  • the data packet is sent from the downlink port to the next level. Router node forwarding;
  • the text is up from the uplink port.
  • the primary router node routes or the peer routes in the router node where the current level is located according to the priority level.
  • the i-th current router node receives the data packet to be forwarded, and the packet header of the data packet carries the HSAPN address of the source router node and the HSAPN address of the destination router node, and the current router node resolves the destination router node.
  • HSAPN address HSAPN address
  • 103b Compare the HSAPN address of the destination router node with the HSAPN address of the current router node Whether the addresses are the same, if the same, indicating that the data packet has been routed to the destination router node, the data packet routing process ends, if not, proceed to the next step 103c;
  • 103c Compare whether the HSAPN address of the destination router node at the current level (i-th level) is the same as the HSAPN address of the current router node. If they are the same, the downlink port from the current router node is down to the first level (1+1th level) router. Node routing, if different, proceeds to the next step 103d;
  • routing from the downlink port of the current router node to the next level (1+1th level) router node further includes: determining whether the current router node has only a unique downlink port, and if so, Routing from the only downstream port to the next-level router node. If not, the (1 + 1)-level HSAPN address of the destination address is compared with the HSAPN address of each downlink port, and the HSAPN address with the same comparison result value is corresponding. The downstream port is routed to the next level router node.
  • 103d Compare the HSAPN address of the destination router node with the HSAPN address of the current router node at the upper level (i-1 level) of the current level. If the same, the data is based on the potential energy level at the current level. The peer forwarding in the router node is forwarded from the upstream port of the current router node to the upstream router node.
  • an embodiment of the present invention provides a router in a hierarchical and ordered address network, including:
  • the advertisement packet generating unit is configured to generate an advertisement packet, where the advertisement packet is used for the neighbor dynamic discovery and the advertisement of the link state.
  • the advertisement packet uses a Hello data packet;
  • the packet is sent to the directly connected neighboring router node, and the packet may be an advertisement packet or a data packet generated by the advertisement packet generating unit, where the advertisement packet carries the link state information of the own router node, and the data packet
  • the HSAPN address carrying the active router node and the destination router node;
  • the receiving unit is configured to receive the packet sent by the directly connected neighboring router node, where the packet may be an advertisement packet or a data packet, and the receiving unit may obtain the link state information of the directly connected neighboring router node from the advertisement packet, Obtain the HSAPN address of the destination router node in the data packet;
  • a routing table establishing and storing unit configured to establish a routing table according to link state information of the directly connected neighboring router node received by the receiving unit, and store the routing table;
  • the determining unit further includes a first determining unit, a second determining unit, a third determining unit, and a fourth determining unit, wherein The first determining unit is configured to determine, after the current router node receives the data packet, whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node;
  • the second determining unit is configured to determine whether the HSAPN address of the current router node at the current level is the same as the HSAPN address of the current router node;
  • the third determining unit is configured to determine whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node at the current level;
  • the fourth determining unit is configured to determine whether the current router node has a unique downlink port.
  • a selecting unit configured to search the routing table according to the routing rule, determine a next hop directly connected neighbor router node, and perform routing to the next hop direct neighbor router node, where the method further includes a first selecting unit, a second selection unit, a third selection unit, and a fourth selection unit, wherein the first selection unit is configured to: when the first determination unit determines that the result is yes (the destination router node
  • the local processing is performed to end the routing of the data packet.
  • the first judgment unit determines that the result is no (the HSAPN address of the destination router node and the HSAPN address of the current router node are not When the same), the second determining unit is enabled;
  • the second selecting unit is configured to select to enable the third determining unit or the fourth determining unit according to the determining result of the second determining unit, that is, when the determining result of the second determining unit is yes (the destination router node is at the current level of the HSAPN address and current When the HSAPN address of the router node is the same, the second selection unit selects to enable the third determining unit, and when the second determining unit determines No (the destination router node is different from the HSAPN address of the current router node in the current level) The second selection unit selects to enable the fourth determining unit;
  • the third selecting unit is configured to: when the third determining unit determines that the HSAPN address of the destination router node is the same as the HSAPN address of the current router node at the current level of the current level, select the peer router node to forward the datagram according to the potential energy level. For example, when the third determining unit determines No (the HSAPN address of the destination router node is different from the HSAPN address of the current router node at the current level), the uplink port from the current router is selected to be routed to the first-level router node;
  • the fourth selecting unit is configured to: when the fourth determining unit determines that it is (having a unique downlink port), select to route from a unique downlink port, and when the fourth determining unit determines to be no (having multiple downlink ports), select The downlink port that is the same as the (i + 1)-level HSAPN address of the destination address is routed to the next-level router node.
  • the program may be stored in a computer readable storage medium, and the storage medium may be ROM/RAM, disk or CD, etc.

Landscapes

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

Abstract

A routing method and router in Hierarchical and Sequential Address Packet Network (HSAPN) is disclosed. In the method, the current router node receives the message to be forwarded and obtains the HSAPN address of the destination router node from the message; the current router node judges whether the HSAPN address of the destination router node and its own HSAPN address are the same; if yes, it ends the routing of the message; if no, it determines, according to routing rules and a routing table, a next-hop directly-connected neighbor router node and routes the message to the next-hop directly-connected neighbor router node.

Description

层次化有序地址分组网络中路由的方法及路由器 本申请要求于 2008 年 9 月 27 日提交中国专利局、 申请号为 200810216519.8、 发明名称为"层次化有序地址分组网络中建立路由表的方法、 路由的方法及路由器"的中国专利申请的优先权, 其全部内容通过引用结合在 本申请中。  Method and router for routing in hierarchical ordered address packet network This application claims a method for establishing a routing table in the hierarchically ordered address packet network submitted to the Chinese Patent Office on September 27, 2008, with the application number 200810216519.8 and the invention name Priority of the Chinese Patent Application, the method of routing, and the entire disclosure of the entire disclosure of which is incorporated herein by reference.

技术领域 Technical field

本发明涉及通信领域, 尤其涉及一种层次化有序地址分组 (HSAPN, Hierarchical and Sequential Address Packet Network ) 网络中路由的方法及路由 器。  The present invention relates to the field of communications, and in particular, to a method and a router for routing in a Hierarchical and Sequential Address Packet (HSAP) network.

背景技术 Background technique

随着技术的发展,电信网已经顺利完成了由模拟技术向数字技术的第一步 过渡, 正在进行由 TDM ( Time-Division Multiplexing, 时分多路复用)技术向 分组交换技术的第二步过渡, ATM ( Asynchronous Transfer Mode, 异步传输模 式) 分组技术是这一过渡阶段的代表, 但是由于 ATM分组技术难度大和商业 运作不成功, 电信网由 TDM技术向分组交换技术的第二步过渡并未实现。  With the development of technology, the telecommunication network has successfully completed the first step from analog technology to digital technology, and the second step of TDM (Time-Division Multiplexing) technology to packet switching technology is underway. ATM (Asynchronous Transfer Mode) packet technology is the representative of this transition phase. However, due to the difficulty of ATM packet technology and the unsuccessful commercial operation, the second step of the TDM technology from packet-switched technology to Telecommunication technology has not been realized. .

20世纪 90年代初, 基于 IP ( Internet Protocol, IP协议)分组技术的互 联网由于 Web技术的应用而获得了极大的成功, 迅速扩大成能够和电信网抗 衡的全球性大网络, 并逐步向电信业务延伸。 于是, 电信网引进了 IP分组技 术,并将全部电信业务加载在 IP网上,期望由此来实现由 TDM技术向分组技 术的过渡。 但是, 由于互联网的设计理念是自由和非赢利商业模式, 使得基于 IP 分组技术的互联网是一个自由开放、 没有统一管理机制的分组网络, 这也 造成了互联网的不安全、 不可信任、 缺乏管理和服务质量缺乏保证等问题, 使 得很多重要的商用业务网以及服务质量要求高的数据互联业务和实时视频业 务, 无法保证安全地加载到公用 IP网上去, 如此看来, IP分组技术也不能担 当起由 TDM技术向分组技术过渡的重任。  In the early 1990s, the Internet based on IP (Internet Protocol, IP protocol) packet technology was extremely successful due to the application of Web technology, and rapidly expanded into a global network that can compete with the telecommunication network, and gradually turned to telecommunications. Business extension. Therefore, the telecommunication network introduced IP packet technology and loaded all telecommunication services on the IP network, and it is expected to realize the transition from TDM technology to packet technology. However, because the design concept of the Internet is a free and non-profit business model, the Internet based on IP packet technology is a free and open packet network without unified management mechanism, which also causes the Internet to be insecure, untrustworthy, lack of management and The lack of quality of service and other issues, so that many important commercial service networks and data security services and real-time video services with high quality of service requirements cannot be safely loaded onto the public IP network. Therefore, IP packet technology cannot be used. The transition from TDM technology to packet technology.

为此提出了一种层次化有序地址分组 HSAPN网络, HSAPN网络是用于 电信目的的分组网, 它用于承载目前业已存在的全部电信业务, 并可以保证它 承载的电信业务能提供与传统电信业务相同的服务质量。此外也可以承载互联 网业务,提供与现有互联网相同的能力,支持目前业已存在的全部互联网业务, 还可以用来承载今后可能产生的其他业务。 HSAPN网络采用层次化有序的编 码方式, 分级路由, 所以根据地址可以确定一条确定的路径, 但当前 HSAPN 网络中还没有完善的路由表建立方法以及相应的路由方法,当前的路由表需要 提供整网中路由器节点的路由信息,路由表项大, 且全部采用静态手工配置的 方式实现, 配置复杂易出错。 Therefore, a Hierarchical Ordered Address Packet HSAPN network is proposed. The HSAPN network is a packet network used for telecommunication purposes. It is used to carry all existing telecommunication services and can guarantee the telecommunication services it carries. The same quality of service for telecommunication services. In addition, it can also carry the interconnection The network service provides the same capabilities as the existing Internet, supports all existing Internet services, and can also be used to carry other services that may arise in the future. The HSAPN network adopts hierarchical and orderly coding and hierarchical routing. Therefore, a certain path can be determined according to the address. However, there is no complete routing table establishment method and corresponding routing method in the current HSAPN network. The current routing table needs to provide the whole routing table. The routing information of the router nodes in the network is large, and all of them are implemented by static manual configuration. The configuration is complex and error-prone.

发明内容 Summary of the invention

本发明实施例提供一种 HSAPN网络中路由的方法及路由器, HSAPN网 络中的路由器节点仅需要获取直连邻居路由器节点的链路状态信息,依据该直 连邻居路由器节点链路状态信息, 确定路由路径。  The embodiment of the invention provides a method and a router for routing in an HSAPN network. The router node in the HSAPN network only needs to obtain the link state information of the directly connected neighboring router node, and determine the route according to the link state information of the directly connected neighboring router node. path.

本发明实施例提出的一种层次化有序地址分组 HSAPN网絡中的路由的方 法, 包括: 当前路由器节点接收需要转发的报文, 并从所述报文中获取目的路 由器节点的 HSAPN地址; 判断所述目的路由器节点的 HSAPN地址与所述当 前路由器节点的 HSAPN地址是否相同, 如果是, 则结束所述报文的路由, 如 果否, 则根据路由规则和所述路由表, 确定下一跳直连邻居路由器节点, 并向 所述下一跳直连邻居路由器节点进行路由。  A method for routing a route in an HSAPN network according to an embodiment of the present invention includes: receiving, by a current router node, a packet that needs to be forwarded, and obtaining an HSAPN address of the destination router node from the packet; Whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, and if yes, the routing of the packet is ended. If not, the next hop is determined according to the routing rule and the routing table. Connect to the neighbor router node and route to the next hop directly connected neighbor router node.

本发明实施例再提出的一种层次化有序地址 HSAPN网络中的路由器, 包 括接收单元, 用以接收直连邻居路由器节点发送的通告报文, 该通告报文中携 带有发送该报文的路由器节点的链路状态信息; 建立单元: 根据接收单元接收 的直连邻居路由器节点的链路状态信息建立路由表; 选择单元, 用以根据路由 规则和所述路由表, 确定下一跳直连邻居路由器节点, 并向所述的下一跳直连 邻居路由器节点进行路由。  A router in a layered and ordered address HSAPN network, which is further provided by the embodiment of the present invention, includes a receiving unit, configured to receive an advertisement packet sent by a directly connected neighboring router node, where the advertisement packet carries the packet Link state information of the router node; establishing unit: establishing a routing table according to the link state information of the directly connected neighboring router node received by the receiving unit; and selecting a unit, configured to determine the next hop direct connection according to the routing rule and the routing table Neighbor router node, and routes to the next hop directly connected neighbor router node.

在本发明的实施例中, 通过在 HSAPN网络中的直连邻居路由器节点之间 相互发送链路状态通告报文, 获得直连邻居的路由器节点的链路状态信息, 并 仅需根据所获得的直连邻居路由器节点的链路状态信息生成路由表,根据路由 规则查找路由表进行报文的转发。 HSAPN网络中的路由器节点仅需要获取直 连邻居路由器节点的链路状态信息,即当前路由器节点根据路由规则仅需要知 道如何路由到下一跳路由器节点,而无需要获取全网的路由器节点的链路状态 信息, 确定全网的路由路径, 不仅缩减了路由表的配置信息, 同时简化了当前 路由器节点的复杂性。 In the embodiment of the present invention, the link state information of the router node directly connected to the neighbor is obtained by transmitting the link state advertisement message between the directly connected neighboring router nodes in the HSAPN network, and only needs to obtain the link state information according to the obtained The link state information of the neighboring router node is directly generated to generate a routing table, and the routing table is searched according to the routing rule to forward the packet. The router node in the HSAPN network only needs to obtain the link state information of the directly connected neighboring router node. That is, the current router node only needs to know how to route to the next hop router node according to the routing rule, and does not need to acquire the chain of the router node of the entire network. The road status information determines the routing path of the entire network, which not only reduces the configuration information of the routing table, but also simplifies the current The complexity of the router node.

附图说明 DRAWINGS

图 1是本发明实施例 HSAPN架构的示意图;  1 is a schematic diagram of an HSAPN architecture according to an embodiment of the present invention;

图 2是本发明实施例 HSAPN网络的分层分级编址示意图;  2 is a schematic diagram of hierarchical hierarchical addressing of an HSAPN network according to an embodiment of the present invention;

图 3是本发明实施例 HSAPN网络端口状态的示意图;  3 is a schematic diagram of a state of an HSAPN network port according to an embodiment of the present invention;

图 4是本发明实施例 HSAPN中的路由方法的示意图;  4 is a schematic diagram of a routing method in an HSAPN according to an embodiment of the present invention;

图 5是本发明实施例 HSAPN中数据报文路由方法的示意图;  5 is a schematic diagram of a data packet routing method in an HSAPN according to an embodiment of the present invention;

图 6是本发明实施例 HSAPN 中数据报文向下行转发时路由方法的示意 图;  6 is a schematic diagram of a routing method when data packets are forwarded to the downstream in the HSAPN according to the embodiment of the present invention;

图 7是本发明实施例 HSAPN中路由器的结构示意图。  FIG. 7 is a schematic structural diagram of a router in an HSAPN according to an embodiment of the present invention.

具体实施方式 detailed description

本发明实施例提供一种 HSAPN网络中路由的方法及路由器, 下面结合附 图详细说明本发明的优选实施例。  The embodiments of the present invention provide a method and a router for routing in an HSAPN network, and a preferred embodiment of the present invention is described in detail below with reference to the accompanying drawings.

如图 1所示, HSAPN架构包括至少一个 HSAPN网, 多数个 IP网、 ATM 网或 FR ( Frame Relay, 帧中继) 网, 以及多数个 ED ( Edge Device, 边界实 体 殳备,其中每个 HSAPN网中还包括至少一个 ADT(地址翻译实体)。 HSAPN 网络的业务网可以是 IP网、 ATM网、 FR网, 因为 IP网是当前应用最广泛的 网络, 所以以下主要以 IP网为例来描述。 在如图 1所示的 HSAPN架构中, IP 网通过 ED设备与 HSAPN网相连接, HSAPN网中的所有设备和 ED设备都分 配有 HSAPN地址, IP网中的所有设备和 ED设备都分配有 IP地址, HSAPN 地址和 IP地址之间的映射关系保存在 ADT内的地址映射表中。  As shown in Figure 1, the HSAPN architecture includes at least one HSAPN network, a plurality of IP networks, an ATM network or an FR (Frame Relay) network, and a plurality of EDs (Edge Devices), each of which is HSAPN. The network also includes at least one ADT (Address Translation Entity). The service network of the HSAPN network may be an IP network, an ATM network, or a FR network. Since the IP network is currently the most widely used network, the following mainly describes the IP network as an example. In the HSAPN architecture shown in Figure 1, the IP network is connected to the HSAPN network through the ED device. All devices and ED devices in the HSAPN network are assigned HSAPN addresses. All devices and ED devices in the IP network are assigned. The mapping between the IP address, HSAPN address and IP address is stored in the address mapping table in the ADT.

HSAPN地址根据运营商和地域采用分层分级的方式来编址, 地址是层次 化有序的, HSAPN网络中根据地址可以得到一条确定的路径。 如图 2所示 的 HSAPN网络路由示意图, 在本发明实施例中, HSAPN网络系统以四级为 例, 各级的编码格式和长度采用的是二 /十六进制编码格式, 但不限于此, 根 据情况 HSAPN网络系统也可分为五级、 六级等, 各级的编码格式和长度亦根 据情况设定, 建议使用二进制编码格式。  The HSAPN address is addressed in a hierarchical manner according to the carrier and the area. The address is hierarchical and ordered. The HSAPN network can obtain a certain path according to the address. As shown in FIG. 2, the HSAPN network routing system is in the embodiment of the present invention. The HSAPN network system uses four levels as an example. The encoding format and length of each level are in a binary/hexadecimal encoding format, but are not limited thereto. According to the situation, the HSAPN network system can also be divided into five levels, six levels, etc. The encoding format and length of each level are also set according to the situation. It is recommended to use the binary encoding format.

结合图 1并参考图 2所示, 在本发明实施例中, A、 B、 C、 D是 HSAPN 地址的编址形式, A、 B、 C、 D分别代表了不同的网络层次, 即 A代表了核 心域(国家域, 一级)、 B代表了汇聚域 (省级域, 二级)、 C代表了接入域 (市 级域, 三级)、 D 代表了边界域(网关域, 四级)。 在 HSAPN 网络中, 根据 HSAPN地址能判断出路由器所处的网络级别, 也即地址分配规则, 例如: 从 A1.0.0.0能知道该路由器处于一级(顶级) A1域, 从 A1.B2.0.0能知道该路由 器处于二级 A1.B2域, 从 A1.B2.C3.0能知道该路由器处于三级 A1.B2.C3域, 从 A1.B2.C3.D1能知道该路由器处于四级(最低级)。针对地址 A.B.C.D来说, 不同等级的路由器 HSAPN网络地址有其相应的网络级别地址掩码, 例如: 核 心域地址 A1.0.0.0的网络级别地址掩码是 Fx xxR0.0.0, 汇聚域地址 A1.B2.0.0 的网絡级别地址掩码是 Fx X xRFxx xRO.O, 接入域地址 Al .B2.C3.0的网络级别 地址掩码是 Fx xxF.FxxxF.Fxx xF.O, 边界域地址 A1.B2.C3.D1的网络级别地址 掩码是 F RF RF RF xF。 Referring to FIG. 1 and referring to FIG. 2, in the embodiment of the present invention, A, B, C, and D are addressing forms of HSAPN addresses, and A, B, C, and D respectively represent different network layers, that is, A represents Nuclear Heart area (country domain, level 1), B represents the aggregation domain (provincial domain, level 2), C represents the access domain (city-level domain, level 3), and D represents the boundary domain (gateway domain, level 4) ). In the HSAPN network, the network level of the router, that is, the address allocation rule, can be determined according to the HSAPN address. For example: From A1.0.0.0, the router can be known to be in the first-level (top-level) A1 domain, from A1.B2. 0.0 can know that the router is in the secondary A1.B2 domain, from A1.B2.C3.0 can know that the router is in the third-level A1.B2.C3 domain, from A1.B2.C3.D1 can know that the router is in the fourth level (lowest level). For the address ABCD, different levels of router HSAPN network addresses have their corresponding network level address masks, for example: The network level address mask of the core domain address A1.0.0.0 is Fx xxR0.0.0, and the aggregation domain address A1. The network level address mask of B2.0.0 is Fx X xRFxx xRO.O, and the network level address mask of access domain address Al.B2.C3.0 is Fx xxF.FxxxF.Fxx xF.O, boundary domain address A1. The network level address mask for B2.C3.D1 is FRF RF RF xF.

本发明实施例基于上述的 HSAPN网络, 在 HSAPN网络中的相邻路由器 节点之间相互发送通告报文, 进行邻居动态发现以及链路状态信息的获取,每 个路由器获取与该路由器节点直连的父节点路由器、 子节点路由器、 同级节点 路由器的链路状态信息, 动态生成路由表; 当然, 也可以通过人工规划, 静态 配置该路由表。 同时, 无论是动态生成路由表还是静态生成路由表, 都可以制 定路由规则, 根据路由规则查找路由表进行数据报文的转发。  The embodiments of the present invention are based on the HSAPN network, and the neighboring router nodes in the HSAPN network send advertisement packets to each other to perform neighbor dynamic discovery and link state information acquisition. Each router obtains direct connection with the router node. The link state information of the parent node router, the child node router, and the peer node router dynamically generates a routing table. Of course, the routing table can also be statically configured through manual planning. At the same time, the routing rule can be defined whether the routing table is dynamically generated or the routing table is statically generated. The routing table is searched according to the routing rule to forward data packets.

请参考图 4所示, 具体地, 本发明实施例提供的 HSAPN网络中的路由方 法包括:  Referring to FIG. 4, specifically, the routing method in the HSAPN network provided by the embodiment of the present invention includes:

101 : 邻居路由器节点动态发现和直连邻居路由器节点的链路状态信息的 获取;  101: The neighbor router node dynamically discovers and directly obtains link state information of the neighbor router node;

在本发明实施例中, HSAPN路由器节点包括至少一个端口, 该 HSAPN 路由器节点从自己所有的端口上发出通告报文,该通告报文用于邻居路由器节 点动态发现和通告链路状态信息, 在本发明实施例中, 该通告报文釆用 Hello 数据报文。 如果两台路由器共享一条公共数据链路, 并且能够相互成功协商它 们各自 Hello数据报文中所指定的某些参数, 那么它们就成为了直连邻居。 该 Hello数据报文携带了链路状态相关的信息, 具体的链路状态信息参数包括路 由器 HSAPN地址、 端口号、 网络级别地址掩码; 该 Hello数据报文还携带了 邻居动态发现相关的信息, 具体的邻居动态发现信息参数包括 Hello数据报文 的发送间隔、 路由器无效时间、 邻居等信息参数, 其中, 路由器无效时间是指 从本节点发送 Hello数据报文开始到收到对端邻居发来的响应消息的最大时间 间隔(阈值), 超过该最大时间间隔, 就认为邻居建立失败。 HSAPN路由器根 据从直连邻居路由器收到的 Hello 数据报文中携带的邻居路由器的端口的 HSAPN地址和自己的 HSAPN地址, 还可以计算出自己各个端口的端口状态 信息参数, 端口状态用于标识该路由器各端口是上行端口 (父级端口)、 下行 端口 (子级端口), 还是同级端口, 具体计算方法如下所示: In an embodiment of the present invention, the HSAPN router node includes at least one port, and the HSAPN router node sends an advertisement packet from all its own ports, and the advertisement message is used for dynamically discovering and advertising link state information of the neighboring router node. In the embodiment of the invention, the advertisement message uses a Hello data packet. If two routers share a common data link and can successfully negotiate with each other some of the parameters specified in their respective Hello data messages, they become direct neighbors. The Hello data packet carries information related to the link state. The specific link state information parameter includes the HSAPN address, the port number, and the network level address mask of the router. The Hello data packet also carries information related to dynamic discovery of the neighbor. Specific neighbor dynamic discovery information parameters include Hello data packets. The information interval of the sending interval, the router invalid time, the neighbor, and the like, wherein the router invalid time refers to the maximum time interval (threshold value) from the start of the sending of the Hello data packet by the local node to the receipt of the response message sent by the peer neighbor. At the maximum time interval, the neighbor establishment failure is considered. The HSAPN router can also calculate the port state information parameters of each port based on the HSAPN address of the neighbor router port and its own HSAPN address carried in the Hello data packet received from the directly connected neighboring router. The port status is used to identify the port. Each port of the router is an uplink port (parent port), a downlink port (child port), or a peer port. The specific calculation method is as follows:

例如以图 3所示为例,路由器 A的 HSAPN地址为 Al .Bl.Cl.O,有三个端 口 1、 2、 3 ,根据从 1端口收到的 Hello数据报文中携带的路由器 B的 HSAPN 地址 A1.B1.0.0, 与自己的 HSAPN地址 Al .Bl.Cl.O相比, 依据所述地址分配 规则可以判断, A1.B1.0.0是 Al.Bl.Cl.O的父级地址, 即可知道路由器 A的端 口 1是上行端口; 同理, 根据从 2端口收到的 Hello数据报文中携带的路由器 C的 HSAPN地址 A1.B1.C2.0, 与自己的 HSAPN地址 Al .Bl.Cl.O相比, 依据 所述地址分配规则可以判断, A1.B1.C2.0和 Al.Bl .Cl .O是同一网络级别的地 址, 即可知道路由器 A的端口 2是同级端口; 根据从 3端口收到的 Hello数据 报文中携带的路由器 D的 HSAPN地址 A1.B1.C1.D1 , 与自己的 HSAPN地址 Al .Bl .Cl.O相比,依据所述地址分配规则可以判断,A1.B1.C1.D1是 Al .Bl.Cl.O 的子级地址, 即可知道路由器 A的端口 3是下行端口。  For example, as shown in FIG. 3, the HSAPN address of the router A is Al.Bl.Cl.O, and there are three ports 1, 2, and 3, and the HSAPN of the router B carried in the Hello data packet received from the port 1 is received. The address A1.B1.0.0, compared with its own HSAPN address Al.Bl.Cl.O, can be judged according to the address allocation rule, A1.B1.0.0 is the parent address of Al.Bl.Cl.O, ie It can be known that port 1 of router A is an uplink port; similarly, according to the HSAPN address A1.B1.C2.0 of router C carried in the Hello data packet received from port 2, and its own HSAPN address Al.Bl. Compared with Cl.O, according to the address allocation rule, it can be judged that A1.B1.C2.0 and Al.Bl.Cl.O are addresses of the same network level, and it can be known that port 2 of router A is a peer port; According to the HSAPN address A1.B1.C1.D1 of the router D carried in the Hello data packet received from the port 3, compared with the HSAPN address Al.Bl.Cl.O of the own, the address allocation rule can be determined according to the address allocation rule. , A1.B1.C1.D1 is the child address of Al.Bl.Cl.O, and it can be known that port 3 of router A is the downlink port.

该 Hello数据报文仅限于邻居节点之间一跳传送, HSAPN路由器节点的 状态信息也只在邻居节点间通告, 不进行洪泛扩散。  The Hello data packet is transmitted only one hop between the neighboring nodes. The status information of the HSAPN router node is only advertised between the neighboring nodes and is not flooded.

102: 根据邻居路由器的链路状态信息建立路由表;  102: Establish a routing table according to link state information of the neighboring router.

如表 1所示,根据收到的直连邻居路由器节点发来的 Hello数据报文中携 带的链路状态信息参数, 以及计算得到的端口状态信息参数, 建立路由表。 该 路由表的建立主要依据链路及端口状态信息中的邻居路由器 HSAPN地址和与 其相连的本机路由器的端口号。  As shown in Table 1, the routing table is established based on the link state information parameters carried in the Hello data packet sent by the directly connected neighbor router node and the calculated port state information parameters. The routing table is established based on the neighbor router HSAPN address in the link and port status information and the port number of the local router connected to it.

路由表中还可以包括根据情况给 HSAPN网络中路由器节点设置优先等 級的信息, 用于标识同一级别 (如一級、 二级、 三级、 四级) 中路由器节点 路由的优先级。 在本发明的实施例中, 该优先等级可采用势能等级来判定, 势能等级高的, 优先等级高, 势能等级低的, 优先级低, 即在转发过程中, 数 据报文从当前路由器节点优先转发到势能等级高的同级路由器节点。势能等级 可以根据网络规划统一进行设置。 势能等级高的为优选、 主路由, 势能等级低 的为主路由故障时, 备选的次路由。 The routing table may further include information for setting a priority level to the router nodes in the HSAPN network according to the situation, and is used to identify the priority of the router node routes in the same level (such as primary, secondary, tertiary, and tertiary). In the embodiment of the present invention, the priority level may be determined by using a potential energy level, the potential energy level is high, the priority level is high, the potential energy level is low, and the priority is low, that is, during the forwarding process, According to the message, the packet is preferentially forwarded from the current router node to the peer router node with the high potential level. The potential level can be set uniformly according to the network plan. If the potential energy level is high, it is preferred, the primary route, and the potential energy level is low, and the primary route is faulty, and the secondary route is optional.

表 1

Figure imgf000008_0001
Table 1
Figure imgf000008_0001

103: 根据路由规则和路由表, 进行数据报文的路由。 103: Perform routing of data packets according to routing rules and routing tables.

本发明实施例提供的路由规则是针对当前 HSAPN路由器节点路由转发的 路由规则, 每个 HSAPN路由器节点在进行数据报文路由转发时, 根据当前路 由器节点的 HSAPN地址、 目的路由器节点的 HSAPN地址和路由规则, 查找 路由表, 确定转发路径。  The routing rule provided by the embodiment of the present invention is a routing rule for routing and forwarding of the current HSAPN router node, and each HSAPN router node performs the data packet routing and forwarding according to the HSAPN address of the current router node and the HSAPN address and route of the destination router node. Rules, look up the routing table, and determine the forwarding path.

如果目的路由器节点的 HSAPN地址与当前路由器节点的 HSAPN地址 相同, 则报文无需路由, 即数据报文已经传递到目的路由器节点;  If the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, the packet does not need to be routed, that is, the data packet has been delivered to the destination router node.

如果目的路由器节点的 HSAPN地址与当前路由器节点的 HSAPN地址 不同, 但目的路由器节点的 HSAPN地址在当前级的 HSAPN地址与当前路 由器节点的 HSAPN 地址相同 , 则将数据报文从下行端口向下一级路由器 节点转发;  If the HSAPN address of the destination router node is different from the HSAPN address of the current router node, but the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, the data packet is sent from the downlink port to the next level. Router node forwarding;

如果目的路由器节点的 HSAPN地址与当前路由器节点的 HSAPN地址 不同, 且目的路由器节点的 HSAPN地址在数据报文所在的当前级的 HSAPN 地址与当前路由器节点的 HSAPN 地址不同, 则将 文从上行端口向上一 级路由器节点路由或者依据优先等级在当前级所在路由器节点中的同级路 由。  If the HSAPN address of the destination router node is different from the HSAPN address of the current router node, and the HSAPN address of the destination router node is different from the HSAPN address of the current router node where the data packet is located, the text is up from the uplink port. The primary router node routes or the peer routes in the router node where the current level is located according to the priority level.

以 4级 HSAPN网络为例, 请参考图 5所示, 在第 i级(i = l、 2、 3、 4 ) HSAPN路由器节点的路由具体如下:  Take the 4-level HSAPN network as an example. Referring to Figure 5, the route of the HSAPN router node at the i-th level (i = l, 2, 3, 4) is as follows:

103a: 第 i级当前路由器节点接收需要转发的数据报文, 该数据报文的报 文头中携带着源路由器节点的 HSAPN地址和目的路由器节点的 HSAPN地址 , 当前路由器节点解析出目的路由器节点的 HSAPN地址;  103a: The i-th current router node receives the data packet to be forwarded, and the packet header of the data packet carries the HSAPN address of the source router node and the HSAPN address of the destination router node, and the current router node resolves the destination router node. HSAPN address;

103b: 比较目的路由器节点的 HSAPN地址与当前路由器节点的 HSAPN地 址是否相同, 如果相同, 表明数据报文已经路由到目的路由器节点, 数据报文 路由流程结束, 如果不同, 进入下一步骤 103c; 103b: Compare the HSAPN address of the destination router node with the HSAPN address of the current router node Whether the addresses are the same, if the same, indicating that the data packet has been routed to the destination router node, the data packet routing process ends, if not, proceed to the next step 103c;

103c: 比较目的路由器节点在当前级(第 i级) 的 HSAPN地址与当前路由 器节点的 HSAPN地址是否相同, 如果相同, 则从当前路由器节点的下行端口 向下一级(第 1+1级)路由器节点路由, 如果不同, 进入下一步骤 103d;  103c: Compare whether the HSAPN address of the destination router node at the current level (i-th level) is the same as the HSAPN address of the current router node. If they are the same, the downlink port from the current router node is down to the first level (1+1th level) router. Node routing, if different, proceeds to the next step 103d;

在此步骤中, 请参考图 6, 从当前路由器节点的下行端口向下一级(第 1+1 级)路由器节点路由, 进一步包括: 判断当前路由器节点是否只有唯一的下行 端口, 如果是, 则从唯一的下行端口向下一级路由器节点路由, 如果不是, 则 用目的地址的第 ( 1 + 1 ) 级 HSAPN地址与各下行端口的 HSAPN地址相比, 从 比较结果值相同的 HSAPN地址所对应的下行端口向下一级路由器节点路由。  In this step, referring to FIG. 6, routing from the downlink port of the current router node to the next level (1+1th level) router node further includes: determining whether the current router node has only a unique downlink port, and if so, Routing from the only downstream port to the next-level router node. If not, the (1 + 1)-level HSAPN address of the destination address is compared with the HSAPN address of each downlink port, and the HSAPN address with the same comparison result value is corresponding. The downstream port is routed to the next level router node.

103d: 比较目的路由器节点的 HSAPN地址与当前路由器节点的 HSAPN地 址在当前级的上一级(第 i - 1级)的 HSAPN地址是否相同, 如果相同, 该数据 4艮文依据势能等级在当前级所在路由器节点中的同级转发, 如果不同, 则从当 前路由器节点的上行端口向上一級路由器节点转发。  103d: Compare the HSAPN address of the destination router node with the HSAPN address of the current router node at the upper level (i-1 level) of the current level. If the same, the data is based on the potential energy level at the current level. The peer forwarding in the router node is forwarded from the upstream port of the current router node to the upstream router node.

如图 7所示, 本发明实施例提供了一种层次化有序地址网络中的路由器, 包括:  As shown in FIG. 7, an embodiment of the present invention provides a router in a hierarchical and ordered address network, including:

通告报文生成单元, 用于生成通告报文, 该通告报文用于邻居动态发现和 通告链路状态信息, 在本发明实施例中, 该通告报文采用 Hello数据报文; 发送单元, 用以向直连邻居路由器节点发送报文, 该报文可为通告报文生 成单元生成的通告报文或者数据报文,其中通告报文中携带有自身路由器节点 的链路状态信息, 数据报文中携带有源路由器节点和目的路由器节点的 HSAPN地址;  The advertisement packet generating unit is configured to generate an advertisement packet, where the advertisement packet is used for the neighbor dynamic discovery and the advertisement of the link state. In the embodiment of the present invention, the advertisement packet uses a Hello data packet; The packet is sent to the directly connected neighboring router node, and the packet may be an advertisement packet or a data packet generated by the advertisement packet generating unit, where the advertisement packet carries the link state information of the own router node, and the data packet The HSAPN address carrying the active router node and the destination router node;

接收单元, 用以接收直连邻居路由器节点发送的报文, 该报文可为通告报 文或者数据报文,该接收单元能够从通告报文中获取直连邻居路由器节点链路 状态信息, 从数据报文中获取目的路由器节点的 HSAPN地址;  The receiving unit is configured to receive the packet sent by the directly connected neighboring router node, where the packet may be an advertisement packet or a data packet, and the receiving unit may obtain the link state information of the directly connected neighboring router node from the advertisement packet, Obtain the HSAPN address of the destination router node in the data packet;

路由表建立及存储单元:用以根据接收单元接收的直连邻居路由器节点的 链路状态信息建立路由表, 并存储该路由表;  a routing table establishing and storing unit: configured to establish a routing table according to link state information of the directly connected neighboring router node received by the receiving unit, and store the routing table;

判断单元, 进一步包括第一判断单元、 第二判断单元、 第三判断单元和第 四判断单元, 其中, 第一判断单元用以在当前路由器节点接收到数据报文后,判断目的路由器 节点的 HSAPN地址与当前路由器节点的 HSAPN地址是否相同; The determining unit further includes a first determining unit, a second determining unit, a third determining unit, and a fourth determining unit, wherein The first determining unit is configured to determine, after the current router node receives the data packet, whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node;

第二判断单元用以判断目的路由器节点在当前级的 HSAPN地址与当前路 由器节点的 HSAPN地址是否相同;  The second determining unit is configured to determine whether the HSAPN address of the current router node at the current level is the same as the HSAPN address of the current router node;

第三判断单元用以判断目的路由器节点的 HSAPN地址与当前路由器节点 在当前级的上一级的 HSAPN地址是否相同;  The third determining unit is configured to determine whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node at the current level;

第四判断单元用以判断当前路由器节点是否有唯一的下行端口。  The fourth determining unit is configured to determine whether the current router node has a unique downlink port.

选择单元, 用以根据路由规则, 查找所述路由表, 确定下一跳直连邻居路 由器节点, 并向所述的下一跳直连邻居路由器节点进行路由, 具体的进一步包 括第一选择单元、 第二选择单元、 第三选择单元和第四选择单元, 其中, 第一选择单元用以当第一判断单元判断结果为是 ( 目的路由器节点的 a selecting unit, configured to search the routing table according to the routing rule, determine a next hop directly connected neighbor router node, and perform routing to the next hop direct neighbor router node, where the method further includes a first selecting unit, a second selection unit, a third selection unit, and a fourth selection unit, wherein the first selection unit is configured to: when the first determination unit determines that the result is yes (the destination router node

HSAPN地址与当前路由器节点的 HSAPN地址相同) 时, 则进行本机处理 , 结 束数据报文的路由, 当第一判断单元判断结果为否(目的路由器节点的 HSAPN 地址与当前路由器节点的 HSAPN地址不相同) 时, 启用第二判断单元; When the HSAPN address is the same as the HSAPN address of the current router node, the local processing is performed to end the routing of the data packet. When the first judgment unit determines that the result is no (the HSAPN address of the destination router node and the HSAPN address of the current router node are not When the same), the second determining unit is enabled;

第二选择单元用以根据第二判断单元的判断结果,选择启用第三判断单元 或第四判断单元, 即当第二判断单元的判断结果为是(目的路由器节点在当前 级的 HSAPN地址与当前路由器节点的 HSAPN地址相同) 时, 第二选择单元选 择启用第三判断单元, 当第二判断单元的判断结果为否(目的路由器节点在当 前级的 HSAPN地址与当前路由器节点的 HSAPN地址不同) 时, 第二选择单元 选择启用第四判断单元;  The second selecting unit is configured to select to enable the third determining unit or the fourth determining unit according to the determining result of the second determining unit, that is, when the determining result of the second determining unit is yes (the destination router node is at the current level of the HSAPN address and current When the HSAPN address of the router node is the same, the second selection unit selects to enable the third determining unit, and when the second determining unit determines No (the destination router node is different from the HSAPN address of the current router node in the current level) The second selection unit selects to enable the fourth determining unit;

第三选择单元用以当第三判断单元判断为是(目的路由器节点的 HSAPN 地址与当前路由器节点在当前级的上一级的 HSAPN地址相同) 时, 依据势能 等级选择同级路由器节点转发数据报文, 当第三判断单元判断为否(目的路由 器节点的 HSAPN地址与当前路由器节点在当前级的上一级的 HSAPN地址不相 同) 时, 选择从当前路由器的上行端口向上一级路由器节点路由;  The third selecting unit is configured to: when the third determining unit determines that the HSAPN address of the destination router node is the same as the HSAPN address of the current router node at the current level of the current level, select the peer router node to forward the datagram according to the potential energy level. For example, when the third determining unit determines No (the HSAPN address of the destination router node is different from the HSAPN address of the current router node at the current level), the uplink port from the current router is selected to be routed to the first-level router node;

第四选择单元用以当第四判断单元判断为是(有唯一的下行端口)时, 选 择从唯一的下行端口进行路由, 当第四判断单元判断为否 (有多个下行端口) 时, 选择与目的地址的第( i + 1 )级 HSAPN地址相同的下行端口向下一级路由 器节点路由。 本领域普通技术人员可以理解实现上述实施例方法中的全部或部分步骤 是可以通过程序来指令相关的转发平面完成,所述的程序可以存储于计算机可 读存储介质中, 所述存储介质可以是 ROM/RAM, 磁盘或光盘等。 The fourth selecting unit is configured to: when the fourth determining unit determines that it is (having a unique downlink port), select to route from a unique downlink port, and when the fourth determining unit determines to be no (having multiple downlink ports), select The downlink port that is the same as the (i + 1)-level HSAPN address of the destination address is routed to the next-level router node. A person skilled in the art may understand that all or part of the steps in the method of implementing the above embodiments may be completed by a program to instruct a related forwarding plane, and the program may be stored in a computer readable storage medium, and the storage medium may be ROM/RAM, disk or CD, etc.

以上所述仅为本发明的较佳实施例, 并不用以限制本发明, 凡在本发明的 精神和原则之内, 所作的任何修改、 等同替换、 改进等, 均应包含在本发明的 保护范围之内。  The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., which are within the spirit and scope of the present invention, should be included in the protection of the present invention. Within the scope.

Claims

权 利 要 求 Rights request 1、 一种层次化有序地址分组 HSAPN网络中的路由的方法, 其特征在于, 包括:  A method for layering an ordered address grouping route in an HSAPN network, comprising: 当前路由器节点接收需要转发的报文,并从所述报文中获取目的路由器节 点的 HSAPN地址;  The current router node receives the packet to be forwarded, and obtains the HSAPN address of the destination router node from the packet; 判断所述目的路由器节点的 HSAPN 地址与所述当前路由器节点的 HSAPN地址是否相同,  Determining whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, 如果所述目的路由器节点的 HSAPN 地址与所述当前路由器节点的 HSAPN地址相同, 则结束所述报文的路由,  If the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, the routing of the packet is ended. 如果所述目的路由器节点的 HSAPN 地址与所述当前路由器节点的 If the destination router node has an HSAPN address with the current router node HSAPN地址不相同, 则根据路由规则和路由表, 确定下一跳直连邻居路由器 节点, 并将所述报文向所述下一跳直连邻居路由器节点进行路由。 If the HSAPN addresses are different, the next hop directly connected neighbor router node is determined according to the routing rule and the routing table, and the packet is routed to the next hop directly connected neighbor router node. 2、 根据权利要求 1所述的 HSAPN网络中路由的方法, 其特征在于, 还 包括:  2. The method of routing in an HSAPN network according to claim 1, further comprising: 发现邻居和获取直连邻居路由器节点的链路状态信息;  Discovering neighbors and obtaining link state information of directly connected neighbor router nodes; 根据所述直连邻居路由器节点的链路状态信息建立所述路由表。  And establishing the routing table according to link state information of the directly connected neighbor router node. 3、 如权利要求 2所述的 HSAPN网络中路由的方法, 其特征在于, 所述 发现邻居和获取直连邻居路由器节点的链路状态信息, 包括:  The method for routing in an HSAPN network according to claim 2, wherein the discovering the neighbor and obtaining the link state information of the directly connected neighboring router node includes: 所述当前路由器节点通过直连邻居路由器节点发送的通告报文来发现邻 居, 并获取直连邻居路由器节点的链路状态信息。  The current router node discovers the neighbor by directly transmitting the advertisement packet sent by the neighboring router node, and obtains the link state information of the directly connected neighbor router node. 4、 如权利要求 3所述的 HSAPN网络中的路由的方法, 其特征在于, 所 述当前路由器节点通过直连邻居路由器节点发送的通告 4艮文来发现邻居,并获 取直连邻居路由器节点的链路状态信息后, 还包括:  The method of routing in an HSAPN network according to claim 3, wherein the current router node discovers a neighbor by directly transmitting an advertisement message sent by the neighboring router node, and acquires a directly connected neighbor router node. After the link status information, it also includes: 所述当前路由器节点根据所述直连邻居路由器节点的链路状态信息获取 所述直连邻居路由器节点的 HSAPN地址,通过所述当前路由器节点的 HSAPN 地址和所述直连邻居路由器节点的 HSAPN地址比较,计算所述当前路由器节 点的端口状态信息参数。  Obtaining, by the current router node, an HSAPN address of the directly connected neighboring router node according to link state information of the directly connected neighboring router node, by using an HSAPN address of the current router node and an HSAPN address of the directly connected neighboring router node Comparing, calculating port state information parameters of the current router node. 5、 如权利要求 4所述的 HSAPN网络中的路由的方法, 其特征在于, 所 述计算所述当前路由器节点的端口状态信息参数, 具体为: 若所述当前路由器节点的 HSAPN 地址是所述直连邻居路由器节点的 HSAPN地址的父级地址, 则所述当前路由器节点接收所述直连邻居路由器节 点发送的通告报文的端口为下行端口; The method for routing a route in an HSAPN network according to claim 4, wherein the calculating a port state information parameter of the current router node is specifically: If the HSAPN address of the current router node is the parent address of the HSAPN address of the directly connected neighboring router node, the current router node receives the port of the advertisement message sent by the directly connected neighboring router node as a downlink port; 若所述当前路由器节点的 HSAPN 地址是所述直连邻居路由器节点的 HSAPN地址的同级地址, 则所述当前路由器节点接收所述直连邻居路由器节 点发送的通告 4艮文的端口为同级端口;  If the HSAPN address of the current router node is a peer address of the HSAPN address of the directly connected neighboring router node, the current router node receives the port of the notification message sent by the directly connected neighboring router node as a peer Port 若所述当前路由器节点的 HSAPN 地址是所述直连邻居路由器节点的 HSAPN地址的子级地址, 则所述当前路由器节点接收所述直连邻居路由器节 点发送的通告报文的端口为上行端口。  If the HSAPN address of the current router node is a child address of the HSAPN address of the directly connected neighboring router node, the current router node receives the port of the advertisement message sent by the directly connected neighboring router node as an uplink port. 6、 如权利要求 2所述的 HSAPN网络中路由的方法, 其特征在于, 所述 路由表中还可以包括所述 HSAPN网絡中路由器节点的优先等级信息, 所述优 先等级采用势能等级来标识。  The method of routing in the HSAPN network according to claim 2, wherein the routing table further includes priority information of the router node in the HSAPN network, and the priority level is identified by a potential energy level. 7、 如权利要求 1所述的 HSAPN网络中路由的方法, 其特征在于, 所述 根据路由规则和路由表, 确定下一跳直连邻居路由器节点, 并将所述报文向所 述下一跳直连邻居路由器节点进行路由, 具体包括:  The method of routing in an HSAPN network according to claim 1, wherein the determining, according to the routing rule and the routing table, determining a next hop direct neighbor router node, and forwarding the packet to the next Skip directly to neighbor router nodes for routing, including: 进一步判断所述目的路由器节点在当前级的 HSAPN地址与所述当前路由 器节点的 HSAPN地址是否相同;  Further determining whether the destination router node has the same HSAPN address of the current level as the HSAPN address of the current router node; 如果所述目的路由器节点在当前级的 HSAPN地址与所述当前路由器节点 的 HSAPN地址相同, 则将所述 ^艮文从下行端口向下一级路由器节点路由; 如果所述目的路由器节点在当前级的 HSAPN地址与所述当前路由器节点 的 HSAPN地址不相同, 则将所述 4艮文从上行端口向上一级路由器节点路由 , 或者依据优先等级在当前级路由器节点中路由。  If the destination router node has the same HSAPN address of the current level as the HSAPN address of the current router node, routing the message from the downlink port to the next-level router node; if the destination router node is at the current level The HSAPN address is different from the HSAPN address of the current router node, and the 4艮 text is routed from the uplink port to the first-level router node, or is routed in the current-level router node according to the priority level. 8、 如权利要求 7所述的 HSAPN网络中的路由的方法, 其特征在于, 所 述将所述报文从下行端口向下一级路由器节点路由, 具体包括:  The method of routing the HSAPN network according to claim 7, wherein the routing the packet from the downlink port to the next-level router node comprises: 进一步判断所述当前路由器节点是否只有唯一的下行端口;  Further determining whether the current router node has only a unique downlink port; 如果只有唯一的下行端口,则从所述唯一的下行端口向下一级路由器节点 路由;  If there is only a unique downlink port, routing from the unique downlink port to the next-level router node; 如果不是只有唯一的下行端口, 则用目的路由器节点的 HSAPN地址在下 一级 HSAPN地址与当前路由器节点的各下行端口的 HSAPN地址相比, 从比 较结果值相同的 HSAPN地址所对应的下行端口向下一级路由器节点路由。If there is not only a unique downlink port, the HSAPN address of the destination router node is compared with the HSAPN address of each downlink port of the current router node in the next-level HSAPN address. The downlink port corresponding to the HSAPN address with the same result value is routed to the next-level router node. 9、 如权利要求 7所述的 HSAPN网络中的路由的方法, 其特征在于, 所 述将所述报文从上行端口向上一级路由器节点路由,或者依据优先等级在当前 级路由器节点中路由, 具体包括: The method of routing in an HSAPN network according to claim 7, wherein the message is routed from an uplink port to a first-level router node, or is routed in a current-level router node according to a priority level, Specifically include: 进一步判断所述目的路由器节点的 HSAPN地址与所述当前路由器节点的 Further determining an HSAPN address of the destination router node and the current router node HSAPN地址在当前级的上一级的 HSAPN地址是否相同; Whether the HSAPN address of the HSAPN address is the same as the HSAPN address of the upper level of the current level; 如果所述目的路由器节点的 HSAPN 地址与所述当前路由器节点的 HSAPN地址在当前级的上一级的 HSAPN地址相同, 将所述报文依据优先等 级在当前级路由器节点中的转发;  If the HSAPN address of the destination router node is the same as the HSAPN address of the current router node in the upper level of the current level, the packet is forwarded in the current level router node according to the priority level; 如果所述目的路由器节点的 HSAPN 地址与所述当前路由器节点的 If the destination router node has an HSAPN address with the current router node HSAPN地址在当前级的上一级的 HSAPN地址不相同, 则将所述报文从所述 当前路由器节点的上行端口向上一级路由器节点转发。 The HSAPN address is different from the HSAPN address of the upper level of the current level, and the message is forwarded from the uplink port of the current router node to the first-level router node. 10、 一种层次化有序地址 HSAPN网络中的路由器, 其特征在于, 包括: 接收单元, 用以接收直连邻居路由器节点发送的报文, 所述报文包括通告 报文和数据报文,并从所述通告报文中获取所述直连邻居路由器节点的链路状 态信息;  A router in a hierarchically-ordered address HSAPN network, comprising: a receiving unit, configured to receive a packet sent by a directly connected neighboring router node, where the packet includes an advertisement packet and a data packet, Obtaining link state information of the directly connected neighbor router node from the advertisement packet; 路由表建立及存储单元,用以根据所述接收单元获取的直连邻居路由器节 点的链路状态信息建立路由表, 并存储该路由表;  a routing table establishing and storing unit, configured to establish a routing table according to the link state information of the directly connected neighboring router node acquired by the receiving unit, and store the routing table; 选择单元, 用以根据路由规则和所述路由表, 确定下一跳直连邻居路由器 节点, 并将接收到的数据 · ^文向所述下一跳直连邻居路由器节点进行路由。  And a selecting unit, configured to determine, according to the routing rule and the routing table, a next hop direct neighbor router node, and route the received data to the next hop directly connected neighbor router node. 11、 如权利要求 10所述的 HSAPN网络中的路由器, 其特征在于, 所述 路由器还包括:  The router in the HSAPN network of claim 10, wherein the router further comprises: 通告报文生成单元, 用于生成通告报文;  An advertisement packet generating unit, configured to generate an advertisement packet; 发送单元, 用以向所述直连邻居路由器节点发送报文, 该报文为数据报文 或者所述通告报文生成单元生成的通告报文,其中通告报文中携带有所述路由 器节点自身的链路状态信息, 数据报文中携带有目的路由器节点的 HSAPN地 址;  a sending unit, configured to send a packet to the directly connected neighboring router node, where the packet is a data packet or an advertisement packet generated by the advertisement packet generating unit, where the advertisement packet carries the router node itself Link state information, the data packet carries the HSAPN address of the destination router node; 所述接收单元, 还用以从接收到的数据报文中获取目的路由器节点的 HSAPN地址。 The receiving unit is further configured to obtain an HSAPN address of the destination router node from the received data packet. 12、 如权利要求 11所述的 HSAPN网络中的路由器, 其特征在于, 所述路 由器还包括: 判断单元, 所述判断单元包括第一判断单元、 第二判断单元、 第 三判断单元和第四判断单元, 其中, The router in the HSAPN network according to claim 11, wherein the router further comprises: a determining unit, wherein the determining unit comprises a first determining unit, a second determining unit, a third determining unit, and a fourth Judging unit, wherein 所述第一判断单元用以在所述路由器节点接收到所述数据报文后,判断所 述目的路由器节点的 HSAPN地址与所述路由器节点的 HSAPN地址是否相同; 所述第二判断单元用以判断所述目的路由器节点在当前级的 HSAPN地址 与所述路由器节点的 HSAPN地址是否相同;  The first determining unit is configured to determine, after the router node receives the data packet, whether the HSAPN address of the destination router node is the same as the HSAPN address of the router node; Determining whether the destination router node has the same HSAPN address at the current level as the HSAPN address of the router node; 所述第三判断单元用以判断所述目的路由器节点的 HSAPN地址与所述路 由器节点在当前级的上一级的 HSAPN地址是否相同;  The third determining unit is configured to determine whether an HSAPN address of the destination router node is the same as an HSAPN address of the router node at a higher level of the current level; 所述第四判断单元用以判断所述路由器节点是否有唯一的下行端口。 The fourth determining unit is configured to determine whether the router node has a unique downlink port. 13、 如权利要求 12所述的 HSAPN网絡中的路由器, 其特征在于, 所述路 由器还包括: 选择单元, 所述选择单元包括第一选择单元、 第二选择单元、 第 三选择单元和第四选择单元, 其中, The router in the HSAPN network according to claim 12, wherein the router further comprises: a selecting unit, wherein the selecting unit comprises a first selecting unit, a second selecting unit, a third selecting unit, and a fourth Select unit, where 所述第一选择单元用以当所述第一判断单元判断结果为否,启用第二判断 单元;  The first selecting unit is configured to enable the second determining unit when the first determining unit determines that the result is negative; 所述第二选择单元用以根据第二判断单元的判断结果,选择启用第三判断 单元或第四判断单元;  The second selecting unit is configured to select to enable the third determining unit or the fourth determining unit according to the determining result of the second determining unit; 所述第三选择单元用以当第三判断单元判断为是时,依据优先等级选择同 级路由器节点转发所述数据 · ^文, 当第三判断单元判断为否时, 选择从所述当 前路由器的上行端口向上一级路由器节点路由;  The third selecting unit is configured to: when the third determining unit determines to be YES, select a peer router node to forward the data according to the priority level, and when the third determining unit determines to be no, select the current router. The uplink port is routed to the upper-level router node; 所述第四选择单元用以当第四判断单元判断为否时,选择与所述目的路由 器节点在当前级下一级 HSAPN地址相同的下行端口向下一级路由器节点路 由。  And the fourth selecting unit is configured to: when the fourth determining unit determines to be no, select a downlink port that is the same as the HSAPN address of the destination router node in the next level of the current level to the next-level router node.
PCT/CN2009/073558 2008-09-27 2009-08-27 Routing method and router in hierarchical and sequential address packet network Ceased WO2010037291A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200810216519.8A CN101686188B (en) 2008-09-27 2008-09-27 Method for establishing route table, routing method and router in hierarchy sequential address packet network
CN200810216519.8 2008-09-27

Publications (1)

Publication Number Publication Date
WO2010037291A1 true WO2010037291A1 (en) 2010-04-08

Family

ID=42049169

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/073558 Ceased WO2010037291A1 (en) 2008-09-27 2009-08-27 Routing method and router in hierarchical and sequential address packet network

Country Status (2)

Country Link
CN (1) CN101686188B (en)
WO (1) WO2010037291A1 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103078798B (en) * 2012-12-28 2015-12-02 华为技术有限公司 A kind of method and apparatus setting up routing table
CN103491509B (en) * 2013-09-29 2016-03-30 北京天公瑞丰科技有限公司 A kind of micro power radio communication node and a kind of micro power radio communication network
CN103746852B (en) * 2014-01-21 2017-04-19 华为技术有限公司 Service routing configuration method and network management equipment
CN105282036A (en) * 2014-06-18 2016-01-27 深圳市中兴微电子技术有限公司 Routing node and route exchange method and system
CN106341862A (en) * 2015-07-07 2017-01-18 联发科技股份有限公司 Method and device for sharing service among multiple devices
DE102017109029A1 (en) * 2017-04-27 2018-10-31 Endress+Hauser Process Solutions Ag Arrangement, fieldbus access unit and method for monitoring a plant of automation technology
CN109379258B (en) * 2018-09-13 2020-11-20 悦动奇点(北京)健康科技有限公司 Communication method, device and system applied to fitness somatosensory equipment
CN115550244B (en) * 2022-09-21 2023-11-17 中国电子科技集团公司第二十八研究所 A method for forwarding instruction messages between multiple data chains

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1477884A (en) * 2002-08-20 2004-02-25 �廪��ѧ Hierarchical mobile data packet communication network and communication method thereof
WO2004040878A2 (en) * 2002-10-28 2004-05-13 Cisco Technology, Inc. Rpf multi-party reliable transport
CN1744566A (en) * 2005-10-14 2006-03-08 清华大学 Layered mobile multicasting method based on fast multicasting switching

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7366111B2 (en) * 2005-04-08 2008-04-29 Cisco Technology, Inc. Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network
CN101026559B (en) * 2007-01-23 2010-07-28 华为技术有限公司 A method and router for establishing communication
CN101227412B (en) * 2008-02-05 2010-09-29 华为技术有限公司 Method and device for message conversion

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1477884A (en) * 2002-08-20 2004-02-25 �廪��ѧ Hierarchical mobile data packet communication network and communication method thereof
WO2004040878A2 (en) * 2002-10-28 2004-05-13 Cisco Technology, Inc. Rpf multi-party reliable transport
CN1744566A (en) * 2005-10-14 2006-03-08 清华大学 Layered mobile multicasting method based on fast multicasting switching

Also Published As

Publication number Publication date
CN101686188A (en) 2010-03-31
CN101686188B (en) 2013-01-09

Similar Documents

Publication Publication Date Title
US11689452B2 (en) Method for forwarding service data, network device, and network system
US7924726B2 (en) Arrangement for preventing count-to-infinity in flooding distance vector routing protocols
EP1579716B1 (en) Routing scheme based on virtual space representation
Li et al. Routing bandwidth guaranteed paths with local restoration in label switched networks
CN107070798B (en) Network area division method, network device and system
CN102281200B (en) Method for selecting current backup route and router
EP3399703B1 (en) Method for implementing load balancing, apparatus, and network system
TW202034737A (en) Routing optimizations in a network computing environment
WO2010037291A1 (en) Routing method and router in hierarchical and sequential address packet network
JP2001308912A (en) Qos path calculation device
JP5625121B2 (en) Prioritizing routing information updates
US20100172237A1 (en) Building backup tunnels for fast reroute in communications networks
US8355368B2 (en) Method and system for automatic selection of detour paths in a wireless mesh network
CN107623630A (en) A kind of explicit Copy Info transmission method of position index and device
Buob et al. Designing optimal iBGP route-reflection topologies
CN103001872B (en) A kind of label distribution method and polymerization unit
CN101483591B (en) Route implementing method and route generating apparatus
CN101635656B (en) Fault detection method in layered ordered address packet network, system and equipment
CN102882785B (en) Area border router and node protection method based on border gateway protocol
JP7592899B2 (en) Method and apparatus for multicast forwarding between autonomous systems
JP2004193644A (en) Router and path setting method and network in MPLS
Nozaki et al. Evaluation of tiered routing protocol in floating cloud tiered internet architecture
CN101997752A (en) Control net element and routing control method thereof
Ariza-Quintana et al. An architecture for the implementation of mesh networks in OMNeT++
EP2337281B1 (en) Method of exchanging routing information between network nodes in a packet switched network

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

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

Country of ref document: EP

Kind code of ref document: A1