Abstract: Method and apparatus for metering network services, for example Web services. In embodiments, a network services metering system may collect network service usage information via an add usage interface and store the usage information in a database. In one embodiment, the usage information may be partitioned into two or more partitions. Once the usage information has been aggregated and stored, the metering system may be queried to obtain usage statistics such as aggregate usage over specific time intervals. In one embodiment, a pipeline mechanism that generates and processes batches of usage information may be implemented for adding usage information to the database. The pipeline mechanism may help to reduce or eliminate redundancy and loss of usage information, and may make the metering system linearly scalable in multiple dimensions.

Abstract: To maintain and manage a computer network, a system administrator may monitor a large number and variety of components, each component comprising a variety of resources. The instrumentation of a resource may be monitored and/or manipulated by receiving a Simple Object Accessing Protocol (SOAP) message comprising an operation identifier for accessing instrumentation information and a resource identifier associated with a computer system resource. The management system may resolve the resource identifier into an address for a local handler associated with the resource, and may send a local request to the local handler at the resolved address.

Abstract: The present invention extends to methods, systems, and computer program products for reliably and securely transferring queued application messages. Application messages are (e.g., binary or text) encoded and then encapsulated in transfer messages, enqueue messages, and dequeue responses such that composable protocol elements used in application messages can be reused in the transfer messages, enqueue messages, and dequeue responses. Transfer message headers are encoded and then encapsulated along with encoded application messages such that composable protocol elements used in transfer headers and application messages can be reused in the store and forward messages. Application messages, transfer messages, enqueue messages, dequeue responses, and store and forward messages can all be configured in accordance with the same messaging protocol, such as, for example, Simple Object Access Protocol.

Abstract: The present invention extends to methods, systems, and computer program products for reliably and securely transferring queued application messages. Application messages are (e.g.,. binary or text) encoded and then encapsulated in transfer messages, enqueue messages, and dequeue responses such that composable protocol elements used in application messages can be reused in the transfer messages, enqueue messages, and dequeue responses. Transfer message headers are encoded and then encapsulated along with encoded application messages such that composable protocol elements used in transfer headers and application messages can be reused in the store and forward messages. Application messages, transfer messages, enqueue messages, dequeue responses, and store and forward messages can all be configured in accordance with the same messaging protocol, such as, for example, Simple Object Access Protocol.

Abstract: The present invention extends to methods, systems, and computer program products for reliably and securely transferring queued application messages. Application messages are (e.g.,. binary or text) encoded and then encapsulated in transfer messages, enqueue messages, and dequeue responses such that composable protocol elements used in application messages can be reused in the transfer messages, enqueue messages, and dequeue responses. Transfer message headers are encoded and then encapsulated along with encoded application messages such that composable protocol elements used in transfer headers and application messages can be reused in the store and forward messages. Application messages, transfer messages, enqueue messages, dequeue responses, and store and forward messages can all be configured in accordance with the same messaging protocol, such as, for example, Simple Object Access Protocol.

Abstract: Mechanisms for providing requested data items in a request-driven enumeration session while retaining control over how much inter-message context information is retained by the data provider. Upon receiving a request for the data items, the data provider identifies a portion of the data items to be provided in the first response along with context information that reflects that the first portion of information has been provided. The data provider then makes a determination of how much of the context is to be provided to the data receiver system, and then provides that appropriate context information to the data receiver. Furthermore, the data provider provides a response that includes the first portion of the data items. The data receiver includes this first provided context information in the second request for the next portion of the data items, allowing continuity in the data transfer session.

Abstract: A method of controlling information exposure in a multiparty transaction includes an originating transaction participant cryptographically encoding all information for each of the transaction participants such that a unique data content and encryption are used for each of the messages destined to the other transaction participants. The cryptographically encoded messages are transmitted to the transaction participants such that each may decrypt their message and respond to a primary transaction participant with status concerning their portion of the transaction. After reception of affirmative status messages from the transaction participants, the primary transaction participant may transmit messages to the responding transaction participants to execute the multiparty transaction. The originating transaction participant may also be provided an indication that the multiparty transaction is executed.

Abstract: A system and method for communicating between a client and a server using a generic, extensible, high-speed framework that separates clients and servers from the application layer and transport layer protocols commonly used for network communications. An application (client or server) specifies a uniform resource identifier (URI) to identify an interface for transmitting or receiving one or more messages and to identify the desired protocol and transport for communication. The invention, executing on the client and/or server, instantiates an object based on the URI to implement the specified protocol and transport for communication between the client and the server.

Abstract: A queueing network framework for processing messages in stages in a multi-processor environment. An event source generates work packets that have information relating to the messages to be processed. The work packets are queued before processing by a plurality of application services. Each application service follows a queue and defines a processing stage. At each processing stage, the application service operates on a batch of the work packets queued for it by the respective queue.

Abstract: A system and method for estimating available payload inventory are provided. An advertisement delivery system generates a set of atomic market segment arrays from target market criteria for one or more advertisement campaigns to be served. The set of arrays is incremented corresponding to advertisement requests matching the target market criteria. The atomic market segment is processed to select an advertisement and to predict future capacity and manage inventory.

Abstract: A system and method for delivering advertisement media are provided. Each advertisement media is associated with an advertisement delivery campaign specifying an impression goal and a campaign date range. Utilizing a dynamic array representative of the campaign date range, an initial rotation frequency is calculated based on a predicted number of page views that will be encountered during the advertisement media campaign. As the campaign progresses, the predicted number of page views in each array element is replaced by the actual number of page views encountered. Accordingly, the rotation frequency will fluctuate with the number of actual page views encountered. An advertisement delivery engine utilizes the dynamic rotation frequency to select an appropriate advertisement for each advertisement request.