INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES (Chine)
ZHENGZHOU SEANET TECHNOLOGIES CO., LTD. (Chine)
Inventeur(s)
Wang, Jinlin
Cheng, Gang
You, Jiali
Li, Yang
Han, Rui
Abrégé
The present application discloses a message forwarding method supporting packet retransmission between network nodes, aiming to support packet loss detection and fast retransmission between network nodes during message forwarding. The message forwarding method comprises: 1) an upstream node uniformly numbers messages in the same flow, fills in message sequence numbers, a flow identifier, an upstream node network address and a retransmitted packet flag field, sequentially writes the messages into a send buffer on the basis of the sequence numbers, copies the messages from the buffer and sends the messages according to the current sending rate; 2) a downstream node performs packet loss detection on the basis of the message sequence numbers, constructs feedback information and sends same to the upstream node; and 3) the upstream node determines lost messages on the basis of the received feedback information, reassigns sequence numbers and retransmits the messages. The method of the present application can carry out packet loss detection and fast retransmission between network nodes, effectively reducing the packet loss rate in a network and enhancing the transmission reliability of data packets in the network.
The present invention relates to the technical field of software-defined networking, in particular to a software-defined networking controller-based decision tree maintenance method, and a system. The method comprises the following steps: step 1: by means of a software-defined networking controller, on the basis of the growth speed of flow table entries and the time for dealing with eliminated branches of a decision tree, setting a threshold value; step 2: when the number of flow table entries generated by the decision tree is greater than the threshold value, by means of the software-defined networking controller, acquiring operating statistical data of each flow table entry in a switch, and on the basis of the corresponding operating statistical data, calculating the elimination priority of each flow table entry; and step 3: by means of the software-defined networking controller, on the basis of the elimination priority of each flow table entry, determining a branch to be eliminated in the decision tree, pruning said branch, and deleting a corresponding flow table entry. The present invention ensures that the decision tree does not occupy too much memory space, and further ensures normal forwarding of data packets.
The present application provides a multi-queue scheduler and a scheduling method. The multi-queue scheduler comprises: a queue type distinguishing module which is used for classifying a data packet; a port scheduler module which is used for, when receiving data, calculating a port characteristic value of a port to which data packet information belongs, and when scheduling for dequeuing, calculating an optimal port; and a queue scheduler module which is used for, when receiving the data, calculating a queue characteristic value and enqueuing the data packet information, and when scheduling for dequeuing, calculating an optimal queue, and scheduling for dequeuing. The present application has the following advantages: a scheduling algorithm can be independently modified and replaced without affecting other parts of the scheduler, thereby achieving good flexibility, scalability and maintainability; customization and expansion can be carried out on the basis of requirements and characteristics of the system, and the quantity of queues can be increased or modified and priority rules and scheduling algorithms can be adjusted on the basis of actual conditions; the characteristic value state of calling by the queue scheduler is maintained in BRAM, the scalability is high, and the resource consumption when the quantity required in expansion is within the BRAM depth is basically unchanged.
The present invention relates to the technical field of computing power resource scheduling, and in particular to a distributed computing power resource scheduling method and a system. The method comprises: step 1) querying a locally maintained mapping relationship between resource states of computing power resource nodes and forwarding nodes for a computing power resource service identifier in a computing power resource request message, so as to determine a group of candidate computing power resource nodes; step 2) on the basis of a resource demand preference field in the computing power resource request message, determining a corresponding computing power matching policy and, on the basis of the corresponding computing power matching policy and a computing power resource demand field and network resource demand field in the computing power resource request message, selecting from the group of candidate computing power resource nodes a computing power resource node meeting the resource demand of a user; and step 3) modifying the destination address of the computing power resource request message into the next hop forwarding address of the message corresponding to the selected computing power resource node. The present invention flexibly schedules computing power resources, and increases the overall utilization rate and scheduling success rate of computing power resources.
The present application provides a FPGA-based data packet parser and a method. The parser comprises a first-level configurable packet parsing module and secondary configurable packet parsing modules which are connected in sequence. The first-level configurable packet parsing module is used for extracting a protocol field at the lowest layer of a packet, and outputting a match field, a header, a packet header vector, and a starting offset to the secondary configurable packet parsing modules; the plurality of secondary configurable packet parsing modules are connected in sequence; and the secondary configurable packet parsing modules are used for parsing the packet on the basis of a parsing action configured in a dynamic configuration message. The present application has the advantages of: adapting to the processing requirements of different protocols, reducing the interface bit width between extraction units, and reducing resource consumption; allowing a matching rule and a field set of each stage to be flexibly adjusted on the basis of requirements; supporting free combination of a plurality of parallel protocol field extraction units, greatly improving the parsing performance; and meeting different packet parsing requirements, and providing higher customization and adaptability.
The present invention provides an FPGA-based data plane state programmable system, comprising a multi-stage match action table pipeline. The pipeline comprises a plurality of ordered match action table modules, configured to implement different data plane processing forwarding algorithms on the basis of read configuration instructions combined with a flow state matching table and a conditional branch matching table. The match action table modules each comprise: a key value extraction module, configured to construct a key value to be matched; a flow state query module, configured to obtain, by matching of said key value, information of flow address to which a packet pertains, and read corresponding flow state information; a packet header vector emission queue, configured to use a flow state address in the flow state information as an identifier to dynamically schedule, on the basis of the flow state address and a dependency relationship, packet header vectors for out-of-order emission; an action module, configured to determine a data plane processing forwarding algorithm on the basis of the configuration instruction for processing, and update the flow state information and table state information; and a packet header vector reordering cache module, configured to store executed packet header vectors, and submit disordered packet header vectors in order.
The present invention relates to the field of packet replication, and in particular to a packet replication method and system for a packet processing pipeline. The present invention only requires buffering one copy of a packet, and then the packet and a packet header vector obtained by parsing a customized generic data structure are simultaneously inputted into a packet processing pipeline. When an input is provided to a replication module, a flow table is queried on the basis of a replication identifier field to obtain a number of times of replication. The wire speed for the packet header vector is replicated and outputted by means of a replication enablement field and the number of times of replication, and a replication index field is set in a reverse order. Finally, the packet header vector and data are recombined by means of deparsing, so that replication and output of the wire speed for the packet are achieved. The present invention implements a high-performance packet replication method and reduces logic and storage resources required for replicating and storing packets. The position of the replication module in the pipeline can be flexibly adjusted, and modules achieve parameterization and wire speed processing. The present invention exhibits flexibility and expandability, and is applicable to network functions and techniques that have packet replication requirements.
The present invention belongs to the technical field of computing power networks, and specifically relates to a generation method for a management structure for nodes used in computing power notification, implemented on the basis of a hierarchical parsing system. The method comprises: step 1) a computing power notification node to be added starts from the lowest level of a node management structure; step 2) according to a computing power notification service identifier corresponding to the level, obtaining a list of existing computing power notification nodes in a parsing domain of the level; step 3) if the list is empty, proceeding to step 4), otherwise, examining the computing power notification nodes in the list and, according to a structure generation constraint, determining a selectable node set; according to a structure generation evaluation index, selecting an optimal node from the selectable node set and executing a notification tree joining operation to become a newly added child node of the optimal node, and proceeding to step 4); step 4) registering to the parsing system of the current level; and step 5) if the node to be added becomes the root node of the notification tree of the current level, adding 1 to the level and proceeding to step 2), otherwise, ending the process.
The present invention belongs to the technical field of name resolution, and specifically relates to a data-plane transparent acceleration method and system for an ICN name resolution service. The method comprises: step 1), for a resolution request packet, comparing the packet length of the resolution request packet with a set threshold value, if the packet length falls within a processing capability range, performing resolution and querying according to a protocol format, and proceeding to step 2), otherwise, uploading the resolution request packet to a control plane for resolution and querying; and step 2), if the resolution and querying is successful, performing packaging and then performing outputting, otherwise, uploading the resolution request packet to the control plane for resolution and querying. In the method in the present invention, a name resolution function is uninstalled from a path in which a data packet is uploaded to a controller, and the processing of a resolution request packet does not affect other functions of a data plane, thereby improving a pipeline processing capability; and by means of performing resolution as well as possible, transparent acceleration of a network-node name resolution service of the data plane is realized, thereby reducing the resolution latency of the name resolution service without affecting the capability of the name resolution service.
The present invention relates to the technical field of network communication and data processing, and relates in particular to a multicast system for identifier resolution-based routing. The system comprises a multicast source, multicast receivers, multicast member agents, and multicast processing nodes. The system further comprises an identifier resolution service module deployed in the cloud or in a network. The module uses a global unique identifier unrelated to any network addresses as a multicast identifier capable of uniquely identifying a multicast service, while IP network addresses are still used as network addresses. The module is further used to maintain mapping relationships between the multicast identifier and IP network addresses of one or more multicast processing nodes, and to provide registration, deregistration, and resolution and query services. Network nodes hosting a multicast bearer service comprise the multicast processing nodes and IP network routing and switching nodes. The multicast receivers apply to join the multicast service by means of the multicast identifier.
A ICN packet forwarding method, including: step 1) maintaining, by a network forwarding device, a network entity ID association state table, which is used for recording a state of the binding relationship between a network entity ID and a network address to which the network entity is associatively bound; after a network address binding relationship of the network entity changes due to location movement thereof, adding or updating, by the network forwarding device, a record of the network entity in the network entity ID association state table according to notification information of the network entity; and step 2) upon receipt of an ICN packet, by the network forwarding device, determining whether the ICN packet needs to be processed, according to information of the current network entity ID association state table; if yes, forwarding after processing the ICN packet; otherwise, directly forwarding the packet.
H04L 45/00 - Routage ou recherche de routes de paquets dans les réseaux de commutation de données
H04L 51/00 - Messagerie d'utilisateur à utilisateur dans des réseaux à commutation de paquets, transmise selon des protocoles de stockage et de retransmission ou en temps réel, p. ex. courriel
H04L 67/63 - Ordonnancement ou organisation du service des demandes d'application, p. ex. demandes de transmission de données d'application en utilisant l'analyse et l'optimisation des ressources réseau requises en acheminant une demande de service en fonction du contenu ou du contexte de la demande
12.
Routing and forwarding method for multi-homed network based on programmable network technology
A programmable network technology-based multi-homed network routing and forwarding method includes a data packet performing address-to-port matching a forwarding flow table address matching method; classifying addresses to matched ports corresponding to a destination address group; selecting a link information table and a port selection function, an appropriate port and a corresponding destination address group; cropping destination address groups of the remaining ports using an address filtering function and previous hop information carried in data to further crop the remaining destination address groups and addresses in the destination address group, a single destination address can be determined using a single address selection method, taking the single destination address using a universal routing and forwarding method to forward a packet to the destination address; otherwise, packaging the destination address group, and using a single address selection method to determine the single destination address hop by hop until the destination address is reached.
G06F 15/16 - Associations de plusieurs calculateurs numériques comportant chacun au moins une unité arithmétique, une unité programme et un registre, p. ex. pour le traitement simultané de plusieurs programmes
H04L 45/02 - Mise à jour ou découverte de topologie
H04L 45/00 - Routage ou recherche de routes de paquets dans les réseaux de commutation de données
The present invention provides a communication method based on an assembled communication protocol stack. The method comprises: construct protocols to form protocol modules, and place the protocol modules into a protocol module library; extract required protocol modules from the protocol module library, and assemble the extracted protocol modules to form a communication protocol stack; install the assembled communication protocol stack into a protocol stack running device; and an application on the protocol stack running device implements data communication by using the installed protocol stack. The specific process of constructing protocol modules comprises: constructing execution codes of protocols corresponding to an operating system to form protocol modules; and defining PDUs, that is, defining a corresponding data length and a data structure when each protocol module is in a mutual input/output relationship with other protocol modules in the protocol module library.
G06F 15/16 - Associations de plusieurs calculateurs numériques comportant chacun au moins une unité arithmétique, une unité programme et un registre, p. ex. pour le traitement simultané de plusieurs programmes
H04L 29/06 - Commande de la communication; Traitement de la communication caractérisés par un protocole
INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES (Chine)
ZHENGZHOU SEANET TECHNOLOGIES CO., LTD. (Chine)
Inventeur(s)
Wang, Jinlin
Wang, Lingfang
You, Jiali
Deng, Feng
Abrégé
The present invention relates to a Layer 2 adapter selecting system, including a Layer 3 packet requirements extracting module, a destination Layer 2 address acquiring module, a Layer 2 adapter metric acquiring module, an appropriate Layer 2 adapter identifier selecting module, a packet caching module and a packet scheduling module; wherein the packet caching module is configured to cache a received Layer 3 packet; the Layer 3 packet requirements extracting module is configured to read the Layer 3 packet and extract the type and a parameter value of the requirements; the Layer 2 adapter metric acquiring module is configured to acquire instant metric parameter values of each of the adapters; the appropriate Layer 2 adapter identifier selecting module calculates an adapter identifier and a Layer 3 packet metric; the destination Layer 2 address acquiring module is configured to acquire a Layer 2 address of each of the adapters associated with a destination Layer 3 address; and the packet scheduling module calls an external Layer 2 adapter driver, and the Layer 2 adapter driver completes packaging and sending of the packet. The present invention may solve the problem of resource waste of multiple links, so that the multiple links may be used dynamically in parallel.
H04L 12/721 - Procédures de routage, p.ex. routage par le chemin le plus court, routage par la source, routage à état de lien ou routage par vecteur de distance
INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES (Chine)
ZHENGZHOU SEANET TECHNOLOGIES CO., LTD. (Chine)
Inventeur(s)
Wang, Jinlin
You, Jiali
Wang, Lingfang
Abrégé
The present invention relates to a multi-protocol routing system, comprising a route determining module and a forwarding module which are located in network layer, wherein the route determining module is used for determining, based on the related information of applications and networks, the types of routable protocols and the next-hop path which are to be selected in the current routing phase; the forwarding module, including different routable protocols and corresponding routing information, is used for periodically calculating the newest remaining network resources and the state of link during a routing process and updating the forwarding table in current state. By integrating various characteristics and states of applications as well as different routable protocols, the present invention realizes real-time protocol selection and dynamic routing. Moreover, the present invention is easy to be expanded to other protocols, thus being adaptive to the continuous development and evolution of network services.
H04L 12/721 - Procédures de routage, p.ex. routage par le chemin le plus court, routage par la source, routage à état de lien ou routage par vecteur de distance
16.
MULTI-PROTOCOL ROUTING SYSTEM AND METHOD DRIVEN BY INTEGRATION OF APPLICATIONS AND NETWORKS
The present invention relates to a multi-protocol routing system, comprising a route determining module and a forwarding module which are located in network layer, wherein the route determining module is used for determining, based on the related information of applications and networks, the types of routable protocols and the next-hop path which are to be selected in the current routing phase; the forwarding module, including different routable protocols and corresponding routing information, is used for periodically calculating the newest remaining network resources and the state of link during a routing process and updating the forwarding table in current state. By integrating various characteristics and states of applications as well as different routable protocols, the present invention realizes real-time protocol selection and dynamic routing. Moreover, the present invention is easy to be expanded to other protocols, thus being adaptive to the continuous development and evolution of network services.
The present invention relates to a Layer 2 adapter selecting system, including a Layer 3 packet requirements extracting module, a destination Layer 2 address acquiring module, a Layer 2 adapter metric acquiring module, an appropriate Layer 2 adapter identifier selecting module, a packet caching module and a packet scheduling module; wherein the packet caching module is configured to cache a received Layer 3 packet; the Layer 3 packet requirements extracting module is configured to read the Layer 3 packet and extract the type and a parameter value of the requirements; the Layer 2 adapter metric acquiring module is configured to acquire instant metric parameter values of each of the adapters; the appropriate Layer 2 adapter identifier selecting module calculates an adapter identifier and a Layer 3 packet metric; the destination Layer 2 address acquiring module is configured to acquire a Layer 2 address of each of the adapters associated with a destination Layer 3 address; and the packet scheduling module calls an external Layer 2 adapter driver, and the Layer 2 adapter driver completes packaging and sending of the packet. The present invention may solve the problem of resource waste of multiple links, so that the multiple links may be used dynamically in parallel.
The present invention relates to a method based on the combination of UPnP and STUN for NAT traversal. The method of the present invention effectively takes the advantages of UPnP and STUN. In particularly, when UpnP fails to traverse NAT, STUN is applied to perform the NAT traversal for the second time, so that the efficiency of the successful traversal is effectively improved. For the symmetric NAT traversal, a Port-Adding Sample Estimation method based on NAT adding port mapping is provided for port estimation, to avoid the defects resulted from the third-party agent and the blindness of the speculation approach. And, where both of the communication peers in the P2P streaming media system are behind NAT, the method that the part of the ordinary outer peers with the sufficient bandwidth acts as the Auxiliary-Relay peers is provided to release the pressure of the relay server so that the bottle-neck of the communication is broken through.
G06F 15/16 - Associations de plusieurs calculateurs numériques comportant chacun au moins une unité arithmétique, une unité programme et un registre, p. ex. pour le traitement simultané de plusieurs programmes
G06F 15/177 - Commande d'initialisation ou de configuration
brevets
