WO2013182108A1 - 哈希映射平面的映射信息注册和查找方法、设备及*** - Google Patents

哈希映射平面的映射信息注册和查找方法、设备及*** Download PDF

Info

Publication number
WO2013182108A1
WO2013182108A1 PCT/CN2013/078640 CN2013078640W WO2013182108A1 WO 2013182108 A1 WO2013182108 A1 WO 2013182108A1 CN 2013078640 W CN2013078640 W CN 2013078640W WO 2013182108 A1 WO2013182108 A1 WO 2013182108A1
Authority
WO
WIPO (PCT)
Prior art keywords
mapping
hash
eid
prefix
node
Prior art date
Application number
PCT/CN2013/078640
Other languages
English (en)
French (fr)
Inventor
成黎
孙默
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2013182108A1 publication Critical patent/WO2013182108A1/zh

Links

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/745—Address table lookup; Address filtering
    • H04L45/7453—Address table lookup; Address filtering using hashing

Definitions

  • the embodiments of the present invention relate to the field of communications, and in particular, to a mapping information registration and searching method, device, and system for a hash mapping plane. Background technique
  • the LISP Licator/ID Separation Protocol
  • Figure 1 shows the basic logical architecture of the LISP network. The implementation is as follows:
  • the site network (usually referred to as the user network) is separated from the transport network (usually referred to as the carrier network).
  • the address space is divided into an EID (Endpoint Identifier, which represents the address within the site network) address space and RLOC (Routing Locator).
  • the location identifier which represents the reachability within the border router network) address space.
  • the routing information inside the site network in the network that is, the EID address information, is not advertised to the transmission network.
  • the two site networks are connected between the ITR (Ingress Tunnel Router) and the ETR (Egress Tunnel Router). Establish a tunnel that traverses the transport network to connect.
  • the site network maintains the mapping information of EID to RLOC through a separate mapping system.
  • the LISP network architecture consists of an overlay network mapping plane and a data forwarding plane.
  • the overlay network mapping plane is used to help the communication request initiator (including the communication originating source terminal or the source site where the communication originating source host is located) to obtain mapping information of the communication peer end (including the communication peer terminal or the destination site where the communication peer host is located). That is, the mapping relationship between the identity EID of the communication peer end and the route identifier RLOC.
  • the data forwarding plane is used to implement forwarding and transmission of data packets. After the communication request initiator obtains the communication peer mapping information through the overlay network mapping plane, the number sent to the communication peer end according to the mapping information After the packet is encapsulated, tunnel forwarding is performed.
  • the related art proposes to construct a domain-based hash mapping plane based on DHT (Distribute Hash Table), as shown in FIG.
  • DHT Distribute Hash Table
  • this storage method can better meet the requirements of the LISP overlay mapping plane.
  • the mapping plane can be deployed as a domain hash mapping plane and interconnected by multiple regional hash mapping planes. Intercommunication.
  • the regional hash mapping plane can be autonomously divided by the operator according to the carrier attribute or the location of the deployed area, and the hash mapping planes of different areas communicate through the interworking node.
  • mapping plane If no partitioning is performed in the mapping plane, only one hash mapping plane is deployed.
  • the related techniques for intra-area communication in the area hash mapping are also applicable to a single hash mapping plane deployment.
  • the registered mapping information is stored on the corresponding area mapping plane node according to the hash result of the EID.
  • Any DHT node in the area mapping plane responsible for managing a certain mapping information may extract EID information in the mapping registration message, perform a hash operation on the EID address according to the EID information, and perform matching according to the hash result, and the EID registration information is Stored on the corresponding DHT node.
  • any DHT node in the area mapping plane receives a mapping request message that points to an EID address
  • the DHT node performs the requested EID address.
  • the operation calculates a DHT node that determines the mapping information according to the hash result, and forwards the mapping request message to the DHT node that maintains the mapping information.
  • mapping information registration and the mapping information search are all indexed by the registration EID or the hash value of the search EID, and can quickly locate the DHT node that maintains the mapping information, and complete the mapping information registration or mapping information search.
  • the LISP network architecture is used as an example.
  • the LISP MN Mobile Node
  • the LISP MN Mobile Node
  • the EID prefix address block may be allocated to the site, and the site ETR may directly register the mapping information of the EID prefix to the RLOC address to the mapping plane when registering with the mapping plane.
  • the LISP site uses this prefix mapping information registration method, which can reduce the number of mapping information entries and reduce the mapping plane overhead. It can also reduce the number of mapping searches and improve the search efficiency.
  • the DHT node When the DHT node registers the mapping information according to the mapping registration message, it registers with the EID prefix, and the DHT node in the area performs the EID prefix. Hash the operation and store it based on the result of the hash operation. However, when searching for mapping information, the DHT node uses the detailed EID address as the lookup index. Since the DHT node cannot determine whether the EID address is registered in the EID prefix and the number of digits of the registered EID prefix is used, it cannot be Find the DHT node that maintains the mapping information.
  • Embodiments of the present invention provide a mapping information registration and searching method, device, and system for a hash mapping plane, which implement registration and searching of mapping information by using an EID prefix.
  • An embodiment of the present invention provides a method for registering a mapping information of a hash mapping plane, including: a plurality of regional hash mapping planes respectively setting a hash digit m of a hash mapping plane of a respective region; and a first region hash mapping plane
  • the first distributed hash list (DHT) node determines that the endpoint identity identifier (EID) prefix in the received mapping registration message belongs to the first region hash mapping plane management, and matches the number of bits of the EID prefix. , performing a hash operation;
  • the first DHT node performs matching according to the result of the hash operation, and sends the mapping registration message to the second DHT node responsible for maintaining the registration information in the mapping registration message.
  • the first DHT node determines that the EID prefix in the received registration registry does not belong to the first region hash mapping plane management, and performs the following processing:
  • the interworking node determines the second area hash mapping plane to which the EID prefix belongs, and sends the mapping registration message to the second area hash mapping plane for processing.
  • the matching the number of bits of the EID prefix, performing a hash operation including:
  • the first m-bit prefix of the EID prefix is selected to perform a hash operation;
  • the EID prefix is split into a plurality of m-bit prefixes, and the plurality of m-bit prefixes are respectively hashed.
  • the determining that the EID prefix belongs to the first area hash mapping plane management includes:
  • the EID prefix belongs to the first area hash mapping plane management, if the EID prefix is not in the first area hash. Within the EID prefix range allocated by the mapping plane, it does not belong to the first region hash mapping plane management.
  • the first DHT node sends the mapping registration message to the second DHT node, including:
  • the registration message performs a hash operation.
  • the first DHT node performs matching according to the result of the hashing operation, and sends the mapping registration message to the second DHT node, including:
  • the first DHT node performs a hash operation on the plurality of m-bit prefixes
  • the first DHT node performs matching according to the multiple hash values obtained by the hash operation, and determines the multiple m-bit prefixes.
  • the method further comprises:
  • the first DHT node determines that the EID prefix part in the received registration registration file belongs to the first area hash mapping plane management, and another part does not belong to the first area hash mapping plane management, then:
  • the part of the EID prefix that does not belong to the management of the first area hash mapping plane is not processed, or the mapping registration message is sent to the interworking node in the hash mapping plane of the local area, and the mutual
  • the first DHT node determines that the EID prefix part in the received mapping registration message belongs to the first area hash mapping plane management, and the other part does not belong to the first area hash mapping plane management, including :
  • the first DHT node performs prefix matching, and determines that the EID prefix is not completely within the EID prefix range allocated by the first area hash mapping plane;
  • the first DHT node splits the EID prefix into a plurality of m-bit prefixes according to a hash bit m of the first region hash mapping plane;
  • the first DHT node performs prefix matching again on the plurality of m-bit prefixes, and determines a partial EID prefix that belongs to the first region hash mapping plane management and a portion that does not belong to the first region hash mapping plane management. EID prefix.
  • the embodiment of the present invention further provides another mapping information searching method of the hash mapping plane, including: receiving, by the first distributed hash list (DHT) node in the first region hash mapping plane, the discovered endpoint identity identifier (EID)
  • the m-bit prefix of the EID address is hashed when the address belongs to the mapping request message managed by the Hash mapping plane of the first area, where m is the hash number of the Hash mapping plane of the area;
  • the first DHT node performs matching according to the hash result, and sends a mapping request message to the second DHT node responsible for maintaining the mapping information of the EID address, and the second DHT node returns the mapping information corresponding to the EID address to Map the requester.
  • the first DHT node determines that the EID address searched in the received mapping request does not belong to the first area hash mapping plane management, and performs the following processing: sending the mapping request message to the first An interworking node in a region Hash mapping plane; the interworking node determines a second region hash mapping plane to which the EID address belongs, and sends the mapping request message to the second region hash mapping plane for processing.
  • the embodiment of the invention further provides a distributed hash list DHT node, including:
  • a setting module configured to set a hash bit m of the first region hash mapping plane to which the DHT belongs
  • a receiving module configured to receive a mapping registration message
  • An operation module configured to match an m-bit of an Endpoint Identity (EID) prefix in the mapping registration message, to perform a hash operation;
  • EID Endpoint Identity
  • a determining module is configured to determine a DHT node responsible for maintaining mapping information based on a result of the hashing operation by the operating module.
  • the operation module is configured to: when the number of bits of the EID prefix is greater than or equal to m, select a previous m-bit prefix of the EID prefix to perform a hash operation; when the number of bits of the EID prefix is less than m, The EID prefix is split into a plurality of m-bit prefixes, and the plurality of m-bit prefixes are respectively hashed.
  • the DHT node further includes:
  • a sending module configured to send the mapping registration message to a DHT node responsible for maintaining mapping information, attaching a result of the hash operation to the mapping registration message, or adding an indication to the mapping registration message Bit, the indicator bit indicates that a hash operation has been performed on the map registration message.
  • the determining module is configured to: perform, according to a plurality of hash values obtained by performing hash operations on the plurality of m-bit prefixes, to determine DHTs responsible for maintaining mapping information corresponding to the plurality of m-bit prefixes. node.
  • the operation module is set to:
  • EID prefix part in the mapping registration belongs to the first area hash mapping plane management, and another part does not belong to the first area hash mapping plane management, then:
  • the m-bit of the EID prefix is subjected to a corresponding hash operation; the partial EID prefix that is not managed by the Hash mapping plane of the first area is not processed, or the mapping registration message is sent to the first area.
  • An interworking node in the hash mapping plane, and the interworking node sends the mapping registration message to other area hash mapping planes for processing.
  • the operation module is set to: And dividing the EID prefix into a plurality of m-bit prefixes according to a hash bit m of the first region hash mapping plane;
  • the embodiment of the present invention further provides another distributed hash list DHT node, including: a receiving module, configured to receive a mapping request message;
  • An operation module configured to perform hashing according to an m-bit prefix of the endpoint identity identifier EID address in the mapping request message, where m is a hash digit m of the first region hash mapping plane to which the DHT node belongs; as well as
  • a sending module configured to send the mapping request message to a DHT node responsible for maintaining mapping information according to a result of the hash operation, and return, by the DHT node responsible for maintaining the mapping information, mapping information corresponding to the EID address to the mapping Requester.
  • the operation module is set to:
  • the embodiment of the present invention further provides a mapping information registration and searching system of a hash mapping plane, which includes multiple regional hash mapping planes, and at least one regional hash mapping plane includes a message receiving node and an interworking node.
  • the message receiving node is configured to perform the functions of the two DHT nodes provided by the embodiment of the present invention.
  • the interworking node is configured to maintain an EID prefix range of other hash mapping planes, and forward the mapping registration message and the mapping request message to other hash mapping planes.
  • the hash operation is performed according to the m bits of the EID prefix, and the DHT node responsible for maintaining the mapping information is determined according to the result of the hash operation, so that the DHT node can be based on the EID.
  • Prefix registration and lookup mapping information BRIEF abstract
  • Figure la is a schematic diagram of the basic logical architecture of the LISP network in the related art.
  • Figure lb is a schematic diagram of a DHT-based subdomain hash mapping plane in the related art
  • 2a is a schematic flowchart of a method for registering mapping information of a hash mapping plane according to an embodiment of the present invention
  • 2b is a schematic flowchart of a mapping information searching method of a hash mapping plane according to an embodiment of the present invention
  • FIG. 5 is a schematic flowchart of a method for registering mapping information according to Embodiment 1 of the present invention.
  • FIG. 6 is a schematic flowchart of a method for registering mapping information in Embodiment 2 of the present invention.
  • FIG. 7 is a schematic flowchart of a method for registering mapping information in Embodiment 3 of the present invention.
  • FIG. 8 is a schematic flowchart of a method for registering mapping information in Embodiment 4 of the present invention.
  • FIG. 9 is a schematic flowchart of a method for searching for mapping information according to Embodiment 5 of the present invention.
  • FIG. 10 is a schematic structural diagram of a DHT node according to Embodiment 6 of the present invention.
  • FIG. 11 is a schematic structural diagram of a DHT node according to Embodiment 7 of the present invention. Preferred embodiment of the invention
  • DHT node The node that forms the hash map plane. Each DHT node can perform area prefix matching on the EID prefix/EID address information in the mapping registration/mapping request message, and can perform the The Greek operation determines the destination DHT node storing the mapping information based on the result of the hash operation. If the hash result of the mapping information received by the DHT node matches the hash identifier configured by itself, the information is stored and maintained, and related signaling corresponding to the mapping information, such as a mapping registration message and a mapping request message, is processed.
  • Message receiving node A DHT node in the hash mapping plane that is connected to the mapping registration/mapping request initiator (that is, the site ETR or ITR in the identity location separation architecture).
  • Interworking node A node deployed in the hash mapping plane for interworking with other hash mapping planes.
  • the information about other hash mapping planes is maintained in the interworking node, including the prefix mapping range maintained by other hash mapping planes and the interworking node addresses and interface information of other hash mapping planes.
  • An embodiment of the present invention provides a method for registering mapping information of a hash mapping plane, as shown in FIG. 2a, including:
  • Step 102 The first distributed hash list DHT node in a region hash mapping plane determines that the EID prefix in the received mapping registration message belongs to the local Hash mapping plane management, and matches the bit of the EID prefix. Number, perform the corresponding hash operation;
  • Step 103 The first DHT node performs matching according to the result of the hash operation, and sends the mapping registration message to the second DHT node responsible for maintaining the registration information in the mapping registration message.
  • the method further includes:
  • the following processing is performed:
  • the interworking node determines the area hash mapping plane to which the EID prefix belongs, and sends the mapping registration message to the area hash mapping plane to which the EID prefix belongs.
  • the matching the number of bits of the EID prefix and performing the corresponding hashing operation includes: when the number of digits of the EID prefix is greater than or equal to m, selecting the first m-bit prefix of the EID prefix to perform a hash operation; When the number of bits of the EID prefix is less than m, the EID prefix is split into a plurality of m-bit prefixes, and the plurality of m-bit prefixes are respectively hashed.
  • the determining that the EID prefix belongs to the Hash mapping plane management of the local area includes: if the EID prefix is within the EID prefix range allocated by the hash mapping plane of the local area, the EID prefix belongs to the local area Hash mapping plane management. Otherwise, it does not belong to the Hash Map Plane Management in this area.
  • the first DHT node sends the mapping registration message to the next node, including:
  • the result of the hash operation is attached to the mapping registration message, or an indication bit is added to the mapping registration message, and the indicator bit indicates that the mapping has been
  • the registration message performs a hash operation.
  • the method also includes:
  • the first DHT node performs matching according to the result of the hash operation, and sends the mapping registration message to the second DHT node, including:
  • the first DHT node performs a hash operation on the plurality of m-bit prefixes
  • the first DHT node performs matching according to the multiple hash values obtained by the hash operation, and determines the multiple m-bit prefixes.
  • Corresponding one or more second DHT nodes and then transmitting a mapping registration message to the second DHT node.
  • the method further includes:
  • the first DHT node determines that the EID prefix part in the received registration registration text belongs to the local area hash mapping plane management, and the other part does not belong to the local area hash mapping plane management, then: the management of the hash mapping plane belonging to the local area
  • the partial EID prefix matches the number of bits of the partial EID prefix, performs a corresponding hash operation, and performs matching according to the result of the hash operation, and sends the mapping registration message to the second DHT node.
  • the part of the EID prefix that does not belong to the management of the hash mapping plane in the local area is not processed, or the mapping registration message is sent to the interworking node in the hash mapping plane of the local area, and the interworking node is preferred.
  • the first DHT node determines that the EID prefix part in the received registration registration text belongs to the local area hash mapping plane management, and the other part does not belong to the local area hash mapping plane management, including: The first DHT node performs prefix matching, and determines that the EID prefix is not completely within the EID prefix range allocated by the hash mapping plane of the local area;
  • the first DHT node splits the EID prefix into multiple m-bit prefixes according to the hash number m of the hash mapping plane of the region;
  • the first DHT node performs prefix matching again on the plurality of m-bit prefixes, and determines a partial EID prefix that belongs to the hash mapping plane management of the local area and a partial EID prefix that does not belong to the local area hash mapping plane management.
  • An embodiment of the present invention provides a mapping information search method for a hash mapping plane, as shown in FIG. 2b, which includes:
  • Step 201 When the first distributed hash list DHT node in a region hash mapping plane receives the mapping request message that the searched EID address belongs to the Hash mapping plane managed by the local area, the m-bit prefix of the EID address is performed.
  • Hash, m is the hash number m of the hash map plane of the region;
  • Step 202 The first DHT node performs matching according to the hash result, and sends the mapping request message to the second DHT node responsible for maintaining the mapping information of the EID address, and the second DHT node maps the EID address corresponding to the EID address.
  • the information is returned to the requesting party.
  • the first DHT node determines that the EID address searched in the received mapping request does not belong to the Hash mapping plane management of the local area, and performs the following processing: sending the mapping request message to the local area hash mapping plane An interworking node; the interworking node determines an area hash mapping plane to which the EID address belongs, and sends the mapping request message to the area hash mapping plane to which the EID address belongs.
  • Figure 3 shows the flow of mapping information registration in the domain hash mapping plane.
  • the process includes two scenarios.
  • the registration mode is local registration.
  • the current area mapping plane determines the user.
  • Registration map plane, and mapping registration 4 ⁇ text forwarding, the note The book mode is cross-domain registration.
  • the registration process for the two registration methods is as follows: Local registration process:
  • the area hash mapping plane is composed of multiple DHT nodes.
  • ETR1 is connected to a node in the regional hash mapping plane of the current area.
  • the ETR1 needs to perform operations such as sending registration messages to the mapping plane, the ETR1 sends the packet to the node.
  • ETR1 sends a mapping registration message to the packet receiving node in the current area hash mapping plane.
  • the area mapping plane is divided by the operator.
  • each mapping plane can be assigned a certain EID prefix.
  • the area hash mapping plane manages mapping information corresponding to all EID addresses in the prefix range. Therefore, after receiving the mapping registration message, the packet receiving node in the area hash mapping plane first performs prefix matching on the EID address in the registration information, and determines whether it belongs to the management scope of the local area mapping plane. If the judgment belongs, the hash operation of the registered EID address is further performed, and according to the hash result, it is determined which DHT node in the area mapping plane should be present in the mapping information.
  • the packet receiving node in the area mapping plane forwards the mapping registration message to the destination DHT node in the area, and the node saves and maintains the registration information.
  • ETR2 sends a mapping registration message to the packet receiving node of the hash mapping plane of the current area
  • the packet receiving node After receiving the mapping registration message, the packet receiving node performs prefix matching on the EID address in the registration information. If the node determines that the EID of the registration packet does not belong to the management scope of the local hash mapping plane, the mapping registration packet is forwarded to the interworking node 1 deployed in the local area hash mapping plane.
  • the packet receiving node forwards the mapping registration message to the interworking node 1.
  • the interworking node in the area mapping plane maintains EID prefix management information and interworking node information of all other area mapping planes. Therefore, the interworking node 1 searches for the management scope of the regional hash mapping plane to which the registration information corresponding to the registration EID belongs according to the EID information in the registration message.
  • the interworking node 1 finds that the registration information belongs to the management scope of the area hash mapping plane 2, and finds the interworking node 2 of the area hash mapping plane 2, and the interworking node 1 forwards the registration message to Interworking node 2.
  • the interworking node 2 performs prefix matching on the EID address in the registration information to determine whether it belongs to the management scope of the local area mapping plane. If the judgment belongs, the hash operation is further performed on the registered EID address, and it is determined according to the hash result, which DHT node in the area mapping plane should be present in the mapping information.
  • the interworking node 2 forwards the mapping registration message to the destination DHT node in the area, and the node saves and maintains the registration information.
  • Figure 4 shows the flow of mapping information search in the domain hash mapping plane.
  • the process includes two scenarios.
  • the mapping information that the user searches for belongs to the management scope of the mapping plane of the current connection area of the user, and the mapping request mode is a local search.
  • the mapping information searched by the user does not belong to the management scope of the mapping plane of the current connection area of the user,
  • the current connection area mapping plane of the user needs to forward the mapping request of the user to the area mapping plane that maintains the mapping information of the search.
  • the mapping request mode is a cross-domain search.
  • the search process for the two request methods is as follows:
  • the ITR1 sends a mapping request message to the packet receiving node of the hash mapping plane of the currently connected area.
  • the packet receiving node After receiving the mapping request packet, the packet receiving node performs prefix matching on the EID address in the request packet, and determines whether the EID address belongs to the management scope of the local area mapping plane. If the judgment belongs, the hash operation of the requested EID address is further performed, and it is determined according to the hash result, which DHT node in the area mapping plane is stored.
  • the message receiving node in the area mapping plane forwards the mapping request message to the corresponding mapping information to maintain the DHT node, and the node performs a mapping operation related operation.
  • the ITR2 sends a mapping request message to the packet receiving node of the hash mapping plane of the current area.
  • the packet receiving node After receiving the mapping request packet, the packet receiving node performs prefix matching on the EID address in the request packet. If the node determines that the EID found in the request message does not belong to the local hash mapping plane The management scope of the polygon is forwarded to the interworking node 1 deployed in the local area hash mapping plane.
  • the packet receiving node forwards the mapping request packet to the interworking node 1.
  • the interworking node 1 determines, according to the EID information in the request packet, which management area of the regional hash mapping plane the mapping information corresponding to the request EID belongs to.
  • the interworking node 1 finds that the mapping information of the request packet search belongs to the management scope of the regional hash mapping plane 2, and finds the interworking node 2 of the regional hash mapping plane 2, and the interworking node 1 forwards the mapping request packet to the interworking. Node 2.
  • the interworking node 2 performs prefix matching on the EID address in the mapping request information, and determines whether it belongs to the management scope of the local area mapping plane. If the judgment belongs, the requesting EID address is further hashed, and according to the hash result, it is determined which mapping node has the DHT node in the area mapping plane.
  • the interworking node 2 forwards the mapping request message to the corresponding mapping information maintenance DHT node, and the node performs a mapping operation related operation.
  • FIG. 5 is a schematic flowchart of a method for registering mapping information provided by an embodiment of the present invention in a local registration application scenario. This embodiment is applicable to the registration scenario of the LISP site where the number of EID prefixes registered by the LISP MN or the station is greater than or equal to m when the hash number of the area mapping plane is m.
  • the EID address managed by the area mapping plane is a 32-bit IPv4 address
  • the hash number m set by the area mapping plane is 16, and the number of EID prefix bits registered by the station is Greater than or equal to m, assumed to be 20 bits.
  • the Sitel ETR sends a mapping registration message to the connection node of the hash mapping plane of the local area, where the registered EID prefix digit is greater than or equal to the hash digit m set by the regional hash mapping plane, and is assumed to be 20 registered in the text.
  • the bit EID prefix is 1.1.0/20.
  • 502 In the local registration scenario, the packet receiving node connected to the Sitel ETR determines that the mapping information belongs to the management scope of the local hash mapping plane by prefix matching, and the packet receiving node performs the hash bit set by the regional mapping plane. The operation, that is, the message receiving node performs a hash operation on the 1.1/16 prefix.
  • the message receiving node performs matching according to the hash value, and determines a destination DHT node responsible for maintaining the mapping information.
  • the message receiving node forwards the mapping registration message with the prefix 1 ⁇ 0/20 to the destination DHT node responsible for storing and maintaining the mapping information.
  • the hash operation result may be attached to the message, or an indication bit may be added to the message, and the destination maintenance DHT node or the forwarding DHT node (if any) indicates that A hash bit hash operation is performed on the registration message.
  • FIG. 6 is another schematic flowchart of a registration method of mapping information provided by an embodiment of the present invention in a local registration scenario. This embodiment is applicable to the registration scenario of the LISP Site with the registration prefix number less than m when the hash number of the area mapping plane is m.
  • the EID address of the area mapping plane management is a 32-bit IPv4 address
  • the hash bit m set by the area mapping plane is 16 bits
  • the Site2 ETR sends a mapping registration message to the receiving node of the local area hash mapping plane, where the registered EID prefix digit is smaller than the hash digit m set by the area hash mapping plane.
  • the 14-bit EID prefix registered in the text is 2.0/14.
  • the packet receiving node of the Site2 ETR connection determines that the mapping information belongs to the management scope of the local hash mapping plane by prefix matching, and the hash receiving digit set by the packet receiving node according to the regional mapping plane, Splitting the registered EID prefix into multiple m-bit prefixes respectively performs a hash operation, that is, the message receiving node splits the 14-bit EID prefix into four 16-bit prefixes of 2.0/16, 2.1/16, 2.2/16. And 2.3/16, and hash the four 16-bit prefixes respectively.
  • 603 The ⁇ receiving node performs matching according to the hash value, and determines the maintenance DHT node corresponding to the four 16-bit prefixes.
  • 604 The message receiving node copies the 14-bit prefix registration message registered by the Site2 ETR, and then sends the message to the maintenance DHT node determined in step 603.
  • the message receiving node may attach the hash split operation result to the forwarded registration message, or add an indication bit in the message, and maintain the DHT node or forward the DHT node (if any) to indicate that the message has been
  • the registration message performs a hash bit hash operation to prevent the destination maintenance node or the forwarding DHT node from repeatedly performing the hash split operation, resulting in a forwarding loop.
  • Embodiment 3 is a diagrammatic representation of Embodiment 3
  • FIG. 7 is a schematic diagram of a method for registering mapping information of a cross-domain registration scenario.
  • the embodiment is applicable to a region where a hash mapping plane of a region currently connected by a user is not a registration mapping plane of a user, and the region hash mapping plane will receive a packet. Forward to the scene where the user registration mapping plane completes registration. As shown in Figure 7, the following steps are included:
  • the Site3 ETR sends a mapping registration message to the packet receiving node of the hash mapping plane in the current area;
  • the packet receiving node After receiving the mapping registration message, the packet receiving node performs prefix matching on the EID address in the registration information. If the node determines that the EID of the registration packet does not belong to the management scope of the local hash mapping plane, the mapping registration packet is forwarded to the interworking node 1 deployed in the local area hash mapping plane.
  • the packet receiving node forwards the mapping registration message to the interworking node 1.
  • the interworking node 1 searches for the management scope of the regional hash mapping plane to which the registration information of the registered EID prefix belongs according to the EID prefix information in the registration.
  • the interworking node in the area mapping plane maintains EID prefix management information and interworking node information of all other area mapping planes.
  • the interworking node 1 finds the registration ⁇ belongs to the management scope of the regional hash mapping plane 2, and finds the interworking node 2 of the regional hash mapping plane 2, and the interworking node 1 forwards the registration message to the interworking node 2.
  • the current connection area hash mapping plane receives the mapping registration information, and if the mapping registration information does not belong to its own management scope, the mapping is registered.
  • the packet is forwarded to the area hash mapping plane corresponding to the registration message, and the corresponding area hash mapping plane performs the operation according to the hash bit hash after receiving the message. Therefore, the selection of the hash bits between the Hash Mapping planes of each region is independent of each other and is not affected.
  • the Hash Mapping Plane of each region can independently select the hash bits according to its own deployment and requirements.
  • Embodiment 4 is a diagrammatic representation of Embodiment 4:
  • FIG. 8 is a schematic diagram of a method for registering cross-domain registration scenario mapping registration information. This embodiment is applicable to the mapping information of the current user registration, and cannot be completely maintained by the currently connected regional hash mapping plane. Hash mapping planes are commonly maintained by the scene.
  • mapping plane 1 and area mapping plane 2 are respectively responsible for managing coverage within the EID address prefixes 3.0/15 and 3.2/15.
  • the mapping information of the area hash mapping plane is set to 16 bits, and the hash number m set by the area hash mapping plane 2 is 15 bits. As shown in Figure 8, the following steps are included:
  • the Site4 ETR sends a mapping registration message to the packet receiving node in the hash mapping plane 1 of the current area, and the registration information covered by the EID prefix registered in the packet cannot be separately maintained by the area hash mapping plane 1.
  • ⁇ Setting, mapping registration ⁇ The EID prefix registered in the text is 3.0/14.
  • the packet receiving node in the area hash mapping plane 1 After receiving the mapping registration message, the packet receiving node in the area hash mapping plane 1 first determines, by prefix matching, that the mapping information does not completely belong to the management scope of the local hash mapping plane.
  • the packet receiving node copies the packet and sends the packet to the interworking node 1 of the local area hash mapping plane.
  • the message receiving node may also choose not to perform 803, and only process mapping information belonging to the local hash mapping plane management range in the area. Subsequent steps 806-808 in this scenario are omitted.
  • the packet receiving node in the area hash mapping plane 1 splits the registration prefix into multiple ml bit prefixes according to the hash bit ml set in the area hash mapping plane 1.
  • the 14-bit prefix is split into four 16-bit prefixes of 3.0/16, 3.1/16, 3.2/16, and 3.3/16.
  • the message receiving node performs prefix matching again, and selects the ml bit belonging to the local management range.
  • the prefix performs a hash operation. That is, when the message receiving node judges that 3.0/16 and 3.1/16 belong to the local management scope, the two prefixes 3.0/16 and 3.1/16 are hashed, and the destination DHT node responsible for maintaining the mapping information is judged.
  • the message receiving node copies the mapping registration message with the prefix 3.0/14 and sends it to the destination DHT node responsible for maintaining the mapping information.
  • step 803 and steps 804, 805 is performed before and after, and can also be performed simultaneously.
  • the interworking node 1 After receiving the copied registration file, the interworking node 1 matches the registration EID prefix (the matching process may also include a prefix split matching process), and determines which management region of the regional hash mapping plane the registration prefix information belongs to.
  • the matching process may also include a prefix split matching process
  • the interworking node 1 finds the registration ⁇ belongs to the management scope of the regional hash mapping plane 2, and finds the interworking node 2 of the regional hash mapping plane 2, and the interworking node 1 forwards the mapping registration to the interworking node 2.
  • the interworking node 1 may select to add a flag when forwarding the registration message to the interworking node 2, and prevent the interworking node 2 from performing the prefix matching judgment, and then forward the packet to the regional hash mapping plane 1 to cause a forwarding loop.
  • the interworking node 2 can also determine the address of the source interworking node 1 that receives the mapping registration message, and avoid forwarding the packet to the regional hash mapping plane 1 to cause a loop.
  • the interworking node 2 After receiving the mapping registration message, the interworking node 2 first determines, by prefix matching, that the mapping information does not completely belong to the management scope of the local hash mapping plane. The interworking node 2 splits the registration prefix into multiple m2 bit prefixes according to the hash bit m2 set in the area hash mapping plane 2. That is, the 14-bit prefix is split into two 15-bit prefixes of 3.0/15 and 3.2/15. The interworking node 2 performs the prefix matching again, and selects the m2 bit prefix belonging to the local management scope to perform the hash operation.
  • ICR2 judges that 3.2/15 belongs to the management scope of the area hash mapping plane 2, performs a hash operation on the prefix 3.2/15, and judges according to the hash result, forwards the mapping registration message of the registration prefix 3.0/14 to which maintenance to send.
  • DHT node DHT node.
  • the interworking node 2 can determine that the packet is not sent to the interworking node 1 according to the identifier added by the interworking node 1 in the mapping registration message or according to the address of the interworking node 1.
  • the interworking node 2 copies the 3.0/14 mapping registration message to the destination DHT node responsible for maintaining the mapping information.
  • FIG. 9 is a schematic diagram of a method for searching for mapping information according to an embodiment of the present invention.
  • the steps of the method include:
  • the ITR1 sends a mapping request message to the packet receiving node of the hash mapping plane of the currently connected area.
  • the packet receiving node After receiving the mapping request packet, the packet receiving node performs prefix matching on the EID address in the request packet, and determines whether the EID address belongs to the management scope of the local area mapping plane. If the judgment belongs, the hash address of the requested EID address is set according to the hash number ml set by the local area mapping plane, and the hash information is used to determine which DHT node in the area mapping plane is stored.
  • the packet receiving node in the area mapping plane forwards the mapping request message to the destination DHT node that maintains the mapping information, and the node performs the related operation of the mapping response.
  • the ITR2 sends a mapping request message to the packet receiving node of the hash mapping plane of the current area.
  • the packet receiving node After receiving the mapping request packet, the packet receiving node performs prefix matching on the EID address in the request packet. If the node determines that the EID in the request packet does not belong to the management scope of the local hash mapping plane, the node forwards the mapping registration message to the interworking node 1 deployed in the local area hash mapping plane.
  • the packet receiving node forwards the mapping request packet to the interworking node 1.
  • the interworking node 1 determines, according to the EID information in the request packet, which management area of the regional hash mapping plane the mapping information corresponding to the request EID belongs to.
  • the interworking node 1 finds that the mapping information of the request packet search belongs to the management scope of the regional hash mapping plane 2, and finds the interworking node 2 of the regional hash mapping plane 2, and the interworking node 1 mapping request packet is forwarded to the interworking node. 2.
  • the interworking node 2 performs prefix matching on the EID address in the mapping request information, and determines whether it belongs to the management scope of the local area mapping plane. If the judgment belongs to, further request the EID
  • the address is hashed according to the hash bit m2 set by the area hash mapping plane 2, and it is determined according to the hash result which DHT node exists in the area mapping plane.
  • the interworking node 2 forwards the mapping request message to the destination DHT node that maintains the mapping information, and the node performs a mapping operation related operation.
  • the hash operation is performed according to the m bits of the EID prefix, and the DHT node responsible for maintaining the mapping information is determined according to the result of the hash operation, so that the DHT node can register according to the EID prefix. Find mapping information.
  • An embodiment of the present invention provides a distributed hash list DHT node, as shown in FIG. 10, including: a setting module 10, configured to: set a hash bit m of a hash mapping plane of the local area;
  • the receiving module 11 is configured to: receive a mapping registration message
  • the operation module 12 is configured to: match the m bits of the endpoint identity EID prefix in the mapping registration message, and perform a corresponding hash operation;
  • the determining module 13 is configured to: determine, according to a result of the hash operation of the operation module, a DHT node responsible for maintaining mapping information
  • the operation module 12 is configured to: when the number of digits of the EID prefix is greater than or equal to m, select the first m-bit prefix of the EID prefix to perform a hash operation; when the number of digits of the EID prefix is less than m, The EID prefix is split into multiple m-bit prefixes, and the multiple m-bit prefixes are respectively hashed.
  • the DHT node also includes:
  • the sending module 14 is configured to: send the mapping registration message to the DHT node responsible for maintaining the mapping information, attach the result of the hash operation to the mapping registration message, or add the mapping registration message An indication bit indicating that a hash operation has been performed on the mapping registration message.
  • the determining module 13 is configured to:
  • the operation module 12 is configured to: if the EID prefix part in the mapping registration message belongs to the local area hash mapping plane management, and the other part does not belong to the local area hash mapping plane management, then:
  • the part of the EID prefix that belongs to the Hash mapping plane management of the local area is matched with the m bits of the partial EID prefix, and the corresponding hash operation is performed; the partial EID prefix that is not managed by the Hash mapping plane of the local area is not processed.
  • the mapping registration message is sent to the interworking node in the hash mapping plane of the local area, and the interworking node sends the mapping registration message to the other area hash mapping plane for processing.
  • the operation module 12 is configured to: split the EID prefix into multiple m-bit prefixes according to the number of hash bits m of the hash mapping plane of the region;
  • the embodiment provides a distributed hash list DHT node, as shown in FIG. 11, including: a receiving module 21, configured to: receive a mapping request message;
  • the operation module 22 is configured to: perform hashing according to the m-bit prefix of the endpoint identifier EID address in the mapping request message, where m is the hash digit m of the hash mapping plane of the region;
  • the sending module 23 is configured to: send the mapping request message to the DHT node responsible for maintaining the mapping information according to the result of the hash operation, and return, by the DHT node responsible for maintaining the mapping information, mapping information corresponding to the EID address to Requester.
  • the operation module 22 is configured to: if the EID address in the mapping request message does not belong to the local area hash mapping plane management, perform the following processing:
  • the mapping request message is sent to the interworking node in the Hash mapping plane of the local area, and the interworking node determines the regional Hash mapping plane to which the EID address belongs, and sends the mapping request message to the area hash to which the EID address belongs. Mapping plane processing.
  • Example eight The embodiment provides a mapping information registration and searching system of a hash mapping plane, which includes multiple regional hash mapping planes, and at least one regional hash mapping plane includes a message receiving node and an interworking node.
  • the packet receiving node is configured to: set a hash bit m of the hash mapping plane of the local area, receive a mapping registration message, and match the m bits of the endpoint identity identifier EID prefix in the mapping registration message, and perform corresponding In the operation, the DHT node responsible for maintaining the mapping information is determined according to the result of the hash operation performed by the operation module; receiving the mapping request message, and hashing according to the m-bit prefix of the endpoint identity EID address in the mapping request message m is the hash number m of the hash mapping plane of the area, and the mapping request message is sent to the DHT node responsible for maintaining the mapping information according to the result of the hash operation, and the DHT node responsible for maintaining the mapping information corresponds to The mapping information of the EID address is returned to the requesting party;
  • the interworking node is configured to: maintain an EID prefix range of other hash mapping planes, and forward the mapping registration message and the mapping request message to other hash mapping planes.
  • the hash operation is performed according to the m bits of the EID prefix, and the DHT node responsible for maintaining the mapping information is determined according to the result of the hash operation, so that the DHT node can register according to the EID prefix. Find mapping information.
  • the hash operation is performed according to the m bits of the EID prefix, and the DHT node responsible for maintaining the mapping information is determined according to the result of the hash operation, thereby enabling the DHT node to register and search for the mapping information according to the EID prefix.

Landscapes

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

Abstract

本发明实施例提供的一种哈希映射平面的映射信息注册方法，包括：各区域哈希映射平面分别设定本区域哈希映射平面的哈希位数m；某一区域哈希映射平面内的第一分布式哈希列表DHT节点如确定收到的映射注册报文中的EID前缀属于本区域哈希映射平面管理，则匹配该EID前缀的位数，执行相应的哈希操作；该第一DHT节点根据所述哈希操作的结果进行匹配，将映射注册报文发送给负责维护该映射注册报文中注册信息的第二DHT节点。

Description

哈希映射平面的映射信息注册和查找方法、 设备及*** 技术领域
本发明实施例涉及通信领域， 尤其涉及一种哈希映射平面的映射信息注 册和查找方法、 设备及***。 背景技术
为了解决路由表规模不断扩大的问题， 更好的满足用户对移动性支持、 多归属网络部署及流量工程部署等技术的需求， 身份和位置分离的网络架构 设计成为业界关注的热点。
LISP ( Locator/ID Separation Protocol, 位置与身份分离协议）技术就是 一种基于主机身份标识与主机位置标识分离的解决方案， 图 1 所示为 LISP 网络的基本逻辑架构， 其实现方式如下：
站点网络（通常指用户网络） 与传输网络（通常指运营商网络）分离， 地址空间被划分为 EID ( Endpoint Identifier, 端点身份标识， 表示站点网络 内的地址 )地址空间与 RLOC ( Routing Locator, 路由位置标识， 表示边界路 由器网络内的可达性）地址空间。网络中的站点网络内部的路由信息，即 EID 地址信息， 不发布到传输网络中， 两个站点网络通过 ITR ( Ingress Tunnel Router, 入口隧道路由器）和 ETR ( Egress Tunnel Router, 出口隧道路由器） 之间建立穿越传输网络的隧道进行连接。 站点网络通过一个单独的映射*** 来实现 EID到 RLOC的映射信息的维护。
如图 1所示， LISP网络架构由叠加网映射平面和数据转发平面构成。 其中， 叠加网映射平面用于帮助通信请求发起方（包括通信发起源终端 或通信发起源主机所在源站点）获取通信对端 (包括通信对端终端或通信对 端主机所在目的站点 )的映射信息， 即通信对端的身份标识 EID到路由标识 RLOC的映射关系。
数据转发平面用于实现数据包的转发和传输。 通信请求发起方通过叠加 网映射平面获取到通信对端映射信息后， 根据映射信息对发往通信对端的数 据包进行封装后， 执行隧道转发。
相关技术中提出构建基于 DHT ( Distribute Hash Table ,分布式哈希列表 ) 的分域哈希映射平面， 如图 lb所示。
由于 DHT存储方式具有自主配置、 自主维护以及良好的可扩展性和鲁 棒性等优良特性， 该种存储方式可更好的满足 LISP叠加层映射平面的需求。
如图 lb 中所示， 考虑到映射平面可能会由多个运营商共同组建， 为具 有更良好的扩展性， 映射平面可部署为分域哈希映射平面， 由多个区域哈希 映射平面互联互通构成。 其中区域哈希映射平面可根据运营商属性或部署区 域位置由运营商进行自主划分， 不同区域哈希映射平面间通过互通节点进行 通信。
若映射平面中不进行区域划分， 只部署一个哈希映射平面， 关于区域哈 希映射平面内通信的相关技术对单个哈希映射平面部署同样适用。
根据相关技术，注册的映射信息根据 EID的哈希结果存储在对应的区域 映射平面节点上。 负责管理某一映射信息的区域映射平面中的任一 DHT 节 点可提取映射注册报文中的 EID信息，根据 EID信息对 EID地址执行哈希运 算， 并根据哈希结果进行匹配， 将 EID注册信息存储在对应的 DHT节点上。
同样， 当区域映射平面中的任一 DHT节点接收到指向某一 EID地址的 映射请求报文时， 若该映射信息属于该区域映射平面的管理维护范围， 则 DHT节点对请求的 EID地址执行哈希运算，根据哈希结果判断该映射信息的 维护 DHT节点， 将映射请求报文转发给维护该映射信息的 DHT节点。
根据上述描述， 映射信息注册及映射信息查找均以注册 EID或查找 EID 的哈希值作为索引， 能够快速的定位到维护映射信息的 DHT 节点， 完成映 射信息注册或映射信息查找。
在实际部署过程中， 以 LISP网络架构为例， LISP MN ( Mobile Node , 移动终端 )在向映射平面注册时， 通常注册 EID地址到 RLOC地址的映射信 息； 但一些大的站点 （LISP Site ) 中， 可能分配给该站点的是一个 EID前缀 地址块， 站点 ETR在向映射平面注册时可直接向映射平面注册 EID前缀到 RLOC地址的映射信息。 LISP 站点釆用这种前缀映射信息注册方式， 即可以减少映射信息条目 数， 减小映射平面开销； 又可减少映射查找的次数， 提高查找效率。
但是， 釆用分域哈希映射平面方法时， 会产生下述问题： DHT节点在根 据映射注册报文进行映射信息的注册时， 是以 EID 前缀进行注册， 区域内 DHT节点以该 EID前缀进行哈希运算，并根据哈希运算的结果进行存储。但 在查找映射信息时， DHT节点是以详细的 EID地址作为查找索引，由于 DHT 节点无法判断 EID地址是否是覆盖在 EID前缀中注册的、 以及注册使用的 EID前缀的位数是多少， 因而无法查找到维护映射信息的 DHT节点。
发明内容
本发明实施例提供一种哈希映射平面的映射信息注册和查找方法、 设备 及***， 实现以 EID前缀进行映射信息的注册和查找。
本发明实施例提供一种哈希映射平面的映射信息注册方法， 包括： 多个区域哈希映射平面分别设定各自区域哈希映射平面的哈希位数 m; 第一区域哈希映射平面内的第一分布式哈希列表（DHT )节点如确定收 到的映射注册报文中的端点身份标识 （EID )前缀属于所述第一区域哈希映 射平面管理， 则匹配该 EID前缀的位数， 执行哈希操作；
该第一 DHT 节点根据所述哈希操作的结果进行匹配， 将映射注册报文 发送给负责维护该映射注册报文中注册信息的第二 DHT节点。
优选地， 该第一 DHT节点如确定收到的映射注册 文中的 EID前缀不 属于所述第一区域哈希映射平面管理， 执行以下处理：
将该映射注册报文发送给本区域哈希映射平面内的互通节点；
该互通节点确定该 EID前缀所属的第二区域哈希映射平面， 将映射注册 报文发送给所述第二区域哈希映射平面处理。
优选地， 所述匹配该 EID前缀的位数， 执行哈希操作， 包括：
当该 EID前缀位数大于或等于 m时， 则选择该 EID前缀的前 m位前缀 进行哈希操作； 当该 EID前缀位数小于 m时， 将该 EID前缀拆分为多个 m位前缀， 分 别对所述多个 m位前缀进行哈希操作。
优选地， 所述确定该 EID前缀属于所述第一区域哈希映射平面管理， 包 括：
如该 EID前缀在所述第一区域哈希映射平面分配的 EID前缀范围内，则 该 EID前缀属于所述第一区域哈希映射平面管理，如所述 EID前缀不在所述 第一区域哈希映射平面分配的 EID前缀范围内， 则不属于所述第一区域哈希 映射平面管理。
优选地，该第一 DHT节点将该映射注册报文发送给所述第二 DHT节点， 包括：
所述第一 DHT 节点发送该映射注册 文时将所述哈希操作的结果附带 在该映射注册报文中， 或者， 在该映射注册报文中添加指示位， 该指示位表 示已对该映射注册报文执行了哈希操作。
优选地， 该第一 DHT 节点根据所述哈希操作的结果进行匹配， 将映射 注册报文发送给第二 DHT节点， 包括：
如该第一 DHT节点分别对所述多个 m位前缀进行哈希操作， 则该第一 DHT 节点根据所述哈希操作得到的多个哈希值进行匹配， 确定所述多个 m 位前缀对应的一个或多个第二 DHT 节点， 然后将映射注册报文发送给所述 第二 DHT节点。 优选地， 还包括：
该第一 DHT节点如确定收到的映射注册 文中的 EID前缀部分属于所 述第一区域哈希映射平面管理， 另一部分不属于所述第一区域哈希映射平面 管理， 则：
对属于所述第一区域哈希映射平面管理的部分 EID前缀， 匹配所述部分 EID前缀的位数， 执行相应的哈希操作， 并根据所述哈希操作的结果进行匹 配， 将映射注册报文发送给该第二 DHT节点；
对不属于所述第一区域哈希映射平面管理的部分 EID前缀，不进行处理， 或者， 将该映射注册报文发送给本区域哈希映射平面内的互通节点， 由该互 优选地， 该第一 DHT节点如确定收到的映射注册报文中的 EID前缀部 分属于所述第一区域哈希映射平面管理， 另一部分不属于所述第一区域哈希 映射平面管理， 包括：
该第一 DHT节点执行前缀匹配 , 判断该 EID前缀不完全在所述第一区 域哈希映射平面分配的 EID前缀范围内；
该第一 DHT 节点按照所述第一区域哈希映射平面的哈希位数 m将该 EID前缀拆分为多个 m位前缀；
该第一 DHT节点对所述多个 m位前缀再次执行前缀匹配， 确定其中属 于所述第一区域哈希映射平面管理的部分 EID前缀和不属于所述第一区域哈 希映射平面管理的部分 EID前缀。 本发明实施例还提供另一种哈希映射平面的映射信息查找方法， 包括： 第一区域哈希映射平面内的第一分布式哈希列表（DHT )节点收到查找 的端点身份标识 （EID )地址属于所述第一区域哈希映射平面管理的映射请 求报文时， 对该 EID地址的 m位前缀进行哈希操作， 其中， m为本区域哈希 映射平面的哈希位数；
该第一 DHT 节点根据哈希结果进行匹配， 将映射请求报文发送给负责 维护该 EID地址的映射信息的第二 DHT节点， 由该第二 DHT节点将对应于 该 EID地址的映射信息返回给映射请求方。
优选地， 该第一 DHT节点如确定收到的映射请求 ^艮文中查找的 EID地 址不属于所述第一区域哈希映射平面管理， 执行以下处理： 将该映射请求报文发送给所述第一区域哈希映射平面内的互通节点； 该互通节点确定该 EID地址所属的第二区域哈希映射平面， 将映射请求 报文发送给所述第二区域哈希映射平面处理。 本发明实施例还提供一种分布式哈希列表 DHT节点， 包括：
设置模块， 其设置为设置所述 DHT所属的第一区域哈希映射平面的哈 希位数 m; 接收模块， 其设置为接收映射注册报文；
操作模块， 其设置为匹配所述映射注册报文中端点身份标识 （EID )前 缀的 m位， 执行哈希操作； 以及
确定模块， 其设置为根据所述操作模块进行哈希操作的结果确定负责维 护映射信息的 DHT节点。 优选地， 所述操作模块是设置为： 当所述 EID前缀位数大于或等于 m时， 则选择该 EID前缀的前 m位前 缀进行哈希操作； 当所述 EID前缀位数小于 m时， 将该 EID前缀拆分为多 个 m位前缀， 分别对所述多个 m位前缀进行哈希操作。 优选地， 所述 DHT节点还包括：
发送模块， 其设置为向负责维护映射信息的 DHT 节点发送所述映射注 册报文， 将所述哈希操作的结果附带在该映射注册报文中， 或者， 在该映射 注册报文中添加指示位，该指示位表示已对该映射注册报文执行了哈希操作。 优选地， 所述确定模块是设置为： 根据对所述多个 m位前缀进行哈希操作得到的多个哈希值进行匹配，确 定所述多个 m位前缀对应的负责维护映射信息的 DHT节点。 优选地， 所述操作模块是设置为：
如所述映射注册 ^艮文中的 EID前缀部分属于所述第一区域哈希映射平面 管理， 另一部分不属于所述第一区域哈希映射平面管理， 则：
对属于所述第一区域哈希映射平面管理的部分 EID前缀， 匹配所述部分
EID前缀的 m位， 执行相应的哈希操作； 对不属于所述第一区域哈希映射平 面管理的部分 EID前缀， 不进行处理， 或者， 将该映射注册报文发送给所述 第一区域哈希映射平面内的互通节点， 由该互通节点将映射注册报文发送给 其他区域哈希映射平面处理。 优选地， 所述操作模块是设置为： 按照所述第一区域哈希映射平面的哈希位数 m将该 EID前缀拆分为多个 m位前缀；
对所述多个 m位前缀再次执行前缀匹配，确定其中属于所述第一区域哈 希映射平面管理的部分 EID前缀和不属于所述第一区域哈希映射平面管理的 部分 EID前缀。 本发明实施例还提供另一种分布式哈希列表 DHT节点， 包括： 接收模块， 其设置为接收映射请求报文；
操作模块， 其设置为根据所述映射请求报文中的端点身份标识 EID地址 的 m位前缀进行哈希 , m为所述 DHT节点所属的第一区域哈希映射平面的 哈希位数 m; 以及
发送模块， 其设置为根据哈希操作的结果将所述映射请求报文发送到负 责维护映射信息的 DHT节点， 由该负责维护映射信息的 DHT节点将对应于 该 EID地址的映射信息返回给映射请求方。 优选地， 所述操作模块是设置为：
如所述映射请求报文中的 EID地址不属于所述第一区域哈希映射平面管 理， 执行以下处理： 将该映射请求报文发送给所述第一区域哈希映射平面内的互通节点， 由 该互通节点确定该 EID地址所属的第二区域哈希映射平面， 将映射请求报文 发送给所述第二区域哈希映射平面处理。 本发明实施例还提供一种哈希映射 平面的映射信息注册和查找***， 包括多个区域哈希映射平面， 至少一个区 域哈希映射平面内包括报文接收节点和互通节点，
所述报文接收节点， 设置为执行上本发明实施例提供的两种 DHT 节点 的功能；
所述互通节点， 设置为维护其他哈希映射平面的 EID前缀范围， 向其他 哈希映射平面转发所述映射注册报文和映射请求报文。
本发明实施例中，根据 EID前缀的 m位进行哈希操作，并根据哈希操作 的结果确定负责维护映射信息的 DHT节点，从而使得 DHT节点能够根据 EID 前缀注册和查找映射信息。 附图概述
图 la是相关技术中 LISP网络的基本逻辑架构示意图；
图 lb是相关技术中基于 DHT的分域哈希映射平面的示意图；
图 2a是本发明实施例提供的哈希映射平面的映射信息注册方法的流程 示意图；
图 2b是本发明实施例提供的哈希映射平面的映射信息查找方法的流程 示意图；
图 3是分域哈希映射平面中映射信息注册的流程示意图；
图 4是分域哈希映射平面中映射信息查找的流程示意图；
图 5是本发明实施例一中映射信息的注册方法的流程示意图；
图 6是本发明实施例二中映射信息的注册方法的流程示意图；
图 7是本发明实施例三中映射信息的注册方法的流程示意图；
图 8是本发明实施例四中映射信息的注册方法的流程示意图；
图 9是本发明实施例五中映射信息的查找方法的流程示意图；
图 10是本发明实施例六提供的 DHT节点的结构示意图；
图 11是本发明实施例七提供的 DHT节点的结构示意图。 本发明的较佳实施方式
为使本发明的目的、 技术方案和优点更加清楚明白， 下文中将结合附图 对本发明的实施例进行详细说明。 需要说明的是， 在不冲突的情况下， 本申 请中的实施例及实施例中的特征可以相互任意组合。
为了更清楚的描述本发明实施例的内容， 对本发明实施例中涉及的相关 概念做如下规定：
DHT节点： 构成哈希映射平面的节点。 每个 DHT节点能够对映射注册 / 映射请求报文中的 EID前缀/ EID地址信息进行区域前缀匹配，并能够执行哈 希运算， 根据哈希运算的结果判断存储映射信息的目的 DHT节点。 若 DHT 节点接收到映射信息的哈希结果匹配自身配置的哈希标识， 则存储维护该信 息， 并处理该映射信息对应的相关信令， 如映射注册报文和映射请求报文。
报文接收节点： 哈希映射平面中与映射注册 /映射请求发起方（在身份位 置分离架构中即为站点 ETR或 ITR )进行连接的 DHT节点。
互通节点： 哈希映射平面中部署的用于与其他哈希映射平面进行互通的 节点。 互通节点中维护其他哈希映射平面的相关信息， 包括其他哈希映射平 面负责维护的前缀映射范围及其他哈希映射平面的互通节点地址和接口信息 等。
本发明实施例提供一种哈希映射平面的映射信息注册方法， 如图 2a 所 示， 包括：
Figure imgf000011_0001
步骤 102,某一区域哈希映射平面内的第一分布式哈希列表 DHT节点如 确定收到的映射注册 ^艮文中的 EID前缀属于本区域哈希映射平面管理， 则匹 配该 EID前缀的位数， 执行相应的哈希操作；
步骤 103 , 该第一 DHT节点根据所述哈希操作的结果进行匹配， 将映射 注册报文发送给负责维护该映射注册报文中注册信息的第二 DHT节点。
优选的， 还包括：
该第一 DHT节点如确定收到的映射注册 ^艮文中的 EID前缀不属于本区 域哈希映射平面管理， 执行以下处理：
将该映射注册报文发送给本区域哈希映射平面内的互通节点；
该互通节点确定该 EID前缀所属的区域哈希映射平面， 将映射注册报文 发送给该 EID前缀所属的区域哈希映射平面处理。
优选的， 所述匹配该 EID前缀的位数， 执行相应的哈希操作， 包括： 当该 EID前缀位数大于或等于 m时， 则选择该 EID前缀的前 m位前缀 进行哈希操作； 当该 EID前缀位数小于 m时， 将该 EID前缀拆分为多个 m位前缀， 分 别对所述多个 m位前缀进行哈希操作。
优选的， 所述确定该 EID前缀属于本区域哈希映射平面管理， 包括： 如该 EID前缀在本区域哈希映射平面分配的 EID前缀范围内 ,则该 EID 前缀属于本区域哈希映射平面管理， 否则不属于本区域哈希映射平面管理。
其中， 优选的， 第一 DHT 节点将该映射注册报文发送给下一节点， 包 括：
该第一 DHT 节点发送该映射注册报文时将所述哈希操作的结果附带在 该映射注册报文中， 或者， 在该映射注册报文中添加指示位， 该指示位表示 已对该映射注册报文执行了哈希操作。 该方法还包括：
该第一 DHT 节点根据所述哈希操作的结果进行匹配， 将映射注册报文 发送给第二 DHT节点， 包括：
如该第一 DHT节点分别对所述多个 m位前缀进行哈希操作， 则该第一 DHT 节点根据所述哈希操作得到的多个哈希值进行匹配， 确定所述多个 m 位前缀对应的一个或多个第二 DHT 节点， 然后将映射注册报文发送给所述 第二 DHT节点。
优选的， 该方法还包括：
该第一 DHT节点如确定收到的映射注册 文中的 EID前缀部分属于本 区域哈希映射平面管理， 另一部分不属于本区域哈希映射平面管理， 则： 对属于本区域哈希映射平面管理的部分 EID前缀，匹配所述部分 EID前 缀的位数， 执行相应的哈希操作， 并根据所述哈希操作的结果进行匹配， 将 映射注册报文发送给该第二 DHT节点。
对不属于本区域哈希映射平面管理的部分 EID前缀，不进行处理，或者， 将该映射注册报文发送给本区域哈希映射平面内的互通节点， 由该互通节点 优选的， 该方法还包括：
该第一 DHT节点如确定收到的映射注册 文中的 EID前缀部分属于本 区域哈希映射平面管理， 另一部分不属于本区域哈希映射平面管理， 包括： 该第一 DHT节点执行前缀匹配， 判断该 EID前缀不完全在本区域哈希 映射平面分配的 EID前缀范围内；
该第一 DHT节点按照本区域哈希映射平面的哈希位数 m将该 EID前缀 拆分为多个 m位前缀；
该第一 DHT节点对所述多个 m位前缀再次执行前缀匹配， 确定其中属 于本区域哈希映射平面管理的部分 EID前缀和不属于本区域哈希映射平面管 理的部分 EID前缀。 本发明实施例提供一种哈希映射平面的映射信息查找方法， 如图 2b 所 示， 包括：
步骤 201 ,某一区域哈希映射平面内的第一分布式哈希列表 DHT节点收 到查找的 EID 地址属于本区域哈希映射平面管理的映射请求 文时， 对该 EID地址的 m位前缀进行哈希， m为本区域哈希映射平面的哈希位数 m;
步骤 202, 该第一 DHT节点根据哈希结果进行匹配， 将映射请求报文发 送给负责维护该 EID地址的映射信息的第二 DHT节点，由该第二 DHT节点 将对应于该 EID地址的映射信息返回给请求方。
优选的， 该第一 DHT节点如确定收到的映射请求 ^艮文中查找的 EID地 址不属于本区域哈希映射平面管理， 执行以下处理： 将该映射请求报文发送给本区域哈希映射平面内的互通节点； 该互通节点确定该 EID地址所属的区域哈希映射平面， 将映射请求报文 发送给该 EID地址所属的区域哈希映射平面处理。
需要说明的是， 本发明实施方式描述中是以多个区域哈希映射平面互通 的分域哈希映射平面架构为例进行描述， 该发明中提到的相关方法同样适用 于单个哈希映射平面架构。
图 3所示是分域哈希映射平面中映射信息注册的流程。 该流程中包括两 种场景， 用户当前连接区域映射平面即为用户的注册映射平面时， 该注册方 式为本地注册； 用户当前连接区域映射平面不是用户的注册映射平面时， 当 前区域映射平面判断用户的注册映射平面， 并进行映射注册 4艮文转发， 该注 册方式为跨域注册。 如下所示分别为两种注册方式的注册流程： 本地注册流程：
301 : 区域哈希映射平面由多个 DHT节点构成。 ETR1与当前所在区域 的区域哈希映射平面中的一个节点连接， ETR1 需要执行向映射平面发送注 册报文等操作时， 均会将报文发送给该节点。 该步骤中， ETR1 向当前区域 哈希映射平面中的报文接收节点发送映射注册报文。
302: 由于区域映射平面由运营商划分， 运营商在部署区域映射平面时， 每个映射平面可分配一定的 EID前缀， 该区域哈希映射平面管理该前缀范围 内所有 EID地址对应的映射信息。 因此， 区域哈希映射平面内的报文接收节 点接收到映射注册报文后， 首先对注册信息中的 EID地址执行前缀匹配， 判 断是否属于本地区域映射平面的管理范围。若判断属于，则进一步对注册 EID 地址进行哈希操作， 根据哈希结果判断该映射信息应当存在区域映射平面内 的哪个 DHT节点上。
303 : 根据哈希匹配结果， 区域映射平面内的报文接收节点将映射注册 报文转发给区域内目的 DHT节点， 由该节点对注册信息保存维护。
跨域注册流程：
304: ETR2向当前所在区域哈希映射平面的报文接收节点发送映射注册 报文；
305: 报文接收节点接收到映射注册报文后， 对注册信息中的 EID地址 执行前缀匹配。 若该节点判断注册报文中 EID不属于本地哈希映射平面的管 理范围， 则将该映射注册报文转发给本地区域哈希映射平面内部署的互通节 点 1。
306: 报文接收节点将映射注册报文转发给互通节点 1。
307: 区域映射平面中互通节点维护所有其他各区域映射平面的 EID前 缀管理信息和互通节点信息。 因此互通节点 1根据注册报文中的 EID信息， 查找该注册 EID对应的注册信息应属于哪个区域哈希映射平面的管理范围。
308: 互通节点 1查找到注册信息属于区域哈希映射平面 2的管理范围， 并查找到区域哈希映射平面 2的互通节点 2, 互通节点 1将注册报文转发给 互通节点 2。
309: 互通节点 2对注册信息中的 EID地址执行前缀匹配， 判断是否属 于本地区域映射平面的管理范围。 若判断属于， 则进一步对注册 EID地址进 行哈希操作， 根据哈希结果判断该映射信息应当存在区域映射平面内的哪个 DHT节点上。
310: 根据哈希匹配结果， 互通节点 2将映射注册报文转发给区域内的 目的 DHT节点， 由该节点对注册信息保存维护。
图 4所示是分域哈希映射平面中映射信息查找的流程。 该流程中包括两 种场景， 用户查找的映射信息属于用户当前连接区域映射平面的管理范围， 该映射请求方式为本地查找； 当用户查找的映射信息不属于用户当前连接区 域映射平面的管理范围， 用户当前连接区域映射平面需要将用户的映射查找 请求转发给维护该查找的映射信息的区域映射平面， 该映射请求方式为跨域 查找。 如下所示分别为两种请求方式的查找流程：
本地查找流程：
401 : ITR1向当前所连接区域哈希映射平面的报文接收节点发送映射请 求报文；
402: 报文接收节点接收到映射请求报文后， 对请求报文中的 EID地址 执行前缀匹配， 判断该 EID地址是否属于本地区域映射平面的管理范围。 若 判断属于， 则进一步对请求的 EID地址进行哈希操作， 根据哈希结果判断该 映射信息存储在区域映射平面内的哪个 DHT节点上。
403 : 根据哈希匹配结果， 区域映射平面内的报文接收节点将映射请求 才艮文转发给对应的映射信息维护 DHT 节点， 由该节点执行映射响应的相关 操作。
跨域查找流程：
404: ITR2向当前所在区域哈希映射平面的报文接收节点发送映射请求 报文；
405: 报文接收节点接收到映射请求报文后， 对请求报文中的 EID地址 执行前缀匹配。 若该节点判断请求报文中查找的 EID不属于本地哈希映射平 面的管理范围， 则将该映射注册报文转发给本地区域哈希映射平面内部署的 互通节点 1。
406: 报文接收节点将映射请求报文转发给互通节点 1。
407: 互通节点 1根据请求报文中的 EID信息， 判断该请求 EID对应的 映射信息应属于哪个区域哈希映射平面的管理范围。
408: 互通节点 1 查找到请求报文查找的映射信息属于区域哈希映射平 面 2的管理范围， 并查找到区域哈希映射平面 2的互通节点 2 , 互通节点 1 将映射请求报文转发给互通节点 2。
409: 互通节点 2对映射请求信息中的 EID地址执行前缀匹配， 判断是 否属于本地区域映射平面的管理范围。 若判断属于， 则进一步对请求 EID地 址进行哈希操作， 根据哈希结果判断该映射信息存在区域映射平面内的哪个 DHT节点上。
410:根据哈希匹配结果，互通节点 2将映射请求报文转发给对应的映射 信息维护 DHT节点， 由该节点执行映射响应的相关操作。
为了更加清楚说明本发明实施例提供的映射信息注册和查找的方案， 下 面结合具体实施例对本发明提供的方案进行介绍。
实施例一
图 5所示是基于本地注册应用场景下本发明实施例提供的映射信息的注 册方法的流程示意图。 本实施例适用于当区域映射平面的哈希位数为 m时， LISP MN或站点注册的 EID前缀位数大于等于 m的 LISP Site的注册场景。
为能够在实施例描述中进行更好的说明， 此处假设该区域映射平面管理 的 EID地址为 32bit IPv4地址， 且区域映射平面设定的哈希位数 m为 16 , 站 点注册 EID前缀位数大于等于 m, 假设为 20位。 如图 5所示， 具体包括以 下步骤：
501 : Sitel ETR向本地区域哈希映射平面的连接节点发送映射注册报文， 其中注册的 EID前缀位数大于等于区域哈希映射平面设定的哈希位数 m,假 设才艮文中注册的 20位 EID前缀为 1.1.0/20。 502: 本地注册场景中， Sitel ETR连接的报文接收节点通过前缀匹配判 断该映射信息属于本地哈希映射平面的管理范围， 则报文接收节点按照区域 映射平面设定的哈希位数进行哈希操作， 即， 报文接收节点对 1.1/16的前缀 进行哈希操作。
503:报文接收节点根据哈希值进行匹配，确定负责维护该映射信息的目 的 DHT节点。报文接收节点将前缀 1丄 0/20的映射注册报文转发给负责存储 维护该映射信息的目的 DHT节点。
可选地， 报文接收节点转发映射注册报文时可将哈希运算结果附带在报 文中， 或在报文中添加指示位， 向目的维护 DHT节点或转发 DHT节点（若 存在 )指明已对该注册报文执行了哈希位哈希操作。
实施例二
图 6所示是基于本地注册场景下本发明实施例提供的映射信息的注册方 法的另一流程示意图。 本实施例适用与当区域映射平面的哈希位数为 m时， 注册前缀位数小于 m的 LISP Site的注册场景。
为能够在实施例描述中进行更好的说明， 此处假设该区域映射平面管理 的 EID地址为 32bit IPv4地址， 且区域映射平面设定的哈希位数 m为 16位， 站点注册 EID前缀位数小于 m, H没为 14位。 如图 6所示， 具体包括以下 步骤：
601 : Site2 ETR向本地区域哈希映射平面的 4艮文接收节点发送映射注册 报文， 其中注册的 EID前缀位数小于区域哈希映射平面设定的哈希位数 m。 殳设 4艮文中注册的 14位 EID前缀为 2.0/14。
602: 本地注册场景中， Site2 ETR连接的报文接收节点通过前缀匹配判 断该映射信息属于本地哈希映射平面的管理范围， 则报文接收节点按照区域 映射平面设定的哈希位数 m,将注册的 EID前缀拆分为多个 m位前缀分别执 行哈希操作， 即， 报文接收节点将 14位的 EID前缀拆分为 4个 16位前缀 2.0/16, 2.1/16, 2.2/16和 2.3/16, 并分别对四个 16位前缀进行哈希操作。
603： ^艮文接收节点根据哈希值进行匹配， 确定四个 16位前缀对应的维 护 DHT节点。 604: 报文接收节点将 Site2 ETR注册的 14位前缀注册报文复制后， 分 别发送给步骤 603中确定的维护 DHT节点。
可选地，报文接收节点可将哈希拆分运算结果附带在转发的注册报文中， 或在 4艮文中添加指示位， 向目的维护 DHT节点或转发 DHT节点 （若存在） 指明已对该注册报文执行了哈希位哈希操作，避免目的维护节点或转发 DHT 节点重复执行哈希拆分运算， 造成转发环路。
实施例三：
图 7所示^ ^于跨域注册场景的映射信息的注册方法的示意图， 本实施 例适用于用户当前连接的区域哈希映射平面不是用户的注册映射平面时， 区 域哈希映射平面将报文转发至用户注册映射平面完成注册的场景。 如图 7所 示， 包括以下步骤：
701 : Site3 ETR向当前所在区域哈希映射平面的报文接收节点发送映射 注册 4艮文；
702: 报文接收节点接收到映射注册报文后， 对注册信息中的 EID地址 执行前缀匹配。 若该节点判断注册报文中 EID不属于本地哈希映射平面的管 理范围， 则将该映射注册报文转发给本地区域哈希映射平面内部署的互通节 点 1。
703: 报文接收节点将映射注册报文转发给互通节点 1。
704: 互通节点 1根据注册 ^艮文中的 EID前缀信息， 查找该注册 EID前 缀的注册信息应属于哪个区域哈希映射平面的管理范围。 区域映射平面中互 通节点维护所有其他各区域映射平面的 EID前缀管理信息和互通节点信息。
705: 互通节点 1查找到注册 ^艮文属于区域哈希映射平面 2的管理范围， 并查找到区域哈希映射平面 2的互通节点 2, 互通节点 1将注册报文转发给 互通节点 2。
706: 文被转发到区域映射平面的互通节点 2后，互通节点 2在本地区 域映射平面内对注册 4艮文的处理流程同实施例一和实施例二。
需要说明的是， 从上述步骤可看出， 当前连接区域哈希映射平面接收到 映射注册信息后， 若该映射注册信息不属于自身管理范围， 则将该映射注册 报文转发给注册报文对应的区域哈希映射平面， 对应区域哈希映射平面接收 到报文后才执行按照哈希位哈希的操作。 因此， 各区域哈希映射平面间哈希 位的选择相互独立， 不受影响， 各个区域哈希映射平面可根据自身部署和需 求自主选择哈希位数。
实施例四：
图 8所示^ ^于跨域注册场景映射注册信息的注册方法的示意图， 本实 施例适用于当前用户注册的映射信息， 无法由当前连接的区域哈希映射平面 完全维护， 需要由多个区域哈希映射平面共同维护的场景。
为能够在实施例描述中进行更好的说明， 此处假设两个区域哈希映射平 面 （区域映射平面 1和区域映射平面 2 )分别负责管理覆盖在 EID地址前缀 3.0/15和 3.2/15内的映射信息，区域哈希映射平面一设定的哈希位数 m为 16 位， 区域哈希映射平面二设定的哈希位数 m为 15位。 如图 8所示， 具体包 括以下步骤：
801 : Site4 ETR向当前所在区域哈希映射平面 1内的报文接收节点发送 映射注册报文， 报文中注册的 EID前缀覆盖的注册信息无法由区域哈希映射 平面 1单独维护。 ^艮设， 映射注册 ^艮文中注册的 EID前缀为 3.0/14。
802: 区域哈希映射平面 1内的报文接收节点接收到该映射注册报文后， 首先通过前缀匹配判断该映射信息不完全属于本地哈希映射平面的管理范 围。
803:报文接收节点将该报文复制一份发送给本地区域哈希映射平面内部 署的互通节点 1。
需要说明的是， 报文接收节点也可选择不执行 803 , 仅在区域内处理属 于本地哈希映射平面管理范围的映射信息。 这种场景下后续步骤 806-808略 去。
804: 区域哈希映射平面 1 内的报文接收节点按照区域哈希映射平面 1 内设定的哈希位数 ml将注册前缀拆分为多个 ml位前缀。
也就是说， 14位前缀被拆分为 3.0/16, 3.1/16, 3.2/16和 3.3/16四个 16 位前缀。 报文接收节点再次执行前缀匹配， 选取属于本地管理范围的 ml位 前缀执行哈希操作。 即， 报文接收节点判断 3.0/16和 3.1/16属于本地管理范 围， 则对 3.0/16和 3.1/16两个前缀进行哈希， 判断负责维护该映射信息的目 的 DHT节点。
805: 报文接收节点将前缀 3.0/14 的映射注册报文复制后发送给负责维 护该映射信息的目的 DHT节点。
步骤 803和步骤 804、 805的执行顺序不分前后， 亦可同时执行。
806: 互通节点 1接收到复制的注册 文后， 对注册 EID前缀进行匹配 (该匹配过程也可包括前缀拆分匹配过程） ， 判断该注册前缀信息属于哪个 区域哈希映射平面的管理范围。
807: 互通节点 1查找到注册 ^艮文属于区域哈希映射平面 2的管理范围， 并查找到区域哈希映射平面 2的互通节点 2, 互通节点 1将映射注册 文转 发给互通节点 2。
需要注意的是， 互通节点 1在向互通节点 2转发注册报文时可选择添加 标记， 避免互通节点 2进行前缀匹配判断后， 向区域哈希映射平面 1转发报 文， 造成转发环路。 可选的， 互通节点 2也可根据接收映射注册报文的源互 通节点 1的地址判断， 避免向区域哈希映射平面 1转发报文， 造成环路。
808: 互通节点 2接收到映射注册报文后，首先通过前缀匹配判断该映射 信息不完全属于本地哈希映射平面的管理范围。 互通节点 2按照区域哈希映 射平面 2内设定的哈希位数 m2将注册前缀拆分为多个 m2位前缀。 即， 将 该 14位前缀拆分为 3.0/15和 3.2/15两个 15位前缀。 互通节点 2再次执行前 缀匹配， 选取属于本地管理范围的 m2位前缀执行哈希操作。 即， ICR2判断 3.2/15属于区域哈希映射平面 2的管理范围， 对前缀 3.2/15执行哈希操作， 根据哈希结果判断将注册前缀 3.0/14的映射注册报文转发给发送给哪个维护 DHT节点。
需要注意的是， 互通节点 2可根据互通节点 1在映射注册报文中添加的 标记或根据互通节点 1的地址， 判断该报文无需复制发送给互通节点 1。
809: 互通节点 2将 3.0/14的映射注册报文复制发送给负责维护该映射 信息的目的 DHT节点。
实施例五： 图 9所示是本发明实施例提供的映射信息的查找方法的示意图， 在本地 查找和跨域查找场景下， 该方法的步骤分别包括：
本地查找流程：
901 : ITR1向当前所连接区域哈希映射平面的报文接收节点发送映射请 求报文；
902: 报文接收节点接收到映射请求报文后， 对请求报文中的 EID地址 执行前缀匹配， 判断该 EID地址是否属于本地区域映射平面的管理范围。 若 判断属于， 则对请求的 EID地址按照本地区域映射平面设定的哈希位数 ml 进行哈希操作， 根据哈希结果判断该映射信息存储在区域映射平面内的哪个 DHT节点上。
903 : 根据哈希匹配结果， 区域映射平面内的报文接收节点将映射请求 报文转发给维护给映射信息的目的 DHT 节点， 由该节点执行映射响应的相 关操作。
跨域查找流程：
904: ITR2向当前所在区域哈希映射平面的报文接收节点发送映射请求 报文；
905: 报文接收节点接收到映射请求报文后， 对请求报文中的 EID地址 执行前缀匹配。 若该节点判断请求报文中查找的 EID不属于本地哈希映射平 面的管理范围， 则将该映射注册报文转发给本地区域哈希映射平面内部署的 互通节点 1。
906: 报文接收节点将映射请求报文转发给互通节点 1。
907: 互通节点 1根据请求报文中的 EID信息， 判断该请求 EID对应的 映射信息应属于哪个区域哈希映射平面的管理范围。
908: 互通节点 1 查找到请求报文查找的映射信息属于区域哈希映射平 面 2的管理范围， 并查找到区域哈希映射平面 2的互通节点 2 , 互通节点 1 映射请求报文转发给互通节点 2。
909: 互通节点 2对映射请求信息中的 EID地址执行前缀匹配， 判断是 否属于本地区域映射平面的管理范围。 若判断属于， 则进一步对请求的 EID 地址按照区域哈希映射平面 2设定的哈希位数 m2进行哈希操作， 根据哈希 结果判断该映射信息存在区域映射平面内的哪个 DHT节点上。
910:根据哈希匹配结果，互通节点 2将映射请求报文转发给维护该映射 信息的目的 DHT节点， 由该节点执行映射响应的相关操作。
通过釆用本发明实施例提供的方法，根据 EID前缀的 m位进行哈希操作， 并根据哈希操作的结果确定负责维护映射信息的 DHT节点， 从而使得 DHT 节点能够 4艮据 EID前缀注册和查找映射信息。
实施例六
本发明实施例提供一种分布式哈希列表 DHT节点，如图 10所示， 包括： 设置模块 10, 设置为： 设置本区域哈希映射平面的哈希位数 m;
接收模块 11 , 设置为： 接收映射注册报文；
操作模块 12,设置为： 匹配所述映射注册报文中端点身份标识 EID前缀 的 m位， 执行相应的哈希操作；
确定模块 13 , 设置为： 根据所述操作模块进行哈希操作的结果确定负责 维护映射信息的 DHT节点
优选的，所述操作模块 12设置为： 当该 EID前缀位数大于或等于 m时， 则选择该 EID前缀的前 m位前缀进行哈希操作； 当该 EID前缀位数小于 m 时， 将该 EID前缀拆分为多个 m位前缀， 分别对所述多个 m位前缀进行哈 希操作。
该 DHT节点还包括：
发送模块 14, 设置为： 向负责维护映射信息的 DHT节点发送所述映射 注册报文， 将所述哈希操作的结果附带在该映射注册报文中， 或者， 在该映 射注册报文中添加指示位， 该指示位表示已对该映射注册报文执行了哈希操 作。 优选的， 所述确定模块 13设置为：
根据对所述多个 m位前缀进行哈希操作得到的多个哈希值进行匹配，确 定所述多个 m位前缀对应的负责维护映射信息的 DHT节点。 优选的， 所述操作模块 12设置为： 如所述映射注册报文中的 EID前缀 部分属于本区域哈希映射平面管理， 另一部分不属于本区域哈希映射平 面管理， 则：
对属于本区域哈希映射平面管理的部分 EID前缀，匹配所述部分 EID前 缀的 m位， 执行相应的哈希操作； 对不属于本区域哈希映射平面管理的部分 EID前缀， 不进行处理， 或者， 将该映射注册报文发送给本区域哈希映射平 面内的互通节点， 由该互通节点将映射注册报文发送给其他区域哈希映射平 面处理。 优选的， 所述操作模块 12设置为： 按照本区域哈希映射平面的哈希位 数 m将该 EID前缀拆分为多个 m位前缀；
对所述多个 m位前缀再次执行前缀匹配，确定其中属于本区域哈希映射 平面管理的部分 EID前缀和不属于本区域哈希映射平面管理的部分 EID前 缀。
实施例七
本实施例提供一种分布式哈希列表 DHT节点， 如图 11所示， 包括： 接收模块 21 , 设置为： 接收映射请求报文；
操作模块 22,设置为： 根据所述映射请求报文中的端点身份标识 EID地 址的 m位前缀进行哈希， m为本区域哈希映射平面的哈希位数 m;
发送模块 23 , 设置为： 根据哈希操作的结果将所述映射请求报文发送到 负责维护映射信息的 DHT节点， 由该负责维护映射信息的 DHT节点将对应 于该 EID地址的映射信息返回给请求方。
所述操作模块 22设置为： 如所述映射请求报文中的 EID地址不属于本 区域哈希映射平面管理， 执行以下处理：
将该映射请求报文发送给本区域哈希映射平面内的互通节点， 由该互通 节点确定该 EID 地址所属的区域哈希映射平面， 将映射请求报文发送给该 EID地址所属的区域哈希映射平面处理。
实施例八 本实施例提供一种哈希映射平面的映射信息注册和查找***， 包括多个 区域哈希映射平面， 至少一个区域哈希映射平面内包括报文接收节点和互通 节点，
所述报文接收节点设置为： 设置本区域哈希映射平面的哈希位数 m, 接 收映射注册报文， 匹配所述映射注册报文中端点身份标识 EID前缀的 m位， 执行相应的哈希操作， 根据所述操作模块进行哈希操作的结果确定负责维护 映射信息的 DHT 节点； 接收映射请求报文， 根据所述映射请求报文中的端 点身份标识 EID地址的 m位前缀进行哈希， m为本区域哈希映射平面的哈希 位数 m, 根据哈希操作的结果将所述映射请求报文发送到负责维护映射信息 的 DHT节点， 由该负责维护映射信息的 DHT节点将对应于该 EID地址的映 射信息返回给请求方；
所述互通节点设置为： 维护其他哈希映射平面的 EID前缀范围， 向其他 哈希映射平面转发所述映射注册报文和映射请求报文。
通过釆用本发明实施例提供的设备及***，根据 EID前缀的 m位进行哈 希操作， 并根据哈希操作的结果确定负责维护映射信息的 DHT 节点， 从而 使得 DHT节点能够根据 EID前缀注册和查找映射信息。
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序 来指令相关硬件完成， 所述程序可以存储于计算机可读存储介质中， 如只读 存储器、 磁盘或光盘等。 可选地， 上述实施例的全部或部分步骤也可以使用 一个或多个集成电路来实现。 相应地， 上述实施例中的各模块 /单元可以釆用 硬件的形式实现， 也可以釆用软件功能模块的形式实现。 本发明不限制于任 何特定形式的硬件和软件的结合。
工业实用 4生
在本发明实施例中，根据 EID前缀的 m位进行哈希操作，并根据哈希操 作的结果确定负责维护映射信息的 DHT节点， 从而使得 DHT节点能够根据 EID前缀注册和查找映射信息。

Claims

权 利 要 求 书
1、 一种哈希映射平面的映射信息注册方法， 包括：
各区域哈希映射平面分别设定各自区域哈希映射平面的哈希位数 m; 第一区域哈希映射平面内的第一分布式哈希列表（DHT )节点如确定收 到的映射注册报文中的端点身份标识 （EID )前缀属于所述第一区域哈希映 射平面管理， 则匹配该 EID前缀的位数， 执行哈希操作；
所述第一 DHT 节点根据所述哈希操作的结果进行匹配， 将映射注册报 文发送给负责维护该映射注册报文中注册信息的第二 DHT节点。
2、 如权利要求 1所述的方法， 还包括：
所述第一 DHT节点如确定收到的映射注册 文中的 EID前缀不属于所 述第一区域哈希映射平面管理， 执行以下处理：
该互通节点确定该 EID前缀所属的第二区域哈希映射平面， 将映射注册 报文发送给所述第二区域哈希映射平面处理。
3、 如权利要求 1或 2所述的方法， 其中：
所述匹配该 EID前缀的位数， 执行哈希操作， 包括：
当所述 EID前缀位数大于或等于 m时， 则选择该 EID前缀的前 m位前 缀进行哈希操作；
当所述 EID前缀位数小于 m时， 将该 EID前缀拆分为多个 m位前缀， 分别对所述多个 m位前缀进行哈希操作。
4、 如权利要求 3所述的方法， 其中；
所述确定该 EID前缀属于所述第一区域哈希映射平面管理， 包括： 如所述 EID前缀在所述第一区域哈希映射平面分配的 EID前缀范围内， 则该 EID前缀属于所述第一区域哈希映射平面管理，如所述 EID前缀不在所 述第一区域哈希映射平面分配的 EID前缀范围内， 则不属于所述第一区域哈 希映射平面管理。
5、 如权利要求 1或 2或 4所述的方法， 其中；
所述第一 DHT节点将该映射注册报文发送给所述第二 DHT节点，包括： 所述第一 DHT 节点发送该映射注册报文时将所述哈希操作的结果附带 在该映射注册报文中， 或者， 在该映射注册报文中添加指示位， 该指示位表 示已对该映射注册报文执行了哈希操作。
6、 如权利要求 3所述的方法， 其中：
所述第一 DHT 节点根据所述哈希操作的结果进行匹配， 将映射注册报 文发送给第二 DHT节点， 包括：
如所述第一 DHT节点分别对所述多个 m位前缀进行哈希操作， 则该第 一 DHT节点根据所述哈希操作得到的多个哈希值进行匹配 ,确定所述多个 m 位前缀对应的一个或多个第二 DHT 节点， 然后将映射注册报文发送给所述 第二 DHT节点。
7、 如权利要求 1或 2或 4或 6所述的方法， 还包括：
所述第一 DHT节点如确定收到的映射注册 文中的 EID前缀部分属于 所述第一区域哈希映射平面管理， 另一部分不属于所述第一区域哈希映射平 面管理， 则：
对属于所述第一区域哈希映射平面管理的部分 EID前缀， 匹配所述部分 EID前缀的位数， 执行相应的哈希操作， 并根据所述哈希操作的结果进行匹 配， 将映射注册报文发送给该第二 DHT节点；
对不属于所述第一区域哈希映射平面管理的部分 EID前缀，不进行处理， 或者， 将该映射注册报文发送给本区域哈希映射平面内的互通节点， 由该互
8、 如权利要求 7所述的方法， 其中：
所述第一 DHT节点如确定收到的映射注册 文中的 EID前缀部分属于 所述第一区域哈希映射平面管理， 另一部分不属于所述第一区域哈希映射平 面管理， 包括：
所述第一 DHT节点执行前缀匹配， 判断该 EID前缀不完全在所述第一 区域哈希映射平面分配的 EID前缀范围内；
所述第一 DHT节点按照所述第一区域哈希映射平面的哈希位数 m将该 EID前缀拆分为多个 m位前缀；
所述第一 DHT节点对所述多个 m位前缀再次执行前缀匹配， 确定其中 属于所述第一区域哈希映射平面管理的部分 EID前缀和不属于所述第一区域 哈希映射平面管理的部分 EID前缀。
9、 一种哈希映射平面的映射信息查找方法， 包括：
第一区域哈希映射平面内的第一分布式哈希列表（DHT )节点收到查找 的端点身份标识 （EID )地址属于所述第一区域哈希映射平面管理的映射请 求报文时， 对该 EID地址的 m位前缀进行哈希操作， 其中， m为本区域哈希 映射平面的哈希位数；
所述第一 DHT 节点根据哈希结果进行匹配， 将映射请求报文发送给负 责维护该 EID地址的映射信息的第二 DHT节点， 由该第二 DHT节点将对应 于该 EID地址的映射信息返回给映射请求方。
10、 如权利要求 9所述的方法， 还包括：
所述第一 DHT节点如确定收到的映射请求 文中查找的 EID地址不属 于所述第一区域哈希映射平面管理， 执行以下处理：
将该映射请求报文发送给所述第一区域哈希映射平面内的互通节点； 该互通节点确定该 EID地址所属的第二区域哈希映射平面， 将映射请求 报文发送给所述第二区域哈希映射平面处理。
11、 一种分布式哈希列表 DHT节点， 包括：
设置模块， 其设置为设置所述 DHT所属的第一区域哈希映射平面的哈 希位数 m;
接收模块， 其设置为接收映射注册报文；
操作模块， 其设置为匹配所述映射注册报文中端点身份标识 （EID )前 缀的 m位， 执行哈希操作； 以及 确定模块， 其设置为根据所述操作模块进行哈希操作的结果确定负责维 护映射信息的 DHT节点。
12、 如权利要求 11所述的 DHT节点， 其中， 所述操作模块是设置为: 当所述 EID前缀位数大于或等于 m时 , 则选择该 EID前缀的前 m位前 缀进行哈希操作； 当所述 EID前缀位数小于 m时， 将该 EID前缀拆分为多 个 m位前缀， 分别对所述多个 m位前缀进行哈希操作。
13、 如权利要求 11或 12所述的 DHT节点， 还包括：
发送模块， 其设置为向负责维护映射信息的 DHT 节点发送所述映射注 册报文， 将所述哈希操作的结果附带在该映射注册报文中， 或者， 在该映射 注册报文中添加指示位，该指示位表示已对该映射注册报文执行了哈希操作。
14、 如权利要求 12所述的 DHT节点， 其中， 所述确定模块是设置为： 根据对所述多个 m位前缀进行哈希操作得到的多个哈希值进行匹配，确 定所述多个 m位前缀对应的负责维护映射信息的 DHT节点。
15、 如权利要求 11或 12或 14所述的 DHT节点， 其中， 所述操作模块 是设置为：
如所述映射注册 ^艮文中的 EID前缀部分属于所述第一区域哈希映射平面 管理， 另一部分不属于所述第一区域哈希映射平面管理， 则：
对属于所述第一区域哈希映射平面管理的部分 EID前缀， 匹配所述部分 EID前缀的 m位， 执行相应的哈希操作； 对不属于所述第一区域哈希映射平 面管理的部分 EID前缀， 不进行处理， 或者， 将该映射注册报文发送给所述 第一区域哈希映射平面内的互通节点， 由该互通节点将映射注册报文发送给 其他区域哈希映射平面处理。
16、 如权利要求 15所述的 DHT节点， 其中， 所述操作模块是设置为： 按照所述第一区域哈希映射平面的哈希位数 m将该 EID前缀拆分为多个 m位前缀； 对所述多个 m位前缀再次执行前缀匹配，确定其中属于所述第一区域哈 希映射平面管理的部分 EID前缀和不属于所述第一区域哈希映射平面管理的 部分 EID前缀。
17、 一种分布式哈希列表 DHT节点， 包括：
接收模块， 其设置为接收映射请求报文；
操作模块， 其设置为根据所述映射请求报文中的端点身份标识 EID地址 的 m位前缀进行哈希 , m为所述 DHT节点所属的第一区域哈希映射平面的 哈希位数 m; 以及
发送模块， 其设置为根据哈希操作的结果将所述映射请求报文发送到负 责维护映射信息的 DHT节点， 由该负责维护映射信息的 DHT节点将对应于 该 EID地址的映射信息返回给映射请求方。
18、 如权利要求 17所述的 DHT节点， 其中， 所述操作模块是设置为： 如所述映射请求报文中的 EID地址不属于所述第一区域哈希映射平面管 理， 执行以下处理：
将该映射请求报文发送给所述第一区域哈希映射平面内的互通节点， 由 该互通节点确定该 EID地址所属的第二区域哈希映射平面， 将映射请求报文 发送给所述第二区域哈希映射平面处理。
19、 一种哈希映射平面的映射信息注册和查找***， 包括多个区域哈希 映射平面， 至少一个区域哈希映射平面内包括 ^艮文接收节点和互通节点， 所述报文接收节点设置为执行权利要求 11所述的 DHT节点的功能和权 利要求 17所述的 DHT节点的功能；
所述互通节点设置为维护其他哈希映射平面的 EID前缀范围， 向其他哈 希映射平面转发所述映射注册报文和映射请求报文。
PCT/CN2013/078640 2012-11-26 2013-07-02 哈希映射平面的映射信息注册和查找方法、设备及*** WO2013182108A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210485369.7A CN103841027B (zh) 2012-11-26 2012-11-26 哈希映射平面的映射信息注册和查找方法、设备及***
CN201210485369.7 2012-11-26

Publications (1)

Publication Number Publication Date
WO2013182108A1 true WO2013182108A1 (zh) 2013-12-12

Family

ID=49711403

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/078640 WO2013182108A1 (zh) 2012-11-26 2013-07-02 哈希映射平面的映射信息注册和查找方法、设备及***

Country Status (2)

Country Link
CN (1) CN103841027B (zh)
WO (1) WO2013182108A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105592174A (zh) * 2014-10-24 2016-05-18 中兴通讯股份有限公司 一种身份位置分离网络映射平面管理方法和映射平面

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070002869A1 (en) * 2005-07-01 2007-01-04 Microsoft Corporation Routing cache for distributed hash tables
CN101399765A (zh) * 2007-09-28 2009-04-01 华为技术有限公司 降低对等网络中热点节点负荷的方法和***
CN101505262A (zh) * 2008-02-05 2009-08-12 华为技术有限公司 一种建立路由的方法和装置
CN101741731A (zh) * 2009-12-03 2010-06-16 中兴通讯股份有限公司 内容分发网络中内容元数据的存储、查询方法及管理***
CN101945034A (zh) * 2009-07-08 2011-01-12 中兴通讯股份有限公司 一种身份标识与位置分离协议数据转发***及方法
CN101958830A (zh) * 2009-07-14 2011-01-26 中兴通讯股份有限公司 一种网络部署***及其映射和数据转发方法

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030126291A1 (en) * 2001-12-28 2003-07-03 Wang Ben B. Method and message distributor for routing requests to a processing node
CN100352233C (zh) * 2002-12-10 2007-11-28 中兴通讯股份有限公司 路由表的组织与查找方法
US7596618B2 (en) * 2004-12-07 2009-09-29 Hewlett-Packard Development Company, L.P. Splitting a workload of a node
CN101656765B (zh) * 2009-09-14 2013-01-16 中兴通讯股份有限公司 身份位置分离网络的名址映射***及数据传输方法
CN101917475B (zh) * 2010-08-18 2013-01-02 天津理工大学 一种基于p2p模式的psrd普适服务资源发现方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070002869A1 (en) * 2005-07-01 2007-01-04 Microsoft Corporation Routing cache for distributed hash tables
CN101399765A (zh) * 2007-09-28 2009-04-01 华为技术有限公司 降低对等网络中热点节点负荷的方法和***
CN101505262A (zh) * 2008-02-05 2009-08-12 华为技术有限公司 一种建立路由的方法和装置
CN101945034A (zh) * 2009-07-08 2011-01-12 中兴通讯股份有限公司 一种身份标识与位置分离协议数据转发***及方法
CN101958830A (zh) * 2009-07-14 2011-01-26 中兴通讯股份有限公司 一种网络部署***及其映射和数据转发方法
CN101741731A (zh) * 2009-12-03 2010-06-16 中兴通讯股份有限公司 内容分发网络中内容元数据的存储、查询方法及管理***

Also Published As

Publication number Publication date
CN103841027B (zh) 2018-08-14
CN103841027A (zh) 2014-06-04

Similar Documents

Publication Publication Date Title
JP5377770B2 (ja) ネームアドレスマッピングシステム、データ伝送方法及びネームアドレスマッピングメンテナンス方法
US10027623B2 (en) Internet protocol address resolution
WO2011029343A1 (zh) 身份位置分离网络的名址映射***及数据传输方法
US8804520B2 (en) Core network node selection in a mobile communication network
US8898334B2 (en) System for network deployment and method for mapping and data forwarding thereof
EP3094052B1 (en) Method and device for forwarding information
CN106572021B (zh) 一种实现网络虚拟化叠加的方法与网络虚拟化边缘节点
CN102075420B (zh) 基于位置标识和主机标识分离的***及其移动性管理方法
EP2705645A1 (en) Name-based neighbor discovery and multi-hop service discovery in information-centric networks
JP6542993B2 (ja) 要求に基づいてルートを取得する方法およびゲートウェイ
WO2009036678A1 (fr) Procédé, dispositif et système de réseau pour acheminer un message
CN108494686B (zh) 路由处理方法及装置
CN105874756B (zh) 控制信令的传输方法及设备
EP2392107A1 (en) Methods and apparatus for forming, maintaining and/or using overlapping networks
CN107070790B (zh) 一种路由学习方法及路由设备
US20120002600A1 (en) System for data communications, router, and method for data transmission and mobility management
WO2009074077A1 (fr) Méthode de réalisation de services anycast, méthode d'envoi de demandes anycast, et routeur anycast
US20190199633A1 (en) Method and apparatus for forwarding in information centric networking
WO2013071825A1 (zh) 一种实现身份位置分离网络的设备及方法
JP2023511257A (ja) パケット送信方法および装置、ならびに記憶媒体
CN102065013B (zh) 基于身份与位置分离的位置信息优化选择的***
WO2013023465A1 (zh) 身份位置分离与传统网络互联互通方法、ilr和asr
US8305959B2 (en) Hierarchical mobility label-based network
CN103167463B (zh) 更新报文的处理方法及***、映射服务器和移动节点
WO2013182108A1 (zh) 哈希映射平面的映射信息注册和查找方法、设备及***

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13800905

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13800905

Country of ref document: EP

Kind code of ref document: A1