A computer implemented method of identifying anomalous behavior of a computer system in a set of intercommunicating computer systems, each computer system in the set being uniquely identifiable, the method including monitoring communication between computer systems in the set for a predetermined baseline time period to generate a baseline vector representation of each of the systems; monitoring communication between computer systems in the set for a subsequent predetermined time period to generate a subsequent vector representation of each of the systems; comparing baseline and subsequent vector representations corresponding to a target computer system using a vector similarity function to identify anomalous behavior of the target system in the subsequent time period compared to the baseline time period, wherein a vector representation of the target system for a time period is generated based on a deterministic walk of a graph representation of communications between the computer systems in which nodes of the graph correspond to computer systems in the set and weighted directed edges between nodes of the graph correspond to a characteristic of communication between pairs of computer systems in the set.

A computer implemented method of identifying anomalous behavior of a computer system in a set of intercommunicating computer systems, each computer system in the set being uniquely identifiable, the method including monitoring communication between computer systems in the set for a predetermined baseline time period to generate a baseline vector representation of each of the systems; monitoring communication between computer systems in the set for a subsequent predetermined time period to generate a subsequent vector representation of each of the systems; comparing baseline and subsequent vector representations corresponding to a target computer system using a vector similarity function to identify anomalous behavior of the target system in the subsequent time period compared to the baseline time period, wherein a vector representation of the target system for a time period is generated based on a deterministic walk of a graph representation of communications between the computer systems in which nodes of the graph correspond to computer systems in the set and weighted directed edges between nodes of the graph correspond to a characteristic of communication between pairs of computer systems in the set.

Programming routers in a network is accomplished using a global network manager and a plurality of local network managers. The global network manager analyzes an entire network and demand matrix in order to provide restrictions and recommendations that are communicated to a set of the local network managers. The local network managers can use the restrictions and recommendations to make local routing decisions defining a percentage of traffic routed to each neighboring node. The local network manager collects traffic metrics, such as local topology and traffic information by measuring the capacity available to reach any neighboring node. The local network manager uses the metrics in combination with the restrictions and recommendations from the global manager to make decisions on how to route network traffic.

Programming routers in a network is accomplished using a global network manager and a plurality of local network managers. The global network manager analyzes an entire network and demand matrix in order to provide restrictions and recommendations that are communicated to a set of the local network managers. The local network managers can use the restrictions and recommendations to make local routing decisions defining a percentage of traffic routed to each neighboring node. The local network manager collects traffic metrics, such as local topology and traffic information by measuring the capacity available to reach any neighboring node. The local network manager uses the metrics in combination with the restrictions and recommendations from the global manager to make decisions on how to route network traffic.

A method of operating first and second terminal devices for transmitting data in a device-to-device communication mode in a wireless telecommunications system supporting communications on a first carrier operating over a first frequency band and a second carrier operating over a second frequency band. The first terminal device transmits control signalling on the first carrier and this is received by the second terminal device. The control signalling comprises an indication of an allocation of radio resource blocks on the second carrier to be used for transmitting user-plane data from the first terminal device to the second terminal device. The first terminal device then proceeds to transmit the user-plane data to the second terminal device on the second carrier using the radio resource blocks on the second carrier identified by the control signalling. The control signalling may also provide an indication of an allocation of radio resource blocks on the first carrier to be used for transmitting user-plane data to the second terminal device.

Systems and methods for providing bandwidth congestion control in a private fabric in a high performance computing environment. An exemplary method can provide, at one or more microprocessors, a first subnet, the first subnet comprising a plurality of switches, and a plurality of host channel adapters, wherein each of the host channel adapters comprise at least one host channel adapter port, and wherein the plurality of host channel adapters are interconnected via the plurality of switches, and a plurality of end nodes. The method can provide, at a host channel adapter, an end node ingress bandwidth quota associated with an end node attached to the host channel adapter. The method can receive, at the end node of the host channel adapter, ingress bandwidth, the ingress bandwidth exceeding the ingress bandwidth quota of the end node.

Systems and methods for providing bandwidth congestion control in a private fabric in a high performance computing environment. An exemplary method can provide, at one or more microprocessors, a first subnet, the first subnet comprising a plurality of switches, and a plurality of host channel adapters, wherein each of the host channel adapters comprise at least one host channel adapter port, and wherein the plurality of host channel adapters are interconnected via the plurality of switches, and a plurality of end nodes. The method can provide, at a host channel adapter, an end node ingress bandwidth quota associated with an end node attached to the host channel adapter. The method can receive, at the end node of the host channel adapter, ingress bandwidth, the ingress bandwidth exceeding the ingress bandwidth quota of the end node.

Systems and methods are provided for reducing network traffic in a mesh network by reducing the number of status messages communicated over the network. The nodes of the network can provide status information to a gateway based on each node's distance from the gateway. The closer nodes respond to the request from the gateway first and then the farther nodes respond to the request. When a node is ready to transmit a status message with status information to the gateway, the node sends the message to the nodes in communication with the transmitting node. One of the closer nodes that receives the message then forwards the message to additional nodes in communication with the forwarding node, while the other nodes that received the message do not forward the message. The process of forwarding messages by a single closer node is repeated until the status information is received by the gateway.

Systems and methods are provided for reducing network traffic in a mesh network by reducing the number of status messages communicated over the network. The nodes of the network can provide status information to a gateway based on each node's distance from the gateway. The closer nodes respond to the request from the gateway first and then the farther nodes respond to the request. When a node is ready to transmit a status message with status information to the gateway, the node sends the message to the nodes in communication with the transmitting node. One of the closer nodes that receives the message then forwards the message to additional nodes in communication with the forwarding node, while the other nodes that received the message do not forward the message. The process of forwarding messages by a single closer node is repeated until the status information is received by the gateway.

Systems and methods for controlling congestion of a data network are provided. An engine round-trip time (RTT) and a fabric RTT for a network flow are determined. An engine-based congestion window size for the flow is determined based on the engine RTT and a target engine RTT. A fabric-based congestion window size for the flow is determined based on the fabric RTT and a target fabric RTT. The smaller of the engine-based congestion window size and the fabric-based window size is selected for use in transmitting a future packet associated with the flow. The target engine RTT is determined based in part on the current congestion window used to transmit packets for the flow and/or the target fabric RTT is determined based on a number of hops packets associated with the flow traverse from a source to a destination associated with the flow.