1,721,106 research outputs found
Joint Compute-Caching-Communication Control for Online Data-Intensive Service Delivery
No full textData-intensive augmented information (AgI) services (e.g., metaverse applications such as virtual/augmented reality), designed to deliver highly interactive experiences resulting from the real-time combination of live data-streams and pre-stored digital content, are accelerating the need for distributed compute platforms with unprecedented storage, computation, and communication requirements. To this end, the integrated evolution of next-generation networks (5G/6G) and distributed cloud technologies (mobile/edge/cloud computing) have emerged as a promising paradigm to address the interaction- and resource-intensive nature of data-intensive AgI services. In this paper, we focus on the design of control policies for the joint orchestration of compute, caching, and communication (3C) resources in next-generation 3C networks for the delivery of data-intensive AgI services. We design the first throughput-optimal control policy that coordinates joint decisions around (i) routing paths and processing locations for live data streams, with (ii) cache selection and distribution paths for associated data objects. We then extend the proposed solution to include a max-throughput data placement policy and two efficient replacement policies. Numerical results demonstrate the superior performance obtained via the novel multi-pipeline flow control and 3C resource orchestration mechanisms of the proposed policy, compared with state-of-the-art algorithms that lack full 3C integrated control
Cache Allocations for Consecutive Requests of Categorized Contents: Service Provider’s Perspective
No full textIn wireless caching networks, a user generally has a concrete purpose of consuming contents in a certain preferred category, and requests multiple contents in sequence. While most existing research on wireless caching and delivery has focused only on one-shot requests, the popularity distribution of contents requested consecutively is definitely different from the one-shot request and has been not considered. Also, especially from the perspective of the service provider, it is advantageous for users to consume as many contents as possible. Thus, this paper proposes two cache allocation policies for categorized contents and consecutive user demands, which maximize 1) the cache hit rate and 2) the number of consecutive content consumption, respectively. Numerical results show how categorized contents and consecutive content requests have impacts on the cache allocation
Wideband spatial channel model in an urban cellular environments at 28 GHz
No full textThis paper presents channel propagation measurements and analysis of the channel characteristics of millimeter wave (mmWave) transmission for urban cellular communication systems, in particular in the promising 28 GHz band. For channel propagation analysis, the urban measurement campaign was conducted with a synchronously spherical scanning 28 GHz channel sounder system, from which omni-like channel measurements are obtained for channel modeling. From the measurements, we analyze the spatio-temporal channel characteristics such as multipath delay, angular statistics, and pathloss. The clustering analysis has been done including its power distribution. Then, a set of millimeter wave radio propagation parameters is presented, and the corresponding channel models based on the 3GPP spatial channel model (SCM) are also described
Probabilistic Caching and Dynamic Delivery Policies for Categorized Contents and Consecutive User Demands
No full textWireless caching networks have been extensively researched as a promising technique for supporting the massive data traffic of multimedia services. Many of the existing studies on real-data traffic have shown that users of a multimedia service consecutively request multiple contents and this sequence is strongly dependent on the related list of the first content and/or the top referrer in the category. This paper thus introduces the notion of "temporary preference", characterizing the behavior of users who are highly likely to request the next content from a certain target category (i.e., related content list). Based on this observation, this paper proposes both probabilistic caching and dynamic delivery policies for categorized contents and consecutive user demands. The proposed caching scheme maximizes the minimum of the cache hit rates for all users. In the delivery phase, a dynamic helper association policy for receiving multiple contents in a row is designed to reduce the delivery latency. By comparing with the content placement optimized for one-shot requests, numerical results verify the effects of categorized contents and consecutive user demands on the proposed caching and delivery policies.
Equalisation techniques for single carrier, unspread digital modulations:Preliminary Topics
No full textEqualisation techniques for single carrier, unspread digital modulations:Equalization algorithms
No full text- …
