43 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 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.

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 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 system and methods to construct and maintain a balanced-tree overlay network are used to host distributed databases. As overlay nodes can detach from and re-attach to an overlay unpredictably, overlay protocols must maintain the overlay tree properly to minimize communication overheads associated with store and retrieval operations of the hosted databases. Unlike a DHT (distributed hash table) approach, the balanced-tree approach has the advantages of stabilizibility and provable correctness of the overlay protocols. Fast inquiry can be achieved by using a caching algorithm that allows each overlay node to keep track of data ranges stored in a neighboring set of nodes. Self-healing and load balancing protocols are also incorporated to enhance the performance and stability of the tree-structured overlay.

An apparatus for processing metadata includes: a map node defining component configured to define a map node for setting a virtual map; a map overlay node defining component configured to define a map overlay node for setting a layer in which an augmented reality object is to be overlaid on a map set according to the map node; a map marker node defining component configured to define a map marker node for setting a position of the augmented reality object on the map, which is to be overlaid on the layer set according to the map overlay node; a point of interest node defining component configured to set information on a point of interest, which is a position of the augmented reality object on the map; and a controller configured to load the virtual map, the layer, the map marker, and the point of interest.

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.

An overlay network of volatile nodes, without centralized servers, using DHT-like search algorithms, is programmed to perform One-Number or One-ID services. A user's public number is either the PSTN or PLMN line that is connected to an overlay node, or a voice (or video) over IP number, which is serviced through the overlay. An overlay node is connected to the Internet, and may connect to a PSTN or PLMN phone line as well. The phone numbers allowed in the One-Number service is generally defined. The One-ID service architecture is based on user-proxy, and does not require social networking other one-ID protocols such as OpenID and protocols suites drafted by OASIS. The user-ID of such a One-ID service is not required to be globally unique while a mapping is used to transform a user-defined non-globally unique ID into a site-specific and site-unique ID.

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 control of 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 is applied to the wireless mobile communication field, and provides wireless multi-hop network data sending and receiving methods based on intelligent antenna technology. The data sending method comprises the following steps: (a1) acquiring destination address information from a data packet to be sent; (a2) according to the acquired destination address information, determining a destination node in all overlay nodes overlaid by an emission node; (a3) according to the determined destination node and other overlay nodes overlaid by the emission node, determining an expectation angle and an interference angle; (a4) according to the determined expectation angle and the interference angle, calculating a weight vector of adaptive wave beamforming , and aligning a main lobe with an expectation signal and aligning a zero point with an interference signal; (a5) according to the weight vector of the adaptive wave beamforming, sending the data packet after weighted to the object node. According to the sending method in the invention, a node coverage range, communication quality and communication efficiency can be raised, and a communication blind area can be effectively reduced.

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).

The invention relates to a node redundancy detection method for a heterogeneous sensor network, wherein judgment is performed with different redundancy rules by adopting an algorithm that nodes are classified according to positions of neighbor nodes. Aiming at a scheduling method for covering nodes in a traditional isomorphic network, the method provided by the invention comprises the following steps: classifying the neighbor nodes into three types according to node positions in a sensor network with two sensing distances; and judging with different redundancy rules so as to judge whether the nodes can sleep. Meanwhile, the traditional redundancy judgment flow is also changed so as to achieve the purpose of preventing blind points from being covered. The problem of redundancy caused by high-density deployment of nodes is solved, and the life cycle of the network is prolonged.

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 discloses an infrastructure network survivability evaluation method and model based on regional damage. The evaluation model comprises an edge conversion module, a weighted clustering algorithm module, a coverage node key area search algorithm module, a single key area search algorithm module, a multi-key area search algorithm module and a network survivability evaluation module. Andthe plurality of modules are electrically connected in sequence, an obtained infrastructure network structure is a topological structure; the edges are converted into virtual nodes with the same weight; a set of virtual points are obtained, nodes damaged by the damaged circle and the virtual nodes are calculated; critical regions are obtained, a key area covering a certain real node, a single keyarea of the infrastructure network and all key areas are sequentially calculated to obtain the edge storage ratio value set, normalization is carried out according to the loss ratio accumulation value acquired according to the storage ratio value set, the evaluation result is acquired, influence factors are considered from multiple aspects, and the evaluation model application scope is enlarged.

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 provides an overlay network-based route selection method and a system. The method comprises the following steps: after receiving a service request sent by a data source end (SC), any overlap node of the overlay network forwards the service request to other overlay nodes; each overlay node measures a first delay time value from the overlay node and a destination end (DC), and sends the first delay time value to the SC; the SC measures each second delay time value from the SC to each overlay node respectively, and calculates each total delay time value from the SC to the DC via each overlay node respectively according to each second delay time value and each first delay time value; and the SC selects the overlay node with the smallest total delay time value as current data forwarding node, and selects other overlay nodes with the smallest total delay time values and meeting transport delay constraint as backup data forwarding nodes. By adopting the overlay network based route selection method and system, the data transmission efficiency is effectively improved, the network throughput is increased, and the data transmission reliability is ensured.

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. 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 discloses a node connection line generation method and device, an apparatus and a storage medium. The method comprises the steps of determining a to-be-connected first node and second node according to a node connection instruction, and determining a start anchor point in the first node and an end anchor point in the second node; determining a current connection type according to preset connection type information, the starting anchor point and the end anchor point; obtaining a relative position relationship between the starting anchor point and the end anchor point, and determining a target intermediate point according to the current connection type and the relative position relationship; and generating a target node connection line according to the starting anchor point, the end anchor point and the target intermediate point. According to the method, the multi-point right-angle broken line type node connecting line is generated, the connecting line bypasses to avoid thesituation that the connecting line coincides with the node edge distance or covers nodes, the drawing effect of a flow chart is improved, and the user experience is improved.

The invention discloses a carrier channel router which is in series connected between an information source node and an overlay node of each overlay network and is used for completing the carrier channel resource scheduling among a plurality of overlay networks. The router comprises a network mixing unit and a scheduling unit; the network mixing unit is used for completing the electric connection between the information source nodes and the overlay nodes of a plurality of overlay networks and enables the sum of the carrier channel of all the overlay networks to be existed in each overlay network; and the scheduling unit is used for intercepting the signal of each overlay network and detecting the actual demand of the overlay network to the carrier channel, and realizing the dynamic scheduling of the carrier channel between at least two overlay networks. The invention has the advantages that firstly, the structure is easy to realize, a plurality of networks can be connected through the independently-provided carrier channel router, the scheduling function is realized, the construction is facilitated and the reconstruction cost is low; and secondly, the scheduling method of the invention breaks through the inherent thought limitation and enables the dynamic scheduling of the carrier channel resource among a plurality of base stations to be possible.

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.