Search

A method for telecommunications services to personalize services based on a user's consumption of data from different multimedia services is presented. The method employs a multisource profiling engine that is used in combination with a deep packet inspection-based keyword inference engine to characterize a user's Web session.

The different ways, by which MiRingBack (MRB) service, which enables the subscriber to provide customized ring-back tone to a calling party, can seamlessly adapt to changing network paradigms and provide multimedia content such as text, image, audio, or video, are addressed. The evolution of MRB service to Multimedia MiRingback (MmRB) service using the packet service capabilities of the network is described and the call flow for MmRB is detailed.

A network processing unit (NPU)-based design and architecture for a packet data serving node (PDSN) in a CDMA2000* network is presented. A prototype implementation of the PDSN on an NPU is presented and its superiority to commercial products by means of measurement experiment is shown.

A new mechanism called adaptive virtual private network (VPN) was proposed that enables enterprises to selectively trade off security for some traffic so that a network service provider (NSP) can provide value-added services for this traffic. Adaptive VPN makes it possible for traffic from a specific user to be carried on an end-to-end VPN session and/or a network-based VPN session.

Real-time active database systems (RTADB's) have attracted the attention of researchers in recent times. Such systems are envisioned as control systems for environments as diverse as process control, network management and automated financial trading. Sensors distributed throughout the system report the state of the system to the database. Unacceptable state reports typically results in corrective actions being triggered with deadlines. Thus RTADB's incorporate both real-time as well as active characteristics. In this paper, we study buffer management in RTADB's. Buffer management is recognized as not being a well studied area in real-time systems. As a result of our work, we postulate PAPER, a new buffer management scheme that relies on two strategies: prefetching and priority based buffer replacement. We report the result of studies of the performance of PAPER, as compared to that of existing buffer management algorithms. The insights derived from this paper impact both real-time database systems as well as real-time, active database systems. Index Terms - Active databases, buffer management, real-time databases.

One of the primary functions of a cloud service provider is to allocate cloud resources to users upon request. Requests arrive in real-time and resource placement decisions must be made as and when a request arrives, without any prior knowledge of future arrivals. In addition, when a cloud service provider operates a geographically diversified cloud that consists of a large number of small data centers, the resource allocation problem becomes even more complex. This is due to the fact that resource request can have additional constraints on data center location, service delay guarantee, and so on, which is especially true for the emerging network function virtualization application. In this paper, we propose a generalized resource placement methodology that can work across different cloud architectures, resource request constraints, with real-time request arrivals and departures. The proposed algorithms are online in the sense that allocations are made without any knowledge of resource requests that arrive in the future, and the current resource allocations are made in such a manner as to permit the acceptance of as many future arrivals as possible. We derive worst case competitive ratio for the algorithms. We show through experiments and case studies the superior performance of the algorithms in practice. [ABSTRACT FROM PUBLISHER]