35 results about "Overlay node" patented technology

Methods and apparatus are disclosed for dynamically discovering and utilizing an optimized network path through overlay routing for the transmission of data. A determination whether to use a default network path or to instead use an alternate data forwarding path through one or more overlay nodes is based on real-time measurement of costs associated with the alternative paths, in response to a user request for transmission of message data to a destination on the network. Cost metrics include delay, throughput, jitter, loss, and security. The system chooses the best path among the default forwarding path and the multiple alternate forwarding paths, and implements appropriate control actions to force data transmission along the chosen path. No modification of established network communication protocols is required.

A global namespace (GNS) is constructed across heterogeneous network-attached storage (NAS) devices by organizing metadata servers into a cluster layer having cluster nodes and a consistent hashing overlay layer having overlay nodes. The global namespace is distributed based on workload at the cluster and overlay nodes, and a portion of the GNS namespace may be migrated from one layer to the other. Cluster nodes may be added to the cluster layer, overlay nodes may be added to the consistent hashing overlay layer. Further, a cluster node may become an overlay node or an overlay node may become a cluster node. To access the global namespace, a request for namespace metadata managed by a cluster node is serviced by the cluster node, but if the requested namespace metadata have been migrated to the consistent hashing overlay layer, the cluster node will forward the request to the responsible overlay node for servicing.

A Flow Transport and Delivery Network (FTDN) supports delivery and transport of flows to destination nodes over parallel overlay networks. Overlay nodes executing overlay processes create and maintain one or more overlay networks. A plurality of sites are connected to each other via the parallel overlay networks with each site comprising one or more transit routers that route the flows to the destination nodes.

Registration and deregistration of entities in a distributed directory, hosted in a distributed overlay network are carried out in a peer-to-peer manner. The overlay nodes are volatile as every node can attach to or detach from the overlay in an unpredictable manner. Therefore, the distributed directory is volatile as its entries are created and destroyed unpredictably, in accordance with the distributed registration process. The registration and deregistration process can use SIP or other protocols. Application-level connection setup is also carried out on an overlay of volatile nodes, in a peer-to-peer manner using IP as the communications protocol. The application-level setup is aided by a distributed search algorithm, which can be based on DHT (distributed hash table).

Methods, apparatuses and program storage devices for constructing a network overlay via embedding an interconnection network in a network overlay graph are provided herein. The network delay distances between pairs of overlay nodes are measured on the shortest network paths. The mapping of the interconnection topology to the network overlay nodes preferably involves assigning 2m m-length binary indexes to the network overlay nodes. There is proposed herein a polynomial time algorithm for interconnection topology embedding using iterative cluster division and node binary index assignment. There is further proposed herein a method for construction of network overlays through interconnection network topology embedding, with the objective of optimizing a quality of service metric (e.g. minimization of the average network overlay routing delay).

A system and method for delivering content over the Internet from a content source to a destination is disclosed which includes the use of an overlay network, built on an underlying IP network. Additionally, error correction capability is added to the overlay network to allow the destination to reconstitute packets lost during the transmission over the Internet. In one embodiment, an overlay network is created using a plurality of overlay nodes, which may be geographically distributed, either throughout the country or throughout the world. Each respective content source or destination is also a part of the overlay network. Overhead, capable of providing error correction capability, is added to the content flow as it enters the overlay network. As the content flow leaves the overlay network, this overhead is removed from the content flow. In the case of transmission errors across the overlay network, the overhead information is used to reconstitute lost or corrupted packets.

The invention relates to a network measuring technology, and discloses a method, device and system for measuring the network performance between the Overlay nodes. The method in the invention comprises: seeking a source network node corresponding to the Overlay source node and a target network node corresponding to the Overlay target node respectively; seeking a converging node corresponding to the source network node and the target network node respectively; sub-measuring the network performance of that between the source network node and the corresponding converging node, between two converging nodes and between the target network node and the corresponding converging node, and computing the network performance between the Overlay nodes according to the measuring result. The system in the invention comprises a network measuring unit and a measuring unit, which are used to finish the measurement of the network performance between the Overlay nodes.

The invention discloses a communication overlay system for dynamic dispatching of carrier channel, which includes n overlay networks. Each overlay network includes an information source node used for providing a carrier channel and an overlay node used for overlaying the signals carried by the carrier channel of the information source node on each independent space; the system a carrier router, which is respectively and electronically connected with n information source nodes of n overlay networks, and is electronically connected with n overlay nodes of n overlay networks; the communication between the information source node and the overlay node of each overlay network passes through the carrier router; and the carrier router dynamically dispatches the carrier channel between n information source nodes according to the actual demands of the overlay nodes. The communication overlay system for dynamic dispatching of carrier channel has the following advantages that: at first, the communication overlay system for dynamic dispatching of carrier channel breaks through thinking limitation and leads the dynamic dispatching of the resources of the carrier channel to be possible; secondary, the structure is simple, which can dynamically dispatch a plurality of overlay networks through the independent carrier router, thus being convenient for construction and lowering the reconstruction cost.

The invention discloses a wireless Ad hoc network covering method based on covering contribution. The wireless Ad hoc network covering method comprises the steps that: firstly, initialized states of all nodes are uncovered nodes; all the nodes update covered degrees and covering contribution, and update respective covering state according to the covering contribution; and a covering node is converted into a covered node under the condition that a covering node with higher covering contribution exists in the neighborhood, a non-covering node is covered into a covering node under the condition that the covering contribution of the non-covering node is higher than that of all neighbor nodes, states of the covered nodes are modified into uncovered nodes if a covering node does not exist in the neighborhood of the covered nodes, states of the uncovered nodes are modified into covered nodes if a covering node exists in the neighborhood of the uncovered nodes, the uncovered nodes conform to a non-highest covering contribution node competition condition, and states of the uncovered nodes are modified into covered nodes after a plurality of cycles; and all the nodes periodically broadcast and receive HELLO messages in a one-hop range to establish a neighbourship. The wireless Ad hoc network covering method based on covering contribution can achieve rapid convergence and is high in reliability.

The invention discloses a method and a system for a box to cover a node. The judgment probability value is randomly generated. If the judgment probability value is smaller than the execution probability value, the non-central node with the largest net capacity is set as the central node, and the net box node of the central node is marked. If the judgment probability value is greater than or equal to the execution probability value , then a non-central node is randomly set as the central node, and the net box node of the central node is marked. The central node and the marked net box nodes form a box, the number of boxes is increased by 1, and the above steps are repeated until there are no unmarked nodes. Since the central node in the MEMB algorithm is the non-central node with the largest net capacity, and the central node in the RS algorithm is a randomly selected non-central node, by setting the execution probability value, the MEMB algorithm and the RS algorithm can be combined to ensure that the calculation The complexity is relatively small, and the accuracy of the result is relatively high.

The invention discloses a method and system for evaluating the invulnerability of an infrastructure network based on area damage. The evaluation system includes an edge conversion module, a weighted clustering algorithm module, a key area search algorithm module for coverage nodes, and a single key area search algorithm module. , multi-key area search algorithm module and network invulnerability evaluation module, and are electrically connected in turn. By obtaining the infrastructure network structure as a topology structure, the edges are converted into virtual nodes with the same weight, and a set of virtual points is obtained to calculate the damage Circle the damaged node and the virtual node to obtain the key area, and then sequentially calculate the key area covering a real node, the single key area and all key areas of the infrastructure network, and obtain the edge preservation ratio value set, according to the preservation ratio The cumulative value of the loss ratio obtained by the value set is normalized to obtain the evaluation result, and the influence factors are considered in many aspects, which increases the application range of the evaluation model.

The invention discloses a method for repairing a routing table in a P2P superimposed network, which includes: when P2P superimposed network nodes keep alive, the P2P superimposed network node confirms whether its own routing table is consistent with the other party, and respectively performs routing table repair when inconsistent. The present invention also discloses a P2P overlay network node, including: a confirmation unit, used to confirm whether the routing table of the P2P overlay network node to which it belongs is consistent with that of the other party's P2P overlay network node when keeping alive between P2P overlay network nodes. The routing table is consistent, and the repairing unit is triggered when inconsistent; the repairing unit is used to repair the routing table of the P2P overlay network node to which it belongs. The present invention utilizes the keep-alive process between the P2P overlay network nodes to realize the route repair between the P2P overlay network nodes, realizes the discovery and deletion of the P2P overlay network nodes in the P2P overlay network, and the P2P overlay network nodes with less cost. Routing table fixes.

The embodiment of the invention discloses a media forwarding method, a system and a device. The system comprises a multi-service controller and an access overlay node (AON); wherein, the multi-service controller is used for controlling the AON to carry out media forwarding on media stream and monitoring the quality of experience (QoE) of the media stream; the AON is used for accepting the controlof the multi-service controller, adding an overlay layer on a layer 2 or a pseudo wire (PW) of the media stream for media forwarding and feeding back the feature data of the QoE of the media stream to the multi-service controller. By the invention, an access network can carry out media processing and forwarding on the media stream through optimal paths and monitor the QoE of the media stream through the overlay layer of the layer 2 or PW; when the QoE is degraded, the path for media processing is reconfigured and optimized according to the media processing resource placement of the access network so as to dynamically improve the QoE of the media stream and user experience.

The invention discloses a wireless ad hoc network networking method with a linear topology structure. The wireless ad hoc network networking method is mainly composed of a root node and several routing nodes; the wireless ad hoc network group with a linear topology structure of the present invention The network method can use the root node as the starting layer node, one node per layer, and cascade layer by layer to achieve long-distance network coverage, and the number of nodes is theoretically unlimited. It can better solve the problems of small coverage, short transmission distance and limited number of network nodes of other ad hoc networks; the network address allocation is simple and the networking is convenient; the wireless ad hoc network with a linear topology has a root node, and other It is a routing node. Each routing node can only be connected to one child node. There are two data transmission paths in the wireless network. One is that the root node passes through multiple routing nodes to the destination node, and the other is that the destination node passes through multiple routing nodes to the root node. Node; applicable to scenarios where the root node is used as a gateway to realize data reading and operation control of each node.