CN114189468B - 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
- CN114189468B CN114189468B CN202111289590.0A CN202111289590A CN114189468B CN 114189468 B CN114189468 B CN 114189468B CN 202111289590 A CN202111289590 A CN 202111289590A CN 114189468 B CN114189468 B CN 114189468B
- Authority
- CN
- China
- Prior art keywords
- identification
- identifier
- cluster
- information
- network
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000009826 distribution Methods 0.000 claims abstract description 8
- 230000008569 process Effects 0.000 claims description 26
- 230000009191 jumping Effects 0.000 claims description 6
- 238000011156 evaluation Methods 0.000 claims description 4
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 3
- 238000003491 array Methods 0.000 claims description 3
- 238000010845 search algorithm Methods 0.000 claims description 3
- 238000013461 design Methods 0.000 description 12
- 238000012546 transfer Methods 0.000 description 11
- 238000013519 translation Methods 0.000 description 10
- 230000009471 action Effects 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 7
- 230000002730 additional effect Effects 0.000 description 6
- 238000007726 management method Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 230000004083 survival effect Effects 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 4
- 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
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000013507 mapping Methods 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
- 238000004364 calculation method Methods 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000007547 defect Effects 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
- 230000006855 networking Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
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 network grouping formats through a multi-identification network grouping coding mode; step S2, distinguishing the controller type according to the control domain of the forwarding layer, wherein the controller type comprises a topology controller and a plurality of identification controllers, the topology controller establishes a safety channel with all routers of the forwarding layer, and the topology controller comprises 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 obtaining a clustering result; and 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 forwarding rate of the network packet.
Description
Technical Field
The present invention relates to a network routing method, and in particular, to a multi-identifier network system routing method based on identifier clustering.
Background
With the development of technology, technologies that are difficult to imagine in the past, such as network education, telemedicine, intelligent robots, etc., have been common, and the assumption of technologies such as virtual reality, automatic driving, and full-coverage networking (IoT) has become increasingly realistic, so that the complexity of network application scenarios and the huge number of network users have led to the development of explosive growth of network information resources. The service form of the internet evolves from an initial scientific research and military special network to a production type network taking the consumption requirement of users as a core, however, the traditional network taking TCP/IP as a main part develops fatigue state when facing complex and changeable future internet scenes, and exposes the limitation of the traditional network.
Firstly, the traditional network has insufficient performance. With mobile terminals such as smart phones and portable wearable devices and the like accessing to a network, higher requirements are put forward on flexible movement, scalable scale and the like of network identifiers, and the traditional network uses an IP address as a unique addressing identifier, so that the problems of management stiffness, 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 latency, etc., while traditional networks exist in a large number of cases of repeated content transmission based on a "host-to-host" communication scheme. Meanwhile, the traditional network has low granularity of control over performance and transmission reliability, is not flexible enough, and cannot meet the customization performance requirement of the future Internet.
Secondly, the potential safety hazard of the traditional network design. IP networks were originally created from data interaction requirements within the united states military and research institutions, and their design did not consider adequate security mechanisms at the beginning. In recent years, attack actions aiming at network base protocols such as BGP, DNS and the like are endless, and network attacks aiming at China still occur. The current security measures against attacks are only to continuously patch the network architecture, and researches on network security are like continuous racing with network attackers, so that potential safety hazards only grow more and more under the trend of future network scale expansion and data volume rapid increase.
Third, the exhaustion of domain name resources and unilateral sense of network space. The global IPv4 address is basically distributed, and the top-level analysis service is centralized. At the end of 2019, global IPv4 was completely allocated. Besides the exhaustion of domain name resources, the network space of each country is also threatened by network unilateralism.
In summary, conventional IP networks cannot cope with many demands of the future internet.
Aiming at the defects of the IP network, the call for constructing a novel future network architecture is quite high. In the context of such demands, various future network architectures and new network identifications have evolved. For example, a Content-Centered Network (CCN) uses Content identification, and through a pull-type communication transmission mode, functions such as in-Network caching and route aggregation are realized, so that the problem of a large number of repeated Content transmissions in an IP Network is solved, and the method is more suitable for future Network assumptions of all-as-a-service (everything as a service, xaaS) than a traditional IP Network; the service identifier generated from the content identifier concept adopts the naming rule same as CCN, but is different from the content identifier, no cache is made on a routing path, and a request packet can carry data, so that the service identifier is more flexible relative to the content identifier; the hyperbolic route (Hyperbolic Routing, HR) maps the network into a metric space, a coordinate is given to each node, namely, a hyperbolic identifier is given to a message transmitted in the network, each router only needs to store the hyperbolic identifier of an adjacent node, a greedy geometric routing algorithm is used for selecting the next hop with the smallest geometric distance between the adjacent node and a destination as forwarding in routing, and the hyperbolic routing strategy can improve the dynamic problem caused by huge addressing space in the Internet of things with extremely large topological scale.
These new identities respectively ameliorate the shortcomings of the traditional IP identities from different aspects, and the differences in design and implementation focus them on the network transmission modes of different scenarios to accommodate different network requirements. Under the requirements of differentiation and customization of network scenes, a novel network system with multiple concurrent frameworks and multiple parallel identifier can better support emerging scenes and multiple functions, and becomes a current research hotspot in the future network field.
The multi-identification network system which is born in the multi-identification scene in the future network supports the parallel coexistence of various novel identifications such as identities, services, contents, hyperbolas and the like and the traditional IP identifications, provides unified generation, management and analysis services for the various identifications, and completely different data transmission modes from the traditional IP, solves the problems of IP network semantic overload and IP identification centralized management, and is more suitable for the scenes of high reliability, low time delay and everything interconnection of the future network. Thus, multi-identification network architectures have evolved.
The multi-identification router is used as a forwarding entity of a multi-identification network architecture data plane and is an actual execution entity of the multi-identification routing method. The multi-identification router is different from the traditional router in that the multi-identification router supports a plurality of network identifications besides the traditional IP identifications, and allows a plurality of identification transmission modes to coexist in parallel in the network topology formed by the multi-identification router so as to meet different requirement scenes.
The existing multi-identification router implementation scheme firstly puts forward a unified hierarchical identification naming rule, and then artificially divides identification domains by introducing a multi-identification inter-translation table (Inter Translation Base, ITB) into the router, so that the inter-translation inter-access function between different identification domains under a multi-identification coexisting network is realized. Technically, the multi-identification router designs a data structure and an algorithm for multi-identification storage and inter-translation, realizes an efficient expandable routing addressing forwarding algorithm and a data forwarding engine for further improving performance, and ensures the traceable security of multi-identification router information through a data packet signature mechanism.
The ITB table stores the identification inter-translation information, the key is the original identifier, and the value is the destination identifier. The matching flow of the network packet inside 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 that the IP address is the wide area network IP address and directly performs DNS query; (2) Otherwise, the network packet sequentially enters a Content cache table (CS), an interest packet pending request table (Pending Interest Table, PIT) and a routing information table (Forward Information Base, FIB) for matching, and if the matching is successful, the network packet is processed or forwarded according to the table entry information; (3) If the network packet identifier is not hit in the FIB table, the network packet identifier possibly belongs to other identification spaces, the ITB table is tried to be inquired, and if the inter-translation is successful, a forwarding port of the identifier after the inter-translation is inquired in the FIB table is returned; if it fails, an error log is generated and the network packet is discarded.
In the prior art, the design of the multi-identifier router is based on the inter-translation technology, and the problems of insufficient performance and the like still exist, if the supporting condition of the router through which the multi-identifier network packet passes on the identifier types is complex, a plurality of different identifier domains may need to be passed between the source identifier and the destination identifier, and meaningless multi-inter-translation may be needed, so that the forwarding efficiency is reduced; when the scale of the multi-identification network is larger, if a precisely matched hash table structure is adopted in the inter-translation table in the router, huge storage overhead is needed, and if the longest prefix matching scheme is changed, the searching efficiency is sacrificed, so that the forwarding performance bottleneck of the whole multi-identification router is formed.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a multi-identification network system routing method capable of effectively reducing the forwarding overhead of a network packet on a router which does not support self-identification type and effectively improving the semantic expression efficiency and forwarding rate of the network packet.
In this regard, the present invention provides a multi-identifier network system routing method based on identifier clustering, which includes the following steps:
step S1, unifying network grouping formats through a multi-identification network grouping coding mode;
step S2, distinguishing the controller types according to the control domain of the forwarding layer, wherein the controller types comprise unique topology controllers and a plurality of identification controllers, the topology controllers and all routers of the forwarding layer establish a safety channel, and the topology controllers comprise identification type information and network topology information; the identification controller comprises identification type information, identifier information and cluster information, and establishes a secure channel only with routers in an identification plane, supports the routers of the identification type, collects the identification type information, and executes an identification clustering algorithm so as to analyze identification topology distribution and cluster information;
Step S3, executing an identification clustering algorithm through an identification controller, calculating to obtain cluster information, and obtaining a clustering result;
and S4, realizing multi-identification routing based on the clustering result.
In the step S1, the multi-identifier network packet coding mode adopts TLV format including 5 fields of source identifier, destination identifier, identification type, 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.
In the step S2, when initializing the network, the identification type information of the topology controller is configured and stored by using an array, each piece of identification type information represents an identification type, and the identification type information is indexed by using an identification number; the identification type information of the topology controller comprises serial numbers of identification types of a sequence hierarchy, identification type meanings, interface addresses of the identification controllers corresponding to the identification types, a flow table information list formed by dynamic arrays, flow table numbers and flow table meanings, wherein the flow table numbers are serial numbers which are not less than 2 and are not repeated.
The invention further improves that the network topology information of the topology controller is obtained by collecting the identity identifiers and the 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 network topology information is indexed by using the value of the identity identifier of the router as a key word, and the network topology information comprises the identity identifiers of routers, the link information of the routers, port numbers and the identity identifiers of the port direct routers in a sequential level, wherein the port numbers only list ports with link connection relation with other routers.
In the step S2, each identification type corresponds to one identification controller, and the identification type information of the identification controller only includes the identification type represented by the identification controller, and the identification type is synchronously acquired 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 of the corresponding router is used as a keyword to index, and the index result is a pointer pointing to specific information; the identifier information of the identification controller comprises an identification of a corresponding router of a sequence level, a cluster number, whether the router is an edge identifier, link information of the corresponding router, a port number and a type identifier of a port direct connection, wherein the port number only lists ports with link connection relation with other routers.
The invention further improves that the cluster information of the identification controller is stored by using an array, each piece of cluster information represents one identification cluster in the identification plane, and the cluster information is indexed by using a cluster number as a keyword.
The invention further improves that in the step S3, the process of executing the identification clustering algorithm to calculate cluster information comprises the following steps:
step S301, initializing a cluster array and a search queue to be empty;
step S302, traversing sequentially until an identifier for identifying an undetermined cluster in the hash table is found;
step S303, adding the identifiers into a search queue, starting from the identifiers, and 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, the searching for the identifier of the next undetermined cluster in the identification hash table is continued, and the step S303 is returned to search until the end of the identification hash table.
A further improvement of the present invention is that said step S303 comprises the sub-steps of:
step S3031, taking out an identifier of the search queue, initializing the attribute of the identifier to be temporarily regarded as a non-edge identifier, traversing the port of the identifier, adding the identifier into the search queue if the identifier of the non-edge port is empty, continuously performing the width-first search, and judging the identifier to be the edge identifier if the identifier of the non-edge port is empty;
Step S3032, judging the attribute of the identifier, if the identifier is an edge identifier, adding the identifier into an edge identifier array of a corresponding cluster, otherwise, adding the identifier into an internal identifier array;
step S3033, it is determined whether the search queue is empty, if not, the process returns to step S3031 to process the next identifier in the search queue, and if so, the search of an identifier cluster is completed.
The invention further improves that in the step S4, the process of realizing the multi-identification routing based on the clustering result comprises the following steps:
step S401, judging whether the source identifier and the destination identifier are clustered together according to the identification clustering result in the identification plane where the network packet is located, if so, jumping to step S402 to execute the routing step in the cluster; if the source identifier and the destination identifier are different in cluster, jumping to step S403 to execute a cross-cluster routing step;
step S402, based on the identification topological graph of the identifier space, directly carrying out single-point to single-point optimal path addressing on the source identifier and the destination identifier so as to realize an intra-cluster routing step;
step S403, taking a plurality of edge identifiers of a source cluster as a starting point and a plurality of edge identifiers of a target cluster as an end point, and planning an optimal path according to the minimum number of hops, so as to obtain one or more cross-cluster forwarding paths; and then, 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, and 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 by using a single-point to single-point optimal path planning algorithm for the edge identifier of the source cluster and the edge identifier of the destination cluster corresponding to each cross-cluster forwarding path.
The invention further improves that a multi-identification network packet of the multi-identification network system is added with a transfer identifier field, a cross-cluster route action list is established in the process of adding the transfer identifier into the cross-cluster, key operations between routers in the cross-cluster route path are described sequentially from left to right, and an identifier in an identification plane, a transfer identifier field value, a hit table, actions and additional actions are recorded sequentially from top to bottom when the network packet is received.
Compared with the prior art, the invention has the beneficial effects that: 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 identification type of the network packet can be effectively reduced, and the semantic expression efficiency and forwarding rate of the network packet are effectively improved; on the basis of the method, the transfer identifier field is added to the multi-identification network packet, the priority and the hit rate of the small-scale flow table are improved through modification of the transfer identifier on the key router, heat is concentrated on part of the 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 of a distributed flow table matching process in a multi-label router according to one embodiment of the invention;
FIG. 3 is a schematic diagram of an identification topology on a content identification plane;
fig. 4 is a schematic diagram of a cross-cluster routing process in a multi-identification 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 architecture is divided into a multi-identification system of a management plane and a multi-identification router of a data plane, wherein the former is responsible for unified management and registration of all identifications of the whole network, and the latter is responsible for analysis, processing and forwarding of multi-identification network packets. In a multi-identification network, a router performs matching, processing and forwarding of network packets based on a distributed flow table structure, and fig. 2 is 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 identification type table RTT. The stream table serial number table-id is 0, namely the entry of the whole stream table structure, and is used as a first stage of the stream table, and the next stage of the stream table is selected by using the next stream table serial number next-id field just like a distributor. If the network packet is matched with a certain identifiable identification type, the next-stage flow table is a multi-stage flow table entry of the identification type; otherwise, the next-level flow table identifies a forwarding table UFT for the default unidentifiable identification with the lowest priority.
(2) And the forwarding port which records the identifier which cannot be identified by the current router in the unidentifiable identification forwarding table UFT.
(3) The multi-identification flow table MFT provides processing and forwarding guidance for each identification type network packet, its flow table serial number table-id is uniformly distributed by the controller from 2, and the flow table dedicated for forwarding is replaced by the following identifiable forwarding table.
(4) A forwarding port that identifies an identifier that the forwarding table RFT records can identify by the router can be identified. According to whether the identifier of the table item and the identifier mapped by the router in the identification plane are clustered, the table is divided into an intra-cluster table (intra-cluster table) and an outer-cluster table (outer-cluster table).
If the source identifier and the destination identifier of the network packet are different in cluster, the network packet needs to be routed across clusters, and the process of routing across clusters is complex, taking the network packet with one source identifier of C19 and one destination identifier of C5 in fig. 3 as an example, the process of routing across clusters includes the following 3 steps:
(1) The network packet originates from the source identifier C19 and is forwarded to one edge identifier C16 of the source cluster via the identifier C20 of the same cluster.
(2) The network packet is forwarded from the source cluster edge identifier C16 to an edge identifier C9 of the destination cluster via the Router12 which does not support the identification 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, the router encounters a network packet that does not support the identification type, and may also forward the packet according to the matching result of the unrecognizable identification forwarding table. The unrecognizable identification forwarding table can guide the router to forward the identification type network packet which is not supported by the router correctly, so that the cross-cluster routing in the multi-identification network is realized.
In addition, the routing path planning should take network performance into account adequately. When the network packet passes through a router supporting the identification type, the addressing efficiency can be improved by utilizing a corresponding optimization scheme, and besides forwarding, certain processing can be performed according to the semantics conveyed by the destination identification, such as in-network caching and request aggregation performed by the content identification. Thus, the route forwarding method from source identifier to destination identifier cannot simply consider the single point to single point best path from source to destination, but pass network packets through routers that do not support this type of identifier as little as possible.
In this regard, as shown in fig. 1, this example provides a multi-identifier network system routing method based on identifier clustering, including:
Step S1, unifying network grouping formats through a multi-identification network grouping coding mode;
step S2, distinguishing the controller types according to the control domain of the forwarding layer, wherein the controller types comprise unique topology controllers and a plurality of identification controllers, the topology controllers and all routers of the forwarding layer establish a safety channel, and the topology controllers comprise identification type information and network topology information; the identification controller comprises identification type information, identifier information and cluster information, and establishes a secure channel only with routers in an identification plane, supports the routers of the identification type, collects the identification type information, and executes an identification clustering algorithm so as to analyze identification topology distribution and cluster information;
step S3, executing an identification clustering algorithm through an identification controller, calculating to obtain cluster information, and obtaining a clustering result;
and S4, realizing multi-identification routing based on the clustering result.
The network packet formats of different identification types are different, so this example needs to be unified with the group format first. In step S1 of this example, the multi-Identifier network packet coding mode adopts a TLV (Type-Length-Value) format including 5 fields, namely, a source Identifier (Source Identifier), a destination Identifier (Destination Identifier), an Identifier Type (Identifier Type), a transit Identifier (Transit Identifier) and network packet original 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 high-priority and small-scale flow table is increased, and heat is concentrated on part of table items, so that the addressing efficiency of network packets is improved.
In this example, all controllers are divided into a unique topology controller and a plurality of identification controllers according to the control domain difference at the forwarding layer. The topology controller of the center can establish a safety channel with all routers of the forwarding layer, wherein two types of information are respectively identification type information and network topology information; in step S2 of this example, the identification type information of the topology controller is configured during network initialization, and is stored using an array, where the format is shown in table 1 below, and each piece of identification type information represents an identification type and is indexed using an identification number; the identification type information of the topology controller is first type information, and the identification type information of the topology controller comprises serial numbers of identification types of sequence layers, identification type meanings, interface addresses of the identification controllers corresponding to the identification types, a flow table information list formed by dynamic arrays, flow table numbers and flow table meanings, wherein the flow table numbers are serial numbers which are not less than 2 and are not repeated. In this example, the identifier type information is fixed after the network is formed, if there is an expansion requirement in the actual network, the identifier type information can be added when a new identifier type is added, but the original identifier 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 in this example is as follows:
the network topology information of the topology controller is second-class information, the network topology information is obtained by collecting the Identity identifiers and the link information of all routers by the topology controller, the network topology information is stored by using a hash table, the format is shown in the following table 2, each piece of network topology information represents a network node, the value of the Identity identifier (Identity) of the router is used as a key for indexing, and the network topology information comprises the Identity identifiers of routers in sequence level, the link information of the routers, port numbers and the Identity identifiers of the port direct-connection routers, wherein the port numbers only list ports with link connection relation with other routers.
Table 2 network topology information format of topology controller
The hierarchical relationship between network topology information fields of the topology controller in this example is as follows:
the topology controller in this example can provide interfaces for other controllers to query shortest distance and bidirectional next hop ports between any two nodes in the topology, respond to unidentified identification forwarding table miss un-mapping UFT type messages of the forwarding layer, and provide interfaces for network topology visualization for application layer administrators.
In step S2 of this example, each identifier type corresponds to one identifier controller, where the identifier controller can only establish a secure channel with a router in the identifier plane, i.e. 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 includes three types of information, namely identification type information, identifier information and cluster information.
The first type of information of the identification controller is also identification type information, the identification type information of the identification controller only comprises the identification type represented by the identification controller, and the identification type is synchronously acquired by the topology controller through an east-west interface, so that only one piece of identification type information with the same format as the topology controller exists in the identification controller; because a plurality of identifiers correspond to the same router node in the multi-Identifier network, and two Identifier information with the same position are also identical, the Identifier information of the Identifier controller in this example is stored by using a hash table, and the value of the identity Identifier (Identifier) of the corresponding router is used as a key to index, and the index result is a pointer pointing to specific information; the second type of information identifying the controller is identifier information, and the 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 restore the real situation of the Identifier distribution in the multi-Identifier network.
Table 3 identifier information format identifying controllers
The hierarchical relationship between the identifier information fields of the identification controller in this example is as follows:
the identifier information of the identification controller in this example includes the identity of the corresponding router of the sequence hierarchy, the cluster number, whether the router is an edge identifier, the link information of the corresponding router, the port number and the identifier of the same type that the port is directly connected, wherein the port number only lists the ports having the link connection relationship with other routers.
The third type of information of the identifier controller in this example is cluster information, where the cluster information of the identifier controller is stored using an array, and the format is shown in table 4 below, and each piece of cluster information represents one identifier cluster in the identifier plane, and is indexed using a cluster number as a key. Because clusters may disappear in the network updating process, the array corresponding to the cluster information may have a small number of memory holes. The cluster information is calculated by using the identification clustering algorithm of step S3 through the first type of information (identification type information), each piece of information represents one cluster in the identification plane, and the value of the cluster Id is used as a key for indexing.
Table 4 cluster information format identifying controller
The hierarchical relationship between cluster information fields of the identification controller in this example is as follows:
the identification controller responds to the unrecognizable identification forwarding table miss mapping RFT type information of the forwarding layer, and can provide an interface for the topology controller to query an edge identification list of a cluster where any identifier is located in the identification plane. All of this information is stored and calculated at the network formation according to the administrator's pre-configuration and forwarding layer signaling and dynamically updated as the network topology changes.
In step S3 of this example, the identifier controller may establish a secure channel with all routers in the corresponding identifier plane, receive the identifier information sent on 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, so as to obtain cluster information through calculation. The pseudo code of the identification clustering algorithm (Identifier Clustering Algorithm) described in this example is as follows:
/>
correspondingly, in step S3 of this example, the process of performing the identification clustering algorithm to calculate cluster information includes the following steps:
Step S301, initializing a Cluster array Cluster_List and a search queue nodeQueue to be empty;
step S302, traversing sequentially until an Identifier of an undetermined cluster in the identifier_HashMap of the identification hash table is found;
step S303, adding the identifier into a search queue nodeQueue, starting from the identifier, and searching all identifiers in the same cluster outwards by using a breadth-first search algorithm according to the connection condition of the identifier;
step S304, the searching of the Identifier of the next undetermined cluster in the identification hash table identifier_HashMap is continued, and the step S303 is returned to perform cluster searching until the end of the identification hash table identifier_HashMap.
More specifically, the step S303 in this example includes the following substeps:
step S3031, taking out an identifier of the search queue nodequue, initializing the attribute isEI to be temporarily regarded as a non-edge identifier (i.e. isei=false), traversing the port, adding the identifier of the non-empty port into the search queue nodequue to continuously perform the breadth-first search, and judging the identifier as an edge identifier if the empty port exists, i.e. isei=true;
step S3032, judging the attribute isEI of the identifier, if the identifier is an edge identifier, namely a True value, adding the edge identifier into an edge identifier Fu Shuzu Eis of a corresponding cluster, otherwise, adding the edge identifier into an internal identifier Fu Shuzu IIs;
Step S3033, it is determined whether the search queue is empty, if not, the process returns to step S3031 to process the next identifier in the search queue nodeQueue, and if so, the search of one identifier cluster is completed.
It is worth to say that, by the design of the technical scheme, the multi-identifier network system routing method based on the identifier clustering can be provided for solving the problem of cross-cluster routing performance in the multi-identifier network, and the multi-identifier network system routing method executes the same-cluster routing method or the cross-cluster routing method based on the identifier clustering result, so that the cost of forwarding the network packet on the router which does not support the self-identifier type can be effectively reduced, and the semantic expression efficiency and forwarding rate of the network packet are improved.
In the multi-identification network, the source identification type and the destination identification type of the network packet are the same, namely the source identification type and the destination identifier are in the same identification plane, but the identification bits of the same type are different in identification clusters. Such a cross-cluster routing process requires routing through routers that do not support the identification type to complete the forwarding process. The distributed flow table structure is designed for the multi-identification router, so that not only is the routing forwarding method of the whole network unified, but also the router is guided to correctly forward the unknown network packet identification type through the unidentified identification forwarding table UFT, the cross-cluster routing process is opened, and the requirement of multi-identification network cross-network domain communication is met.
In this example, when the 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 the semantics conveyed by the destination identifier. Taking content identification as an example, a content identification network packet is divided into a request packet and a data packet. The request packet will match the CS table and the FIB table in turn, the CS table refers to the Content cache table (CS), the FIB table refers to the routing information table (Forward Information Base, FIB), the successfully forwarded request packet will leave the return path information in the PIT table, the PIT table refers to the pending request table for the packet of interest (Pending Interest Table, PIT). The data packet decides whether to leave a buffer copy at the current router position according to the router buffer method, and then forwards according to the PIT table item matching result. These processes cannot be implemented on routers that do not support content identification types, i.e., cannot perform operations such as in-network caching and request aggregation.
Therefore, the route forwarding method from the source identifier to the destination identifier in this example cannot simply consider the single-point to single-point optimal path from the source to the destination, and the design concept of the multi-identifier routing method in this example is to minimize the number of route hops of the network packet on the router that does not support the identifier type in the identifier plane, so the cross-cluster routing method is one of the design key points of the whole routing method.
In this example, the multi-identifier network system routing method SD-MIRS pseudo code based on the identifier clustering result in step S4 is as follows:
correspondingly, in step S4 of the present example, the process of implementing multi-identifier 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 clustered together according to an identification clustering result in an identification plane where a network packet is located, if the source identifier and the destination identifier are clustered together, jumping to step S402 to execute a routing step in the cluster; if the source identifier and the destination identifier are different in cluster, 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 an intra-cluster routing step;
step S403, the cross-cluster routing step is divided into two steps:
step S4031, which is used to realize the shortest path selection among clusters, takes a plurality of edge identifiers (marked as src EI) of a source cluster as a starting point, a plurality of edge identifiers (marked as dstEI) of a destination cluster as an end point, and plans an optimal path according to the minimum hop count, thereby obtaining one or more cross-cluster forwarding paths;
Step S4032, configured to implement overall best path selection, and calculate, for an edge identifier (src ei) of a source cluster and an edge identifier (dstEI) of a destination cluster corresponding to each cross-cluster forwarding path, a first best path hop count between the source identifier (src) and the edge identifier (src ei) of the source cluster, and a second best path hop count between the edge identifier (dstEI) of the destination cluster and the destination identifier (dst) by using a point-to-point optimal path planning algorithm, and calculate a sum of the first best path hop count and the second best path hop count as an evaluation basis of the cross-cluster forwarding path, so as to select a best path. If there are multiple optimal paths, randomly selecting one path as an output result.
In summary, the flow table structure in the multi-identifier router in this embodiment adopts a software implementation manner, and reasonable reduction of the flow table size has positive effects on improvement of addressing efficiency and reduction of memory overhead.
It is worth to say that the addressing efficiency of the network packet in the router is an important evaluation standard of a routing method, the embodiment designs a special cross-cluster routing step aiming at the communication scene of the source identifier and the destination identifier in the multi-identifier network, and compared with the single-point to single-point optimal path planning from the source to the destination, the cross-cluster routing step of the embodiment can pass through routers which do not support the identifier type as few as possible, reduces the forwarding cost, effectively improves the addressing efficiency of the cross-cluster network packet, improves the semantic expression efficiency and the forwarding rate of the cross-cluster network packet, and provides a larger playing space for the table item optimization method aiming at specific identifiers in the future.
Further investigation of the cross-cluster routing process as shown in fig. 4 may find that:
(1) When all routers in the path from the source identifier (src) to the edge identifier (srcEI) of the source cluster receive the network packet, the destination identifier (dst) field of the network packet will hit in the cluster table. The cluster appearance of the embodiment has lower priority than the cluster interior table, and the table item scale of the cluster appearance is larger than the table item scale of the cluster interior table, so that the hit rate of the cluster interior table can be improved, the addressing efficiency of the network packet in the router can be improved, and the overall forwarding speed of the cross-cluster route is improved.
It should be noted that, in this example, the flow table is divided into an intra-cluster table and an outer-cluster table according to whether the identifier of the flow table entry and the identifier mapped by the router in the identifier plane are clustered together; on the basis that the priority of the cluster appearance is lower than that of the cluster interior table, the size of a preset table item of the cluster exterior is larger than that of the preset table item of the cluster interior table, the preset survival time threshold of the cluster interior table is preferably set to be larger than that of the cluster exterior, the preset survival time threshold refers to a preset survival time threshold of the flow table, the flow table can be self-defined and adjusted according to actual requirements, and when the survival time of the flow table exceeds the preset survival time threshold, the table item is automatically deleted; the setting is not a conventional design or a conventional means in the industry, but is designed according to the technical scheme of the application aiming at the scene of an actual multi-identification network system, the setting can well improve the hit rate of the in-cluster table, concentrate the heat in part of the 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 kinds of optimization designs with different angles.
(2) When Router3 (third Router) and other routers which do not support the identification type receive the network packet, the destination identifier (dst) field of the network packet will hit in the unidentified identification forwarding table UFT, so that under the condition of complex identification distribution, the number of table entries required by UFT is quite large, and in this example, heat is concentrated in part of table entries, and the table searching speed of UFT can also be improved. Experiments show that the network packet is guided to any Router in the correct direction at Router3, and the correct addressing route can be realized, wherein the edge identifier dstEI of the destination cluster is a good choice.
Therefore, the multi-identification network packet of the multi-identification network system adds the transit identifier field, and the addressing efficiency of the cross-cluster routing packet is improved by reasonably modifying the field values on several key routers on the path.
TABLE 5 Critical actions in Cross-cluster routing
The cross-cluster process of adding the transit identifier in this example is shown in the above table 5, a cross-cluster routing action list is established, key operations between routers in the cross-cluster routing path are sequentially described from left to right, and an identifier in an identifier plane, a transit identifier field value, a hit table, actions and additional actions when a network packet is received are sequentially recorded from top to bottom. Wherein line 2 shows the identifier that the router has in the identification plane, which the router 4 does not support; line 3 is the value of the transit identifier field when the router receives the network packet, and after the router determines the identification type in the identification type table RTT, the network packet is processed as in the multi-level flow table of the identification type, and finally the matching flow is hit and jumped out from one of the flow tables, and the hit table of each router is shown in line 4 of table 5 below. Network packets that hit in the self-identifier entries in the cluster-outside or in-cluster table will have some additional actions performed on them by the router in addition to being forwarded, exemplified in rows 5 and 6 of the table.
It should also be noted that, in this example, a transfer identifier field is added to the multi-identifier network packet, and by modifying the transfer identifier on the key router, the priority of the table in the cluster and the hit rate of the small-scale flow table are improved, so that the heat is concentrated on a part of the table entries, and the overall forwarding efficiency of the multi-identifier network can be further improved.
(1) When the transfer identifier field value hits in the cluster table, the additional action of the entry is to modify the transfer identifier field value to a predetermined value. When the controller makes a method, for a router with an edge identifier as a self identifier, such as a router 3, a flow table generated for the router can modify a transit identifier field value into the edge identifier of a target cluster; for routers represented by an intra-cluster identifier, such as router 1, the flow table generated for it will modify the transit identifier field value to the edge identifier of the cluster in which it resides.
(2) When the transit identifier field value is the same as the router's own identifier, the network packet will hit at the entry in the cluster with the highest table priority, the additional actions of this entry are: 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 itself, such as the router 7, directly receiving the packet, recovering the memory allocated to the packet, and completing the routing process; otherwise, as router 3 and router 5, the transit identifier field value is changed to the destination identifier field value of the network packet, and matching is continued in the in-cluster table.
The additional actions are preset in the flow table items generated by the controller, and the router of the forwarding layer only needs to execute the actions and forward the actions according to the matching result of the flow table.
Therefore, the embodiment executes the same-cluster routing step or the cross-cluster routing step 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 forwarding rate of the network packet are effectively improved; on the basis of the method, the transfer identifier field is added to the multi-identification network packet, the priority and the hit rate of the small-scale flow table are improved through modification of the transfer identifier on the key router, heat is concentrated on part of the table entries, and then the overall forwarding efficiency of the multi-identification network can be further improved.
The foregoing is a further detailed description of the invention in connection with the preferred embodiments, and it is not intended that the invention be limited to the specific embodiments described. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.
Claims (3)
1. The multi-identification network system routing method based on the identification clustering is characterized by comprising the following steps of:
step S1, unifying network grouping formats through a multi-identification network grouping coding mode; the multi-identification network block coding mode adopts a TLV format comprising 5 fields of a source identifier, a destination identifier, an identification type, a transit identifier and network packet original data;
step S2, distinguishing the controller types according to the control domain of the forwarding layer, wherein the controller types comprise unique topology controllers and a plurality of identification controllers, the topology controllers and all routers of the forwarding layer establish a safety channel, and the topology controllers comprise identification type information and network topology information; the identification controller comprises identification type information, identifier information and cluster information, and establishes a secure channel with a router in an identification plane only, namely a router supporting the identification type, and is used for collecting the identification type information and executing an identification clustering algorithm so as to analyze identification topology distribution and cluster information;
the identification type information of the topology controller comprises serial numbers of identification types of a sequence level, identification type meanings, interface addresses of the identification controllers corresponding to the identification types, a flow table information list formed by dynamic arrays, flow table numbers and flow table meanings, wherein the flow table numbers are serial numbers which are not less than 2 and are not repeated;
Each identification type corresponds to one identification controller, and the identification type information of the identification controller only comprises the identification type represented by the identification controller, and the identification type is synchronously acquired by the topology controller through an 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 keyword to index, and the index result is a pointer pointing to specific information;
the identifier information of the identifier controller comprises an identifier of a corresponding router of a sequence level, a cluster number, 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; the link information of the corresponding router, namely the similar identification list of each port direct-connection router, is a dynamic array; the port numbers only list ports with link connection relation with other routers; if the connected router does not support the current identification type, the port direct connection type identifier is empty;
the cluster information of the identification controller is stored by using an array, each piece of cluster information represents one identification cluster in an identification plane, and the cluster number is used as a keyword for indexing;
Step S3, executing an identification clustering algorithm through an identification controller, calculating to obtain cluster information, and obtaining a clustering result;
s4, realizing multi-identification routing based on clustering results;
in the step S3, the process of performing the identification clustering algorithm to calculate cluster information includes the following steps:
step S301, initializing a cluster array and a search queue to be empty;
step S302, traversing sequentially until an identifier for identifying an undetermined cluster in the hash table is found;
step S303, adding the identifiers into a search queue, starting from the identifiers, and 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, continuing to traverse and search the identifier of the next undetermined cluster in the identification hash table, returning to the step S303 for searching until the end of the identification hash table;
said step S303 comprises the sub-steps of:
step S3031, taking out an undetermined cluster identifier in the search queue, initializing the attribute of the undetermined cluster identifier to be a non-edge identifier, traversing the port of the undetermined cluster identifier, adding the undetermined cluster identifier into the search queue if the undetermined port identifier is the identifier, continuously searching for width priority, and judging the identifier to be the edge identifier if the undetermined port is the identifier;
Step S3032, judging the attribute of the identifier, if the identifier is an edge identifier, adding the identifier into an edge identifier array of a corresponding cluster, otherwise, adding the identifier 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 identifier cluster;
in the step S4, the process of implementing the multi-identifier routing based on the clustering result includes the following steps:
step S401, judging whether the source identifier and the destination identifier are clustered together according to the identification clustering result in the identification plane where the network packet is located, if so, jumping to step S402 to execute the routing step in the cluster; if the source identifier and the destination identifier are different in cluster, jumping to step S403 to execute a cross-cluster routing step;
step S402, based on the identification topological graph of the identifier space, directly carrying out single-point to single-point optimal path addressing on the source identifier and the destination identifier so as to realize an intra-cluster routing step;
step S403, taking a plurality of edge identifiers of a source cluster as a starting point and a plurality of edge identifiers of a target cluster as an end point, and planning an optimal path according to the minimum number of hops, so as to obtain one or more cross-cluster forwarding paths; and then, 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, and 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 by using a single-point to single-point optimal path planning algorithm for the edge identifier of the source cluster and the edge identifier of the destination cluster corresponding to each cross-cluster forwarding path.
2. The routing method of the multi-label network system based on label clustering according to claim 1, wherein in the step S2, label type information of the topology controller is configured and stored by using an array, and each piece of label type information represents one label type and is indexed by using a label number at the time of network initialization.
3. The routing method of the multi-identification network system based on the identification clustering according to claim 2, wherein the network topology information of the topology controller is obtained by collecting the identifications and the 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 one network node, the values of the identifications of the routers are used as keywords for indexing, and the network topology information comprises the identifications of routers in a sequence hierarchy, the link information of the routers, port numbers and the identifications of the port direct routers, wherein the port numbers only list ports with link connection relation with other routers.
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 CN114189468A (en) | 2022-03-15 |
| CN114189468B true 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) |
Families Citing this family (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 (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015043327A1 (en) * | 2013-09-30 | 2015-04-02 | 华为技术有限公司 | Routing method, device and system |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103150264B (en) * | 2013-01-18 | 2014-09-17 | 浪潮电子信息产业股份有限公司 | Extension Cache Coherence protocol-based multi-level consistency simulation domain verification and test method |
| US10148510B2 (en) * | 2015-03-02 | 2018-12-04 | Spidercloud Wireless, Inc. | Topology discovery and management and SON orchestration |
-
2021
- 2021-11-02 CN CN202111289590.0A patent/CN114189468B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015043327A1 (en) * | 2013-09-30 | 2015-04-02 | 华为技术有限公司 | Routing method, device and system |
| 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 (4)
| Title |
|---|
| Routing in the Centralized Identifier Network;Wensheng Chen;《2015 10th International Conference on Communications and Networking in China (ChinaCom)》;20160623;全文 * |
| SD-MIRS SDN-based Multi-Identifier Routing Strategy;Mengchu Shi;《International Conference on Computing, Networks and Internet of Things》;20210520;全文 * |
| 分簇结构在Ad Hoc网络中的应用综述;王海涛;《重庆邮电学院学报(自然科学版)》;20031230(第04期);全文 * |
| 基于能量均衡高效WSN的分簇路由算法;王宗山;《计算机工程与设计》;20211016;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114189468A (en) | 2022-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111371779B (en) | Firewall based on DPDK virtualization management system and implementation method thereof | |
| CN110572274B (en) | Named data network method for optimizing deployment and management of edge computing nodes | |
| EP3777055B1 (en) | Longest prefix matching | |
| US7668160B2 (en) | Methods for performing packet classification | |
| US10554555B2 (en) | Hash-based overlay routing architecture for information centric networks | |
| US20060221967A1 (en) | Methods for performing packet classification | |
| CN105072030B (en) | A kind of name data network route system and its cluster querying method based on content clustering | |
| US20180287942A1 (en) | Forwarding Data Packets | |
| CN109450795B (en) | Service router and service network system facing service network | |
| CN102123091A (en) | Method, device and network equipment for generating multilink transparent transmission interconnection forwarding table | |
| CN115426312B (en) | Method and device for managing, optimizing and forwarding identifiers in large-scale multi-modal network | |
| CN114189468B (en) | Multi-identification network system routing method based on identification clustering | |
| CN113556413A (en) | Message processing method and device | |
| CN107977160B (en) | Method for data access of exchanger | |
| US7940755B2 (en) | Lookup engine with programmable memory topology | |
| CN113630323B (en) | Software definition-based distributed flow table matching method in multi-identification network system | |
| CN115865844B (en) | Virtual-real combined dynamic flow scheduling method and device based on SDN (software defined network) and NDN (non-dynamic network) | |
| CN113098749A (en) | Message sending method, device and storage medium | |
| CN112688880B (en) | Method for reducing redundant data packet transmission in named data network | |
| CN113259263B (en) | Data packet scheduling method in deep packet inspection cluster | |
| US12010008B2 (en) | Network communication method and apparatus | |
| CN113037635A (en) | Multi-source assembling method and device for data block in ICN router | |
| US11924102B2 (en) | Minimizing deviation from average latency of table lookups | |
| CN115426308B (en) | Link state routing method under multi-identification network | |
| CN113411257B (en) | Method, device, computing equipment and storage medium for transmitting message |
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 |