CN101686188A - 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
CN101686188A
CN101686188A CN200810216519A CN200810216519A CN101686188A CN 101686188 A CN101686188 A CN 101686188A CN 200810216519 A CN200810216519 A CN 200810216519A CN 200810216519 A CN200810216519 A CN 200810216519A CN 101686188 A CN101686188 A CN 101686188A
Authority
CN
China
Prior art keywords
router node
hsapn
address
route
node
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.)
Granted
Application number
CN200810216519A
Other languages
Chinese (zh)
Other versions
CN101686188B (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

Abstract

The embodiment of the invention discloses a method for establishing route table, routing method and router in hierarchy sequential address packet network. The method includes: finding a neighbour andacquiring state information of a link directly connecting neighbour router node; establishing a route table according to the state information of the link directly connecting neighbour router node; and confirming next hop directly connecting the neighbour router node according to routing rule and the route table and routing toward the next hop directly connecting the neighbour router node. Routernode in HSAPN network only needs to acquire the state information of the link directly connecting the neighbour router node, namely the current router node only needs to know how to route to the nexthop router node according to routing rule without acquiring link state information of router node of the full network or confirming routing path of the full network, thus not only reducing configuration information of the route table but also simplifying complexity of the current router node.

Description

Set up the method for routing table, the method and the router of route in the hierarchy sequential address packet network
Technical field
The present invention relates to the communications field, relate in particular in a kind of hierarchy sequential address grouping (HSAPN, Hierarchical and Sequential Address Packet Network) network and set up the method for routing table, the method and the router of route.
Background technology
Development along with technology, telecommunications network has been finished smoothly by the first step transition of analogue technique to digital technology, carrying out (Time-Division Multiplexing by TDM, time division multiplexing) technology is to the second step transition of packet-switch technology, ATM (Asynchronous Transfer Mode, asynchronous transfer mode) group technology is the representative of this transition stage, but because ATM group technology difficulty is big and commercial operation is unsuccessful, telecommunications network is gone on foot transition and is unrealized to second of packet-switch technology by the TDM technology.
Early 1990s, based on IP (Internet Protocol, the IP agreement) the Internet of group technology has been owing to the Web The Application of Technology has obtained great success, is expanded into the global macroreticular that can contend with telecommunications network rapidly, and progressively extends to telecommunication service.So telecommunications network has been introduced the IP group technology, and whole telecommunication services are carried on the IP network, expectation realizes thus by the transition of TDM technology to group technology.But, because the design concept of the Internet is free and non-profile business model, make the Internet based on the IP group technology be one free and open, the packet network that does not have unified management mechanism, this has also caused the dangerous of the Internet, trustless, lack the management and service quality and lack problems such as assurance, feasible a lot of important commercial business net and high data interconnect services and real-time video traffic of quality of service requirement, can't guarantee to be loaded into safely public IP goes on the net, in this case, the IP group technology can not be born the responsibility by the important task of TDM technology to the group technology transition.
A kind of hierarchy sequential address grouping HSAPN network has been proposed for this reason, the HSAPN network is the Packet Based Network that is used for the telecommunications purpose, it is used to carry the whole telecommunication services that existed already at present, and can guarantee that the telecommunication service of its carrying can provide and the professional same services quality of conventional telecommunications.Also can carry Internet service in addition, the ability identical with existing the Internet is provided, support the present whole Internet services that existed already, can also be used to issuable from now on other business of carrying.The coded system that the stratification of HSAPN network using is orderly, hierarchical routing, so can determine a definite path according to the address, but also there are not perfect routing table method for building up and corresponding method for routing in the current HSAPN network, current routing table need provide the routing iinformation of router node in the whole net, route table items is big, and all adopts the mode of static manual configuration to realize, the configuration complexity is easily made mistakes.
Summary of the invention
The embodiment of the invention provides and sets up the method for routing table, the method and the router of route in a kind of HSAPN network, router node in the HSAPN network only needs to obtain the link-state information of directly-connected neighbor router node, according to this directly-connected neighbor router node link-state information, determine routed path.
The method of the route in a kind of hierarchy sequential address grouping HSAPN network that the embodiment of the invention proposes comprises: find neighbours and the link-state information of obtaining the directly-connected neighbor router node; Set up routing table according to described directly-connected neighbor router node link-state information; According to routing rule and described routing table, determine next jumping directly-connected neighbor router node, and carry out route to described next jumping directly-connected neighbor router node.
The embodiment of the invention has proposed to set up in a kind of hierarchy sequential address HSAPN network the method for routing table, comprise: router node direct-connected in the HSAPN network carries out the link-state information that neighbours found and obtained the directly-connected neighbor router node by mutual transmission notification packet, and sets up routing table according to described directly-connected neighbor router node link-state information.
The embodiment of the invention has also proposed the method for the route in a kind of hierarchy sequential address HSAPN network, comprising: the current router node receives the service message that needs are transmitted, and the HSAPN address that obtains the purpose router node from described service message; Whether the HSAPN address of judging described purpose router node identical with the HSAPN address of described current router node, if, then finish the route of described data message, if not, to described next jump directly-connected neighbor router node and carry out route.
Router in a kind of hierarchy sequential address HSAPN network that the embodiment of the invention reintroduces, comprise receiving element, in order to receive the notification packet that the directly-connected neighbor router node sends, carry the link-state information of the router node that sends this message in this notification packet; Set up the unit: the link-state information of the directly-connected neighbor router node that receives according to receiving element is set up routing table; Selected cell in order to according to routing rule and described routing table, is determined next jumping directly-connected neighbor router node, and carries out route to described next jumping directly-connected neighbor router node.
In an embodiment of the present invention, by sending the LSA message between the directly-connected neighbor router node in the HSAPN network mutually, obtain the link-state information of the router node of directly-connected neighbor, and only need to generate routing table according to the link-state information of the directly-connected neighbor router node that is obtained, search the forwarding that routing table is carried out data message according to routing rule.Router node in the HSAPN network only needs to obtain the link-state information of directly-connected neighbor router node, be the current router node according to routing rule only needs know how to be routed to the next hop router node, and need not obtain the link-state information of the router node of the whole network, determine the routed path of the whole network, not only reduce the configuration information of routing table, simplified the complexity of current router node simultaneously.
Description of drawings
Fig. 1 is the structural representation of embodiment of the invention HSAPN network;
Fig. 2 is an embodiment of the invention HSAPN Network Layering classification addressing schematic diagram;
Fig. 3 is the schematic diagram of embodiment of the invention HSAPN network port state;
Fig. 4 is the schematic diagram of the method for routing among the embodiment of the invention HSAPN;
Fig. 5 is the schematic diagram of data message method for routing among the embodiment of the invention HSAPN;
Fig. 6 is the schematic diagram of data message route method when descending forwarding the among the embodiment of the invention HSAPN;
Fig. 7 is the structural representation of router among the embodiment of the invention HSAPN.
Embodiment
The embodiment of the invention provides and sets up the method for routing table, the method and the router of route in a kind of HSAPN network, describes the preferred embodiments of the present invention in detail below in conjunction with accompanying drawing.
As shown in Figure 1, the HSAPN network comprises at least one HSAPN net, most IP networks, ATM net or FR (Frame Relay, frame relay) net, and most ED (Edge Device, boundary solid) equipment, wherein also comprise at least one ADT (address translation entity) in each HSAPN net.The service network of HSAPN network can be IP network, ATM net, FR net because IP network is a current application network the most widely, so following mainly be that example is described with the IP network.In HSAPN network as shown in Figure 1, IP network is connected with the HSAPN net by ED equipment, all devices and ED equipment in the HSAPN net all are assigned the HSAPN address, all devices in the IP network and ED equipment all are assigned the IP address, and the mapping relations between HSAPN address and the IP address are kept in the interior address mapping table of ADT.
The HSAPN address adopts mode at different levels to address according to operator and region, and the address is that stratification is orderly, can determine a definite path according to the address in the HSAPN network.HSAPN network route schematic diagram as shown in Figure 2, in embodiments of the present invention, the HSAPN network system is an example with 4 grades, what coded format at different levels and length adopted is two/hexadecimal code form, but never be limited to this, according to circumstances the HSAPN network system also can be divided into 5 grades, 6 grades etc., and coded format at different levels and length are also according to circumstances set, and binary coded format is used in suggestion.
In conjunction with Fig. 1 and with reference to shown in Figure 2, in embodiments of the present invention, A, B, C, D are the addressing forms of HSAPN, A, B, C, D have represented different network layers respectively, be that on behalf of core domain (national territory, one-level), B, A represented to converge territory (provincial territory, secondary), C has represented input field (city-level territory, three grades), D represented territory, border (gateway territory, level Four).In the HSAPN network, can judge the residing network-level of router according to the address, it also is the address assignment rule, for example: can know that from A1.0.0.0 this router is in one-level (top) A1 territory, can know that from A1.B2.0.0 this router is in secondary A1.B2 territory, can know that from A1.B2.C3.0 this router is in three grades of A1.B2.C3 territories, can know that from A1.B2.C3.D1 this router is in level Four (lowermost level).At address A.B.C.D, there is its corresponding network-level address mask the router network address of different brackets, for example: the network-level address mask of core domain address A1.0.0.0 be F * * * F.0.0.0, the network-level address mask of converging domain addresses A1.B2.0.0 be F * * * F.F * * * F.0.0, the network-level address mask of input field address A1.B2.C3.0 be F * * * F.F * * * F.F * * * F.0, the network-level address mask of border domain addresses A1.B2.C3.D1 be F * * * F.F * * * F.F * * * F.F * * * F.
The embodiment of the invention is based on above-mentioned HSAPN network, send notification packet between the neighboring router node in the HSAPN network mutually, carry out obtaining of dynamic discovery of neighbours and link-state information, each router obtains the link-state information of the father node router direct-connected with this router node, child node router, brother of node router, dynamically generate routing table, also can be by artificial planning, this routing table of static configuration, simultaneously, formulate routing rule, and search the forwarding that routing table is carried out data message according to routing rule.
Please refer to shown in Figure 4ly, particularly, the method for routing in the HSAPN network that the embodiment of the invention provides comprises:
101: neighbours dynamically find and the obtaining of the link-state information of directly-connected neighbor router node;
In embodiments of the present invention, the HSAPN router node comprises at least one port, this HSAPN router node sends notification packet from own all ports, this notification packet is used for neighbours and dynamically finds and announce link-state information, in embodiments of the present invention, this notification packet adopts the Hello data message.If two routers are shared common data links, and can successfully consult their some specified parameters in the Hello data message separately mutually, they just become directly-connected neighbor so.This Hello data message has carried the relevant information of Link State and neighbours dynamically find relevant information, and concrete information parameter comprises informations parameter such as HSAPN router address, port numbers, network-level address mask, hello interval, router ineffective time, neighbours.The HSAPN router is according to the HSAPN address of the adjacent port that carries from the Hello data message that the directly-connected neighbor router is received and the HSAPN address of oneself, can also calculate the port status information parameter of own each port, it is uplink port (parent port), downlink port (sub level port) that port status is used to identify each port of this router, or port at the same level, concrete computational methods are as follows:
For example Figure 3 shows that example, the HSAPN address of router-A is A1.B1.C1.0, three port ones, 2,3 are arranged, HSAPN address A1.B1.0.0 according to the router B that carries the Hello data message of receiving from 1 port, compare with the HSAPN address A1.B1.C1.0 of oneself, can judge that according to described address assignment rule A1.B1.0.0 is the parent address of A1.B1.C1.0, the port one of promptly knowing router-A is a uplink port; In like manner, HSAPN address A1.B1.C2.0 according to the router C that carries the Hello data message of receiving from 2 ports, compare with the HSAPN address A1.B1.C1.0 of oneself, can judge according to described address assignment rule, A1.B1.C2.0 and A1.B1.C1.0 are other addresses of consolidated network level, and the port 2 of promptly knowing router-A is ports at the same level; HSAPN address A1.B1.C1.D1 according to the router D that carries the Hello data message of receiving from 3 ports, compare with the HSAPN address A1.B1.C1.0 of oneself, can judge according to described address assignment rule, A1.B1.C1.D1 is the sub level address of A1.B1.C1.0, knows that promptly the port 3 of router-A is a downlink port.
This Hello data message only limits between the neighbor node jump set and send, and the state information of HSAPN router node is also only announced between neighbor node, does not carry out the inundation diffusion.
102: the link-state information according to neighbor router is set up routing table;
As shown in Table 1, the Link State parameter of carrying in the Hello data message of sending according to the directly-connected neighbor router node of receiving, and the port status information parameter that calculates, information is set up routing table, and the foundation of this routing table is mainly according to the port numbers of the neighbor router HSAPN address in the state information and coupled this machine router.
Can also comprise the information that priority level according to circumstances is set to router node in the HSAPN network in the routing table, be used for identifying the priority of same rank (as one-level, secondary, three grades, level Four) router node route.In an embodiment of the present invention, this priority level can adopt the potential energy grade to judge, the potential energy grade is high, the priority level height, the potential energy grade is low, and priority is low, promptly in repeating process, data message preferentially is forwarded to the high router node at the same level of potential energy grade from the current router node.The potential energy grade can be according to artificial unified setting of the network planning.The potential energy grade is high be preferred, main road by, the potential energy grade is low is main road during by fault, alternative inferior route.
Table 1
Destination address Next hop address Outbound port The outbound port state The potential energy grade
??A1.B1.C1.D1 ??A1.B1.C2.0 ??1 Up High
103:, carry out the route of data message according to routing rule and routing table.
The routing rule that the embodiment of the invention provides is the routing rule at current HSAPN router node routing forwarding, each HSAPN router node is when carrying out the data message routing forwarding, according to the HSAPN address of current router node, the HSAPN address and the routing rule of purpose router node, search routing table, determine forward-path.
If the HSAPN address of purpose router node is identical with the HSAPN address of current router node, then message need not route, and promptly data message has been delivered to the purpose router node;
If the HSAPN address of purpose router node is different with the HSAPN address of current router node, but the HSAPN address of purpose router node is identical with the HSAPN address of current router node in the HSAPN address when prime, then data message is transmitted from the downward level-1 router node of downlink port;
If the HSAPN address of purpose router node is different with the HSAPN address of current router node, and the HSAPN address of purpose router node the data message place when the HSAPN address of prime different with the HSAPN address of current router node, then with message from make progress level-1 router node route or of uplink port according to the route at the same level of priority level during working as prime place router node.
With 4 grades of HSAPN networks is example, please refer to shown in Figure 5, specific as follows in the route of i level (i=1,2,3,4) HSAPN router node:
103a: i level current router node receives the data message that needs forwarding, carrying the HSAPN address of source router node and the HSAPN address of purpose router node in the heading of this data message, the current router node parses the HSAPN address of purpose router node;
103b: relatively whether the HSAPN address of purpose router node is identical with the HSAPN address of current router node, if identical, show that data message has been routed to the purpose router node, data message route flow process finishes, if different, enter next step 103c;
103c: relatively whether the purpose router node is identical with the HSAPN address of current router node in the HSAPN address when prime (i level), if it is identical, then from the downlink port of current router node to next stage (i+1 level) router node route, if different, enter next step 103d;
In this step, please refer to Fig. 6, from the downlink port of current router node to next stage (i+1 level) router node route, further comprise: judge whether the current router node has only unique downlink port, if, then from the downward level-1 router node of unique downlink port route, if not, then use (i+1) level HSAPN address of destination address to compare, from the identical downward level-1 router node of the pairing downlink port in the HSAPN address route of comparison result value with the HSAPN address of each downlink port.
103d: relatively whether the HSAPN address of purpose router node is identical in the HSAPN address of the upper level (i-1 level) of working as prime with the HSAPN address of current router node, if it is identical, this data message is transmitted in the 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.
As shown in Figure 7, the embodiment of the invention provides the router in a kind of hierarchy sequential address network, comprising:
The notification packet generation unit is used to generate notification packet, and this notification packet is used for neighbours and dynamically finds and announce link-state information, and in embodiments of the present invention, this notification packet adopts the Hello data message;
Transmitting element, in order to send message to the directly-connected neighbor router node, this message can be notification packet or the data message that the notification packet generation unit generates, wherein carry the link-state information of self router node in the notification packet, carry the HSAPN address of source router node and purpose router node in the data message;
Receiving element, in order to receive the message that the directly-connected neighbor router node sends, this message can be notification packet or data message, this receiving element can obtain directly-connected neighbor router node link-state information from notification packet, obtain the HSAPN address of purpose router node from data message;
Routing table is set up and memory cell: the link-state information of the directly-connected neighbor router node that receives according to receiving element is set up routing table, and stores this routing table;
Judging unit further comprises first judging unit, second judging unit, the 3rd judging unit and the 4th judging unit, wherein,
First judging unit judges in order to after receiving data message at the current router node whether the HSAPN address of purpose router node is identical with the HSAPN address of current router node;
Second judging unit is in order to judge whether the purpose router node is identical with the HSAPN address of current router node in the HSAPN address when prime;
Whether the 3rd judging unit is identical in the HSAPN address of the upper level of working as prime with the current router node in order to the HSAPN address of judging the purpose router node;
The 4th judging unit is in order to judge whether the current router node has unique downlink port.
Selected cell, in order to according to routing rule, search described routing table, determine next jumping directly-connected neighbor router node, and to described next jump directly-connected neighbor router node and carry out route, concrete first selected cell, second selected cell, the 3rd selected cell and the 4th selected cell of further comprising, wherein
First selected cell in order to when the first judgment unit judges result when being (the HSAPN address of purpose router node is identical with the HSAPN address of current router node), then carrying out this machine handles, the route of end data message, when the first judgment unit judges result when denying (the HSAPN address of purpose router node and the HSAPN address of current router node are inequality), enables second judging unit;
Second selected cell is in order to the judged result according to second judging unit, the 3rd judging unit or the 4th judging unit are enabled in selection, promptly the judged result when second judging unit is when being (the purpose router node is identical with the HSAPN address of current router node in the HSAPN address when prime), second selected cell selects to enable the 3rd judging unit, when the judged result of second judging unit during for not (the purpose router node is different with the HSAPN address of current router node in the HSAPN address when prime), the 4th judging unit is enabled in the selection of second selected cell;
The 3rd selected cell in order to when the 3rd judgment unit judges when being (the HSAPN address of purpose router node and current router node are identical in the HSAPN address when the upper level of prime), select router node at the same level to transmit data message according to the potential energy grade, when the 3rd judgment unit judges during for not (the HSAPN address of purpose router node and current router node are inequality in the HSAPN address when the upper level of prime), selection is from the uplink port of the current router level-1 router node route that makes progress;
The 4th selected cell in order to when the 4th judgment unit judges when being (unique downlink port is arranged), selection is carried out route from unique downlink port, when the 4th judgment unit judges is when denying (a plurality of downlink ports are arranged), select the identical downward level-1 router node of downlink port route in (i+1) level HSAPN address with destination address.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant Forwarding plane to finish by program, described program can be stored in the computer-readable recording medium, described storage medium can be ROM/RAM, disk or CD etc.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (18)

1, the method for route in a kind of hierarchy sequential address grouping HSAPN network is characterized in that, comprising:
Find neighbours and the link-state information of obtaining the directly-connected neighbor router node;
Set up routing table according to described directly-connected neighbor router node link-state information;
According to routing rule and described routing table, determine next jumping directly-connected neighbor router node, and carry out route to described next jumping directly-connected neighbor router node.
2, the method for route in the HSAPN network as claimed in claim 1 is characterized in that, the notification packet that described current router node sends by described direct-connected router node obtains the link-state information of directly-connected neighbor router node.
3, the method for the route in the HSAPN network as claimed in claim 2, it is characterized in that, described current router node comprises at least one port, described current router receives the notification packet that described direct-connected router node sends by described port, and the HSAPN address that obtains direct-connected 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 direct-connected router node, calculate the port status information parameter of described current router node.
4, the method for the route in the HSAPN network as claimed in claim 3 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, the port that then described current router node receives the notification packet of described directly-connected neighbor router node transmission is a downlink port;
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, the port that then described current router node receives the notification packet of described directly-connected neighbor router node transmission is a port at the same level;
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, the port that then described current router node receives the notification packet of described directly-connected neighbor router node transmission is a uplink port.
5, 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 provided with priority level, and this priority level adopts the potential energy grade to identify.
6, 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 next jumping directly-connected neighbor router node, and carry out route to described next jumping 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, then finish the route of described data message,
If not, carry out route to described next jumping directly-connected neighbor router node.
7, the method for route in the HSAPN network as claimed in claim 6 is characterized in that, and is if not described, carries out route to described next jumping directly-connected neighbor router node, is specially:
If the HSAPN address of described purpose router node is different with 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 of downlink port route, if not, then with described data message from uplink port make progress level-1 router node route or according to priority level in the route at the same level when the router node of prime place.
8, the method for the route in the HSAPN network as claimed in claim 7 is characterized in that, described if, then with described data message from the downward level-1 router node of downlink port route, 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 has only unique downlink port, if, then from the downward level-1 router node of unique downlink port route, if not, then compare with the HSAPN address of each downlink port of current router node in next stage HSAPN address, from the identical downward level-1 router node of the pairing downlink port in the HSAPN address route of comparison result value with destination address.
9, the method for the route in the HSAPN network as claimed in claim 7, it is characterized in that, if not described, then with described data message from uplink port make progress level-1 router node route or according to priority level in the route at the same level when the router node of prime place, be specially:
If described purpose router node is different with the HSAPN address of described current router node in the HSAPN address when prime, whether the HSAPN address of further judging described purpose router node is identical in the HSAPN address of the upper level of working as prime with the HSAPN address of described current router node, if, described data message is transmitted in the peer in the router node of prime place according to the potential energy grade, if not, then transmit from the uplink port of the described current router node level-1 router node that makes progress.
10, set up the method for routing table in a kind of hierarchy sequential address HSAPN network, it is characterized in that, comprising:
Router node direct-connected in the HSAPN network is found neighbours by sending notification packet mutually, and obtains the link-state information of directly-connected neighbor router node, and sets up routing table according to described directly-connected neighbor router node link-state information.
11, the method for the route in a kind of hierarchy sequential address HSAPN network is characterized in that, comprising:
The current router node receives the service message that needs forwarding, and the HSAPN address that obtains the purpose router node from described service message;
Whether the HSAPN address of judging described purpose router node is identical with the HSAPN address of described current router node,
If, then finish the route of described data message,
If not, carry out route to described next jumping directly-connected neighbor router node.
12, the method for route in the HSAPN network as claimed in claim 11 is characterized in that, and is if not described, carries out route to described next jumping directly-connected neighbor router node, is specially:
If the HSAPN address of described purpose router node is different with 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 of downlink port route, if not, then with described data message from uplink port make progress level-1 router node route or according to priority level in the route at the same level when the router node of prime place.
13, the method for the route in the HSAPN network as claimed in claim 12 is characterized in that, described if, then with described data message from the downward level-1 router node of downlink port route, 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 has only unique downlink port, if, then from the downward level-1 router node of unique downlink port route, if not, then compare with the HSAPN address of each downlink port of current router node in next stage HSAPN address, from the identical downward level-1 router node of the pairing downlink port in the HSAPN address route of comparison result value with destination address.
14, the method for the route in the HSAPN network as claimed in claim 12, it is characterized in that, if not described, then with described data message from uplink port make progress level-1 router node route or according to priority level in the route at the same level when the router node of prime place, be specially:
If described purpose router node is different with the HSAPN address of described current router node in the HSAPN address when prime, whether the HSAPN address of further judging described purpose router node is identical in the HSAPN address of the upper level of working as prime with the HSAPN address of described current router node, if, described data message is transmitted in the peer in the router node of prime place according to the potential energy grade, if not, then transmit from the uplink port of the described current router node level-1 router node that makes progress.
15, the router in a kind of hierarchy sequential address HSAPN network is characterized in that, comprising:
Receiving element in order to receive the notification packet that the directly-connected neighbor router node sends, carries the link-state information of the router node that sends this message in this notification packet;
Routing table is set up and memory cell: the link-state information of the directly-connected neighbor router node that receives according to described receiving element is set up routing table, and stores this route;
Selected cell in order to according to routing rule and described routing table, is determined next jumping directly-connected neighbor router node, and carries out route to described next jumping directly-connected neighbor router node.
16, the router in the HSAPN network as claimed in claim 15 is characterized in that described router also comprises:
The notification packet generation unit is used to generate 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 notification packet or the data message that the directly-connected neighbor router node sends, and obtains directly-connected neighbor node routing device chain circuit state information, the HSAPN address that obtains the purpose router node from data message from notification packet.
17, the router in the HSAPN network as claimed in claim 15, it is characterized in that described router also comprises: judging unit, described judging unit comprise first judging unit, second judging unit, the 3rd judging unit and the 4th judging unit, wherein,
Described 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 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.
18, the router in the HSAPN network as claimed in claim 15 is characterized in that, described selected cell comprises first selected cell, second selected cell, the 3rd selected cell and the 4th selected cell, wherein,
Described first selected cell is enabled second judging unit in order to be not as the described first judgment unit judges result;
Described second selected cell selects to enable the 3rd judging unit or the 4th judging unit in order to the judged result according to 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 for not the time, select from the uplink port of the described current router level-1 router node route that makes progress;
Described the 4th selected cell in order to when the 4th judgment unit judges for not the time, select working as the identical downward level-1 router node of the downlink port route in prime next stage HSAPN address with described purpose router node.
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 true CN101686188A (en) 2010-03-31
CN101686188B 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)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103078798A (en) * 2012-12-28 2013-05-01 华为技术有限公司 Method and equipment for establishing route table
CN103491509A (en) * 2013-09-29 2014-01-01 北京天公瑞丰科技有限公司 Micro-power wireless communication node and micro-power wireless communication network
CN103746852A (en) * 2014-01-21 2014-04-23 华为技术有限公司 Service routing configuration method and network management equipment
WO2015192483A1 (en) * 2014-06-18 2015-12-23 深圳市中兴微电子技术有限公司 Routing node, route exchanging method and system, and computer storage medium
CN106341862A (en) * 2015-07-07 2017-01-18 联发科技股份有限公司 Method and device for sharing a service among multiple devices
CN109379258A (en) * 2018-09-13 2019-02-22 悦动奇点(北京)健康科技有限公司 A kind of communication means applied to body-building somatosensory device, apparatus and system
CN110573974A (en) * 2017-04-27 2019-12-13 恩德莱斯和豪瑟尔过程解决方案股份公司 Device, field bus access unit and method for monitoring an automation system
CN115550244A (en) * 2022-09-21 2022-12-30 中国电子科技集团公司第二十八研究所 Method for forwarding instruction messages among multiple data chains

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1477884A (en) * 2002-08-20 2004-02-25 �廪��ѧ Hiearchical moving data packet communication network and its communication method
CN101026559A (en) * 2007-01-23 2007-08-29 华为技术有限公司 Communication establishing method and router

Family Cites Families (4)

* 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
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
CN100366032C (en) * 2005-10-14 2008-01-30 清华大学 Layered mobile multicasting method based on fast multicasting switching
CN101227412B (en) * 2008-02-05 2010-09-29 华为技术有限公司 Apparatus and method for message conversion

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1477884A (en) * 2002-08-20 2004-02-25 �廪��ѧ Hiearchical moving data packet communication network and its communication method
CN101026559A (en) * 2007-01-23 2007-08-29 华为技术有限公司 Communication establishing method and router

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
吴伟民: "《动态路由选择协议OSPF的原理及应用》", 《国土资源信息化》 *

Cited By (14)

* 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
CN103078798A (en) * 2012-12-28 2013-05-01 华为技术有限公司 Method and equipment for establishing route 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
CN103491509A (en) * 2013-09-29 2014-01-01 北京天公瑞丰科技有限公司 Micro-power wireless communication node and micro-power wireless communication network
CN103746852A (en) * 2014-01-21 2014-04-23 华为技术有限公司 Service routing configuration method and network management equipment
CN103746852B (en) * 2014-01-21 2017-04-19 华为技术有限公司 Service routing configuration method and network management equipment
WO2015192483A1 (en) * 2014-06-18 2015-12-23 深圳市中兴微电子技术有限公司 Routing node, route exchanging method and system, and computer storage medium
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 a service among multiple devices
CN110573974A (en) * 2017-04-27 2019-12-13 恩德莱斯和豪瑟尔过程解决方案股份公司 Device, field bus access unit and method for monitoring an automation system
CN109379258A (en) * 2018-09-13 2019-02-22 悦动奇点(北京)健康科技有限公司 A kind of communication means applied to body-building somatosensory device, apparatus and system
CN109379258B (en) * 2018-09-13 2020-11-20 悦动奇点(北京)健康科技有限公司 Communication method, device and system applied to fitness somatosensory equipment
CN115550244A (en) * 2022-09-21 2022-12-30 中国电子科技集团公司第二十八研究所 Method for forwarding instruction messages among multiple data chains
CN115550244B (en) * 2022-09-21 2023-11-17 中国电子科技集团公司第二十八研究所 Method for forwarding instruction message among multiple data chains

Also Published As

Publication number Publication date
WO2010037291A1 (en) 2010-04-08
CN101686188B (en) 2013-01-09

Similar Documents

Publication Publication Date Title
CN101686188B (en) Method for establishing route table, routing method and router in hierarchy sequential address packet network
CN102055665B (en) OSPF point-to-multipoint over broadcast or NBMA mode
US8130656B2 (en) Method and device for routing mesh network traffic
CN101600156B (en) Auto-allocation method of addresses of mobile ad hoc networks
US20090028169A1 (en) Method and device for routing mesh network traffic
CN104283789B (en) Route convergent method and system
US20070291663A1 (en) Method and apparatus for scale-free topology generation in relay based wireless networks
US8023435B2 (en) Distribution scheme for distributing information in a network
CN102971988A (en) Alternate down paths for directed acyclic graph (DAG) routing
CN112953834A (en) Network area division method, network equipment and system
KR101457317B1 (en) Prioritization of routing information updates
CN105791169A (en) Switch transmission control method, switch transmitting method and related equipment in SDN (Software Defined Network)
CN104980347A (en) Tunnel establishing method and tunnel establishing device
CN101159695A (en) Link selecting method and apparatus
CN101453413A (en) Method and apparatus for automatic topology discovery and resource management in PBB network
CN113242179B (en) SDN-based SR path calculation and label stack generation method and SDN controller
CN101483591B (en) Route implementing method and route generating apparatus
CN104811378A (en) Route isolation and synchronization method
WO2010053348A2 (en) Cooperative relaying data method and system for wireless mesh network
CN104320346B (en) A kind of status information dissemination method and device
KR101204518B1 (en) Method and Apparatus for optimal routing in wireless mesh network
So et al. Load-balancing routing in multichannel hybrid wireless networks with single network interface
CN107819726A (en) IS IS protocol interfaces identify the method, apparatus and system of effective use
CN105591940B (en) TRILL network distribution tree selection method and TRILL network node
Nguyen et al. Implementation and performance evaluation of a quality of service support for OLSR in a real MANET

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