摘要:
Systems and associated methods for providing scalable presence subscriptions in federated presence environments are described. Embodiments provide for intelligent addition of subscriptions to a presence system. Embodiments identify if a virtualized presentity (corresponding to a new query) can be composed from existing virtualized presentities, and if so, corresponding query processing cells (QPCs) (servicing existing queries) are reused to retrieve the presence information (partially or fully) for the new incoming query. Embodiments organize the existing QPCs into a hierarchy such that a QPC/virtual presentity at a higher layer fetches presence information of all or some presentities from QPCs/virtual presentities at lower layer(s) to service the new query.
摘要:
Systems, methods, apparatuses and program products configured to provide a topology-service tool are described. A presence-federation solution asset is leveraged to address topology-federation problems. A network topology tool takes as input network endpoints, for example caller and callee telephone numbers, determines a network service flow used to connect the network endpoints, and develops a network topology view of the service flow along with associated network device related information.
摘要:
Systems, methods, apparatuses and program products configured to provide a topology-service tool are described. A presence-federation solution asset is leveraged to address topology-federation problems. A network topology tool takes as input network endpoints, for example caller and callee telephone numbers, determines a network service flow used to connect the network endpoints, and develops a network topology view of the service flow along with associated network device related information.
摘要:
Systems and associated methods for providing scalable presence subscriptions in federated presence environments are described. Embodiments provide for intelligent addition of subscriptions to a presence system. Embodiments identify if a virtualized presentity (corresponding to a new query) can be composed from existing virtualized presentities, and if so, corresponding query processing cells (QPCs) (servicing existing queries) are reused to retrieve the presence information (partially or fully) for the new incoming query. Embodiments organize the existing QPCs into a hierarchy such that a QPC/virtual presentity at a higher layer fetches presence information of all or some presentities from QPCs/virtual presentities at lower layer(s) to service the new query.
摘要:
Techniques for supporting a presence virtualization query are provided. The techniques include receiving a virtual query from a client, the virtual query specified in terms of a membership set of members, wherein the membership set comprises a list of presentity uniform resource identifiers (URIs) and a separate transformation function, defined over a set of presence documents of the members in the membership set, redirecting the query to a destination virtual presentity URI whose presence state comprises an aggregation of the presence documents of the list of URIs in the membership set and a corresponding query element (QE) object that manages subscriptions for the URI, adding the client as a watcher for the destination virtual presentity URI, and applying transformation logic specified by the watcher client and notifying a corresponding client of a resulting output.
摘要:
Techniques are disclosed for generating and managing presentities in accordance with a virtual presence server. By way of example, a method for requesting information from at least one server comprises the following steps. A client request, which expresses a request that can not be satisfied by a single existing presentity, is obtained at an intermediate server, wherein the intermediate server operates as a virtual presence server. The virtual presence server (i.e., intermediate server) creates a set of software objects for a virtual presentity, the set of objects embodying logic to combine presence information from one or more of existing presentities and external information sources, in accordance with at least one existing presence server. The virtual presence server creates an association between the request of the client and the created virtual presentity that allows the presence information to be propagated back to the client.
摘要:
Techniques are disclosed for generating and managing presentities in accordance with a virtual presence server. By way of example, a method for requesting information from at least one server comprises the following steps. A client request, which expresses a request that can not be satisfied by a single existing presentity, is obtained at an intermediate server, wherein the intermediate server operates as a virtual presence server. The virtual presence server (i.e., intermediate server) creates a set of software objects for a virtual presentity, the set of objects embodying logic to combine presence information from one or more of existing presentities and external information sources, in accordance with at least one existing presence server. The virtual presence server creates an association between the request of the client and the created virtual presentity that allows the presence information to be propagated back to the client.
摘要:
Techniques for supporting a presence virtualization query are provided. The techniques include receiving a virtual query from a client, the virtual query specified in terms of a membership set of members, wherein the membership set comprises a list of presentity uniform resource identifiers (URIs) and a separate transformation function, defined over a set of presence documents of the members in the membership set, redirecting the query to a destination virtual presentity URI whose presence state comprises an aggregation of the presence documents of the list of URIs in the membership set and a corresponding query element (QE) object that manages subscriptions for the URI, adding the client as a watcher for the destination virtual presentity URI, and applying transformation logic specified by the watcher client and notifying a corresponding client of a resulting output.
摘要:
A method for operating a server having a maximum capacity for servicing requests comprises the following steps: receiving a plurality of requests; classifying each request according to a value; determining a priority for handling the request according to the value, such that requests with higher values are assigned higher priorities; placing each request in one of multiple queues according to its priority value; and dropping the requests with the lowest priority when the plurality of requests are received at a rate that exceeds the maximum capacity. The server operates according to a session initiation protocol.Classifying each request comprises running a classification algorithm. The classification algorithm comprising steps of: receiving a rule set, each rule comprising headers and conditions; creating a condition table by taking a union of all conditions in the rules; creating a header table by extracting a common set of headers from the condition table; extracting the relevant headers from the header table; determining a matching rule; creating a bit vector table; selecting the matching rule according to data in the bit vector table; and applying the rule to place the message in the appropriate queue.
摘要:
A method for operating a server having a maximum capacity for servicing requests comprises the following steps: receiving a plurality of requests; classifying each request according to a value; determining a priority for handling the request according to the value, such that requests with higher values are assigned higher priorities; placing each request in one of multiple queues according to its priority value; and dropping the requests with the lowest priority when the plurality of requests are received at a rate that exceeds the maximum capacity. The server operates according to a session initiation protocol.Classifying each request comprises running a classification algorithm. The classification algorithm comprising steps of: receiving a rule set, each rule comprising headers and conditions; creating a condition table by taking a union of all conditions in the rules; creating a header table by extracting a common set of headers from the condition table; extracting the relevant headers from the header table; determining a matching rule; creating a bit vector table; selecting the matching rule according to data in the bit vector table; and applying the rule to place the message in the appropriate queue.