Abstract: A system, method and apparatus are presented for the adaptive optimization of call quality and marginal profit in a telephony over data network, where the network contains a plurality of destinations, where calls are routable to each destination via a plurality of gateways in route to such destination, and where said gateways may serve more than one destination. The method comprises continually monitoring call traffic to each destination to first analyze whether the destination is currently volatile. If it is not, no action is taken. If it is, the method then reallocates the destination's traffic among some or all of the gateways in route to it.

Abstract: In some embodiments, the present invention provides a distributed monitoring, evaluation and routing (“DiMER”) system capable of active management of data network-based telephony. Such a system, and data network-based telephony incorporating the same, advantageously routes calls to meet call quality standards, connection speed and/or cost goals, among other targets. To meet such quality standards, the system incorporates preferences with periodically obtained call-related data and analysis, and revises call routing, as appropriate, by shifting or reallocating call traffic between available terminating gateways (based on their performance and caller preferences).

Abstract: An "n" dimensional mesh-connected massively parallel processing system uses pointers to connect requesting processors to allocated processors, and also, to access the allocated processors. The requesting and allocated processors are connected by (i) storing in the requesting processor or in a system controller a pointer which points to the allocated processors as a group and (ii) storing in each of the allocated processors, in a designated memory location, an assigned-marker, or an identifier which identifies the processor as a member of the identified group. When one or more requesting processors require connection to free processors, a request is sent to each processor in the system asking each of them to determine if it is free. Each of the processors which is free then assigns itself indices relating to its position in the mesh and its position relative to other free processors.