Composite Service Presence Calculation Using Timed AND-OR Tree
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Determining accurate presence states and presence delays for composite services in real-time communication systems within Service-Oriented Architecture (SOA) is challenging due to discrete and differing presence systems among atomic services, making it difficult to merge or compare presence information effectively.
Innovation Solution
A presence calculation method using a Timed AND-OR (TAO) tree overlay that maps discrete service presence states to presence state transition delays, computes composite presence state transition delays, and determines the composite presence state, allowing for integration of presence information from different systems without manual translation, and informs clients about service availability through conventional presence subscriptions and notifications.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If discrete presence systems from different atomic services are merged or compared for composite services, then accurate presence information can be obtained, but the complexity of integrating different presence standards and systems increases significantly
Solution Approach 1:
The patent introduces a presence information translation and integration mechanism that acts as an intermediary between different atomic service presence systems. This mediator translates diverse presence states and delays into a unified composite service presence representation, enabling accurate presence information aggregation without requiring direct complex integration of heterogeneous presence standards.
Solution Approach 2:
The patent transforms presence information from different atomic services by changing its representation parameters. It converts various presence states and timing information into a standardized format with unified delay measurements, allowing accurate comparison and integration while simplifying the handling of heterogeneous presence systems.
2Loss of time
If presence state transition delays are computed for composite services, then accurate timing information for service availability is provided, but the computation complexity and processing time increase
Solution Approach 1:
The patent performs preliminary computation of presence state transition delays for atomic services individually before composing them into composite services. By pre-calculating and storing delay information at the atomic service level, the system avoids complex real-time computations when determining composite service presence, thus improving timing accuracy while reducing computational burden.
Solution Approach 2:
The patent segments the presence delay computation process into independent atomic service evaluations followed by compositional aggregation. This segmentation allows each atomic service's presence delay to be computed separately using simpler methods, and then combined to determine the composite service presence delay, reducing overall computation complexity.
3Loss of information
If detailed presence information is exchanged between services, then accurate presence states are determined, but network traffic and communication overhead increase
Solution Approach 1:
The patent extracts only the essential presence information elements (presence state and transition delay) from atomic services that are necessary for determining composite service presence. By extracting and transmitting only these critical parameters rather than complete presence data sets, the system maintains information completeness while significantly reducing network traffic overhead.
Data Source
AI summary
A presence calculation method comprising receiving first presence subscription request for a composite service that comprises a service at the node and a plurality of discrete services at one or more child nodes, sending a second presence subscription request to one or more child nodes in response to the first subscription request, receiving one or more response messages that comprise a collection of presence state transition delays corresponding to the child nodes from the child nodes in response to the second subscription request, determining one or more communication delays between the node and the child nodes using the response messages, computing a presence state transition delay for the composite service using the collection of presence state transition delays and the communication delays; and determining a composite presence state using a mapping between the presence state transition delay for the composite service and the composite presence state.