Abstract: A method for optimizing package-oriented network traffic control is proposed which can involve constraints to the optimization model which emerged dynamically during the optimization period. Thus, unpredictable events can be considered amongst foreseeable events during the optimization process. For achieving this the method according to the invention uses graphs which are dynamically generated and eventually be varied during the optimization process for managing the above said complex inter-dependencies. Unexpected changes of the time and loading schedules can be balanced and their negative impact on just in-time delivery of goods can be lowered. Generally, transport costs are reduced and natural resources are saved. In a preferred embodiment of the inventional method a variable time buffer extension is introduced which is used to extend the availability of the transport vehicle's capacity.

Abstract: The management and use of replicated distributed transactions is facilitated. A distributed synchronous transaction system protocol is provided to manage the replication of distributed transactions for client application instances. The distributed synchronous transaction system allows transactions to be replicated without having the client application instances be aware of other instances to receive the transaction. Further, if a failure occurs during processing of a distributed replicated transaction, the distributed synchronous transaction system manages the recovery of the failure.

Abstract: A method, apparatus and computer program product are disclosed to enable independent verification of service level agreement between two parties. In one embodiment, a first party contracts the hosting service of a second party to provide said first party with Web page and services on second party's equipment. Said contract contains a Service Level Agreement specifying performance parameters and guarantees for the response time experienced by users of said Web page and services. Independent verification by a third party of said agreement is done for a fee through several steps. In a first step, said third party inserts measuring and reporting instructions into blocks of information maintained on the server of said second party. The measuring instructions are for delivery to the client with the blocks of information. The delivery of the instructions occurs responsive to a request for the information by the client. Once they are delivered, the instructions are executed by the client.

Abstract: A communications system (10) includes a packet-based data network (12) that is coupled to various network elements (14, 16, 18, 20, 22, and 34) that are capable of participating in audio-based call sessions over the data network (12). The audio-based call sessions may be defined according to a Session Initiation Protocol (SIP) or to another type of protocol (e.g., H. 323). The network elements (14, 18, 22, and 34) are also capable of participating in text-based chat sessions. Text messages exchanged in such text-based chat sessions are earned in messages that are defined according to the protocol for audio-based call sessions. In one example, such messages may be SIP Info messages. The SIP Info messages carrying the text messages may be communicated either during an established audio-based call session or outside of an audio-based call session. Using SIP (or another signal protocol) messages to carry the text messages allows such messages to be conveniently transported through a firewall system.

Abstract: A data processing system includes an interconnect, a plurality of nodes coupled to the interconnect that each include at least one agent, response logic within each node, and a queue. In response to snooping a transaction on the interconnect, each agent outputs a snoop response. In addition, the queue, which has an associated agent, allocates an entry to service the transaction. The response logic within each node accumulates a partial combined response of its node and any preceding node until a complete combined response for all of the plurality of nodes is obtained. However, prior to the associated agent receiving the complete combined response, the queue speculatively deallocates the entry if the partial combined response indicates that an agent other than the associated agent will service the transaction.