Abstract: There is provided a method and system for process migration in a data center network. The method includes selecting processes to be migrated from a number of overloaded servers within a data center network based on an overload status of each overloaded server. Additionally, the method includes selecting, for each selected process, one of a number of underloaded servers to which to migrate the selected process based on an underload status of each underloaded server, and based on a parameter of a network component by which the selected process is to be migrated. The method also includes migrating each selected process to the selected underloaded server such that a migration finishes within a specified budget.

Abstract: There is provided a method and system for process migration in a data center network. The method includes selecting processes to be migrated from a number of overloaded servers within a data center network based on an overload status of each overloaded server. Additionally, the method includes selecting, for each selected process, one of a number of underloaded servers to which to migrate the selected process based on an underload status of each underloaded server, and based on a parameter of a network component by which the selected process is to be migrated. The method also includes migrating each selected process to the selected underloaded server such that a migration finishes within a specified budget.

Abstract: There is provided a method and system for process migration in a data center network. The method includes selecting processes to be migrated from a number of overloaded servers within a data center network based on an overload status of each overloaded server. Additionally, the method includes selecting, for each selected process, one of a number of underloaded servers to which to migrate the selected process based on an underload status of each underloaded server, and based on a parameter of a network component by which the selected process is to be migrated. The method also includes migrating each selected process to the selected underloaded server such that a migration finishes within a specified budget.

Abstract: Methods and a system for automated onsite customer assistance are provided. A customer operating a Self-Service Terminal (SST) onsite of an enterprise establishes a communication session with a host system. Information passed between the SST and the host system is relayed to a device operated by a clerk that is also onsite. A real-time determination is made as to whether the customer is in need of assistance of the clerk during the communication session.

Abstract: Methods and a system for automated onsite customer assistance are provided. A customer operating a Self-Service Terminal (SST) onsite of an enterprise establishes a communication session with a host system. Information passed between the SST and the host system is relayed to a device operated by a clerk that is also onsite. A real-time determination is made as to whether the customer is in need of assistance of the clerk during the communication session.

Abstract: The performance of randomized load balanced or selective, randomized load balanced networks is enhanced by using ingress traffic engineering in addition to randomized traffic splitting. By first using the capacity of all links leading to the final destination of traffic, the remaining capacity is freed up for best effort traffic. Traffic splitting rules that enhance the performance of randomized load balanced networks in terms of packet missequencing and other quality of service criteria are also described.

Abstract: There is provided a method and system for process migration in a data center network. The method includes selecting processes to be migrated from a number of overloaded servers within a data center network based on an overload status of each overloaded server. Additionally, the method includes selecting, for each selected process, one of a number of underloaded servers to which to migrate the selected process based on an underload status of each underloaded server, and based on a parameter of a network component by which the selected process is to be migrated. The method also includes migrating each selected process to the selected underloaded server such that a migration finishes within a specified budget.

Abstract: Interoperability software modules comprise an architected .NET layer, an architected interpreter, an automatic interpreter and a library of COM objects. The architected interpreter where they are mapped to intermediate .NET interfaces compatible with the automatic interpreter by means of a Runtime Callable Wrapper (RCW). The architected interpreter also comprises an architected COM Callable Wrapper (CCW) that maps the intermediate COM interfaces into architected interfaces.

Abstract: Described is a technology by which an assignment model is computed to distribute labeling tasks among judging entities (judges). The assignment model is optimized by obtaining accuracy-related data of the judges, e.g., by probing the judges with labeling tasks having a gold standard label and evaluating the judges' labels against the gold standard labels, and optimizing for accuracy. Optimization may be based upon on or more other constraints, such as per-judge cost and/or quota.

Abstract: Methods, systems, and software are disclosed for configuring an ATM. The ATM receives one or more configuration messages in an XML-based format. The ATM interprets the one or more configuration messages. The ATM restricts one or more ATM operations based on at least a portion of the one or more configuration messages.

Abstract: Interoperability software modules comprise an architected .NET layer, an architected interpreter, an automatic interpreter and a library of COM objects. The architected interpreter where they are mapped to intermediate .NET interfaces compatible with the automatic interpreter by means of a Runtime Callable Wrapper (RCW). The architected interpreter also comprises an architected COM Callable Wrapper (CCW) that maps the intermediate COM interfaces into architected interfaces.

Abstract: The performance of randomized load balanced or selective, randomized load balanced networks is enhanced by using ingress traffic engineering in addition to randomized traffic splitting. By first using the capacity of all links leading to the final destination of traffic, the remaining capacity is freed up for best effort traffic. Traffic splitting rules that enhance the performance of randomized load balanced networks in terms of packet missequencing and other quality of service criteria are also described.

Abstract: Methods, systems, and software are disclosed for configuring an ATM. The ATM receives one or more configuration messages in an XML-based format. The ATM interprets the one or more configuration messages. The ATM restricts one or more ATM operations based on at least a portion of the one or more configuration messages.

Abstract: Methods, systems, and software are disclosed for configuring an ATM. The ATM receives one or more configuration messages in an XML-based format. The ATM interprets the one or more configuration messages. The ATM alters one or more ATM operations based on at least a portion of the one or more configuration messages.

Abstract: Broadly, techniques for solving network routing within a predetermined error are disclosed. These techniques may be applied to networks supporting dedicated reserve capacity, where reserved capacity on links in the network is dedicated for a particular commodity (generally, a source and sink pair of computers), and shared recovery, where reserved capacity on links is shared amongst two or more commodities. These techniques use an iterative process to determine flows on each of the links in a network. Costs are set for each commodity, and primary and secondary (i.e., backup) flows are initialized. A commodity is selected and demand for the commodity is routed through the shortest path. Costs are updated for each potential failure mode. For each commodity, the flows and costs are updated. Once all flows and costs are updated, then it is determined if a function is less than a predetermined value.

Abstract: A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space.

Abstract: A method for exchanging routing information between I-BGP routers within an autonomous system (AS) advantageously enables a solution to both persistent route oscillation problems and transient route oscillation problems which may occur when using I-BGP in a given AS. Conventional I-BGP protocol techniques are extended by enabling I-BGP speakers (e.g., routers) to communicate a set of possible best paths to a given destination, rather than communicating only a single best path, to each of their I-BGP peers within the given AS. Specifically, a plurality of possible best paths to a destination are communicated (where there are in fact more than one) from an I-BGP speaker in a given AS to its I-BGP peers (within the given AS), for each neighboring AS that provides any such paths (i.e., routes to the destination).

Abstract: In a software management system, a software package held in a management station (12) is transferred across a communications network (14) to a plurality of destination terminals (16), of which there may be a large number. In order to save on distribution time, the management station (12) can cause terminals (16) which have received the software package to transmit it to further terminals, until all terminals (16) have received the package.

Abstract: Broadly, techniques for solving network routing within a predetermined error are disclosed. These techniques may be applied to networks supporting dedicated reserve capacity, where reserved capacity on links in the network is dedicated for a particular commodity (generally, a source and sink pair of computers), and shared recovery, where reserved capacity on links is shared amongst two or more commodities. These techniques use an iterative process to determine flows on each of the links in a network. Costs are set for each commodity, and primary and secondary (i.e., backup) flows are initialized. A commodity is selected and demand for the commodity is routed through the shortest path. Costs are updated for each potential failure mode. For each commodity, the flows and costs are updated. Once all flows and costs are updated, then it is determined if a function is less than a predetermined value.

Abstract: A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space.