Abstract: The underlying invention generally relates to the field of mobile computing in a wireless mobile networking environment with distributed multimedia applications (130). More specifically, it is directed to the field of Quality-of-Service (QOS) management for adaptive real-time services running on mobile devices and an End-to-End Negotiation Protocol (E2ENP) based on a novel usage of a session-layer protocol (SIP) in conjunction with extensions of a session description protocol implementation (SDP, SDPng) and the Extensible Markup Language (XML) for defining user profile and terminal capability information which allow to enforce and use hierarchical QOS Contract specifications.

Abstract: A system for establishing a session between two entities in a telecommunications network. The system includes the following Application Programming Interfaces (APIs): a Management API representing an interface between the system and an entity managing it, an API representing an interface between the system, middleware and/or an application using services offered by the system, and a generic session-layer protocol API representing an interface between the system and a User Agent of a session-layer protocol.

Abstract: A system offering an Application Programming Interface for multi-stream multimedia applications running on at least two registered end peers participating in a mobile telecommunication session and/or middleware being connected to a mobile network. The system providing guaranteed end-to-end quality and resource capabilities using the concept of concatenated E2ENP phases and providing a pre-negotiation of a multiplicity of alternative capabilities and QoS Contracts, management of leased pre-negotiated information, session establishment between said end peers with negotiation of a multiplicity of alternative capabilities and/or QoS Contracts, and a dynamic re-negotiation of the end-to-end quality and capabilities.

Abstract: Cache bounded reference counting for computer languages having automated memory management in which, for example, a reference to an object “Z” initially stored in an object “O” is fetched and the cache hardware is queried whether the reference to the object “Z” is a valid reference, is in a cache, and has a continuity flag set to “on”. If the object “Z” is a valid reference, is in the cache, and has a continuity flag set to “on”, the object “O” is locked for an update, a reference counter is decremented for the object “Z” if the object “Z” resides in the cache, and a return code is set to zero to indicate that the object “Z” is de-referenced and that its storage memory can be released and re-used if the reference counter for the object “Z” reaches zero. Thereafter, the cache hardware is similarly queried regarding an object “N” that will become a new reference of object “O”.

Abstract: A computer implemented method of cache bounded reference counting for computer languages having automated memory management in which, for example, a reference to an object “Z” initially stored in an object “O” is fetched and the cache hardware is queried whether the reference to the object “Z” is a valid reference, is in the cache, and has a continuity flag set to “on”. If so, the object “O” is locked for an update, a reference counter is decremented for the object “Z” if the object “Z” resides in the cache, and a return code is set to zero to indicate that the object “Z” is de-referenced and that its storage memory can be released and re-used if the reference counter for the object “Z” reaches zero. Thereafter, the cache hardware is similarly queried regarding an object “N” that will become a new reference of object “O”.

Abstract: A database replication method comprises storing a database snapshot to determine changes applied to at least one first database system component; generating a sequence of change records using the database snapshot, and rearranging the sequence of change records to reflect referential dependencies, and a database computer system, data processing program, and computer program product therefor.