Chinese Academy of Sciences

Beijing Hili Technology Co. Ltd.

Asiainfo Technologies (China), Inc.

Xiaozhou Ye

Gang Cheng

Jinlin Wang

Lingfang Wang

Haojiang Deng

Jun Chen

Weining Qi

Yiqiang Sheng

Jiali You

Ye Ouyang

Yi Liao

Aidong Yang

Pufang Ma

Boquan Cheng

Mohan Wu

A method of resource scheduling in a computing force network, wherein the computing force network includes at least one node among which at least one forward path exists, and the method includes the following steps: for each of the at least one node, acquiring node performance indicator of the node based on resource indicators of the node and at least one influence node related to the node; for each of the at least one forward path, acquiring path performance indicator of the forward path based on the performance indicators of nodes constituting the forward path; and in response to a business requirement for the computing force network, selecting at least one optimal forward path from the at least one forward path based on the forward path performance indicators of the at least one forward path.

Resource scheduling method for computing force network

A method for propagating a movement event message of a network entity, including: step 1) a network device maintaining a historical forwarded information list, wherein a network device capable of receiving a movement event message from an external system or device maintains an uplink port information table; step 2) after receiving the message, the network device performs matching using the table to obtain a forwarding port and forwarding information of the message, and constructs a movement event forwarding message using the information and forwards through the forwarding port; and step 3) after a device receives the message, searching for a matching forwarding port and forwarding information of the message in the information list, modifying the message using the forwarding information, and forwarding the modified message through the forwarding port. The method is able to propagate a movement event message to a network device responsible for related data transmission and forwarding.

Method for propagating movement event message of network entity

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.

Routing and forwarding method for multi-homed network based on programmable network technology

A query enhancement system for constructing an elastic field based on a time delay, including: dividing a network node to obtain a set of containers composed of several containers, wherein the containers are nested and each container includes a management node for performing node organization, neighbor maintenance and query services within the container. Further, a query enhancement method for constructing an elastic field based on a time delay includes: carrying out same-layer non-intersection full-coverage division on a network node to obtain a set of containers that are nested, and execute a query flow without a given low time delay requirement which uses an existing query technique and a nearby query flow with a given low time delay requirement which uses a distributed nearby querying method to carry out a nearby query; with an actual query time delay index Ti less than the requirement of an upper time delay limit Ts.

Query enhancement system and method for constructing elastic field based on time delay

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.

ICN packet forwarding method

A method for generating a nested container with no intersection and same layer full coverage, including: giving a right undirected graph G(V, E, W) and network measurement index set {Ti} for dividing nodes in G, each network measurement index Ti corresponding to a Ci layer container set {Ci k}; deleting an edge weighing greater than Ti, and segmenting G into subgraphs, each a connected component; setting all nodes in the subgraph Gcm not in the Ci layer container as set L; selecting one node from set L as current anchor aj; starting with anchor aj, performing breadth-first search on all nodes in L and Ci+1 layer container containing aj with the path communicated therewith less than Ti forming a Ci layer container with anchor aj; setting j'=j+1, determining whether L is a null set; setting m=m+1, determining whether all subgraphs are processed; setting i=i&#x2212;1, and determining whether i=1 is satisfied.

Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium

A fast query method for a mobile network entity dynamic location information, using a distributed container hierarchical nested structure to process registration and queries for location information, includes: after a network entity connects to a network attachment point after moving and obtains a new network address assignment, determining a series of a registered container, and then registering new location information corresponding to where the network entity is currently located, the location information containing at least current network address information; when a network forwarding device learns that the network entity is currently un-reachable, querying the new location information of the network entity from the container where the network entity was located before moving; and the container where the network entity was located before moving, after receiving the query request, obtains the new location information of the network entity by searching in the container and in a peer neighboring container set.

Growing community of inventors

Beijing, China

Xiaozhou Ye