Search

Based on the continuous time random walk, we derive the Fokker-Planck equations with Caputo-Fabrizio fractional derivative, which can effectively model a variety of physical phenomena, especially, the material heterogeneities and structures with different scales. Extending the discretizations for fractional substantial calculus [Chen and Deng, \emph{ ESAIM: M2AN.} \textbf{49}, (2015), 373--394], we first provide the numerical discretizations of the Caputo-Fabrizio fractional derivative with the global truncation error $\mathcal{O}(\tau^\nu)$ $ (\nu=1,2,3,4)$. Then we use the derived schemes to solve the Caputo-Fabrizio fractional diffusion equation. By analysing the positive definiteness of the stiffness matrices of the discretized Caputo-Fabrizio operator, the unconditional stability and the convergence with the global truncation error $\mathcal{O}(\tau^2+h^2)$ are theoretically proved and numerical verified., Comment: At first sight, fractional derivatives defined using non-singular kernels may appear very attractive. Thus, it is unsurprising that these simpler operators have become quite popular since their appearance about five years ago. But these operators with non-singular kernels have serious shortcomings that strongly discourage their use, see [Fract. Calc. Appl. Anal., 23, 610-634, 2020]

The nonlocal problems have been used to model very different applied scientific phenomena, which involve the fractional Laplacian when one looks at the L\'{e}vy processes and stochastic interfaces. This paper deals with the nonlocal problems on a bounded domain, where the stiffness matrices of the resulting systems are Toeplitz-plus-tridiagonal and far from being diagonally dominant, as it occurs when dealing with linear finite element approximations. By exploiting a weakly diagonally dominant Toeplitz property of the stiffness matrices, the optimal convergence of the two-grid method is well established [Fiorentino and Serra-Capizzano, {\em SIAM J. Sci. Comput.}, {17} (1996), pp. 1068--1081; Chen and Deng, {\em SIAM J. Matrix Anal. Appl.}, {38} (2017), pp. 869--890]; and there are still questions about best ways to define coarsening and interpolation operator when the stiffness matrix is far from being weakly diagonally dominant [St\"{u}ben, {\em J. Comput. Appl. Math.}, {128} (2001), pp. 281--309]. In this work, using spectral indications from our analysis of the involved matrices, the simple (traditional) restriction operator and prolongation operator are employed in order to handle general algebraic systems which are {\em neither Toeplitz nor weakly diagonally dominant} corresponding to the fractional Laplacian kernel and the constant kernel, respectively. We focus our efforts on providing the detailed proof of the convergence of the two-grid method for such situations. Moreover, the convergence of the full multigrid is also discussed with the constant kernel. The numerical experiments are performed to verify the convergence with only $\mathcal{O}(N \mbox{log} N)$ complexity by the fast Fourier transform, where $N$ is the number of the grid points., Comment: 25 pages

In this article a theoretical framework for the Galerkin finite element approximation to the time-dependent Riesz tempered fractional problem is provided without the fractional regularity assumption. Because the time-dependent problems should become easier to solve as the time step $\tau \rightarrow 0$, which correspond to the mass matrix dominant [R. E. Bank and T. Dupont, {\em Math. Comp.}, 153 (1981), pp. 35--51]. Based on the introduced and analysis of the fractional $\tau$-norm, the uniform convergence estimates of the V-cycle multigrid method with the time-dependent fractional problem is strictly proved, which means that the convergence rate of the V-cycle MGM is independent of the mesh size $h$ and the time step $\tau$. The numerical experiments are performed to verify the convergence with only $\mathcal{O}(N \mbox{log} N)$ complexity by the fast Fourier transform method, where $N$ is the number of the grid points. To the best of our knowledge, this is the first proof for the convergence rate of the V-cycle multigrid finite element method with $\tau\rightarrow 0$., Comment: 23 pages. 0 figures

Small-cell architecture is widely adopted by cellular network operators to increase network capacity. By reducing the size of cells, operators can pack more (low-power) base stations in an area to better serve the growing demands, without causing extra interference. However, this approach suffers from low spectrum temporal efficiency. When a cell becomes smaller and covers fewer users, its total traffic fluctuates significantly due to insufficient traffic aggregation and exhibiting a large "peak-to-mean" ratio. As operators customarily provision spectrum for peak traffic, large traffic temporal fluctuation inevitably leads to low spectrum temporal efficiency. In this paper, we advocate device-to-device (D2D) load-balancing as a useful mechanism to address the fundamental drawback of small-cell architecture. The idea is to shift traffic from a congested cell to its adjacent under-utilized cells by leveraging inter-cell D2D communication, so that the traffic can be served without using extra spectrum, effectively improving the spectrum temporal efficiency. We provide theoretical modeling and analysis to characterize the benefit of D2D load balancing, in terms of total spectrum requirements of all individual cells. We also derive the corresponding cost, in terms of incurred D2D traffic overhead. We carry out empirical evaluations based on real-world 4G data traces to gauge the benefit and cost of D2D load balancing under practical settings. The results show that D2D load balancing can reduce the spectrum requirement by 25% as compared to the standard scenario without D2D load balancing, at the expense of negligible 0.7% D2D traffic overhead.

We study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G(V,E) at a fixed rate R possibly using multiple paths to minimize the maximum end-to-end delay, denoted as the Min-Max-Delay problem. Transmission over an edge incurs a constant delay within the capacity. We prove that Min-Max-Delay is weakly NP-complete, and demonstrate that it becomes strongly NP-complete if we require integer flow solution. We propose an optimal pseudo-polynomial time algorithm for Min-Max-Delay, with time complexity O(\log (Nd_{\max}) (N^5d_{\max}^{2.5})(\log R+N^2d_{\max}\log(N^2d_{\max}))), where N = \max\{|V|,|E|\} and d_{\max} is the maximum edge delay. Besides, we show that the integrality gap, which is defined as the ratio of the maximum delay of an optimal integer flow to the maximum delay of an optimal fractional flow, could be arbitrarily large.

We investigate the problem of stochastic network optimization in the presence of imperfect state prediction and non-stationarity. Based on a novel distribution-accuracy curve prediction model, we develop the predictive learning-aided control (PLC) algorithm, which jointly utilizes historic and predicted network state information for decision making. PLC is an online algorithm that requires zero a-prior system statistical information, and consists of three key components, namely sequential distribution estimation and change detection, dual learning, and online queue-based control. Specifically, we show that PLC simultaneously achieves good long-term performance, short-term queue size reduction, accurate change detection, and fast algorithm convergence. In particular, for stationary networks, PLC achieves a near-optimal $[O(\epsilon)$, $O(\log(1/\epsilon)^2)]$ utility-delay tradeoff. For non-stationary networks, \plc{} obtains an $[O(\epsilon), O(\log^2(1/\epsilon)$ $+ \min(\epsilon^{c/2-1}, e_w/\epsilon))]$ utility-backlog tradeoff for distributions that last $\Theta(\frac{\max(\epsilon^{-c}, e_w^{-2})}{\epsilon^{1+a}})$ time, where $e_w$ is the prediction accuracy and $a=\Theta(1)>0$ is a constant (the Backpressue algorithm \cite{neelynowbook} requires an $O(\epsilon^{-2})$ length for the same utility performance with a larger backlog). Moreover, PLC detects distribution change $O(w)$ slots faster with high probability ($w$ is the prediction size) and achieves an $O(\min(\epsilon^{-1+c/2}, e_w/\epsilon)+\log^2(1/\epsilon))$ convergence time. Our results demonstrate that state prediction (even imperfect) can help (i) achieve faster detection and convergence, and (ii) obtain better utility-delay tradeoffs.

The fractional wave equation governs the propagation of mechanical diffusive waves in viscoelastic media which exhibits a power-law creep, and consequently provided a physical interpretation of this equation in the framework of dynamic viscoelasticity. In this paper, we first develop the energy method to estimate the one-dimensional space-Riesz fractional wave equation. For two-dimensional cases with the variable coefficients, the discretized matrices are proved to be commutative, which ensures to carry out of the priori error estimates. The unconditional stability and convergence with the global truncation error $\mathcal{O}(\tau^2+h^2)$ are theoretically proved and numerically verified. In particulary, the framework of the priori error estimates and convergence analysis are still valid for the compact finite difference scheme and the nonlocal wave equation., Comment: 22pages

Today's Internet has witnessed an increase in the popularity of mobile video streaming, which is expected to exceed 3/4 of the global mobile data traffic by 2019. To satisfy the considerable amount of mobile video requests, video service providers have been pushing their content delivery infrastructure to edge networks--from regional CDN servers to peer CDN servers (e.g., smartrouters in users' homes)--to cache content and serve users with storage and network resources nearby. Among the edge network content caching paradigms, Wi-Fi access point caching and cellular base station caching have become two mainstream solutions. Thus, understanding the effectiveness and performance of these solutions for large-scale mobile video delivery is important. However, the characteristics and request patterns of mobile video streaming are unclear in practical wireless network. In this paper, we use real-world datasets containing 50 million trace items of nearly 2 million users viewing more than 0.3 million unique videos using mobile devices in a metropolis in China over 2 weeks, not only to understand the request patterns and user behaviors in mobile video streaming, but also to evaluate the effectiveness of Wi-Fi and cellular-based edge content caching solutions. To understand performance of edge content caching for mobile video streaming, we first present temporal and spatial video request patterns, and we analyze their impacts on caching performance using frequency-domain and entropy analysis approaches. We then study the behaviors of mobile video users, including their mobility and geographical migration behaviors. Using trace-driven experiments, we compare strategies for edge content caching including LRU and LFU, in terms of supporting mobile video requests. Moreover, we design an efficient caching strategy based on the measurement insights and experimentally evaluate its performance., Comment: 13 pages, 19 figures

A promising approach to hedge against the inherent uncertainty of renewable generation is to equip the renewable plants with energy storage systems. This paper focuses on designing profit maximization offering strategies, i.e., the strategies that determine the offering price and volume, for a storage-assisted renewable power producer that participates in hour-ahead electricity market. Designing the strategies is challenging since (i) the underlying problem is coupled across time due to the evolution of the storage level, and (ii) inputs to the problem including the renewable output and market clearing price are unknown when submitting offers. Following the competitive online algorithm design approach, we first study a basic setting where the renewable output and the clearing price are known for the next hour. We propose sOffer, a simple online offering strategy that achieves the best possible competitive ratio of O(log \theta), where $\theta$ is the ratio between the maximum and the minimum clearing prices. Then, we consider the case where the clearing price is unknown. By exploiting the idea of submitting multiple offers to combat price uncertainty, we propose mOffer, and demonstrate that the competitive ratio of mOffer converges to that of sOffer as the number of offers grows. Finally, we extend our approach to the scenario where the renewable output has forecasting error. We propose gOffer as the generalized offering strategy and characterize its competitive ratio as a function of the forecasting error. Our trace-driven experiments demonstrate that our algorithms achieve performance close to the offline optimal and outperform a baseline alternative significantly.

This paper focuses on providing the high order algorithms for the space-time tempered fractional diffusion-wave equation. The designed schemes are unconditionally stable and have the global truncation error $\mathcal{O}(\tau^2+h^2)$, being theoretically proved and numerically verified., Comment: 7 pages