CN113938427A - Communication method and system, and routing node - Google Patents
Communication method and system, and routing node Download PDFInfo
- Publication number
- CN113938427A CN113938427A CN202010653880.8A CN202010653880A CN113938427A CN 113938427 A CN113938427 A CN 113938427A CN 202010653880 A CN202010653880 A CN 202010653880A CN 113938427 A CN113938427 A CN 113938427A
- Authority
- CN
- China
- Prior art keywords
- node
- level
- routing node
- neighbor
- interface
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
Abstract
The present disclosure provides a communication method, a communication system and a routing node, and relates to the technical field of communication, wherein the method comprises the following steps: the method comprises the steps that a routing node sends a first request message for acquiring an IPv6 address prefix of a second interface of the routing node to an upper-level routing node through a first interface, and the routing node is in communication connection with a lower-level node through the second interface; the routing node receives a response message returned by the upper-level routing node, wherein the response message does not carry the IPv6 address prefix of the second interface; and in response to a second request message for acquiring the IPv6 address prefix, sent by the next-level node, the routing node sends the IPv6 address prefix of the first interface to the next-level node through the second interface.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a communication method and system, and a routing node.
Background
At present, for IPv6 address acquisition, a Point-to-Point Protocol Over Ethernet (PPPoE) dialing mode is mostly adopted. The IPv6 Address can be configured using SLAAC (Stateless Address Auto Configuration, Stateless Address Auto Configuration Protocol) and DHCPv6(IPv6 Dynamic Host Configuration Protocol ).
For the deployment and management of the IPv6 address pool, two address pools are configured on a BRAS (Broadband Remote Access Server), one is an ND address pool configured by using SLAAC, and the other is a PD address pool configured by using DHCPv 6.
Disclosure of Invention
According to an aspect of the embodiments of the present disclosure, there is provided a communication method, including: a routing node sends a first request message for acquiring an IPv6 address prefix of a second interface of the routing node to an upper-level routing node through a first interface, and the routing node is in communication connection with a lower-level node through the second interface; the routing node receives a response message returned by the upper-level routing node, wherein the response message does not carry the IPv6 address prefix of the second interface; and responding to a second request message for acquiring the IPv6 address prefix sent by the next-level node, and sending the IPv6 address prefix of the first interface to the next-level node through the second interface by the routing node.
In some embodiments, the communication method further includes: the routing nodes comprise a first proxy node and a second proxy node, the first proxy node and the previous routing node are located in the same network segment, the second proxy node and the next routing node are located in the same network segment, and the previous routing node and the next routing node are located in different network segments.
In some embodiments, the communication method further includes: the second proxy node receives and stores a neighbor solicitation message sent by the next-level node, wherein the neighbor solicitation message carries a target address and a first source link layer address of the previous-level routing node, and the first source link layer address comprises a link layer address of the next-level node; the second agent node broadcasts the neighbor request message; the first proxy node receives and stores the neighbor request message; the first proxy node replaces the link layer address of the next level node in the first source link layer address with the link layer address of the first proxy node; and after the replacement, the first proxy node sends the neighbor solicitation message to an upper-level routing node.
In some embodiments, the communication method further includes: the first proxy node receives and stores a neighbor response message sent by the upper-level routing node in response to the neighbor solicitation message, wherein the neighbor response message carries a second source link layer address, and the second source link layer address comprises a link layer address of the upper-level routing node; the first proxy node forwards the neighbor response message to the second proxy node; the second proxy node receives and stores the neighbor response message; the second proxy node replaces the link layer address of the upper level routing node in the second source link layer address with the link layer address of the second proxy node; and after the replacement, the second proxy node sends the neighbor response message to the next-level node.
In some embodiments, the communication method further includes: and after receiving the neighbor request message, the second proxy node creates a first neighbor entry corresponding to the next-level node, wherein the neighbor state of the first neighbor entry is a reachable state.
In some embodiments, the communication method further includes: after receiving the neighbor request message, the first proxy node creates a second neighbor entry corresponding to the upper-level routing node, wherein the neighbor state of the second neighbor entry is an incomplete state; and after receiving the neighbor response message, the first proxy node changes the neighbor state of the second neighbor entry into an reachable state.
According to another aspect of the embodiments of the present disclosure, there is provided a routing node, including: the first sending module is configured to send a first request message for acquiring an IPv6 address prefix of a second interface of a routing node to a previous-level routing node through a first interface, and is in communication connection with a next-level node through the second interface; a receiving module, configured to receive a response message returned by the upper-level routing node, where the response message does not carry an IPv6 address prefix of the second interface; and a second sending module, configured to send, to the next-level node through the second interface, the IPv6 address prefix of the first interface in response to a second request message sent by the next-level node to obtain the IPv6 address prefix.
According to another aspect of the embodiments of the present disclosure, there is provided a routing node, including: a memory; a processor coupled to the memory, the processor configured to perform the method of any of the above embodiments based on instructions stored in the memory.
According to still another aspect of the embodiments of the present disclosure, there is provided a communication system including: the routing node according to any one of the above embodiments; the upper-level routing node is configured to respond to the first request message sent by the routing node and send a response message which does not carry the IPv6 address prefix of the second interface; and the next-level node is configured to receive the IPv6 address prefix of the first interface sent by the routing node and generate the IPv6 address of the next-level node according to the IPv6 address prefix of the first interface.
According to a further aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon computer program instructions, wherein the instructions, when executed by a processor, implement the method according to any one of the embodiments described above.
In the embodiment of the present disclosure, a routing node sends, to an upper-level routing node through a first interface, a first request message for acquiring an IPv6 address prefix of a second interface of the routing node. And the routing node receives a response message returned by the upper-level routing node. The response message does not carry the IPv6 address prefix of the second interface. And in response to a second request message for acquiring the IPv6 address prefix, sent by the next-level node, the routing node sends the IPv6 address prefix of the first interface to the next-level node through the second interface. Therefore, under the networking mode of the second-level route, the next-level node under the route node can acquire the IPv6 address prefix.
The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1, 2A and 2B are diagrams schematically illustrating a communication method in the related art;
fig. 3 is a flow diagram of a communication method according to some embodiments of the present disclosure;
fig. 4 is a schematic diagram of a communication method according to some embodiments of the present disclosure;
FIG. 5 is a flow diagram of a communication method according to further embodiments of the present disclosure;
FIG. 6 is a flow diagram of a communication method according to further embodiments of the present disclosure;
FIG. 7 is a schematic diagram of a communication method according to further embodiments of the present disclosure;
8A-8C are schematic diagrams of communication methods according to still further embodiments of the present disclosure;
FIG. 9 is a schematic structural diagram of a routing node according to some embodiments of the present disclosure;
FIG. 10 is a schematic structural diagram of a routing node according to further embodiments of the present disclosure;
FIG. 11 is a schematic structural diagram of a routing node according to further embodiments of the present disclosure;
fig. 12 is a schematic structural diagram of a communication system according to some embodiments of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
The relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
The inventor finds that the home gateway in the bridge mode cannot configure an IP address, and can transparently transmit a protocol packet, such as an ND (Neighbor Discovery) protocol packet or a DHCPv6 protocol packet. The BRAS may directly allocate an IPv6 address prefix to the terminal by using an SLAAC allocation manner, and may directly allocate DNS (Domain Name System) information to the terminal by using a DHCPv6 allocation manner. This is similar to a terminal being directly connected to a BRAS. For example, in the case that the home gateway in the bridge mode can pass through the protocol message, the BRAS can directly allocate the IPv6 address prefix 240e:398:100: c2b0/64 to the terminal, as shown in fig. 1. The IPv6 address is composed of a 64-bit prefix and a 64-bit interface identifier. The 64-bit interface Identifier may be determined according to a MAC (Media Access Control) address EUI-64(64-bit Extended Unique Identifier) rule.
For the networking mode of the first-level routing, in some implementations, as shown in fig. 2A, the BRAS may allocate an address to the home gateway in the routing mode, and the home gateway in the routing mode may allocate an address to the terminal. For example, BRAS can distribute IPv6 address prefix 240e:398:100: e2f4/64 to WAN port of the home gateway by SLAAC distribution mode, can distribute IPv6 address prefix 240e:398:180: d120/60 to LAN1 port of the home gateway by DHCPv6 distribution mode, and can distribute IPv6 address prefix 240e:398:180:1db0/60 to LAN2 port of the home gateway by DHCPv6 distribution mode. Thus, for a router with two broadband service interfaces, an IPv6 address prefix can be obtained respectively. Next, the home gateway may assign an IPv6 address prefix 240e:398:180: d120/64 to the terminal 1 connected to the LAN1 port, and may assign an IPv6 address prefix 240e:398:180:1db0/64 to the terminal 2 connected to the LAN2 port. Under the condition of not sending DNS information to the terminal user, the home gateway needs to start a DNS proxy function. In other implementation manners, as shown in fig. 2B, the routing function of the home gateway may be extracted and assumed by the router, and the home gateway is only responsible for transparent transmission of the protocol packet. The IPv6 address allocation mechanism of this implementation is similar to the scenario of the home gateway direct connection terminal in the above-described routing mode.
After exploration, under the networking mode of the first-level route, the terminal can normally acquire the IPv6 address prefix. And in the networking mode of the second-level routing, for example, in the case that the router and the home gateway in fig. 2B are both set to the routing mode, the terminal cannot acquire the IPv6 address prefix.
Aiming at the problem that the terminal cannot acquire the IPv6 address prefix in the secondary routing mode, the present disclosure proposes a corresponding solution, which is described below with reference to a specific embodiment.
Fig. 3 is a flow diagram of a communication method according to some embodiments of the present disclosure.
As shown in fig. 3, the communication method of the present embodiment includes the following steps 302 to 306.
In step 302, the routing node sends a first request message for acquiring the IPv6 address prefix of the second interface of the routing node to the upper-level routing node through the first interface, and the routing node is communicatively connected to the lower-level node through the second interface. Here, the routing node and the upper level routing node may be any devices having a routing function. The next level node may be any device that communicates with the routing node.
In some embodiments, the routing node may be a router, the first interface of the routing node is a WAN (Wide Area Network) port of the router, and the second interface of the routing node is a LAN (Local Area Network) port of the router. The upper level routing node may be a routing type home gateway, that is, a home gateway having a routing function. The next level node may be a terminal, such as a subscriber host; or a routing node. For example, a router sends a request message to a routing type home gateway through its WAN port to obtain the IPv6 address prefix of the router's LAN port. The router may be connected to the next level node through its LAN port.
In step 304, the routing node receives a response message returned by the upper-level routing node, wherein the response message does not carry the IPv6 address prefix of the second interface.
For example, in the case where the upper level routing node and the routing node are both in the routing mode, the upper level routing node cannot allocate an IPv6 address prefix to the second interface of the routing node. That is, in the second-level routing mode, the response message sent by the upper-level routing node to the routing node does not carry the IPv6 address prefix of the second interface.
In step 306, in response to the second request message sent by the next node to obtain the IPv6 address prefix, the routing node sends the IPv6 address prefix of the first interface to the next node through the second interface. The next level node may generate an IPv6 address for the next level node from the IPv6 address prefix for the first interface.
For example, the terminal sends a second request message for acquiring the IPv6 address prefix, where the second request message may be an RS (Router Solicitation) message. The router sends the IPv6 address prefix of the WAN port to the terminal through the LAN port. The terminal can generate the IPv6 address of the terminal according to the IPv6 address prefix of the WAN port.
By using the method of the embodiment, in the second-level routing mode, the IPv6 address prefix acquisition of the next-level node can be realized.
Fig. 4 is a schematic diagram of a communication method according to some embodiments of the present disclosure.
Next, a communication method will be described with reference to fig. 4 by taking an example in which the upper-level routing node is a home gateway in the routing mode, the routing node is a router in the routing mode, and the lower-level node is a terminal.
First, the BRAS may allocate an IPv6 address prefix 240e:398:100:8e0e/64 to a WAN port of the home gateway using an ND address pool (e.g., 240e:398:100/48), and may allocate an IPv6 address prefix 240e:398:180: ef00/60 to a LAN port of the home gateway using a PD address pool (e.g., 240e:398: 180/44).
Next, the home gateway can assign IPv6 address prefixes 240e:398:180: ef08/64 to the router's WAN port. But in case no address pool can allocate IPv6 address prefix for the router's LAN port, the home gateway will send a response message not carrying IPv6 address prefix of the router's LAN port in response to the router's request message.
Next, in the case where the terminal sends a request message to the router to acquire the IPv6 address prefix, the router sends the IPv6 address prefix of the WAN port to the terminal through the LAN port. For example, in the case that the WAN port receives that the DHCPv6 broadcast message sent by the home gateway is in No Prefix Avail (No available Prefix) state, the router may send a message carrying a PIO (Prefix Information Option) message to its LAN port by using the Bridge port. The PIO message includes the IPv6 address prefix for the router's WAN port. Thus, after the LAN port of the router normally acquires the IPv6 address prefix, the terminal can acquire the IPv6 address prefix 240e:398:180: ef08/64 through the LAN port of the router.
In the above embodiment, the routing node sends the first request message to the upper-level routing node through the first interface to obtain the IPv6 address prefix of the second interface of the routing node. And the routing node receives a response message returned by the upper-level routing node. The response message does not carry the IPv6 address prefix of the second interface. And in response to a second request message for acquiring the IPv6 address prefix, sent by the next-level node, the routing node sends the IPv6 address prefix of the first interface to the next-level node through the second interface. Therefore, under the networking mode of the second-level route, the next-level node under the route node can still acquire the IPv6 address prefix.
In the above embodiment, after the routing node passes through the new processing program, the routing node may implement the packet interaction between the first interface and the second interface, so that the next-level node may obtain the IPv6 address prefix through the first interface.
For the networking mode of the second-level route, the next-level node and the routing node can share the same IPv6 address prefix through the network link established by the routing node. For example, after the next-level node acquires the IPv6 address by the above method, the IPv6 address prefixes of the next-level node, the first interface, and the second interface of the routing node are all the same as the IPv6 address prefix of the LAN port of the previous-level routing node. A network having this networking mode may be defined herein as a multilink subnet.
Fig. 5 is a flow diagram of a communication method according to further embodiments of the present disclosure.
In some embodiments, after the next-level node acquires the IPv6 address by using the method of the foregoing embodiments, since the IPv6 address of the next-level node and the IPv6 address of the first interface of the routing node have the same address prefix and are not on the same physical network segment, the next-level node and the previous-level routing node cannot communicate with each other. To address this problem, embodiments of the present disclosure also provide the following solutions.
The routing nodes include a first proxy node and a second proxy node. The first proxy node and the upper level routing node are located in the same network segment, namely the first proxy node can be in communication connection with the upper level routing node. The second proxy node and the next level node are in the same network segment, namely the second proxy node can be in communication connection with the next level node. Therefore, under the condition that the upper-level routing node and the lower-level routing node are positioned in different network segments, the communication between the upper-level routing node and the lower-level routing node can be realized through the proxy node arranged by the routing node. The following explanation is made with reference to fig. 5 to 8C.
Referring to fig. 5, the above communication method further includes steps 502 to 510.
In step 502, the second proxy node receives and stores a Neighbor Solicitation (NS) message sent by the next node, where the Neighbor Solicitation message carries a destination address of the previous node (e.g., an IPv6 address of the previous node) and a first source link-layer address, and the first source link-layer address includes a link-layer address of the next node.
In some embodiments, after receiving the neighbor solicitation message, the second proxy node may create a first neighbor entry corresponding to the next node, so as to establish a communication connection with the next node subsequently. Here, the neighbor state of the first neighbor entry is the reachable state.
At step 504, the second proxy node broadcasts a neighbor solicitation message. For example, the second proxy node may forward the neighbor solicitation message to any other proxy node.
At step 506, the first proxy node receives and stores the neighbor solicitation message.
In some embodiments, after receiving the neighbor solicitation packet, the first proxy node may create a second neighbor entry corresponding to the previous routing node, so as to establish a communication connection with the previous routing node subsequently. Here, the neighbor state of the second neighbor entry is an incomplete state.
At step 508, the first proxy node replaces the link-layer address of the next level node in the first source link-layer address with the link-layer address of the first proxy node.
At step 510, after the replacement, the first proxy node sends a neighbor solicitation message to the upper level routing node.
In the method of the above embodiment, the next-level node may implement sending the neighbor solicitation message to the previous-level routing node through the relay of the proxy node in the routing node.
Fig. 6 is a flow diagram of a communication method according to further embodiments of the present disclosure.
In some embodiments, the above communication method further includes steps 602 to 610.
In step 602, the first proxy node receives and stores a neighbor response message sent by the previous routing node in response to the neighbor solicitation message, where the neighbor response message carries a second source link layer address, where the second source link layer address includes a link layer address of the previous routing node.
After receiving the neighbor solicitation message, the upper-level routing node judges whether the target address in the neighbor solicitation message is consistent with the address of the upper-level routing node; and if the two messages are consistent, sending a neighbor response message.
In some embodiments, after receiving the neighbor response packet, the first proxy node changes the neighbor state of the second neighbor entry from the incomplete state to the reachable state, so as to subsequently communicate with the previous-level routing node.
At step 604, the first proxy node forwards the neighbor response message to the second proxy node.
At step 606, the second proxy node receives and stores the neighbor response message.
At step 608, the second proxy node replaces the link-layer address of the upper level routing node in the second source link-layer address with the link-layer address of the second proxy node.
At step 610, after the replacement, the second proxy node sends a neighbor response message to the next level node.
In the method of the above embodiment, the previous routing node may implement sending the neighbor response packet to the next routing node through the relay of the proxy node in the routing node.
Fig. 7 is a schematic diagram of a communication method according to further embodiments of the present disclosure.
In the networking mode of the second-level routing, that is, in the multilink subnet, the next-level node and the previous-level routing node communicate the ND (Neighbor Discovery) protocol packet or transmit the data packet, which is described below with reference to fig. 7.
As shown in FIG. 7, a next level node may have a link layer address a, a previous level routing node may have a link layer address b, a first proxy node of the routing nodes may have a link layer address p1, and a second proxy node of the routing nodes may have a link layer address p 2.
Firstly, the next-level node sends a neighbor solicitation message to the previous-level routing node in a multicast mode. The first source link layer address portion field in the neighbor solicitation message includes the link layer address of the next level node.
And then, the second proxy node receives a neighbor request message sent by the next-level node to the previous-level routing node, and stores the information in the neighbor request message. The second proxy node may create a first neighbor entry corresponding to the next level node, wherein the state of the first neighbor entry is a reachable state.
And then, the second proxy node sends a neighbor solicitation message to any other proxy interface of the routing node in a broadcasting mode.
Next, the first proxy node receives the neighbor solicitation message and stores the information in the neighbor solicitation message. The first proxy node may create a second neighbor entry to facilitate subsequent establishment of a communication connection with a superior routing node. The state of the second neighbor entry is an incomplete state. Before sending the neighbor solicitation message, the first proxy node will determine whether the message being sent needs to be proxied or not according to the relevant fields in the message, and may replace the Link Layer Address of the next-level node in the first SLLA (Source Link-Layer Address) part field of the neighbor solicitation message with the Link Layer Address p1 of the first proxy node of the routing node. The subsequent first proxy node can forward the neighbor solicitation message to other nodes of the multilink subnet where the first proxy node is located by using a multicast mode.
Next, the previous-level routing node receives the neighbor request message sent by the first proxy node, and sends a neighbor response message carrying the link layer address of the previous-level routing node to the next-level node. The upper-level routing node can also create a third neighbor entry corresponding to the second proxy node of the routing node and a fourth neighbor entry corresponding to the lower-level node, wherein the states of the third neighbor entry and the fourth neighbor entry are reachable states. For example, in response to the Neighbor solicitation message, the upper routing node transmits an NA (Neighbor advertisement) message to the first proxy node using the third Neighbor entry, wherein the NA message carries the link layer address b of the upper routing node.
Next, the first proxy node receives the neighbor response message and stores the information in the neighbor response message, and can update the state of the second neighbor entry to the reachable state. The first proxy node sends the neighbor response message to the second proxy node in a unicast mode. The second agent node stores the information in the neighbor response message. Before sending the neighbor response message, the second proxy node may determine whether the message to be sent needs to be proxied according to the relevant field in the message, and may replace the link-layer address of the upper-level routing node in the second SLLA part field of the neighbor response message with the link-layer address p2 of the second proxy node.
Next, the next-level node receives the neighbor response message sent by the second proxy node, and stores the information in the neighbor response message. The next-level node may create a fifth neighbor entry corresponding to the previous-level routing node and a sixth neighbor entry corresponding to the second proxy node, where states of the fifth neighbor entry and the sixth neighbor entry are reachable states.
In the method of the above embodiment, address resolution of the ND protocol may be implemented between a next-level node and a previous-level routing node through relaying of a proxy node in the routing node. On the basis of the method of the above embodiment, communication of other ND protocol messages and transmission of data packets may also be implemented, and a description thereof is not repeated here.
Fig. 8A-8C are schematic diagrams of communication methods according to still further embodiments of the present disclosure. As shown in fig. 8A, communication of an RA (Router Advertisement) message may be implemented between a lower-level node and an upper-level routing node. As shown in fig. 8B, NS packet communication can be implemented between the next-level node and the previous-level routing node. As shown in fig. 8C, the transmission of the data packet may be implemented between the next-level node and the previous-level routing node.
Under the networking mode of the second-level route, the bidirectional route inter-access between the next-level node and the previous-level routing node can be realized, the problem of communication between the next-level node and the previous-level routing node under the networking mode of the second-level route is solved, and the interconnection and intercommunication between the next-level node and the external node under the routing node can be further realized.
In some embodiments, the next level node may verify the uniqueness of the IPv6 temporary address by sending an NS message. And if the next-stage node still does not receive the DAD Detection NS message after the DAD (Duplicate Address Detection) timer is overtime, determining that the IPv6 Address is unique and using the IPv6 Address for initialization.
Fig. 9 is a schematic structural diagram of a routing node according to some embodiments of the present disclosure.
As shown in fig. 9, the routing node in this embodiment includes a first sending module 901, a receiving module 902, and a second sending module 903.
The first sending module 901 is configured to send, to the upper-level routing node through the first interface, a first request message for obtaining the IPv6 address prefix of the second interface of the routing node, which is communicatively connected to the lower-level node through the second interface.
The receiving module 902 is configured to receive a response message returned by the upper-level routing node. The response message does not carry the IPv6 address prefix for the second interface.
The second sending module 903 is configured to send the IPv6 address prefix of the first interface to the next node through the second interface in response to a second request message sent by the next node to obtain the IPv6 address prefix.
Thus, in the networking mode of the second-level route, by using the routing node in the above embodiment, the next-level node under the routing node can obtain the IPv6 address prefix.
In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts in the embodiments are referred to each other. For the embodiment of the routing node, since it basically corresponds to the embodiment of the method, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the embodiment of the method.
Fig. 10 is a schematic structural diagram of a routing node according to further embodiments of the present disclosure. As shown in fig. 10, the routing node of this embodiment comprises a memory 1001 and a processor 1002 coupled to the memory 1001, the processor 1002 being configured to execute the method of any of the previous embodiments based on instructions stored in the memory 1001.
Fig. 11 is a schematic structural diagram of a routing node according to further embodiments of the present disclosure.
As shown in fig. 11, the routing node of this embodiment comprises a memory 1101 and a processor 1102 coupled to the memory 1101, the processor 1102 being configured to perform the method of any one of the preceding embodiments based on instructions stored in the memory 1101.
The memory 1101 may include, for example, a system memory, fixed non-volatile storage media, and the like. The system memory may store, for example, an operating system, application programs, a Boot Loader (Boot Loader), and other programs.
Routing node may also include input output interface 1103, network interface 1104, storage interface 1105, and the like. The interfaces 1103, 1104, 1105 and the memory 1101 and the processor 1102 may be connected by a bus 1106, for example. The input/output interface 1103 provides a connection interface for input/output devices such as a display, a mouse, a keyboard, and a touch screen. The network interface 1104 provides a connection interface for various networking devices. The storage interface 1105 provides a connection interface for external storage devices such as an SD card and a usb disk.
Fig. 12 is a schematic structural diagram of a communication system according to some embodiments of the present disclosure.
As shown in fig. 12, the communication system in this embodiment includes a routing node 1201, a higher-level routing node 1202, and a lower-level node 1203. The routing node 1201 may be a routing node in any of the embodiments described above.
In some embodiments, upper level routing node 1202 is configured to send, in response to the first request message sent by routing node 1201, a response message that does not carry the IPv6 address prefix of the second interface. The next level node 1203 is configured to receive the IPv6 address prefix of the first interface sent by the routing node 1201, and generate an IPv6 address of the next level node 1203 according to the IPv6 address prefix of the first interface.
With the communication system in the above embodiment, in the networking mode of the second-level route, the next-level node under the route node may acquire the IPv6 address.
The disclosed embodiments also provide a computer-readable storage medium having stored thereon computer program instructions, which when executed by a processor, implement the method of any of the above embodiments.
Thus, various embodiments of the present disclosure have been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that the functions specified in one or more of the flows in the flowcharts and/or one or more of the blocks in the block diagrams can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the foregoing examples are for purposes of illustration only and are not intended to limit the scope of the present disclosure. It will be understood by those skilled in the art that various changes may be made in the above embodiments or equivalents may be substituted for elements thereof without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.
Claims (10)
1. A method of communication, comprising:
a routing node sends a first request message for acquiring an IPv6 address prefix of a second interface of the routing node to an upper-level routing node through a first interface, and the routing node is in communication connection with a lower-level node through the second interface;
the routing node receives a response message returned by the upper-level routing node, wherein the response message does not carry the IPv6 address prefix of the second interface;
and responding to a second request message for acquiring the IPv6 address prefix sent by the next-level node, and sending the IPv6 address prefix of the first interface to the next-level node through the second interface by the routing node.
2. The method of claim 1, wherein the routing nodes comprise a first proxy node and a second proxy node, the first proxy node being located in the same network segment as the previous routing node, the second proxy node being located in the same network segment as the next routing node, the previous routing node being located in a different network segment than the next routing node.
3. The method of claim 2, further comprising:
the second proxy node receives and stores a neighbor solicitation message sent by the next-level node, wherein the neighbor solicitation message carries a target address and a first source link layer address of the previous-level routing node, and the first source link layer address comprises a link layer address of the next-level node;
the second agent node broadcasts the neighbor request message;
the first proxy node receives and stores the neighbor request message;
the first proxy node replaces the link layer address of the next level node in the first source link layer address with the link layer address of the first proxy node; and
and after the replacement, the first proxy node sends the neighbor solicitation message to an upper-level routing node.
4. The method of claim 3, further comprising:
the first proxy node receives and stores a neighbor response message sent by the upper-level routing node in response to the neighbor solicitation message, wherein the neighbor response message carries a second source link layer address, and the second source link layer address comprises a link layer address of the upper-level routing node;
the first proxy node forwards the neighbor response message to the second proxy node;
the second proxy node receives and stores the neighbor response message;
the second proxy node replaces the link layer address of the upper level routing node in the second source link layer address with the link layer address of the second proxy node; and
and after the replacement, the second proxy node sends the neighbor response message to the next-level node.
5. The method of claim 3, further comprising:
and after receiving the neighbor request message, the second proxy node creates a first neighbor entry corresponding to the next-level node, wherein the neighbor state of the first neighbor entry is a reachable state.
6. The method of claim 4, further comprising:
after receiving the neighbor request message, the first proxy node creates a second neighbor entry corresponding to the upper-level routing node, wherein the neighbor state of the second neighbor entry is an incomplete state; and
and after receiving the neighbor response message, the first proxy node changes the neighbor state of the second neighbor entry into an reachable state.
7. A routing node, comprising:
the first sending module is configured to send a first request message for acquiring an IPv6 address prefix of a second interface of a routing node to a previous-level routing node through a first interface, and is in communication connection with a next-level node through the second interface;
a receiving module, configured to receive a response message returned by the upper-level routing node, where the response message does not carry an IPv6 address prefix of the second interface; and
a second sending module, configured to send, to the next-level node through the second interface, the IPv6 address prefix of the first interface in response to a second request message sent by the next-level node to obtain the IPv6 address prefix.
8. A routing node, comprising:
a memory;
a processor coupled to the memory, the processor configured to perform the method of any of claims 1-6 based on instructions stored in the memory.
9. A communication system, comprising:
a routing node according to any of claims 7-8;
the upper-level routing node is configured to respond to the first request message sent by the routing node and send a response message which does not carry the IPv6 address prefix of the second interface;
and the next-level node is configured to receive the IPv6 address prefix of the first interface sent by the routing node and generate the IPv6 address of the next-level node according to the IPv6 address prefix of the first interface.
10. A computer readable storage medium having computer program instructions stored thereon, wherein the instructions, when executed by a processor, implement the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010653880.8A CN113938427A (en) | 2020-07-08 | 2020-07-08 | Communication method and system, and routing node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010653880.8A CN113938427A (en) | 2020-07-08 | 2020-07-08 | Communication method and system, and routing node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113938427A true CN113938427A (en) | 2022-01-14 |
Family
ID=79273449
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010653880.8A Pending CN113938427A (en) | 2020-07-08 | 2020-07-08 | Communication method and system, and routing node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113938427A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115426334A (en) * | 2022-08-26 | 2022-12-02 | Oppo广东移动通信有限公司 | Network address generation method and device, routing equipment and storage medium |
| WO2024001549A1 (en) * | 2022-07-01 | 2024-01-04 | 荣耀终端有限公司 | Address configuration method and electronic device |
| WO2024037198A1 (en) * | 2022-08-19 | 2024-02-22 | 华为技术有限公司 | Routing method for home network, and access device and medium |
| CN115426334B (en) * | 2022-08-26 | 2024-05-03 | Oppo广东移动通信有限公司 | Network address generation method, device, routing equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007009367A1 (en) * | 2005-07-19 | 2007-01-25 | Alcatel | A method for duplicate address detection in the two-layer access network supporting ipv6 and a system thereof |
| US20080263353A1 (en) * | 2007-04-23 | 2008-10-23 | Ralph Edward Droms | Autoconfigured prefix delegation based on distributed hash |
| CN101663878A (en) * | 2007-04-23 | 2010-03-03 | 思科技术公司 | Extensions to ipv6 neighbor discovery protocol for automated prefix delegation |
| CN102340452A (en) * | 2011-10-14 | 2012-02-01 | 中兴通讯股份有限公司 | Single-Internet protocol version 6 (IPv6)-address-prefix-based routing transmission method and wireless equipment |
| CN102413033A (en) * | 2010-09-26 | 2012-04-11 | 华为技术有限公司 | Method, device and system for realizing route aggregation |
| CN104782105A (en) * | 2013-01-31 | 2015-07-15 | 思科技术公司 | Recovering lost device information in cable networks |
-
2020
- 2020-07-08 CN CN202010653880.8A patent/CN113938427A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007009367A1 (en) * | 2005-07-19 | 2007-01-25 | Alcatel | A method for duplicate address detection in the two-layer access network supporting ipv6 and a system thereof |
| US20080263353A1 (en) * | 2007-04-23 | 2008-10-23 | Ralph Edward Droms | Autoconfigured prefix delegation based on distributed hash |
| CN101663878A (en) * | 2007-04-23 | 2010-03-03 | 思科技术公司 | Extensions to ipv6 neighbor discovery protocol for automated prefix delegation |
| CN102413033A (en) * | 2010-09-26 | 2012-04-11 | 华为技术有限公司 | Method, device and system for realizing route aggregation |
| CN102340452A (en) * | 2011-10-14 | 2012-02-01 | 中兴通讯股份有限公司 | Single-Internet protocol version 6 (IPv6)-address-prefix-based routing transmission method and wireless equipment |
| CN104782105A (en) * | 2013-01-31 | 2015-07-15 | 思科技术公司 | Recovering lost device information in cable networks |
Non-Patent Citations (1)
| Title |
|---|
| 计野，袁贲，王涛，孙文超: "二级路由场景下IPv6地址获取与通信问题研究", 《通信与信息技术》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024001549A1 (en) * | 2022-07-01 | 2024-01-04 | 荣耀终端有限公司 | Address configuration method and electronic device |
| WO2024037198A1 (en) * | 2022-08-19 | 2024-02-22 | 华为技术有限公司 | Routing method for home network, and access device and medium |
| CN115426334A (en) * | 2022-08-26 | 2022-12-02 | Oppo广东移动通信有限公司 | Network address generation method and device, routing equipment and storage medium |
| CN115426334B (en) * | 2022-08-26 | 2024-05-03 | Oppo广东移动通信有限公司 | Network address generation method, device, routing equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2919444B1 (en) | Method, relay device, and system for acquiring internet protocol address in network | |
| US8953601B2 (en) | Internet protocol version six (IPv6) addressing and packet filtering in broadband networks | |
| JP5967173B2 (en) | Network relay device, method for setting operation mode of packet relay processing unit included in network relay device, and computer program | |
| US7706374B2 (en) | Method for assigning IP address to terminal device and communication system | |
| CN100583904C (en) | Automatic configuration method for host address in IPV6 network | |
| US7760666B2 (en) | Method of generating and managing connection identifiers for supporting multicast for each group in IPv6-based wireless network and network interface using the method | |
| CN102137004A (en) | Edge-facing router capable of automatically identifying | |
| CN102984288A (en) | Method and system for managing internet protocol version 6 (IPV6) address conflicts automatically | |
| CN101753460A (en) | Method and device for processing internet protocol version 6(IPV6) routing prefix | |
| JP5907239B2 (en) | Network relay device, method for setting operation mode of packet relay processing unit included in network relay device, and computer program | |
| CN112654049B (en) | Method, system, node and medium for configuring a wireless communication coverage extension system | |
| JP5241957B2 (en) | Method and apparatus for connecting a subscriber unit to an aggregation network supporting IPv6 | |
| CN105227466A (en) | Communication processing method and device | |
| CN108206783B (en) | Address configuration method and device in software defined network system | |
| CN103026692A (en) | PV6 address generation to trigger a virtual leased line service | |
| JP4686609B2 (en) | Method for supporting IPv6 neighbor discovery in a point-to-point oriented broadband wireless network | |
| CN113938427A (en) | Communication method and system, and routing node | |
| US9438475B1 (en) | Supporting relay functionality with a distributed layer 3 gateway | |
| US6917977B2 (en) | Method and system of automatic allocation of unique subnet identifier to a subnet in the network having multiple subnets and a plurality of associated routers and router interfaces | |
| CN103108056A (en) | Device and method capable of achieving subscriber identifier and locator separation network | |
| CN100493073C (en) | Method for implementing neighbor discovery of different link layer separated domain | |
| CN102761425A (en) | Charging method and device | |
| CN108632198B (en) | Equipment management method and device | |
| CN102986186B (en) | Method for terminal network element registration, terminal network element and router | |
| WO2012114684A1 (en) | Router device, packet control method based on prefix management, and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |