Provided is an incident effect range estimation device which estimates the range of the effect of an incident and shortens incident handling time. This incident effect range estimation device 10 is provided with an incident origin log acquisition unit 11 which acquires log information for the incident-originating device which is related to the occurrence of the incident, a communication destination log acquisition unit 12 which acquires, on the basis of the log information for the incident-originating device, log information for a communication destination device which is the communication destination of the incident-originating device, and an effect range estimation unit 13 which estimates the range of the effect of the incident on the basis of the communication destination device. The range of the effect of the incident can thereby be estimated automatically, and thus incident handling time can be shortened significantly.

Apparatus and method for optimized route invalidation using modified no-path DAO signaling are disclosed. According to the present invention, a node switching its current parent is adapted to send a regular Destination Oriented Directed Acyclic Graph (DODAG) Advertisement Object (DAO) message. Using the changed signaling, the common ancestor node generates an NPDAO on behalf of the switching node on receiving a refreshed DAO from an alternate path. The common ancestor node according to the present invention reuses a same PathSequence from the regular DAO based on which the NPDAO gets generated. The common ancestor node detects routing anomaly using next hop mismatch on reception of the DAO to generate the NPDAO on behalf of the target node. The No-Path DAO traverses downward/downstream along the previous path, unlike any other DAO messages traverses upstream according to convention approaches. The present invention provides a new signaling mechanism for route invalidation in constrained networks.

Systems and methods for accelerating computer network policy searching are provided. According to one embodiment, a packet is received by a policy search engine (PSE) of a packet processing device. A set of candidate policies are identified from among multiple policies of the packet processing device by screening the multiple policies by a speculation unit of the PSE based on metadata associated with the received packet. Finally, a matching policy for the received packet is identified by a policy search processor (PSP) of the PSE by executing policy-search-specific instructions and general purpose instructions.

A highly predicable quality shared distributed memory process is achieved using less than predicable public and private internet protocol networks as the means for communications within the processing interconnect. An adaptive private network (APN) service provides the ability for the distributed memory process to communicate data via an APN conduit service, to use high throughput paths by bandwidth allocation to higher quality paths avoiding lower quality paths, to deliver reliability via fast retransmissions on single packet loss detection, to deliver reliability and timely communication through redundancy transmissions via duplicate transmissions on high a best path and on a most independent path from the best path, to lower latency via high resolution clock synchronized path monitoring and high latency path avoidance, to monitor packet loss and provide loss prone path avoidance, and to avoid congestion by use of high resolution clock synchronized enabled congestion monitoring and avoidance.

A method for determining path health to conduct a plurality of Input-Output (IO) operations along a healthy path in a network is provided. The present invention may include receiving an IO request from a user and sending the received IO request on a first path. The present invention may include determining a first IO response has exceeded a threshold time on the first path. The present invention may include determining the first path has degraded based on the exceeded threshold time. The present invention may include generating a duplicate IO request and sending on a second path. The present invention may include receiving the duplicated IO response before receiving the original IO response. The present invention may include determining a health state associated with the slower path. The present invention may include refreshing a path state machine based on the determined health state associated with the slow path.

In a load sharing method and a router device, each of the router devices in a load sharing relationship obtains load sharing information of all downstream router devices that are in a load sharing relationship with the router device, and when determining load sharing information of the router device, the router device determines the load sharing information of the router device according to the load sharing information of all the downstream router devices that are in a load sharing relationship with the router device, so that a disturbance factor of the router device is different from disturbance factors of all the downstream router devices that are in a load sharing relationship with the router device. Therefore, a coupling degree of load sharing information of all the router devices in a load sharing relationship in the network is reduced, and load sharing at all levels is even.

There is disclosed a network communication system that includes data sources and of switches. Each of the data sources and switches is interconnected by a packet-switched network, and is synchronized to a common clock. The system also includes a network controller that maintains records of network characteristics including a transmission delay for each of the data sources and switches, and a transmission delay for links in the packet-switched network. The network controller processes the network characteristics to generate, for each of a plurality of packets of a given type of traffic: a path from a particular data source, and through at least one particular switch, and a schedule of departure times at each of the particular data source and the at least one particular switch. The path and the schedule are optimized to meet jitter requirements for the given type of traffic.

A physical layer chip of a first physical port of a network device receives a packet and sends a first time stamp and the packet to a Media Access Control (MAC) chip of the first physical port. The MAC chip of the first physical port adds the first time stamp to the packet and sends the packet. A MAC chip of a second physical port receives the packet, extracts the first time stamp of the packet, and sends the packet to a physical layer chip of the second physical port. The MAC chip of the second physical port receives a second time stamp of the packet. The network device calculates a processing delay for the packet. The processing delay is a value obtained by subtracting the first time stamp from the second time stamp.

Various technologies pertaining to scheduling network traffic in a network are described. A request to transfer data from a first computing device to a second computing device includes data that identifies a volume of the data to be transferred and a deadline, where the data is to be transferred prior to the deadline. A long-term schedule is computed based upon the request, wherein the long-term schedule defines flow of traffic through the network over a relatively long time horizon. A short-term schedule is computed based upon the long-term schedule, where devices in the network are configured based upon the short-term schedule.

The application discloses caching method, system and device of edge computing and computer readable storage medium, wherein the edge computing network is divided into a plurality of zones each including a plurality of sub-zones. Each sub-zone corresponds to an edge computing node, which is divided into local sub-zone storage space and zone-shared storage space. Depending on the popularity for respective information data, they are stored into the local sub-zone storage space and zone-shared storage space in respective edge computing nodes, in order to optimize cooperative processing of user access requests across nodes, reduce the delivery latency, and maximize utilization of the processing capacity and storage space. Through constant adjustments to the size of local sub-zone storage space and changes to the distribution of information data, the storage distribution data at shortest average delivery latency is obtained, so as to achieve the minimum average delivery latency. (FIG. 1 )