4360 results about "PathPing" patented technology

Techniques for securing electronic data and keeping the electronic data secured at all times are disclosed. According to one embodiment, a client module in a client machine is configured to provide access control to secured documents that may be located in a local store, another computer machine or somewhere over a data network. The client module includes a document-securing module configured to operate in a path through which a document being accessed is caused to pass so that the document can be examined or detected for the security nature. If the document is secured, the document-securing module obtains a user or group key to decrypt security information in the secured document for access rules therein. If a user accessing the document is determined to have the access privilege to the secured document, a file key is retrieved from the security information and a cipher module is activated to decrypt the encrypted data portion with the file key. Likewise, if a document is to be secured, the cipher module encrypts clear data from the document to create the encrypted data portion. The document-securing module integrates proper or desired security information with the encrypted data portion to produce the secured document.

Methods and apparatus that enable more than one server to host a resource using a shared IP address such that a client may generally access the resource on any of the servers using the shared IP address are disclosed. According to one aspect of the present invention, a method for providing paths that allow a client to access a resource in a TCP/IP network includes obtaining an IP address, as well as associating the IP address to first and second servers. The first and second servers support the resource at the IP address, and a first path of the plurality of paths that allow the client to access the resource is between the client and the first server and a second path of the plurality of paths that allow the client to access the resource is between the client and the second server.

Methods and systems for communicating between autonomous vehicles are described herein. Such communication may be performed for signaling, collision avoidance, path coordination, and/or autonomous control. A computing device may receive data for the same road segment from autonomous vehicles, including (i) an indication of a location within the road segment, and (ii) an indication of a condition of the road segment. The computing device may generate, from the data for the same road segment, an overall indication of the condition of the road segment, which may include a recommendation to vehicles approaching the road segment. Additionally, the computing device may receive a request from a computing device within a vehicle approaching the road segment to display vehicle data. The overall indication for the road segment may then be displayed on a user interface of the computing device.

The present invention relates to distributing the load between the set routes among a plurality of routes between a communication apparatus which serves as a start point to another communication apparatus which serves as an end point. An apparatus provided in a router in a network collects traffic characteristics of transmission paths connected to the router, notifies other routers of the collected traffic characteristics, calculates load based on the collected traffic characteristics, decides based on the calculated load information whether or not a transmission path should be added or deleted, and equalizes the load among the plurality of transmission paths.

A system and method that routes special number calls from communications devices, including VoIP communications devices, to an answering point that is selected based on a parameter. A peering network effects parameter-based routing of calls to a pre-assigned answering point, wherein the voice path and the signaling paths are set up simultaneously. A gateway in the peering network is connected to the service provider switch and receives special number calls. The gateway queries a pre-provisioned parameter server that determines call routing information for the particular communications device. The gateway then selects another gateway, or, optionally, a selective router access provider network, based on the routing information and delivers the call thereto. The other gateway or selective router access provider network is connected to a router in the destination network and delivers the call and the call parameters to the router.

Disclosed are methods, computer program products, apparatus, and systems for controlling sending and receiving of universal serial bus (“USB”) messages between a plurality of host computers and a USB device over a data network. A first USB server is in communication with a first one of the host computers and the data network. A second USB server is in communication with a second one of the host computers and the data network. A USB client is in communication with the data network and the USB device. A first control path is established between the USB client and the first USB server, and a second control path is established between the USB client and the second USB server. A data transfer path is established between the USB client and the first USB server. The data transfer path enables sending of data between the USB client and the first USB server over the data network. A busy message is sent from the USB client to the second USB server over the second control path when the data transfer path is established with the first USB server.

A QoS routing apparatus as a node of a logical network to transmit data communicated between user's terminals comprises a relay unit discriminating whether or not flows of received data are measurement flows and transmitting said received data, a quality measurement unit measuring communication quality of links connected the own apparatus using the measurement flows, a quality accuracy setting unit determining measurement accuracy of the communication qualities of the respective links and a path setting unit prescribing transmission amounts of the measurement flows to the respective links. When the path setting unit prescribes the transmission amounts of the measurement flows, it applies a higher rate to a link which has been determined a lower measurement accuracy.

In a multinode data processing system in which nodes exchange information over a network or through a switch, a structure and mechanism are provided which enables data packets to be sent and received in any order. Normally, if in-order transmission and receipt are required, then transmission over a single path is essential to insure proper reassembly. However, the present mechanism avoids this necessity and permits Remote Direct Memory Access (RDMA) operations to be carried out simultaneously over multiple paths. This provides a data striping mode of operation in which data transfers can be carried out much faster since packets of single or multiple RDMA messages can be portioned and transferred over several paths simultaneously, thus providing the ability to utilize the full system bandwidth that is available.

A number of techniques are described for routing methods that improve resistance to faults affecting groups of links subject to common risks. One of these techniques accounts for failure potentials in physical networks by considering shared risk link groups separately from performance and costs metrics in determining a primary routing path and a backup path. A shared risk link group (SRLG) is an attribute attached to a link to identify edges that have physical links in common and can therefore be simultaneously disrupted due to a single fault. Another technique considers node disjointness and provides a solution of two paths that are as node disjoint as possible and minimizes administrative costs. The techniques may further be combined in a priority order thereby providing a solution of at least two paths that are strictly SRLG disjoint, as node-disjoint as possible, and have minimum administrative costs. Due to the priority order of evaluation and typical network physical configurations of links, with the links associated common fault SRLGs, the priority ordering technique is very efficient in determining at least two paths for routing between a source and destination node.

A method and system for enabling peer to peer synchronization between members of a synchronized network. A predefined synchronization reference area on each member of the network is provided. A common identifier associated with the synchronization network is provided to each member. Changes are detected on a member regarding a data item. A network identifier associated is obtained. A unique identifier of a synchronization module is obtained. A relative path to the data item within the predefined synchronization reference area is obtained. A unique value is calculated based upon a content of a version of the data item that is associated with the change. A log number counter is incremented. A log representing the data item and the chance is created. The log includes data regarding the type of change, the network identifier, the unique identifier of the synchronization module, the relative path, the unique value, and the log number.

In a computer system in which a computer, storage devices, and a storage management device are connected by a network, the computer or a first storage device accesses a second storage device using a plurality of paths in the network, and the computer or the first storage device performs load balancing among the plurality of paths on the basis of a ratio set in advance, it is detected that congestion has occurred on a path, a ratio at the time of congestion of the path is calculated, and a difference between the ratio at the time of congestion and the ratio set in advance is allocated to a ratio of the other paths between the computer or the first storage device and the second storage device.

An apparatus, program product and method utilize cluster data port services within a cluster infrastructure to provide reliable and efficient communications between nodes in a clustered computer system. The cluster data port services present an abstracted transport service that encapsulates and manages the establishment of multiple connection paths between a source node, a target node and one or more backup nodes in such a manner that a cluster data port is effectively utilized as single data port from the perspective of a user program.

PCIe is a point-to-point protocol. A PCIe switch fabric has multi-path routing supported by adding an ID routing prefix to a packet entering the switch fabric. The routing is converted within the switch fabric from address routing to ID routing, where the ID is within a Global Space of the switch fabric. Rules are provided to select optimum routes for packets within the switch fabric, including rules for ordered traffic, unordered traffic, and for utilizing congestion feedback. In one implementation a destination lookup table is used to define the ID routing prefix for an incoming packet. The ID routing prefix may be removed at a destination host port of the switch fabric.

A method and system for controlling a transmission window size, wherein a transmission condition of the transmission path between a transmitting element and a receiving element is checked when at least one of the transmitting and receiving elements moves from a first access network to a second access network. Then, the transmission window size is changed in response to the result of said checking step. Thereby, the transmission window can be decreased actively to thereby accelerate the control procedure and improve resource utilization.

A flow based routing method and apparatus selects a path from a plurality of different paths for assignment to a flow. The path is selected based on a traffic performance measurements which identify relative congestion and performance of the different paths, so that traffic flows can be diverted away from network congestion points, thereby allowing network resources to be load balanced at a flow granularity. The present invention may be configured on physical or virtual links on an NE to enhance the forwarding of packets using the primary link and one or more alternate links to any given destination.

Methods for determining at least two pre-computed paths to a destination in a communications network are provided. The two paths are maximally disjoint. Maximally disjoint paths are paths where the number of links or nodes common to the two paths is minimized. This minimization is given a priority over other path considerations, such as bandwidth or cost metrics. By pre-computing a maximally disjoint pair of paths, the probability that an inoperable link or node is in both paths is minimized. The probability that the inoperable link or node blocks a transfer of data is minimized. Additionally, a pair of maximally disjoint paths is determined even if absolutely disjoint paths are not possible. The communications network may include at least four nodes, and maximally disjoint pairs of paths are pre-computed from each node to each other node. A third path from each node to each other node may also be computed as a function of bandwidth or a cost metric. Therefore, the advantages of the maximally disjoint pair of paths are provided as discussed above and a path associated with a higher bandwidth or lower cost is provided to more likely satisfy the user requirements of a data transfer.

Functionality can be implemented for optimizing connection constraints in an integrated circuit design. A target timing path associated with a first of a plurality of sub-connections of the integrated circuit is determined. A timing probability value and a route probability value associated with the first of the plurality of sub-connections is determined based, at least in part, on the target timing path associated with the first of the plurality of sub-connections. The timing probability value indicates a probability that timing closure is satisfied on the target timing path. The route probability value indicates a probability that a physical routing track on the target timing path associated with the first of the plurality of sub-connections resolves congestion. A current connection constraint associated with the first of the plurality of sub-connections is modified in accordance with a connection constraint model to which the first of the plurality of sub-connections corresponds.

A technique dynamically triggers an exchange of reachability information between a tail-end (remote) domain target node (e.g., a tail-end node) of a traffic engineering (TE) label switched path (LSP) and a local domain head-end node of the TE-LSP in a computer network. The inter-domain information retrieval technique is illustratively based on triggering a Border Gateway Protocol (BGP) session whereby at least a portion of the reachability, i.e., routing, information of the tail-end node is transmitted to the head-end node of the TE-LSP in accordance with BGP. Specifically, once a TE-LSP is established between the head-end node and the tail-end node, the head-end node triggers the tail-end node, e.g., through extensions to a request/response signaling exchange, to establish the BGP session. Establishment of the BGP session enables transmission of the routing information from the tail-end node to the head-end node. The head-end node uses the routing information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.

The available bandwidth of a communication path between two nodes of a computer network is determined using probe packages that are transmitted between a sender one of the nodes and a receiver one of the nodes at varying transmission rates. Each successive transmission rate of the probe packages is selected according to: (i) an achieved throughput for a transmission of a preceding one of the probe packages, and (ii) a deviation between the achieved throughput for the transmission of the preceding one of the probe packages and a corresponding transmission rate of the preceding one of the probe packages.

A network storage controller for transferring data between a host computer and a storage device, such as a redundant array of inexpensive disks (RAID), described. The network storage controller includes at least one channel interface module which is adapted to be connected to the host computer and storage device. The network storage controller also includes at least one controller memory module, attached to a passive backplane. The controller memory module communicates with the channel interface module. In applications where redundancy is required, at least two controller memory modules and at least two channel interface modules are used. The controller memory modules may mirror data between one another using the passive backplane and a shared communication path on the channel interface modules.

The invention provides a global path planning method of a moving robot under a dynamic and complicated environment. The method includes the steps of building a global environment map according to an actual environment, building a dynamic barrier environment, obtaining a grid map by means of a grid method, converting a barrier distribution map obtained in the grid method into an empowered adjacent matrix of the map, carrying out global path planning on the environment by means of an ant colony algorithm, processing trap problems in the environment in a regressing method, judging whether a current position of a path is a target point, repeating the preceding steps if the answer is negative, and ending if the current position is the designated target point. The method is simple and easy to achieve, and the path planning effect is good.

The present invention provides a novel client side caching (CSC) infrastructure that supports transition states at the directory level to facilitate a seamless operation across connectivity states between client and remote server. More specifically, persistent caching is performed to safeguard the user (e.g., client) and/or the client applications across connectivity interruptions and/or bandwidth changes. This is accomplished in part by caching to a client data store the desirable file(s) together with the appropriate file access parameters. Moreover, the client maintains access to cached files during periods of disconnect. Furthermore, portions of a path can be offline while other portions upstream can remain online. CSC operates on the logical path which cooperates with DFS which operates on the physical path to keep track of files cached, accessed and changes in the directories. In addition, truth on the client is facilitated whether or not a conflict of file copies exists.

Systems and methods to deliver malformed data for software application fuzzing are described. In one aspect, a fuzzing engine receives well-formed valid input data from a test automation tool. The received data is for input into a software application to implement a functional test. Responsive to receiving the well-formed valid input data, the fuzzing engine automatically generates corresponding malformed data based on characteristics of the well-formed valid input data. The application is then automatically fuzzed with the malformed data to notify an end-user of any security vulnerabilities in one or more code paths of the application used to process the malformed data.

The invention relates to a mobile robot real-time layered path planning method based on a grid map. The method, which is used in a grid map, comprises the following steps: carrying out binary classification according to external environment information, and establishing a grid map; planning an outer path according to a speed-based artificial potential field method; and when the path is about to fall into local minimum and oscillation, planning an inner path according to an A star algorithm. The problem that the traditional artificial potential field method may fall into local minimum and planned path oscillation and the problem that the A star algorithm is not applicable to real-time path planning are solved. Real-time, safe and stable operation of mobile robots is ensured.

Stream applications may inefficiently use the hardware resources that execute the processing elements of the data stream. For example, a compute node may host four processing elements and execute each using a CPU. However, other CPUs on the compute node may sit idle. To take advantage of these available hardware resources, a stream programmer may identify one or more processing elements that may be cloned. The cloned processing elements may be used to generate a different execution path that is parallel to the execution path that includes the original processing elements. Because the cloned processing elements contain the same operators as the original processing elements, the data stream that was previously flowing through only the original processing element may be split and sent through both the original and cloned processing elements. In this manner, the parallel execution path may use underutilized hardware resources to increase the throughput of the data stream.

A method for measuring and reporting performance parameters in a network having at least one originator for generating test protocol data units, and multiple reflectors for relaying the test protocol data units along successive segments of a test path in the network. The method generates the test protocol data units at the originator and transmits the test protocol data unit along a test path that includes multiple reflectors. Each reflector relays the test protocol data unit to the next reflector along the test path. Measurements of performance parameters are collected from the multiple reflectors in the test protocol data unit by inserting timestamps into the test protocol data unit at the originator and each of the reflectors to identify the departure and arrival times for each test protocol data unit at the originator and each of the reflectors in both the downstream and upstream directions along the test path.

A method and apparatus for design-for-low-power of register transfer level (RTL) controller/data path circuits that implement control-flow intensive specifications. The method of the invention focuses on multiplexer networks and registers which dominate the total circuit power consumption and reduces generation and propagation of glitches in both the control and data path parts of the circuit. Further the method reduces glitching power consumption by minimizing propagation of glitches in the RTL circuit through restructuring multiplexer networks (to enhance data correlations and eliminate glitchy control signals), clocking control signals, and inserting selective rising/falling delays, in order to kill the propagation of glitches from control as well as data signals. To reduce power consumption in registers, the clock inputs to registers are gated with conditions derived by an analysis of the RTL circuit, ensuring that glitches are not introduced on the clock signals.

A bandwidth efficient routing protocol for wireless ad-hoc networks. This protocol can be used in ad-hoc networks because it considerably reduces control overhead, thus increasing available bandwidth and conserving power at mobile stations. It also gives very good results in terms of the throughput seen by the user. The protocol is a table-driven distance-vector routing protocol that uses the same constraints used in on-demand routing protocols, i.e., paths are used as long as they are valid and updates are only sent when a path becomes invalid. The paths used by neighbors are maintained and this allows the design of a distance-vector protocol with non-optimum routing and event-driven updates, resulting in reduced control overhead.

The invention relates to the technical field of network security, in particular to a network attack event traceability processing method and device, equipment and a storage medium. The method comprises the steps of obtaining a network attack clue related to a to-be-traced network attack event; performing intelligence mining on the network attack clue based on the constructed network threat association model to obtain threat intelligence related to the network attack event; taking the network attack clue and the threat intelligence as attack behavior elements corresponding to the network attackevent, and constructing a traceability analysis model containing an association relationship between the attack behavior elements; and determining a traceability path according to the association relationship between the target attack behavior elements in the traceability analysis model, and performing traceability on the network attack event based on the traceability path to obtain a traceability result of the network attack event. By adopting the method, accurate tracking and tracing of the network attack event can be realized, so that the security of a computer communication network is improved.

A method for automated topology discovery and management of meter nodes in a power grid is described. In the discovery mode any of the meter nodes is able to act as a proxy for a data concentrator to sort out the topology, and to determine the best path for communicating between a concentrator and each of the meter nodes.