CN114189468A - Multi-identification network system routing method based on identification clustering - Google Patents
Multi-identification network system routing method based on identification clustering Download PDFInfo
- Publication number
- CN114189468A CN114189468A CN202111289590.0A CN202111289590A CN114189468A CN 114189468 A CN114189468 A CN 114189468A CN 202111289590 A CN202111289590 A CN 202111289590A CN 114189468 A CN114189468 A CN 114189468A
- Authority
- CN
- China
- Prior art keywords
- identifier
- identification
- cluster
- information
- controller
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000009826 distribution Methods 0.000 claims abstract description 8
- 230000008569 process Effects 0.000 claims description 26
- 230000009471 action Effects 0.000 claims description 9
- 230000002730 additional effect Effects 0.000 claims description 7
- 230000009191 jumping Effects 0.000 claims description 6
- 238000011156 evaluation Methods 0.000 claims description 4
- 238000003491 array Methods 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000010845 search algorithm Methods 0.000 claims description 3
- 238000013461 design Methods 0.000 description 10
- 238000013519 translation Methods 0.000 description 9
- 230000006872 improvement Effects 0.000 description 8
- 235000008694 Humulus lupulus Nutrition 0.000 description 7
- 230000006870 function Effects 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 6
- 238000007726 management method Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 5
- 230000004083 survival effect Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000005457 optimization Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 238000003860 storage Methods 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000010485 coping Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 238000004064 recycling Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
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/34—Source routing
-
- 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/02—Topology update or discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a multi-identification network system routing method based on identification clustering, which comprises the following steps: step S1, unifying the network packet format by the multi-identification network packet coding mode; step S2, distinguishing controller types according to the control domain of the forwarding layer, wherein the controller types include a topology controller and a plurality of identification controllers, the topology controller establishes a secure channel with all routers of the forwarding layer, and the topology controller includes identification type information and network topology information; the identification controller only collects identification type information, executes an identification clustering algorithm, and analyzes identification topological distribution and cluster information; step S3, executing an identification clustering algorithm through an identification controller, calculating to obtain cluster information, and acquiring a clustering result; and step S4, realizing multi-identification routing based on the clustering result. The invention can effectively reduce the forwarding cost of the network packet on the router which does not support the self identification type, and effectively improve the semantic expression efficiency and the forwarding rate of the network packet.
Description
Technical Field
The invention relates to a network routing method, in particular to a multi-identification network system routing method based on identification clustering.
Background
With the development of science and technology, technologies which are difficult to imagine in the past, such as network education, telemedicine, intelligent robots and the like, are commonly learned by people, the assumption about the technologies of virtual reality, automatic driving, full coverage internet of things (IoT) and the like gradually becomes reality, and the complexity of network application scenes and the huge number of network users enable network information resources to show a trend of explosive growth. The service form of the internet is evolved from the initial scientific research and military special network to the current production type network taking the user consumption requirement as the core, however, the traditional network mainly based on the TCP/IP gradually shows a fatigue state when facing to the complicated and changeable future internet scene, and the self limitation is exposed.
One is that the conventional network performance is not sufficient. With the access of mobile terminals such as smart phones and portable wearable devices to networks, higher requirements are put forward on the aspects of flexible movement, expandable scale and the like of network identification, and the traditional network takes an IP address as a unique addressing identifier, so that the problems of management rigidity, insufficient mobility, difficulty in expansion and the like exist. New products of future networks all depend on network quality such as reliability, high throughput, low time delay and the like, and a traditional network is based on a host-to-host communication mode and has a situation of transmitting a large amount of repeated contents. Meanwhile, the traditional network has low granularity of performance and transmission reliability control and is not flexible enough, and cannot meet the customized performance requirements of the future internet.
And secondly, the potential safety hazard of the traditional network design. IP networks were first born from the data interaction needs within the U.S. military and scientific research institutions, and were not designed with sufficient security mechanisms in mind at the beginning. In recent years, attack action against network base protocols such as BGP and DNS is endless, and network attacks against China still occur. The current security measures for coping with attacks are only to patch the network architecture continuously, and the research on the network security is like to compete with network attackers endlessly, and the potential safety hazards only become stronger under the trends of future network scale expansion and data volume increase.
And thirdly, the exhaustion of domain name resources and unilateral meaning of network space. The global IPv4 address is basically distributed, and the top-level resolution service is centralized. And in the end of 2019, the global IPv4 is completely allocated. Besides the exhaustion of domain name resources, network spaces of various countries are threatened by network unilateral sense.
In summary, the conventional IP network cannot cope with many demands of the future internet.
Aiming at the defects of the IP network, the construction of a novel future network architecture has quite high call sound. Against the background of such demands, various future network architectures and new network identities have emerged. For example, a Content-centric Network (CCN) uses a Content identifier, and realizes functions such as intra-Network caching and route aggregation by a pull-type communication transmission manner, thereby solving the problem of transmission of a large amount of repeated Content in an IP Network, and being more suitable for future Network assumption of an instant serving (XaaS) than a conventional IP Network; the service identifier generated from the content identifier concept adopts the same naming rule as the CCN, but is different from the content identifier, the cache is not made on the routing path, the request packet can carry data, and the service identifier is more flexible compared with the content identifier; hyperbolic Routing (HR) maps a network into a measurement space, each node is given a coordinate, namely a Hyperbolic identifier, a message transmitted in the network is provided with the Hyperbolic identifier, each router only needs to store the Hyperbolic identifier of an adjacent node, a greedy geometric Routing algorithm is used for selecting a minimum geometric distance between the adjacent node and a destination as a next hop for forwarding during Routing, and a Hyperbolic Routing strategy can improve the dynamic problem caused by huge addressing space in the internet of things with a large topological scale.
The new identifiers respectively improve the defects of the traditional IP identifiers from different aspects, and the difference of design and implementation leads the new identifiers to focus on network transmission modes of different scenes so as to adapt to different network requirements. Under the differentiation and customizable requirements of network scenes, a novel network system with multiple structures coexisting and multiple routing identifiers paralleling can better support the emerging scenes and various functions, and becomes a current research hotspot in the future network field.
A multi-identification network system born under a multi-identification scene in a future network supports the parallel coexistence of various novel identifications such as identities, services, contents, hyperbolic characteristics and the like and traditional IP identifications, provides unified generation, management and analysis services for the various identifications, and provides a data transmission mode completely different from the traditional IP, solves the problems of semantic overload and IP identification centralized management of the IP network, and is more suitable for the requirements of high reliability and low time delay of the future network and the scene of internet of everything. Therefore, a multi-identity network architecture arises.
The multi-label router is used as a forwarding entity of a data plane of a multi-label network system architecture and is an actual execution entity of the multi-label routing method. The multi-identification router is different from the traditional router in the biggest characteristic that besides the traditional IP identification, the multi-identification router also supports various network identifications, and various identification transmission modes are allowed to coexist in parallel in a network topology formed by the multi-identification router so as to meet different demand scenes.
The existing multi-identifier router implementation scheme firstly provides a unified hierarchical identifier naming rule, and then introduces a multi-Identifier Translation Base (ITB) to the router for artificial division of the identifier domain, thereby implementing the function of Inter-Translation and Inter-access between different identifier domains in a network with multiple identifiers coexisting. Technically, the multi-identification router designs a data structure and an algorithm for multi-identification storage and inter-translation, realizes an efficient extensible routing addressing forwarding algorithm and a data forwarding engine for further improving performance, and ensures the information traceability security of the multi-identification router through a data packet signature mechanism.
The ITB table stores identification translation information, the key of which is the original identifier, and the value of which is the destination identifier. The matching process of the internal network packet of the multi-identification router is realized by four tables including an ITB table: (1) after receiving a multi-identification network packet, the multi-identification router judges whether the packet is a wide area network IP address or not, and directly performs DNS query; (2) otherwise, the network packet sequentially enters a Content cache Table (CS), an Interest packet Pending request Table (PIT) and a routing Information Table (FIB) for matching, and if the matching is successful, the network packet is processed or forwarded according to the Table Information; (3) if the identifier is not hit in the FIB table, the network packet identifier possibly belongs to other identification spaces, an ITB table is tried to be inquired, and if the inter-translation is successful, a forwarding port for inquiring the inter-translated identifier in the FIB table is returned; if the failure occurs, an error log is generated and the network packet is discarded.
In the prior art, the design of a multi-identification router is based on an inter-translation technology, and the performance is still insufficient, if the support situation of the router through which a multi-identification network packet passes on the identification type is complex, a plurality of different identification fields may need to pass between source and destination identifications, and multiple inter-translations without meaning may be needed, so that the forwarding efficiency is reduced; when the multi-identifier network is large in scale, if the inter-translation table in the router adopts an accurately matched hash table structure, huge storage overhead is needed, and if the inter-translation table is changed into a longest prefix matching scheme, the search efficiency needs to be sacrificed, so that the multi-identifier network becomes a bottleneck of the forwarding performance of the whole multi-identifier router.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a multi-label network system routing method capable of effectively reducing the forwarding overhead of a network packet on a router which does not support the self-label type, and effectively improving the semantic expression efficiency and forwarding rate of the network packet.
To this end, the invention provides a routing method of a multi-identification network system based on identification clustering, which comprises the following steps:
step S1, unifying the network packet format by the multi-identification network packet coding mode;
step S2, distinguishing controller types according to the control domain of the forwarding layer, wherein the controller types include a unique topology controller and a plurality of identification controllers, the topology controller establishes a secure channel with all routers of the forwarding layer, and the topology controller includes identification type information and network topology information; the identification controller comprises identification type information, identifier information and cluster information, the identification controller only establishes a safe channel with a router in an identification plane, supports the router of the identification type, collects the identification type information and executes an identification clustering algorithm so as to analyze identification topological distribution and cluster information;
step S3, executing an identification clustering algorithm through an identification controller, calculating to obtain cluster information, and acquiring a clustering result;
and step S4, realizing multi-identification routing based on the clustering result.
In a further improvement of the present invention, in step S1, the multi-identification network packet encoding manner adopts a TLV format including 5 fields including a source identifier, a destination identifier, an identification type, a transit identifier, and network packet original data; and the controller enables the key router on the cross-cluster routing path to update the field of the transit identifier according to the self-defined operation in the flow table by issuing the flow table.
A further improvement of the present invention is that, in step S2, when the network is initialized, the identifier type information of the topology controller is configured and stored by using an array, and each identifier type information represents an identifier type and is indexed by using an identifier number; the identification type information of the topology controller comprises the serial number of the identification type of the sequence hierarchy, the identification type meaning, the interface address of the identification controller corresponding to the identification type, a flow table information list consisting of dynamic arrays, the flow table number and the flow table meaning, wherein the flow table number is a serial number which is not less than 2 and is not repeated.
The invention has the further improvement that the network topology information of the topology controller is obtained by collecting the identity identifiers and link information of all routers by the topology controller, the network topology information is stored by using a hash table, each piece of network topology information represents a network node, the value of the identity identifier of the router is used as a key word for indexing, the network topology information comprises the identity identifiers of routers in sequence hierarchy, the link information of the routers, port numbers and the identity identifiers of the routers directly connected to ports, and the port numbers only list the ports with link connection relations with other routers.
In a further improvement of the present invention, in step S2, each identifier type corresponds to one identifier controller, the identifier type information of the identifier controller only includes the identifier type represented by the identifier controller, and the identifier types are synchronously obtained by the topology controller through the east-west interface; the identifier information of the identification controller is stored by using a hash table, the value of the identity identifier corresponding to the router is used as a key word for indexing, and the indexing result is a pointer pointing to specific information; the identifier information for identifying the controller comprises an identity identifier of a corresponding router of the sequence hierarchy, a cluster number of the corresponding router, whether the identifier is an edge identifier, link information of the corresponding router, a port number and a same type identifier of port direct connection, wherein the port number only lists ports which have link connection relations with other routers.
The invention is further improved in that the cluster information of the identification controller is stored using an array, each piece of cluster information represents an identification cluster in an identification plane, and the cluster number is used as a key word for indexing.
In a further improvement of the present invention, in step S3, the process of performing the calculation of the identification clustering algorithm to obtain the cluster information includes the following steps:
step S301, initializing a cluster array and a search queue to be empty;
step S302, traversing in sequence until finding an identifier for identifying an undetermined cluster in the hash table;
step S303, adding the identifiers into a search queue, and starting from the identifiers, searching all identifiers in the same cluster outwards by using a breadth-first search algorithm according to the connection condition of the identifiers;
step S304, continuously traversing and searching for the identifier identifying the next undetermined cluster in the hash table, and returning to step S303 to search until the end of the hash table is identified.
A further refinement of the invention is that said step S303 comprises the following sub-steps:
step S3031, take out an identifier of the search queue, initialize its attribute as the non-edge identifier temporarily, then traverse its port, if the identifier of the non-empty port joins the search queue and continues the breadth first search, if there is an empty port, judge the identifier is the edge identifier;
step S3032, judging the attribute of the identifier, if the attribute is an edge identifier, adding the attribute into an edge identifier array of a corresponding cluster, otherwise, adding the attribute into an internal identifier array;
step S3033, determining whether the search queue is empty, if not, returning to step S3031 to process the next identifier in the search queue, and if so, completing the search of an identified cluster.
In a further improvement of the present invention, in the step S4, the process of implementing multi-label routing based on the clustering result includes the following steps:
step S401, judging whether the source identifier and the destination identifier are in the same cluster according to the identification clustering result in the identification plane where the network packet is positioned, and if the source identifier and the destination identifier are in the same cluster, jumping to step S402 to execute the routing step in the cluster; if the source identifier and the destination identifier are different clusters, jumping to step S403 to execute a cross-cluster routing step;
step S402, directly carrying out single-point to single-point optimal path addressing on a source identifier and a destination identifier based on an identification topological graph of an identifier space so as to realize the step of routing in a cluster;
step S403, with a plurality of edge identifiers of a source cluster as starting points, a plurality of edge identifiers of a destination cluster as end points, and multiple points to multiple points, based on the fewest hops, planning an optimal path, and further obtaining one or more cross-cluster forwarding paths; and then, for the edge identifier of the source cluster and the edge identifier of the destination cluster corresponding to each cross-cluster forwarding path, calculating a first optimal path hop count from the source identifier to the edge identifier of the source cluster and a second optimal path hop count from the edge identifier of the destination cluster to the destination identifier by using a single-point-to-single-point optimal path planning algorithm, calculating the sum of the first optimal path hop count and the second optimal path hop count as an evaluation basis of the cross-cluster forwarding path, and selecting an optimal path.
The invention has the further improvement that a transit identifier field is added to a multi-identification network packet of the multi-identification network system, a cross-cluster routing action list is established in the cross-cluster process of adding the transit identifier, the routers in the cross-cluster routing path and key operations among the routers are sequentially described from left to right, and identifiers in an identification plane, the field value of the transit identifier when the network packet is received, a hit list, actions and additional actions are sequentially recorded from top to bottom.
Compared with the prior art, the invention has the beneficial effects that: the same cluster routing step or the cluster crossing routing step is executed based on the identification clustering result, so that the overhead of forwarding the network packet on the router which does not support the self identification type can be effectively reduced, and the semantic expression efficiency and the forwarding rate of the network packet are effectively improved; on the basis, the transfer identifier field is added to the multi-identification network grouping, the priority and the hit rate of the small-scale flow table are improved through the modification of the transfer identifier on the key router, the heat is concentrated on partial table entries, and then the overall forwarding efficiency of the multi-identification network can be further improved.
Drawings
FIG. 1 is a schematic workflow diagram of one embodiment of the present invention;
fig. 2 is a schematic diagram illustrating a distributed flow table matching process in a multi-identity router according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of the tag topology on the content tag plane;
fig. 4 is a schematic diagram of a cross-cluster routing process in a multi-identity network.
Detailed Description
Preferred embodiments of the present invention will be described in further detail below with reference to the accompanying drawings.
The multi-identification network system architecture is divided into a multi-identification system of a management surface and a multi-identification router of a data surface, wherein the multi-identification system of the management surface is responsible for the unified management and registration of all identifications of the whole network, and the multi-identification router of the data surface is responsible for the analysis, processing and forwarding of multi-identification network packets. In the multi-identification network, the router matches, processes and forwards the network packet based on the distributed flow table structure, and fig. 2 shows a flow chart of distributed flow table matching in the multi-identification router.
(1) All the identification types supported by the current router are recorded in the identifiable identification type table RTT. The flow table serial number table-id is 0, namely, the entry of the whole flow table structure is used as a first-level table, and the next-level flow table is selected by using the next-level flow table serial number table-id field just like a distributor. If the network packet is matched with a certain identifiable identifier type, the next-stage flow table is a multi-stage flow table inlet of the identifier type; otherwise, the next-level flow table is the default unrecognizable identification forwarding table UFT with the lowest priority.
(2) The forwarding port in the forwarding table UFT that records an identifier that cannot be recognized by the current router is unrecognized.
(3) The multi-identification flow table MFT provides guidance for processing and forwarding for each identification type of network packet, the flow table sequence number table-id of the multi-identification flow table MFT is uniformly distributed by the controller from 2, and the flow table dedicated for forwarding is replaced by the following identification forwarding table.
(4) The forwarding table RFT is identifiable as a forwarding port that records an identifier that the router can identify. And dividing the table entry into an intra-cluster table and an outer-cluster table according to whether the identifier of the table entry is in the same cluster with the identifier mapped by the router on the identification plane.
If the source identifier and the destination identifier of the network packet are clustered differently, the network packet needs to perform cross-cluster routing, which is a complex process, and taking a network packet with a source identifier of C19 and a destination identifier of C5 as an example in fig. 3, the cross-cluster routing process has the following 3 steps:
(1) the network packet is sent from the source identifier C19 and forwarded to an edge identifier C16 of the source cluster via the identifier C20 of the same cluster.
(2) Network packets are forwarded from the source cluster edge identifier C16 to an edge identifier C9 of the destination cluster via Router12 that does not support the identified type.
(3) The network packet is forwarded from the destination cluster edge identifier C9 to the destination identifier C5, completing the entire routing process.
In this example, when a router encounters a network packet that does not support an identifier type, the router may also forward the packet based on the matching result of the unidentifiable forwarding table. The forwarding table of the unidentifiable identification can guide the router to correctly forward the network packet of the identification type which is not supported by the router, thereby realizing the cross-cluster routing in the multi-identification network.
In addition, the planning of the routing path should take network performance into full consideration. When the network packet passes through a router supporting the identification type, the addressing efficiency can be improved by using a corresponding optimization scheme, and besides forwarding, certain processing can be performed according to semantics conveyed by a target identification, such as in-network caching and request aggregation performed by the content identification. Therefore, a route forwarding method from a source identifier to a destination identifier cannot simply consider an optimal path from a single point to a single point from the source to the destination, but should pass network packets as few as possible through routers that do not support the type of identifier.
In view of the above, as shown in fig. 1, this example provides a routing method based on multiple identity networks of identity clusters, including:
step S1, unifying the network packet format by the multi-identification network packet coding mode;
step S2, distinguishing controller types according to the control domain of the forwarding layer, wherein the controller types include a unique topology controller and a plurality of identification controllers, the topology controller establishes a secure channel with all routers of the forwarding layer, and the topology controller includes identification type information and network topology information; the identification controller comprises identification type information, identifier information and cluster information, the identification controller only establishes a safe channel with a router in an identification plane, supports the router of the identification type, collects the identification type information and executes an identification clustering algorithm so as to analyze identification topological distribution and cluster information;
step S3, executing an identification clustering algorithm through an identification controller, calculating to obtain cluster information, and acquiring a clustering result;
and step S4, realizing multi-identification routing based on the clustering result.
The network packet formats of different identifier types are different, so the example first needs to unify the following packet formats. In step S1 of this embodiment, the multi-Identifier network packet coding method adopts a TLV (Type-Length-Value) format that includes 5 fields including a Source Identifier (Source Identifier), a Destination Identifier (Destination Identifier), an Identifier Type (Identifier Type), a Transit Identifier (Transit Identifier), and network packet raw Data (Data); the network packet of this example carries an identification Type (Identifier Type) and a Transit Identifier (Transit Identifier) as additional fields.
And the controller enables the key router on the cross-cluster routing path to update the field of the transit identifier according to the custom operation in the flow table by issuing the flow table. On the basis of realizing a complex forwarding process, the hit rate of a flow table with high priority and small scale is increased, and the heat is concentrated in part of table entries so as to improve the addressing efficiency of the network packet.
In the embodiment, all controllers are divided into a unique topology controller and a plurality of identification controllers according to different control domains at a forwarding layer. The central topology controller can establish a secure channel with all routers of a forwarding layer, and two types of information are provided in the secure channel, namely identification type information and network topology information; in step S2 of this example, the identifier type information of the topology controller is configured during network initialization, stored using an array, and the format is shown in table 1 below, where each identifier type information represents an identifier type and is indexed using an identifier number; the identification type information of the topology controller is first type information, the identification type information of the topology controller comprises serial number of the identification type of the sequence level, identification type meaning, an interface address of the identification controller corresponding to the identification type, a flow table information list consisting of dynamic arrays, a flow table number and flow table meaning, wherein the flow table number is a serial number which is not less than 2 and is not repeated. In this example, the identification type information is fixed after the network is formed, and if there is an expansion requirement in the actual network, when a new identification type is added, the identification type information can be added, but the original identification type information cannot be deleted.
Table 1 identification type information format of topology controller
The hierarchical relationship between the identification type information fields of the topology controller described in this example is as follows:
the network topology information of the topology controller in this example is second-class information, and is obtained by collecting, by the topology controller, the Identity identifiers and link information of all routers, where the network topology information is stored using a hash table, and is in a format shown in table 2 below, where each piece of network topology information represents one network node, a value of an Identity identifier (Identity) of a router is used as a key (key) for indexing, and the network topology information includes the Identity identifiers of routers in sequential hierarchies, link information of routers, port numbers, and Identity identifiers of directly connected port routers, and the port numbers only list ports having link connection relationships with other routers.
Table 2 network topology information format of topology controller
The hierarchical relationship between the network topology information fields of the topology controller in this example is as follows:
the topology controller described in this example can provide an interface for querying the shortest distance between any two nodes and the bidirectional next hop port in the topology for other controllers, respond to the unrecognizable forwarding table of the forwarding layer missing the unidentified UFT type message, and provide an interface for network topology visualization for an application layer administrator.
In step S2, each identifier type corresponds to an identifier controller, and the identifier controller can only establish a secure channel with a router in the identifier plane, that is, a router supporting the identifier type, and is configured to collect identifier type information and execute an identifier clustering algorithm, so as to analyze identifier topology distribution and cluster information. The identification controller contains three types of information, which are identification type information, identifier information, and cluster information, respectively.
The first type of information of the identifier controller is also identifier type information, the identifier type information of the identifier controller only includes an identifier type represented by the identifier controller, and the identifier type is synchronously acquired by the topology controller through an east-west interface, so that only one identifier type information with the same format as that of the topology controller is in the identifier controller; because a plurality of identifiers exist in the multi-identification network and correspond to the same router node, and two pieces of Identifier information with the same position are also completely the same, the Identifier information of the identification controller is stored by using a hash table, the value of the identity (Identifier) corresponding to the router is used as a key (key) for indexing, and the indexing result is a pointer pointing to specific information; the second type of information identifying the controller is identifier information, and a specific format of the identifier information identifying the controller is shown in table 3 below. The design of the embodiment can index the same information by using a plurality of different Identifier values, and the real situation of Identifier distribution in the multi-Identifier network is restored.
Table 3 identifier information format for identifying controller
The hierarchical relationship between the identifier information fields identifying the controllers as described in this example is as follows:
that is, the identifier information for identifying the controller in this example includes the identity of the corresponding router at the sequential level, the cluster number to which the router belongs, whether the router is an edge identifier, the link information of the corresponding router, the port number, and the identifier of the same type of port direct connection, where the port number only lists the ports having link connection relationships with other routers.
The third type of information of the identifier controller in this example is cluster information, the cluster information of the identifier controller is stored using an array, the format is shown in table 4 below, each piece of cluster information represents an identifier cluster in an identifier plane, and the index is performed using a cluster number as a keyword (key). Because the cluster may disappear in the network updating process, the array corresponding to the cluster information may have a small number of storage holes. The cluster information is calculated by the first type information (identification type information) using the identification clustering algorithm of step S3, each piece of information representing one cluster in the identification plane, and the value of the cluster Id is used as the key for indexing.
Table 4 cluster information format for an identified controller
The hierarchical relationship between the cluster information fields identifying the controllers as described in this example is as follows:
the identification controller responds to the unidentifiable identification forwarding table missing unidentified RFT type message of the forwarding layer, and can provide an interface for the topology controller to inquire an edge identification list of a cluster where any identifier in the identification plane is located. All this information will be stored and calculated at the network formation according to the administrator's pre-configuration and forwarding level and dynamically updated as the network topology changes.
In step S3, the identifier controller may establish a secure channel with all routers in the corresponding identifier plane, receive the identifier information sent from the identifier plane by using the data distribution submodule of the southbound interface module, store the identifier information in the information storage submodule of the topology information module, and continuously execute the identifier clustering algorithm through the topology analysis submodule of the topology information module to obtain cluster information through calculation. The pseudo code for the identify Clustering Algorithm (Identifier Clustering Algorithm) described in this example is as follows:
Input:Identifier_HashMap
Output:Identifier_HashMap,Cluster_List
1：function identifierClustering(…)
2：let nodeQueue＝a empty queue,Cluster_List＝a empty list
3: let node is a empty string, clusterNumber is 0// initialization data is null
4：for each&Identifier_node in Identifier_HashMap,do
5：if Identifier_node->Cluster＜0,do
6: // traversing the identifier information identifying all undetermined clusters within the hash table
7：Cluster_List.push_back(clusterNumber,
8：nodeQueue.push(Identifier_node)
9: while! Iso empty (), do// breadth first search
10：node＝nodeQueue.pop()
11：node->Cluster＝clusterNumber
12：node->isEI＝False
13：for each Port in node->Ports,do
14：if Port.Identifier.isEmpty(),do
15：node->isEI＝True
16：else if Identifier_HashMap[Port.Identifier].Cluster＜0,do
17：nodeQueue.push(Identifier_HashMap[Port.Identifier])
18：end if
19: if node- > isEI, do// if node is edge identifier
20：Cluster_List[clusterNumber].EIs.push_back(node->Identifier)
21：else,do
22：Cluster_List[clusterNumber].IIs.push_back(node->Identifier)
23：end if
24：end for
25：end while
26：clusterNumber++
27：end if
28：end for
29：end function
Correspondingly, in step S3 in this example, the process of performing the identification clustering algorithm to calculate the cluster information includes the following steps:
step S301, initializing Cluster number group _ List and search queue nodeQueue to be empty;
step S302, traversing sequentially until an Identifier for identifying an undetermined cluster in the IDentifier _ HashMap of the hash table is found;
step S303, adding the identifier into a search queue nodeQueue, and starting from the identifier, searching all identifiers in the same cluster outwards by using a breadth-first search algorithm according to the connection condition of the identifier;
and step S304, continuously traversing and searching the Identifier for identifying the next undetermined cluster in the HashTable Identifier _ HashMap, returning to the step S303 to perform cluster search until the tail of the HashTable Identifier _ HashMap is identified.
More specifically, step S303 in this embodiment includes the following sub-steps:
step S3031, extracting an identifier of the search queue nodeQueue, initializing the attribute iset as a non-edge identifier (that is, isetI is False), traversing the port of the search queue nodeQueue, if the identifier of the non-empty port is not empty, adding the search queue nodeQueue to continuously perform the breadth-first search, and if the port is empty, determining that the identifier is an edge identifier, that is, isetI is True;
step S3032, judging the attribute isEI of the identifier, if the edge identifier is a True value, adding the edge identifier into an edge identifier array Eis of a corresponding cluster, otherwise, adding the edge identifier into an internal identifier array IIs;
step S3033, determining whether the search queue is empty, if not, returning to step S3031 to process the next identifier in the search queue nodeQueue, and if so, completing the search of an identifier cluster.
It should be noted that, by the design of the above technical solution, this example can provide a multi-identifier network system routing method based on identifier clustering for the problem of cross-cluster routing performance in a multi-identifier network, where the multi-identifier network system routing method executes a same-cluster routing method or a cross-cluster routing method based on the result of identifier clustering, so as to effectively reduce the overhead of forwarding a network packet on a router that does not support its own identifier type, and improve the semantic expression efficiency and forwarding rate of the network packet.
In the multi-identification network, the source identification type and the destination identification type of the network packet are the same, that is, the source identification type and the destination identification are in the same identification plane, but the identification positions of the same type are different identification clusters. Such a cross-cluster routing process requires a router that does not support the identified type to complete the forwarding process. The distributed flow table structure is designed for the multi-identification router, the route forwarding method of the whole network is unified, the router is guided to correctly forward the network packet identification types which are not identified by the router through the unidentified forwarding table UFT, the cross-cluster routing process is opened, and the requirement of the multi-identification network for cross-network domain communication is met.
In this example, when a network packet passes through a router supporting the packet identifier type, the addressing efficiency can be improved by using a corresponding optimization scheme, and besides forwarding, certain processing can be performed according to semantics conveyed by a destination identifier. Taking the content id as an example, a content id network packet is divided into a request packet and a data packet. The request packet can match a CS Table and a FIB Table in sequence, the CS Table refers to a Content Store Table (CS), the FIB Table refers to a routing Information Table (FIB), the request packet successfully forwarded leaves return path Information in a PIT Table, and the PIT Table refers to a Pending request Table (PIT) of the Interest packet. And the data packet determines whether a cache copy is reserved at the current router position according to a router cache method, and then is forwarded according to a PIT table item matching result. These processing flows cannot be implemented on a router that does not support the content identification type, that is, operations such as in-network caching and request aggregation cannot be performed.
Therefore, the route forwarding method from the source identifier to the destination identifier in this example cannot simply consider the optimal path from a single point to a single point from the source to the destination, and the design idea of the multi-identifier routing method in this example is to reduce the number of routing hops of the network packet in the identifier plane on the router which does not support the identifier type as much as possible, so the cross-cluster routing method is one of the design key points of the whole routing method.
In this example, the SD-MIRS pseudo code of the multi-id network system routing method based on the id clustering result in step S4 is as follows:
Input:Identifier_HashMap
Output:Identifier_HashMap,Cluster_List
1：function SD-MIRS(…)
2: if src and dst are identifiers in the same cluster routing method
3：address single-point to single-point optimal path from src to dst
4: else, do// cross-cluster routing method
5：address multi-point to multi-point optimal paths from several srcEI to several dstEI.
6：choose first optimal cross-clusters forwarding path
7：address the optimal path from src to srcEI and the optimal path from dstEI to dst
8：let optimal_hopsum＝the sum of the two path hops
9：for each optimal cross-clusters forwarding path,do
10：address the optimal path from src to srcEI and the optimal path from dstEI to dst
11：calculate the sum of the two path hops
12：if the sum of the two path hops＜optimal_hopsum,do
13：optimal_hopsum＝the sum of the two path hops
14：end if
15：end for
16：end if
17：end function
Correspondingly, in step S4 in this example, the process of implementing multi-label routing based on the clustering result includes the following steps:
step S401, judging whether a source identifier (marked as src) and a destination identifier (marked as dst) are in the same cluster or not according to the identification clustering result in the identification plane where the network packet is positioned, and if the source identifier and the destination identifier are in the same cluster, jumping to step S402 to execute an intra-cluster routing step; if the source identifier and the destination identifier are different clusters, jumping to step S403 to execute a cross-cluster routing step;
step S402, directly carrying out single-point to single-point optimal path addressing on a source identifier (src) and a destination identifier (dst) based on an identification topological graph of an identifier space so as to realize the intra-cluster routing step;
step S403, the step of routing across clusters is divided into two steps:
step S4031, used to implement the shortest path selection between clusters, using several edge identifiers (denoted as srcEI) of the source cluster as the starting point, several edge identifiers (denoted as dstEI) of the destination cluster as the end point, and multiple points to multiple points, based on the fewest hops, planning out the best path, and then obtaining one or more inter-cluster forwarding paths;
step S4032, configured to implement overall optimal path selection, where for an edge identifier (srcEI) of a source cluster and an edge identifier (dstEI) of a destination cluster corresponding to each cross-cluster forwarding path, a single-point-to-single-point optimal path planning algorithm is used to calculate a first optimal path hop count between the source identifier (src) and the edge identifier (srcEI) of the source cluster and a second optimal path hop count between the edge identifier (dstEI) of the destination cluster and the destination identifier (dst), and a sum of the first optimal path hop count and the second optimal path hop count is calculated as an evaluation basis for the cross-cluster forwarding path, so as to select an optimal path. If there are multiple best paths, one path is randomly selected as an output result.
In summary, in this embodiment, the flow table structure in the multi-identifier router is implemented by software, and the rational reduction of the flow table scale has positive effects on the improvement of the addressing efficiency and the reduction of the memory overhead.
It is worth explaining that the addressing efficiency of the network packet in the router is an important evaluation criterion of the routing method, and in this example, for a communication scenario in which a source identifier and a destination identifier in a multi-identifier network are different clusters, a special cross-cluster routing step is designed, and compared with the optimal path planning from a single point to a single point which is simply from a source to a destination, the cross-cluster routing step of this example can pass through a router which does not support the identifier type as little as possible, so that the forwarding overhead is reduced, the addressing efficiency of the cross-cluster network packet is effectively improved, the semantic expression efficiency and the forwarding rate of the cross-cluster network packet are improved, and a larger play space is provided for a table item optimization method for specific identifiers in the future.
Further investigation of the cross-cluster routing process shown in fig. 4 may reveal that:
(1) when all routers in the path from the source identifier (src) to the source cluster's edge identifier (src ei) receive a network packet, the destination identifier (dst) field of the network packet will hit within the cluster's outer table. Compared with the cluster inner table, the cluster outer table of the embodiment has lower priority, and the table entry scale of the cluster outer table is larger than that of the cluster inner table, so that the hit rate of the cluster inner table can be improved, the addressing efficiency of a network packet in a router can be improved, and the overall forwarding speed of a cross-cluster route is improved.
It should be noted that, in this example, the flow table is divided into a cluster inner table and a cluster outer table according to whether the identifier of the flow table entry and the identifier mapped by the router on the identification plane are the same cluster; on the basis that the priority of the cluster outer surface is lower than that of the cluster inner surface, the scale of the preset table entry of the cluster outer surface is larger than that of the preset table entry of the cluster inner surface, a preset survival time threshold of the cluster inner surface is preferably set to be larger than that of the cluster outer surface, the preset survival time threshold refers to a preset flow table survival time threshold, self-definition setting and adjustment can be carried out according to actual requirements, and when the survival time of the flow table exceeds the preset survival time threshold, the table entry is automatically deleted; the setting is designed according to the technical scheme of the application, not by conventional design or conventional means in the industry, but by aiming at the scene of an actual multi-identification network system, the setting can well improve the hit rate of the cluster internal table, concentrate heat in partial table entries, further improve the real-time performance and accuracy of the table entries, and further improve the hit rate and the matching rate of the flow table through two optimization designs in different angles.
(2) When a Router such as Router3 (the third Router) that does not support the identification type receives a network packet, the destination identifier (dst) field of the network packet will hit in the unidentifiable forwarding table UFT, so that under the condition of complex identification distribution, the number of entries required by the UFT is quite large, in this example, the heat is concentrated in part of the entries, and the table lookup speed of the UFT can also be increased. Experiments have shown that directing network packets to any Router in the right direction at Router3 also enables correct addressing routing, where the edge identification dstEI of the destination cluster is a good choice.
Therefore, in the multi-identification network system of the present embodiment, the transit identifier field is added to the multi-identification network packet, and the addressing efficiency of the cross-cluster routing packet is improved by reasonably modifying the field value on several key routers on the path.
TABLE 5 Key actions in Cross-Cluster routing Process
The cluster crossing process of adding the transit identifier in this example is as shown in table 5 above, a cluster crossing routing action list is established, the routers in the cluster crossing routing path and the key operations among the routers are sequentially described from left to right, and the identifier in the identification plane, the field value of the transit identifier when the network packet is received, the hit list, the action and the additional action are sequentially recorded from top to bottom. Wherein, line 2 shows the identifier owned by the router on the identification plane, and the router 4 does not support the identification type; line 3 is the value of the transit identifier field when the router receives the network packet, after the router determines the identifier type in the identifier type table RTT, the network packet is processed as in a multi-stage flow table of the identifier type, and finally a matching flow is hit and skipped from one of the flow tables, where the hit table of each router is shown in line 4 of table 5 below. A network packet that hits a self-id entry in either the outer or inner cluster table, will, in addition to being forwarded, have some additional actions performed on it by the router, as illustrated in rows 5 and 6 of the table.
It should also be noted that, in this embodiment, a transit identifier field is added to the multi-identity network packet, and the priority of the table in the cluster and the hit rate of the small-scale flow table are improved by modifying the transit identifier on the key router, so that the heat is concentrated on a part of the table entries, and the overall forwarding efficiency of the multi-identity network can be further improved.
(1) When the transit identifier field value hits in the cluster table, the table entry has the additional action of modifying the transit identifier field value to a preset value. When the controller establishes the method, for a router whose own identifier is an edge identifier, such as the router3, a flow table generated for the router will modify the transit identifier field value into the edge identifier of the destination cluster; for a router represented by an identifier in a cluster, such as router1, a flow table generated for the router will modify the transit identifier field value to the edge identifier of the cluster in which the router is located.
(2) When the transit identifier field value is the same as the router's own identifier, the network packet will hit at the table entry with the highest cluster inner table priority, with the additional actions of: checking the field value of the destination identifier of the network packet, if the field value is the same as the identifier of the router 7, directly receiving the packet, recycling the memory allocated to the packet, and finishing the routing process; otherwise, if the router3 and the router 5 change the transit identifier field value to the destination identifier field value of the network packet, and continue matching in the cluster inner table.
The additional actions are all preset in the flow table entry generated by the controller, and the router of the forwarding layer only needs to execute the actions and forward according to the result of flow table matching.
Therefore, the same cluster routing step or the cross-cluster routing step is executed based on the identification clustering result, so that the cost of forwarding the network packet on the router which does not support the self identification type can be effectively reduced, and the semantic expression efficiency and the forwarding rate of the network packet are effectively improved; on the basis, the transfer identifier field is added to the multi-identification network grouping, the priority and the hit rate of the small-scale flow table are improved through the modification of the transfer identifier on the key router, the heat is concentrated on partial table entries, and then the overall forwarding efficiency of the multi-identification network can be further improved.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.
Claims (10)
1. A routing method of a multi-identification network system based on identification clustering is characterized by comprising the following steps:
step S1, unifying the network packet format by the multi-identification network packet coding mode;
step S2, distinguishing controller types according to the control domain of the forwarding layer, wherein the controller types include a unique topology controller and a plurality of identification controllers, the topology controller establishes a secure channel with all routers of the forwarding layer, and the topology controller includes identification type information and network topology information; the identification controller comprises identification type information, identifier information and cluster information, the identification controller only establishes a safe channel with a router in an identification plane, supports the router of the identification type, collects the identification type information and executes an identification clustering algorithm so as to analyze identification topological distribution and cluster information;
step S3, executing an identification clustering algorithm through an identification controller, calculating to obtain cluster information, and acquiring a clustering result;
and step S4, realizing multi-identification routing based on the clustering result.
2. The routing method according to claim 1, wherein in step S1, the multi-id network packet coding scheme adopts a TLV format comprising 5 fields including a source identifier, a destination identifier, an id type, a transit identifier, and network packet original data; and the controller enables the key router on the cross-cluster routing path to update the field of the transit identifier according to the custom operation in the flow table by issuing the flow table.
3. The method according to claim 1 or 2, wherein in step S2, when initializing the network, configuring the identifier type information of the topology controller, and storing the identifier type information in an array, each identifier type information represents an identifier type, and each identifier type information is indexed by an identifier number; the identification type information of the topology controller comprises the serial number of the identification type of the sequence hierarchy, the identification type meaning, the interface address of the identification controller corresponding to the identification type, a flow table information list consisting of dynamic arrays, a flow table number and a flow table meaning, wherein the flow table number is a serial number which is not less than 2 and is not repeated.
4. The routing method of claim 3, wherein the network topology information of the topology controller is obtained by collecting, by the topology controller, the identity identifiers and link information of all routers, the network topology information is stored using a hash table, each piece of network topology information represents a network node, and the network topology information is indexed by using a value of the identity identifier of a router as a key, and includes the identity identifiers of routers in sequential hierarchy, link information of routers, port numbers, and identity identifiers of directly connected port routers, and wherein the port numbers only list ports having link connection relationships with other routers.
5. The method according to claim 1 or 2, wherein in step S2, each identifier type corresponds to one identifier controller, the identifier type information of the identifier controller only includes the identifier type represented by the identifier controller, and the identifier types are synchronously obtained by the topology controller via the east-west interface; the identifier information of the identification controller is stored by using a hash table, the value of the identity identifier of the corresponding router is used as a key word for indexing, and the indexing result is a pointer pointing to specific information; the identifier information of the identification controller comprises an identity identification of a corresponding router of an order hierarchy, a cluster number of the corresponding router, whether the identifier is an edge identifier, link information of the corresponding router, a port number and a same type identifier of port direct connection, wherein the port number only lists ports which have link connection relations with other routers.
6. The method according to claim 5, wherein the cluster information of the label controller is stored in an array, each cluster information represents an identification cluster in the label plane, and the index is performed by using a cluster number as a keyword.
7. The routing method according to claim 1 or 2, wherein in step S3, the step of performing the calculation of the labeled clustering algorithm to obtain the cluster information comprises the following steps:
step S301, initializing a cluster array and a search queue to be empty;
step S302, traversing in sequence until finding an identifier for identifying an undetermined cluster in the hash table;
step S303, adding the identifiers into a search queue, and starting from the identifiers, searching all identifiers in the same cluster outwards by using a breadth-first search algorithm according to the connection condition of the identifiers;
step S304, continuously traversing and searching for the identifier identifying the next undetermined cluster in the hash table, and returning to step S303 to search until the end of the hash table is identified.
8. The method for routing based on multiple identity clusters in network architecture of claim 7, wherein the step S303 comprises the following sub-steps:
step S3031, take out an identifier of the search queue, initialize its attribute as the non-edge identifier temporarily, then traverse its port, if the identifier of the non-empty port joins the search queue to continue the breadth first search, if the empty port judges the identifier as the edge identifier;
step S3032, judging the attribute of the identifier, if the attribute is an edge identifier, adding the attribute into an edge identifier array of a corresponding cluster, otherwise, adding the attribute into an internal identifier array;
step S3033, determining whether the search queue is empty, if not, returning to step S3031 to process the next identifier in the search queue, and if so, completing the search of an identified cluster.
9. The method for routing based on multiple identity networks of claim 1 or 2, wherein in step S4, the process for implementing multiple identity routing based on the clustering result comprises the following steps:
step S401, judging whether the source identifier and the destination identifier are in the same cluster according to the identification clustering result in the identification plane where the network packet is positioned, and if the source identifier and the destination identifier are in the same cluster, jumping to step S402 to execute the routing step in the cluster; if the source identifier and the destination identifier are different clusters, jumping to step S403 to execute a cross-cluster routing step;
step S402, directly carrying out single-point to single-point optimal path addressing on a source identifier and a destination identifier based on an identification topological graph of an identifier space so as to realize the step of routing in a cluster;
step S403, with a plurality of edge identifiers of a source cluster as a starting point and a plurality of edge identifiers of a destination cluster as an end point, planning an optimal path by multipoint-to-multipoint according to the minimum hop count, and further obtaining one or more cross-cluster forwarding paths; and then, for the edge identifier of the source cluster and the edge identifier of the destination cluster corresponding to each cross-cluster forwarding path, calculating a first optimal path hop count between the source identifier and the edge identifier of the source cluster and a second optimal path hop count between the edge identifier of the destination cluster and the edge identifier of the destination cluster by using a single-point-to-single-point optimal path planning algorithm, calculating the sum of the first optimal path hop count and the second optimal path hop count as an evaluation basis of the cross-cluster forwarding path, and selecting an optimal path.
10. The routing method of claim 1 or 2, wherein a transit identifier field is added to a multi-label network packet of the multi-label network system, a cross-cluster routing action list is established in a cross-cluster process of adding a transit identifier, key operations between routers and routers in a cross-cluster routing path are sequentially described from left to right, and identifiers in an identification plane, transit identifier field values when network packets are received, a hit table, actions and additional actions are sequentially recorded from top to bottom.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111289590.0A CN114189468B (en) | 2021-11-02 | 2021-11-02 | Multi-identification network system routing method based on identification clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111289590.0A CN114189468B (en) | 2021-11-02 | 2021-11-02 | Multi-identification network system routing method based on identification clustering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114189468A true CN114189468A (en) | 2022-03-15 |
| CN114189468B CN114189468B (en) | 2024-04-12 |
Family
ID=80601798
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111289590.0A Active CN114189468B (en) | 2021-11-02 | 2021-11-02 | Multi-identification network system routing method based on identification clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114189468B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114844730A (en) * | 2022-07-05 | 2022-08-02 | 深圳赛思鹏科技发展有限公司 | Network system constructed based on trusted tunnel technology |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015043327A1 (en) * | 2013-09-30 | 2015-04-02 | 华为技术有限公司 | Routing method, device and system |
| US20150095008A1 (en) * | 2013-01-18 | 2015-04-02 | Inspur Electronic Information Industry Co., Ltd | Extension cache coherence protocol-based multi-level coherency domain simulation verification and test method |
| US20160262038A1 (en) * | 2015-03-02 | 2016-09-08 | Spidercloud Wireless, Inc., | Topology discovery and management and son orchestration |
| CN106341324A (en) * | 2016-09-30 | 2017-01-18 | 赛特斯信息科技股份有限公司 | Method for dynamically establishing SDN controller in SDN and NFV integrated network |
| CN106533733A (en) * | 2016-08-30 | 2017-03-22 | 中国科学院信息工程研究所 | CCN collaborative cache method and device based on network clustering and Hash routing |
| CN107969008A (en) * | 2017-11-06 | 2018-04-27 | 东南大学 | A kind of software definition Sensor Network concentrated route computational methods |
| CN109005065A (en) * | 2018-08-15 | 2018-12-14 | 扬州大学 | A kind of appreciable cluster algorithm of concealed nodes for extensive D2D network |
| CN110062432A (en) * | 2019-04-26 | 2019-07-26 | 长春师范大学 | A kind of Wireless sensor network clustering routing algorithm based on least energy consumption |
| CN111373704A (en) * | 2019-01-28 | 2020-07-03 | 北京大学深圳研究生院 | Method, system and storage medium for supporting multimode identification network addressing progressive-entry IP |
| CN111447658A (en) * | 2019-01-16 | 2020-07-24 | 沈阳理工大学 | SDWSN-based clustering routing method |
| CN113301534A (en) * | 2021-05-21 | 2021-08-24 | 哈尔滨理工大学 | Routing method applied to multi-intelligent-vehicle communication |
-
2021
- 2021-11-02 CN CN202111289590.0A patent/CN114189468B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150095008A1 (en) * | 2013-01-18 | 2015-04-02 | Inspur Electronic Information Industry Co., Ltd | Extension cache coherence protocol-based multi-level coherency domain simulation verification and test method |
| WO2015043327A1 (en) * | 2013-09-30 | 2015-04-02 | 华为技术有限公司 | Routing method, device and system |
| US20160262038A1 (en) * | 2015-03-02 | 2016-09-08 | Spidercloud Wireless, Inc., | Topology discovery and management and son orchestration |
| CN106533733A (en) * | 2016-08-30 | 2017-03-22 | 中国科学院信息工程研究所 | CCN collaborative cache method and device based on network clustering and Hash routing |
| CN106341324A (en) * | 2016-09-30 | 2017-01-18 | 赛特斯信息科技股份有限公司 | Method for dynamically establishing SDN controller in SDN and NFV integrated network |
| CN107969008A (en) * | 2017-11-06 | 2018-04-27 | 东南大学 | A kind of software definition Sensor Network concentrated route computational methods |
| CN109005065A (en) * | 2018-08-15 | 2018-12-14 | 扬州大学 | A kind of appreciable cluster algorithm of concealed nodes for extensive D2D network |
| CN111447658A (en) * | 2019-01-16 | 2020-07-24 | 沈阳理工大学 | SDWSN-based clustering routing method |
| CN111373704A (en) * | 2019-01-28 | 2020-07-03 | 北京大学深圳研究生院 | Method, system and storage medium for supporting multimode identification network addressing progressive-entry IP |
| CN110062432A (en) * | 2019-04-26 | 2019-07-26 | 长春师范大学 | A kind of Wireless sensor network clustering routing algorithm based on least energy consumption |
| CN113301534A (en) * | 2021-05-21 | 2021-08-24 | 哈尔滨理工大学 | Routing method applied to multi-intelligent-vehicle communication |
Non-Patent Citations (7)
| Title |
|---|
| MENGCHU SHI: "SD-MIRS SDN-based Multi-Identifier Routing Strategy", 《INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKS AND INTERNET OF THINGS》, 20 May 2021 (2021-05-20) * |
| WENSHENG CHEN: "Routing in the Centralized Identifier Network", 《2015 10TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM)》 * |
| WENSHENG CHEN: "Routing in the Centralized Identifier Network", 《2015 10TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM)》, 23 June 2016 (2016-06-23) * |
| 王宗山: "基于能量均衡高效WSN的分簇路由算法", 《计算机工程与设计》 * |
| 王宗山: "基于能量均衡高效WSN的分簇路由算法", 《计算机工程与设计》, 16 October 2021 (2021-10-16) * |
| 王海涛: "分簇结构在Ad Hoc网络中的应用综述", 《重庆邮电学院学报(自然科学版)》 * |
| 王海涛: "分簇结构在Ad Hoc网络中的应用综述", 《重庆邮电学院学报(自然科学版)》, no. 04, 30 December 2003 (2003-12-30) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114844730A (en) * | 2022-07-05 | 2022-08-02 | 深圳赛思鹏科技发展有限公司 | Network system constructed based on trusted tunnel technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114189468B (en) | 2024-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110572274B (en) | Named data network method for optimizing deployment and management of edge computing nodes | |
| CN100428225C (en) | Apparatus and method for performing high-speed IP route lookup and managing routing/forwarding tables | |
| US10554555B2 (en) | Hash-based overlay routing architecture for information centric networks | |
| US6674769B1 (en) | Simultaneous searching of layer 3 policy filter and policy cache in a network switch port | |
| CN102571599B (en) | Rapid storage method of routing table entry | |
| CN107395532B (en) | Multi-tenant virtual network isolation method based on SDN | |
| CN111611613A (en) | ICN-based industrial internet identification analysis system and data access method | |
| Jain et al. | Viro: A scalable, robust and namespace independent virtual id routing for future networks | |
| CN109450795B (en) | Service router and service network system facing service network | |
| CN103957157B (en) | Route method for network interface to define forwarding rule | |
| CN106170956B (en) | A kind of method for routing and equipment | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN108710629A (en) | Top-k query method and system based on name data network | |
| CN113810287B (en) | Data retrieval and pushing method based on NDN and SDN | |
| CN105471747A (en) | Intelligent router routing method and apparatus thereof | |
| CN114189468A (en) | Multi-identification network system routing method based on identification clustering | |
| CN113630323B (en) | Software definition-based distributed flow table matching method in multi-identification network system | |
| CN106453091B (en) | The equivalent route management method and device of router Forwarding plane | |
| US7940755B2 (en) | Lookup engine with programmable memory topology | |
| CN115865844B (en) | Virtual-real combined dynamic flow scheduling method and device based on SDN (software defined network) and NDN (non-dynamic network) | |
| CN105207904A (en) | Message processing method, device and router | |
| CN113098749A (en) | Message sending method, device and storage medium | |
| CN110572327A (en) | Method for realizing cross-network-segment data forwarding of neutron network and flow controllable method | |
| CN104639438A (en) | Novel identifying and controlling method of data flow in OpenFlow network | |
| JP7289303B2 (en) | Network communication method and apparatus |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |