[go: up one dir, main page]

CN101686188B - Method for establishing route table, routing method and router in hierarchy sequential address packet network - Google Patents

Method for establishing route table, routing method and router in hierarchy sequential address packet network Download PDF

Info

Publication number
CN101686188B
CN101686188B CN200810216519.8A CN200810216519A CN101686188B CN 101686188 B CN101686188 B CN 101686188B CN 200810216519 A CN200810216519 A CN 200810216519A CN 101686188 B CN101686188 B CN 101686188B
Authority
CN
China
Prior art keywords
router node
hsapn
address
directly
routing
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.)
Expired - Fee Related
Application number
CN200810216519.8A
Other languages
Chinese (zh)
Other versions
CN101686188A (en
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
Priority to CN200810216519.8A priority Critical patent/CN101686188B/en
Priority to PCT/CN2009/073558 priority patent/WO2010037291A1/en
Publication of CN101686188A publication Critical patent/CN101686188A/en
Application granted granted Critical
Publication of CN101686188B publication Critical patent/CN101686188B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

Landscapes

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

Abstract

本发明实施例公开了一种HSAPN网络中建立路由表的方法、路由的方法及路由器,所述的方法包括:发现邻居和获取直连邻居路由器节点的链路状态信息;根据所述直连邻居路由器节点链路状态信息建立路由表;根据路由规则和所述路由表,确定下一跳直连邻居路由器节点,并向所述下一跳直连邻居路由器节点进行路由。HSAPN网络中的路由器节点仅需要获取直连邻居路由器节点的链路状态信息,即当前路由器节点根据路由规则仅需要知道如何路由到下一跳路由器节点,而无需要获取全网的路由器节点的链路状态信息,确定全网的路由路径,不仅缩减了路由表的配置信息,同时简化了当前路由器节点的复杂性。

The embodiment of the present invention discloses a method for establishing a routing table in an HSAPN network, a routing method, and a router. The method includes: discovering neighbors and obtaining link state information of directly connected neighbor router nodes; The link state information of the router node establishes a routing table; according to the routing rules and the routing table, determine the next hop directly connected to the neighbor router node, and perform routing to the next hop directly connected to the neighbor router node. The router nodes in the HSAPN network only need to obtain the link state information of directly connected neighbor router nodes, that is, the current router node only needs to know how to route to the next-hop router node according to the routing rules, and does not need to obtain the link status information of the router nodes in the entire network. Route status information to determine the routing path of the entire network, which not only reduces the configuration information of the routing table, but also simplifies the complexity of the current router nodes.

Description

层次化有序地址分组网络中建立路由表的方法、路由的方法及路由器Method for establishing routing table in hierarchical orderly address grouping network, routing method and router

技术领域 technical field

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

背景技术 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 transition from analog technology to digital technology, and is undergoing the second transition from TDM (Time-Division Multiplexing) technology to packet switching technology. , ATM (Asynchronous Transfer Mode, Asynchronous Transfer Mode) packet technology is the representative of this transition stage, but due to the difficulty of ATM packet technology and the unsuccessful commercial operation, the second step of the transition from TDM technology to packet switching technology in the telecom network 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 achieved great success due to the application of Web technology, and rapidly expanded into a large global network that can compete with the telecommunications network, and gradually moved to the telecommunications network. Business extension. Therefore, the telecommunication network has introduced IP packet technology and loaded all telecommunication services on the IP network, expecting 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 a unified management mechanism, which also causes the Internet to be insecure, untrustworthy, lack of management and Due to the lack of guarantee of service quality and other issues, many important commercial service networks and data interconnection services and real-time video services with high service quality requirements cannot be safely uploaded to the public IP network. The important task of transition from TDM technology to packet technology.

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

发明内容 Contents of the invention

本发明实施例提供一种HSAPN网络中建立路由表的方法、路由的方法及路由器,HSAPN网络中的路由器节点仅需要获取直连邻居路由器节点的链路状态信息,依据该直连邻居路由器节点链路状态信息,确定路由路径。Embodiments of the present invention provide a method for establishing a routing table in an HSAPN network, a routing method, and a router. A router node in an HSAPN network only needs to obtain the link state information of a directly connected neighbor router node. Route status information to determine the routing path.

本发明实施例提出的一种层次化有序地址分组HSAPN网络中的路由的方法,包括:发现邻居和获取直连邻居路由器节点的链路状态信息;根据所述的直连邻居路由器节点链路状态信息建立路由表;根据路由规则和所述路由表,确定下一跳直连邻居路由器节点,并向所述的下一跳直连邻居路由器节点进行路由。A method for routing in a hierarchical and ordered address grouping HSAPN network proposed by an embodiment of the present invention includes: discovering neighbors and obtaining link state information of directly connected neighbor router nodes; The state information establishes a routing table; according to the routing rules and the routing table, determine the next hop directly connected to the neighbor router node, and perform routing to the next hop directly connected to the neighbor router node.

本发明实施例提出了一种层次化有序地址HSAPN网络中建立路由表的方法,包括:HSAPN网络中直连的路由器节点通过相互发送通告报文进行邻居发现和获取直连邻居路由器节点的链路状态信息,并根据所述的直连邻居路由器节点链路状态信息建立路由表。The embodiment of the present invention proposes a method for establishing a routing table in a hierarchical and ordered address HSAPN network, including: the directly connected router nodes in the HSAPN network perform neighbor discovery by sending notification messages to each other and obtain the link of the directly connected neighbor router node link state information, and establish a routing table according to the link state information of directly connected neighbor router nodes.

本发明实施例还提出了一种层次化有序地址HSAPN网络中的路由的方法,包括:当前路由器节点接收需要转发的业务报文,并从所述的业务报文中获取目的路由器节点的HSAPN地址;判断所述目的路由器节点的HSAPN地址与所述当前路由器节点的HSAPN地址是否相同,如果是,则结束所述数据报文的路由,如果否,向所述下一跳直连邻居路由器节点进行路由。The embodiment of the present invention also proposes a routing method in a hierarchical ordered address HSAPN network, including: the current router node receives the service message that needs to be forwarded, and obtains the HSAPN address of the destination router node from the service message. Address; determine whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, if yes, then end the routing of the data message, if not, directly connect the neighbor router node to the next hop for routing.

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

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

附图说明 Description of drawings

图1是本发明实施例HSAPN网络的结构示意图;Fig. 1 is the structural representation of the HSAPN network of the embodiment of the present invention;

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

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

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

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

图6是本发明实施例HSAPN中数据报文向下行转发时路由方法的示意图;6 is a schematic diagram of a routing method when a data message is forwarded downstream in an HSAPN according to an 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 ways

本发明实施例提供一种HSAPN网络中建立路由表的方法、路由的方法及路由器,下面结合附图详细说明本发明的优选实施例。Embodiments of the present invention provide a method for establishing a routing table in an HSAPN network, a routing method, and a router. Preferred embodiments of the present invention will be described in detail below in conjunction with 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 network includes at least one HSAPN network, a plurality of IP networks, ATM networks or FR (Frame Relay, Frame Relay) networks, and a plurality of ED (Edge Device, border entity) devices, wherein each HSAPN The net also includes at least one ADT (Address Translation Entity). The service network of the HSAPN network can 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 uses the IP network as an example to describe. In the HSAPN network shown in Figure 1, the IP network is connected to the HSAPN network through ED devices, all devices in the HSAPN network and ED devices are assigned HSAPN addresses, and all devices in the IP network and ED devices are assigned IP addresses. The address, the mapping relationship between the HSAPN address and the IP address is stored in the address mapping table in the ADT.

HSAPN地址根据运营商和地域采用分层分级的方式来编址,地址是层次化有序的,HSAPN网络中根据地址可以确定一条确定的路径。如图2所示的HSAPN网络路由示意图,在本发明实施例中,HSAPN网络系统以4级为例,各级的编码格式和长度采用的是二/十六进制编码格式,但绝不限于此,根据情况HSAPN网络系统也可分为5级、6级等,各级的编码格式和长度亦根据情况设定,建议使用二进制编码格式。HSAPN addresses are addressed in a hierarchical and hierarchical manner according to operators and regions. The addresses are hierarchical and orderly. A certain path can be determined according to the address in the HSAPN network. HSAPN network route schematic diagram as shown in Figure 2, in the embodiment of the present invention, HSAPN network system is with 4 grades as example, what the encoding format of each level and length adopted is binary/hexadecimal encoding format, but is by no means limited to Therefore, according to the situation, the HSAPN network system can also be divided into 5 levels, 6 levels, etc., and the coding format and length of each level are also set according to the situation. It is recommended to use the binary coding format.

结合图1并参考图2所示,在本发明实施例中,A、B、C、D是HSAPN的编址形式,A、B、C、D分别代表了不同的网络层次,即A代表了核心域(国家域,一级)、B代表了汇聚域(省级域,二级)、C代表了接入域(市级域,三级)、D代表了边界域(网关域,四级)。在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来说,不同等级的路由器网络地址有其相应的网络级别地址掩码,例如:核心域地址A1.0.0.0的网络级别地址掩码是F×××F.0.0.0,汇聚域地址A1.B2.0.0的网络级别地址掩码是F×××F.F×××F.0.0,接入域地址A1.B2.C3.0的网络级别地址掩码是F×××F.F×××F.F×××F.0,边界域地址A1.B2.C3.D1的网络级别地址掩码是F×××F.F×××F.F×××F.F×××F。With reference to Fig. 1 and shown in Fig. 2, in the embodiment of the present invention, A, B, C, D are the addressing forms of HSAPN, and A, B, C, D represent different network levels respectively, namely A represents The core domain (national 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 border domain (gateway domain, level 4 ). In the HSAPN network, the network level of the router can be judged according to the address, that is, the address allocation rule, for example: from A1. It can be known that the router is in the second-level A1.B2 domain, from A1.B2.C3.0, it can be known that the router is in the third-level A1.B2.C3 domain, and from A1.B2.C3.D1, it can be known that the router is in the fourth-level ( lowest level). For address A.B.C.D, router network addresses of different levels have their corresponding network-level address masks. For example, the network-level address mask of the core domain address A1.0.0.0 is F×××F.0.0.0, and the aggregation The network-level address mask of the domain address A1.B2.0.0 is F×××F.F×××F.0.0, and the network-level address mask of the access domain address A1.B2.C3.0 is F×××F.F× ××F.F×××F.0, the network level address mask of the border domain address A1.B2.C3.D1 is F×××F.F×××F.F×××F.F×××F.

本发明实施例基于上述的HSAPN网络,在HSAPN网络中的相邻路由器节点之间相互发送通告报文,进行邻居动态发现以及链路状态信息的获取,每个路由器获取与该路由器节点直连的父节点路由器、子节点路由器、同级节点路由器的链路状态信息,动态生成路由表,也可以通过人工规划,静态配置该路由表,同时,制定路由规则,并根据路由规则查找路由表进行数据报文的转发。The embodiment of the present invention is based on the above-mentioned HSAPN network, and the adjacent router nodes in the HSAPN network send notification messages to each other to perform dynamic discovery of neighbors and acquisition of link state information. The link status information of parent node routers, child node routers, and routers at the same level can dynamically generate routing tables, or statically configure the routing table through manual planning. At the same time, formulate routing rules, and search the routing table for data Message forwarding.

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

101:邻居动态发现和直连邻居路由器节点的链路状态信息的获取;101: Dynamic discovery of neighbors and acquisition of link state information of directly connected neighbor router nodes;

在本发明实施例中,HSAPN路由器节点包括至少一个端口,该HSAPN路由器节点从自己所有的端口上发出通告报文,该通告报文用于邻居动态发现和通告链路状态信息,在本发明实施例中,该通告报文采用Hello数据报文。如果两台路由器共享一条公共数据链路,并且能够相互成功协商它们各自Hello数据报文中所指定的某些参数,那么它们就成为了直连邻居。该Hello数据报文携带了链路状态相关的信息和邻居动态发现相关的信息,具体的信息参数包括HSAPN路由器地址、端口号、网络级别地址掩码、Hello间隔、路由器无效时间、邻居等信息参数。HSAPN路由器根据从直连邻居路由器收到的Hello数据报文中携带的相邻端口的HSAPN地址和自己的HSAPN地址,还可以计算出自己各个端口的端口状态信息参数,端口状态用于标识该路由器各端口是上行端口(父级端口)、下行端口(子级端口),还是同级端口,具体计算方法如下所示:In the embodiment of the present invention, the HSAPN router node includes at least one port, and the HSAPN router node sends a notification message from all ports of itself, and the notification message is used for neighbor dynamic discovery and notification of link state information. In the example, the notification message adopts the Hello data message. Two routers become direct neighbors if they share a common data link and can successfully negotiate certain parameters specified in their respective Hello packets. The Hello data packet carries link state-related information and neighbor dynamic discovery-related information. The specific information parameters include HSAPN router address, port number, network-level address mask, Hello interval, router invalid time, neighbors and other information parameters. . According to the HSAPN address of the adjacent port carried in the Hello data message received from the directly connected neighbor router and its own HSAPN address, the HSAPN router can also calculate the port status information parameters of each port of its own. The port status is used to identify the router. Whether each port is an uplink port (parent port), a downlink port (child port), or a port at the same level, the specific calculation method is as follows:

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

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

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

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

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

表1Table 1

  目的地址 下一跳地址 出端口 出端口状态 势能等级 A1.B1.C1.D1 A1.B1.C2.0 1 上行 Destination address next hop address out port Outgoing port status Potential level A1.B1.C1.D1 A1.B1.C2.0 1 Uplink high

103:根据路由规则和路由表,进行数据报文的路由。103: Routing the data packet according to the routing rule and the routing table.

本发明实施例提供的路由规则是针对当前HSAPN路由器节点路由转发的路由规则,每个HSAPN路由器节点在进行数据报文路由转发时,根据当前路由器节点的HSAPN地址、目的路由器节点的HSAPN地址和路由规则,查找路由表,确定转发路径。The routing rules provided by the embodiments of the present invention are routing rules directed at the routing and forwarding of the current HSAPN 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 message does not need to be routed, that is, the data message 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 at the current level is the same as the HSAPN address of the current router node, then send the data message 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 message is located, the message is sent from the uplink port Routing to the upper level router node or routing at the same level in the router node where the current level is located according to the priority.

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

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

103b:比较目的路由器节点的HSAPN地址与当前路由器节点的HSAPN地址是否相同,如果相同,表明数据报文已经路由到目的路由器节点,数据报文路由流程结束,如果不同,进入下一步骤103c;103b: compare whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node, if identical, it indicates that the data message has been routed to the destination router node, and the data message routing process ends, if different, enter the next step 103c;

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

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

103d:比较目的路由器节点的HSAPN地址与当前路由器节点的HSAPN地址在当前级的上一级(第i-1级)的HSAPN地址是否相同,如果相同,该数据报文依据势能等级在当前级所在路由器节点中的同级转发,如果不同,则从当前路由器节点的上行端口向上一级路由器节点转发。103d: Compare whether the HSAPN address of the destination router node is the same as the HSAPN address of the HSAPN address of the current router node at the upper level (level i-1) of the current level; if they are the same, the data message is located at the current level according to the potential energy level For forwarding at the same level in the router node, if it is different, it is forwarded from the uplink port of the current router node to the upper level router node.

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

通告报文生成单元,用于生成通告报文,该通告报文用于邻居动态发现和通告链路状态信息,在本发明实施例中,该通告报文采用Hello数据报文;The notification message generation unit is used to generate a notification message, which is used for neighbor dynamic discovery and notification of link state information. In the embodiment of the present invention, the notification message adopts a Hello data message;

发送单元,用以向直连邻居路由器节点发送报文,该报文可为通告报文生成单元生成的通告报文或者数据报文,其中通告报文中携带有自身路由器节点的链路状态信息,数据报文中携带有源路由器节点和目的路由器节点的HSAPN地址;The sending unit is used to send a message to the directly connected neighbor router node. The message can be a notification message or a data message generated by the notification message generation unit, wherein the notification message carries the link state information of its own router node , the data message carries the HSAPN addresses of the source router node and the destination router node;

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

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

判断单元,进一步包括第一判断单元、第二判断单元、第三判断单元和第四判断单元,其中,The judging unit further includes a first judging unit, a second judging unit, a third judging unit and a fourth judging unit, wherein,

第一判断单元用以在当前路由器节点接收到数据报文后,判断目的路由器节点的HSAPN地址与当前路由器节点的HSAPN地址是否相同;The first judging unit is used for judging whether the HSAPN address of the destination router node is the same as the HSAPN address of the current router node after the current router node receives the data message;

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

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

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

选择单元,用以根据路由规则,查找所述路由表,确定下一跳直连邻居路由器节点,并向所述的下一跳直连邻居路由器节点进行路由,具体的进一步包括第一选择单元、第二选择单元、第三选择单元和第四选择单元,其中,The selection unit is used to search the routing table according to the routing rules, determine the next hop directly connected to the neighbor router node, and perform routing to the next hop directly connected to the neighbor router node, specifically further comprising a first selection unit, The second selection unit, the third selection unit and the fourth selection unit, wherein,

第一选择单元用以当第一判断单元判断结果为是(目的路由器节点的HSAPN地址与当前路由器节点的HSAPN地址相同)时,则进行本机处理,结束数据报文的路由,当第一判断单元判断结果为否(目的路由器节点的HSAPN地址与当前路由器节点的HSAPN地址不相同)时,启用第二判断单元;The first selection unit is used for when the judgment result of the first judging unit is yes (the HSAPN address of the purpose router node is identical with the HSAPN address of the current router node), then carry out local processing, end the routing of the data message, when the first judging When the unit judgment result is no (the HSAPN address of the destination router node is different from the HSAPN address of the current router node), enable the second judgment unit;

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

第三选择单元用以当第三判断单元判断为是(目的路由器节点的HSAPN地址与当前路由器节点在当前级的上一级的HSAPN地址相同)时,依据势能等级选择同级路由器节点转发数据报文,当第三判断单元判断为否(目的路由器节点的HSAPN地址与当前路由器节点在当前级的上一级的HSAPN地址不相同)时,选择从当前路由器的上行端口向上一级路由器节点路由;The 3rd selection unit is used for when the 3rd judging unit is judged to be (the HSAPN address of destination router node is identical with the HSAPN address of the upper level of current router node at the current level), selects the router node of the same level to forward the datagram according to the potential energy level When the third judging unit judges as no (the HSAPN address of the destination router node is different from the HSAPN address of the current router node at the upper level of the current level), select routing from the uplink port of the current router to the upper level router node;

第四选择单元用以当第四判断单元判断为是(有唯一的下行端口)时,选择从唯一的下行端口进行路由,当第四判断单元判断为否(有多个下行端口)时,选择与目的地址的第(i+1)级HSAPN地址相同的下行端口向下一级路由器节点路由。The fourth selection unit is used to select a route from a unique downlink port when the fourth judging unit is judged to be yes (there is a unique downlink port), and when the fourth judging unit is judged to be no (there are multiple downlink ports), select The downlink port that is the same as the (i+1)th level HSAPN address of the destination address is routed to the next level router node.

本领域普通技术人员可以理解实现上述实施例方法中的全部或部分步骤是可以通过程序来指令相关的转发平面完成,所述的程序可以存储于计算机可读存储介质中,所述存储介质可以是ROM/RAM,磁盘或光盘等。Those of ordinary skill in the art can understand that all or part of the steps in the method of the above embodiments can be implemented by instructing the relevant forwarding plane through a program, and the program can be stored in a computer-readable storage medium, and the storage medium can be ROM/RAM, disk or CD, etc.

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

Claims (8)

1. the method for route in the hierarchy sequential address grouping HSAPN network is characterized in that, comprising:
Discovering neighbor and the link-state information of obtaining the directly-connected neighbor router node, wherein, if two routers are shared common data links, and can mutually successfully consult their separately some specified parameters in the Hello data message, they just become directly-connected neighbor so;
Set up routing table according to described directly-connected neighbor router node link-state information;
According to routing rule and described routing table, determine down hop directly-connected neighbor router node, and carry out route to described down hop directly-connected neighbor router node;
Wherein, the notification packet that the current router node sends by described directly-connected neighbor router node obtains the link-state information of directly-connected neighbor router node, described current router node comprises at least one port, described current router receives the notification packet that described directly-connected neighbor router node sends by described port, and the HSAPN address that obtains the directly-connected neighbor router node according to the link-state information of described directly-connected neighbor router node, compare by the HSAPN address of described current router node and the HSAPN address of described directly-connected neighbor router node, calculate the port status information parameter of described current router node.
2. the method for the route in the HSAPN network as claimed in claim 1 is characterized in that, the port status information parameter of the described current router node of described calculating is specially:
If the HSAPN address of described current router node is the parent address of the HSAPN address of described directly-connected neighbor router node, then to receive the port of the notification packet that described directly-connected neighbor router node sends be downlink port to described current router node;
If the HSAPN address of described current router node is the address at the same level of the HSAPN address of described directly-connected neighbor router node, then to receive the port of the notification packet that described directly-connected neighbor router node sends be port at the same level to described current router node;
If the HSAPN address of described current router node is the sub level address of the HSAPN address of described directly-connected neighbor router node, then to receive the port of the notification packet that described directly-connected neighbor router node sends be uplink port to described current router node.
3. the method for route in the HSAPN network as claimed in claim 1 is characterized in that described method also further comprises: router node in the described HSAPN network is arranged priority level, and this priority level adopts potential energy grade to identify.
4. the method for route in the HSAPN network as claimed in claim 1, it is characterized in that, described method also further comprises: described current router node receives the data message that needs are transmitted, and the HSAPN address that obtains the purpose router node from described data message
Described according to routing rule and described routing table, determine down hop directly-connected neighbor router node, and carry out route to described down hop directly-connected neighbor router node, be specially:
Whether the HSAPN address of judging described purpose router node is identical with the HSAPN address of described current router node,
If so, then finish the route of described data message,
If not, carry out route to described down hop directly-connected neighbor router node.
5. the method for route in the HSAPN network as claimed in claim 4 is characterized in that, and is if not described, carries out route to described down hop directly-connected neighbor router node, is specially:
If the HSAPN address of described purpose router node is different from the HSAPN address of current router node, judge further whether described purpose router node is identical with the HSAPN address of described current router node in the HSAPN address when prime, if, then with described data message from the downward level-1 router node-routing of downlink port, if not, then relatively whether the HSAPN address of purpose router node is identical in the HSAPN address of the upper level of working as prime with the HSAPN address of current router node, if identical, this data message is transmitted in peer in the router node of prime place according to the potential energy grade, if different, then transmit from the uplink port of the current router node level-1 router node that makes progress.
6. the method for the route in the HSAPN network as claimed in claim 5 is characterized in that, described if, then with described data message from the downward level-1 router node-routing of downlink port, be specially:
If described purpose router node is identical with the HSAPN address of described current router node in the HSAPN address when prime, further judge whether described current router node only has unique downlink port, if, then from the downward level-1 router node-routing of unique downlink port, if not, then compare with the HSAPN address of each downlink port of current router node in next stage HSAPN address with destination address, from the identical downward level-1 router node-routing of the corresponding downlink port in HSAPN address of comparison result value.
7. the router in the hierarchy sequential address HSAPN network is characterized in that, comprising:
Receiving element, the notification packet that sends in order to receive the directly-connected neighbor router node, carry the link-state information of the router node that sends this message in this notification packet, wherein, if two routers are shared a common data link, and can mutually successfully consult their separately some specified parameters in the Hello data message, they just become directly-connected neighbor so;
Routing table is set up and memory cell: the link-state information in order to the directly-connected neighbor router node that receives according to described receiving element is set up routing table, and the storage route;
Selected cell in order to according to routing rule and described routing table, is determined down hop directly-connected neighbor router node, and carries out route to described down hop directly-connected neighbor router node;
Described router also comprises:
The notification packet generation unit is used for generating notification packet;
Transmitting element, in order to send message to described directly-connected neighbor router node, this message is notification packet or the data message that described notification packet generation unit generates, wherein carry the link-state information of self router node in the notification packet, carry the HSAPN address of purpose router node in the data message;
Described receiving element receives the data message that the directly-connected neighbor router node sends, and obtains directly-connected neighbor node-routing device link-state information, the HSAPN address that obtains the purpose router node from data message from notification packet;
Described router also comprises: judging unit, described judging unit comprise the first judging unit, the second judging unit, the 3rd judging unit and the 4th judging unit, wherein,
Described the first judging unit judges in order to after receiving described data message at the current router node whether the HSAPN address of described purpose router node is identical with the HSAPN address of described current router node;
Described the second judging unit is in order to judge whether described purpose router node is identical with the HSAPN address of described current router node in the HSAPN address when prime;
Whether described the 3rd judging unit is identical in the HSAPN address of the upper level of working as prime with described current router node in order to the HSAPN address of judging described purpose router node;
Described the 4th judging unit is in order to judge whether described current router node has unique downlink port.
8. the router in the HSAPN network as claimed in claim 7 is characterized in that,
Described selected cell comprises the first selected cell, the second selected cell, the 3rd selected cell and the 4th selected cell, wherein,
Described the first selected cell is enabled the second judging unit in order to be no as described the first judgment unit judges result;
Described the second selected cell selects to enable the 3rd judging unit or the 4th judging unit in order to the judged result according to the second judging unit;
Described the 3rd selected cell in order to when the 3rd judgment unit judges when being, select router node at the same level to transmit described data message according to the potential energy grade, when the 3rd judgment unit judges when being no, select from the uplink port of the described current router level-1 router node-routing that makes progress;
Described the 4th selected cell is selected working as the identical downward level-1 router node-routing of downlink port in prime next stage HSAPN address with described purpose router node when being no when the 4th judgment unit judges.
CN200810216519.8A 2008-09-27 2008-09-27 Method for establishing route table, routing method and router in hierarchy sequential address packet network Expired - Fee Related CN101686188B (en)

Priority Applications (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
PCT/CN2009/073558 WO2010037291A1 (en) 2008-09-27 2009-08-27 Routing method and router in hierarchical and sequential address packet network

Applications Claiming Priority (1)

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

Publications (2)

Publication Number Publication Date
CN101686188A CN101686188A (en) 2010-03-31
CN101686188B true CN101686188B (en) 2013-01-09

Family

ID=42049169

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200810216519.8A Expired - Fee Related CN101686188B (en) 2008-09-27 2008-09-27 Method for establishing route table, routing method and router in hierarchy 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
CN101133595A (en) * 2005-04-08 2008-02-27 思科技术公司 Device for providing optimal connection between peer routers in tree-based mobile ad hoc network
CN101227412A (en) * 2008-02-05 2008-07-23 华为技术有限公司 Method and device for message conversion

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7546380B2 (en) * 2002-10-28 2009-06-09 Cisco Technology, Inc. RPF multi-party reliable transport
CN100366032C (en) * 2005-10-14 2008-01-30 清华大学 Hierarchical Mobile Multicast Method Based on Fast Multicast Handover
CN101026559B (en) * 2007-01-23 2010-07-28 华为技术有限公司 A method and router for establishing communication

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
CN101133595A (en) * 2005-04-08 2008-02-27 思科技术公司 Device for providing optimal connection between peer routers in tree-based mobile ad hoc network
CN101227412A (en) * 2008-02-05 2008-07-23 华为技术有限公司 Method and device for message conversion

Also Published As

Publication number Publication date
CN101686188A (en) 2010-03-31
WO2010037291A1 (en) 2010-04-08

Similar Documents

Publication Publication Date Title
EP1579716B1 (en) Routing scheme based on virtual space representation
CN101686188B (en) Method for establishing route table, routing method and router in hierarchy sequential address packet network
EP3103230B1 (en) Software defined networking (sdn) specific topology information discovery
US8270302B2 (en) System and method for providing an adaptive value of TTL (time to live) for broadcast/multicast messages in a mesh network using a hybrid wireless mesh protocol
CN101401360B (en) Tree-guided distributed link state routing method
CN101455030B (en) Dynamic shared risk node group (srng) membership discovery
CN102971988B (en) Alternative Down Paths for Directed Acyclic Graph (DAG) Routing
WO2018113586A1 (en) Network area division method, network device and system
CN101005452A (en) Method and system for communication between IP devices
CN109510769A (en) A kind of fusion route system being suitable for width combination network and its method
CN101674229B (en) Information management method of link aggregation group and network node
CN101483591B (en) Route implementing method and route generating apparatus
CN100396056C (en) A Path Selection Method for Wireless Mesh Networks
Margaryan et al. Development of an Adaptive Routing Algorithm in MANET
US20050254473A1 (en) Routing within a mobile communication network
Gao et al. Multi-path routing protocol with unavailable areas identification in wireless sensor networks
Lafta et al. Efficient routing protocol in the mobile ad-hoc network (MANET) by using genetic algorithm (GA)
CN101997752B (en) Control net element and routing control method thereof
Prasanna et al. Analysis of AntHocNet and AODV performance using NS2
Ziane et al. A QoS adaptive multi-path reinforcement learning routing algorithm for manet
Quadri et al. COMPARATIVE EVALUATION OF AODV, OLSR, AND DSDV ROUTING PROTOCOL PERFORMANCE IN MANET USING NS-3.
Ali et al. Enhanced QoS support in Mobile Ad hoc Networks using multipath routing backbones
Sachdeva et al. Performance based comparison of aodv and olsr routing protocols in manet using ftp and http traffics
Nwelih et al. Analysis and performance evaluation of mobile ad-hoc network (MANET) protocols based on selected criteria
CN101540713B (en) Method and device for establishing point-to-multipoint channel

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130109

Termination date: 20150927

EXPY Termination of patent right or utility model