Abstract: Systems and methods for pooling a plurality of telecommunication users into groups is disclosed. One method includes ranking the telecommunication users in an order based on a usage parameter. The usage parameter, for example, may be the average service usage time per billing period. Once ranked, the telecommunication users are pooled into at least two groups, each group comprising at least one telecommunication user within a range of ranks. The method may further include calculating estimated costs for the users to use cost-effective rate plans selected from a group of available rate plans and re-pooling the users into other possible combinations to determine the most cost-effective pooling combination and respective rate plans.

Abstract: A sending computer system can identify one or more available network resources at one or more network computers by sending a request for services using Simple Object Access Protocol (SOAP) over User Datagram Protocol (UDP). In particular, the sending computer system prepares a SOAP message that includes a request for available resources. The sending computer system then encapsulates the SOAP message into a user datagram, and sends the user datagram to one or more identifiable computer systems on the network. In one implementation, the sending computer system sends the user datagram to a multi-cast Uniform Resource Identifier (URI). The receiving computer system receives the message through UDP, unpacks the message, and responds to the SOAP message request. Accordingly, the sending computer system can query multiple computer systems in an efficient manner without necessarily incurring the overhead otherwise associated with connection-oriented communication.

Abstract: Methods, systems, and data structures for communicating object metadata are provided. A generic metadata container is presented that allows object metadata to be described in an extensible manner using protocol-neutral and platform-independent methodologies. A metadata scope refers to a dynamic universe of targets to which the included metadata statements correspond. Metadata properties provide a mechanism to describe the metadata itself, and metadata security can be used to ensure authentic metadata is sent and received. Mechanisms are also provided to allow refinement and replacement of metadata statements. Communication of metadata is expedited using hash digests to confirm metadata versions, and by piggybacking policy metadata requests and responses on other substantive data communication messages, thereby dynamically altering future communications.

Abstract: Methods, systems, and data structures for communicating object metadata are provided. A generic metadata container is presented that allows object metadata to be described in an extensible manner using protocol-neutral and platform-independent methodologies. A metadata scope refers to a dynamic universe of targets to which the included metadata statements correspond. Metadata properties provide a mechanism to describe the metadata itself, and metadata security can be used to ensure authentic metadata is sent and received. Mechanisms are also provided to allow refinement and replacement of metadata statements. Communication of metadata is expedited using hash digests to confirm metadata versions, and by piggybacking policy metadata requests and responses on other substantive data communication messages, thereby dynamically altering future communications.

Abstract: Reliable end-to-end messaging in which tracking and acknowledgement information are contained in the electronic message that is visible to layers above the transport layer, thereby being independent of what transport protocols, and whether different transport protocols, are used to comununicate between the two end points. Furthermore, acknowledgment messages may identify multiple ranges of sequence numbers corresponding to received electronic messages, thereby permitting further flexibility and completeness in acknowledging received messages.

Abstract: The transformation of a symbolic representation using an inverted match that represents an inverted form of a specific kind of non-linear match. The match is inverted around a particular reaction variable and merged on that variable after determining that the match represents a specific kind of non-linear identity that has at least one associative commutative operator, and in which each variable has one instance, except for the reaction variable, which has multiple instances in the match, at least one of the instances not being a direct argument of an associative commutative operator. The inverted match may then be applied to the symbolic expression to thereby transform the symbolic expression.

Abstract: A sending computer system can identify one or more available network resources at one or more network computers by sending a request for services using SOAP over UDP. In particular, the sending computer system prepares a SOAP message that includes a request for available resources. The sending computer system then encapsulates the SOAP message into a user datagram, and sends the user datagram to one or more identifiable computer systems on the network. In one implementation, the sending computer system sends the user datagram to a multi-cast URI. The receiving computer system receives the message through UDP, unpacks the message, and responds to the SOAP message request. Accordingly, the sending computer system can query multiple computer systems in an efficient manner without necessarily incurring the overhead otherwise associated with connection-oriented communication.

Abstract: In general, a system and method for analyzing wireless communication data for determining an optimal wireless communication service plans based on historical projection analysis is disclosed. A transceiver is configured to receive billing information associated with a subscriber of a telecommunications service under a current rate plan. A storage unit stores the billing information. A processor processes the subscriber related billing information to produce organized data in a calling profile record for each telecommunication service being used by the subscriber. The processor then creates a usage history table and a call detail table within the storage unit from the processed billing information in accordance with a specified billing period. A determination is then made of the cost of the current rate plan and the cost of at least one other rate plan via use of the usage history table and call detail table.

Abstract: Example embodiments provide for a new set of binding extensions that allow individual messages within a contract of a Network Protocol Description Language data structure (e.g., a portType of a WSDL document or file) to flow over different transports and to different network transport addresses. Further, example embodiments provide for a concise expression of protocol choices through the use of a default element for specifying one of a plurality of binding mechanisms. Moreover, the present invention also provides for not only defining services within a document or data structure through standard URLs, but also for allowing the addressing of a service using an endpoint reference as defined by, e.g., WS-Addressing. This allows for a more robust way to address a service in a document by providing a lightweight, extensible, self-contained description of the service.

Abstract: A mechanism for negotiating a relatively transport agnostic communication protocol for use in accomplishing a distributed activity. The potential protocols subject to negotiation may be, for example, extensions to Web Services Coordination. In that case, when the initiator creates a transaction, the initiator also negotiates the desired protocol with its transaction manager. The transaction manager and any other participants in the transaction will then follow that negotiated protocol when communicating with the transaction manager. The protocol may be selected to improve performance and may be tailored to existing needs and capabilities.

Abstract: Signals are mapped from one protocol to another protocol. A first protocol is received, and a mapping interface is generated to a second protocol. The first protocol is then mapped to the second protocol in accordance with the mapping interface. The mapping interface may comprise a coordination map. Moreover, a state diagram may be generated that is based on the first protocol, prior to mapping the first protocol to the second protocol. The first protocol may be an abstract protocol or a web services business activity protocol, for example, and the second protocol may be another abstract protocol, a concrete interface, a web services interface, a common language runtime interface, or a business process execution language for web services, for example.

Abstract: The present invention extends to methods, systems, and computer program products for reliable messaging using clocks with synchronized rates. In some embodiments, a message source adds at least an interaction ID and TTL value to a message. The message source begins a countdown timer having duration of the TTL value. The message source transmits the message to the destination computer system. The message source detects expiration of a retransmission interval corresponding to the message. The message source determines if the message requires acknowledgment. In other embodiments, a message destination receives a message that includes at least an interaction ID and TTL value. The message destination determines that the message is to be processed. The message destination begins a countdown timer having duration of the TTL value. The message destination processes the message and updates an interaction cache location that corresponds to the interaction ID.

Abstract: The present invention extends to methods, systems, and computer program products for reliable messaging using clocks with synchronized rates. Embodiments of the present invention insure at-most-once delivery of messages. A source and a destination utilize clocks with synchronized rates. Messages are assigned Time-To-Live (“TTL”) values such that state information is updated the source and removed at the destination when a corresponding message timer based on a TTL value expires. Accordingly, resources consumed to maintain state information at the destination can be freed up in a shorter period of time. The source can retransmit state information to the message destination if relevant state information has been removed. Message processor instance IDs insure at-most-once delivery when a message destination suffers an involuntary memory loss. Embodiments of the present invention can also be used for exactly-once-delivery, for example, when TTL values are infinite and instance IDs are not used.

Abstract: Reliable end-to-end messaging in which tracking and acknowledgement information are contained in the electronic message that is visible to layers above the transport layer, thereby being independent of what transport protocols, and whether different transport protocols, are used to communicate between the two end points. Furthermore, acknowledgment messages may identify multiple ranges of sequence numbers corresponding to received electronic messages, thereby permitting further flexibility and completeness in acknowledging received messages.

Abstract: Mechanisms for securely allowing a participant computing entity to engage in a transaction initiated by an initiator computing entity and managed by a coordinator computing entity. The initiator provides a transaction initiation request to the coordinator. Upon receipt, the coordinator accessing a transaction coordination context that includes information such as a secure key that may be used by a participant to register in the transaction. The coordinator then provides the coordination context to the initiator, which provides the coordination context to the participant(s) that are also to engage in the transaction. Each participant then generates a registration request that is based on the coordination context, and that is secured using the secure key provided in the coordination context.

Abstract: Systems and methods for pooling a plurality of telecommunication users into groups is disclosed. One method includes ranking the telecommunication users in an order based on a usage parameter. The usage parameter, for example, may be the average service usage time per billing period. Once ranked, the telecommunication users are pooled into at least two groups, each group comprising at least one telecommunication user within a range of ranks. The method may further include calculating estimated costs for the users to use cost-effective rate plans selected from a group of available rate plans and re-pooling the users into other possible combinations to determine the most cost-effective pooling combination and respective rate plans.

Abstract: Systems and methods for open content model Web service messaging in a networked computing environment are described. In one aspect, a transport neutral message is generated that includes message recipient, endpoint addressing information, and one or more reference properties. The reference properties include selectively opaque message context. The transport neutral message is bound to a transport protocol for communication to the message recipient. At least a portion of the selectively opaque message context is. not directed to the message recipient.

Abstract: Methods, systems, and data structures for communicating object metadata are provided. A generic metadata container is presented that allows object metadata to be described in an extensible manner using protocol-neutral and platform-independent methodologies. A metadata scope refers to a dynamic universe of targets to which the included metadata statements correspond. Metadata properties provide a mechanism to describe the metadata itself, and metadata security can be used to ensure authentic metadata is sent and received. Mechanisms are also provided to allow refinement and replacement of metadata statements. Communication of metadata is expedited using hash digests to confirm metadata versions, and by piggybacking policy metadata requests and responses on other substantive data communication messages, thereby dynamically altering future communications.

Abstract: In general, a system and method for analyzing wireless communication records and for determining optimal wireless communication service plans is disclosed. A transceiver is configured to receive billing information associated with a subscriber of a telecommunications service under a current rate plan. A storage unit stores the billing information. A processor processes the subscriber related billing information to produce organized data having a predefined format. The processor then analyzes the processed data in relation to a plurality of rate plans of a plurality of telecommunications service providers, and determines at least one proposed rate plan that would save the subscriber telecommunication costs relative to the current rate plan. A report of at least one proposed rate plan is then produced and provided to the subscriber, which enables selection of a best telecommunication service provider.

Abstract: In general, a system and method for analyzing wireless communication data for determining an optimal wireless communication service plan is disclosed. A transceiver is configured to receive billing information associated with a subscriber of a telecommunications service under a current rate plan. A storage unit stores the billing information. A processor processes the subscriber related billing information to produce organized data in a calling profile record for each telecommunication service being used by the subscriber. The processor then creates a usage history table and a call detail table within the storage unit from the processed billing information. The processed data is then analyzed by the processor in relation to at least one rate plans of at least one telecommunication service provider. The processor then determines at least one proposed rate plan that would save the subscriber telecommunication costs relative to the current rate plan, via use of the usage history table and the call detail table.