A data distribution system and method are described herein to improve the distribution of market information to subscribing client devices. Market information updates are provided to subscribing devices over a communication link every time a change in the market occurs. If a bandwidth limitation is reached on the communication link, the preferred embodiments switch to a second mode of transmission such that the market information updates are provided only at predetermined intervals. The preferred embodiment monitors the bandwidth consumption to determine what mode of transmission to apply, and in response, it can dynamically change between modes of transmission. By dynamically adjusting the mode of transmission to comport with the current network bandwidth, the preferred embodiments may provide a network friendly, data intensive, and fast response market information feed.

Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically harvested, calculated, or assigned from third parties or based on the frequency of interactions between members of the community. Connectivity values may represent such factors as alignment, reputation, status, and/or influence within a social graph within the network community, or the degree of trust. The paths connecting a first node to a second node may be retrieved, and social graph data analytics may be used to determine a network connectivity value from all or a subset of all of the retrieved paths and/or one or more connectivity statistics value associated with the first node and/or the second node. A parallel computational framework may operate in connection with a key-value store to perform some or all of the computations related to the connectivity determinations. Network connectivity values and/or other social graph data may be outputted to third-party processes and services for use in initiating automatic transactions or making automated network-based or real-world decisions.

In one embodiment, a method includes: receiving, by a first computing device on a first port of a plurality of ports, a data packet, wherein each of the ports corresponds to one of a plurality of security classes, and the first computing device comprises a plurality of cryptographic modules, each module configured to encrypt data for a respective one of the security classes; tagging the data packet, wherein tagging data identifies one of the security classes and the first port; routing, based on at least one header, the data packet to a first cryptographic module of the plurality of cryptographic modules; encrypting the data packet using the first cryptographic module; and storing the encrypted data packet in a first data storage device.

Methods and apparatus for efficiently establishing communications connections, e.g., for a secondary application, are described. A device to device communications network has established routing paths, e.g., corresponding to a first application. Different segments of the network use different gateways. Individual communications devices within a segment of the network may have incomplete information on the routing within the segment. A wireless communications device advertises the gateway device which it uses for the first application. A first communications device seeking to establish a communications connection with a second communications device for a second application uses obtained gateway information to make transmission and/or routing decisions, e.g., identifying a third communications device which can bridge a routing path gap between two segments of the network.

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

Embodiments of the present disclosure relate to a method, apparatus and computer program product for scheduling dedicated processing resources. The method comprises: in response to receiving a scheduling request for a plurality of dedicated processing resources, obtaining a topology of the plurality of dedicated processing resources, the topology being determined based on connection attributes related to connections among the plurality of dedicated processing resources; and determining, based on the topology, a target dedicated processing resource satisfying the scheduling request from the plurality of dedicated processing resources. In this manner, the performance and the resource utilization rate of scheduling the dedicated processing resources are improved.

A method is provided for consistent data processing by first and second distributed processing systems having different data partitioning and routing mechanisms such that the first system is without states and the second system is with states. The method includes dividing data in each system into a same number of partitions based on a same key and a same hash function. The method includes mapping partitions between the systems in a one-to-one mapping. The mapping step includes calculating a partition ID based on the hash function and a total number of partitions, and dynamically mapping a partition in the first system to a partition in the second system, responsive to the partition in the first system being unmapped to the partition in the second system.

A service routing packet processing method, apparatus and system. The method includes obtaining, by a first service router (SR), a first service routing packet, where the first service routing packet includes path identification information and identification information of a service node (SN), and sending, by the first SR, the first service routing packet to the SN.

Devices, methods, and systems are described for the execution of centralized control of IP routing. The described methods may be used for video production systems. The methods may also be configured for other applications or in any IP routing environment to provide centralized routing control of any IP traffic.