637 research outputs found
Dynamic Optimization and Migration of Continuous Queries Over Data Streams
Continuous queries process real-time streaming data and output results in streams for a wide range of applications. Due to the fluctuating stream characteristics, a streaming database system needs to dynamically adapt query execution. This dissertation proposes novel solutions to continuous query adaptation in three core areas, namely dynamic query optimization, dynamic plan migration and partitioned query adaptation. Runtime query optimization needs to efficiently generate plans that satisfy both CPU and memory resource constraints. Existing work focus on minimizing intermediate query results, which decreases memory and CPU usages simultaneously. However, doing so cannot assure that both resource constraints are being satisfied, because memory and CPU can be either positively or negatively correlated. This part of the dissertation proposes efficient optimization strategies that utilize both types of correlations to search the entire query plan space in polynomial time when a typical exhaustive search would take at least exponential time. Extensive experimental evaluations have demonstrated the effectiveness of the proposed strategies. Dynamic plan migration is concerned with on-the-fly transition from one continuous plan to a semantically equivalent yet more efficient plan. It is a must to guarantee the continuation and repeatability of dynamic query optimization. However, this research area has been largely neglected in the current literature. The second part of this dissertation proposes migration strategies that dynamically migrate continuous queries while guaranteeing the integrity of the query results, meaning there are no missing, duplicate or incorrect results. The extensive experimental evaluations show that the proposed strategies vary significantly in terms of output rates and memory usages given distinct system configurations and stream workloads. Partitioned query processing is effective to process continuous queries with large stateful operators in a distributed system. Dynamic load redistribution is necessary to balance uneven workload across machines due to changing stream properties. However, existing solutions generally assume static query plans without runtime query optimization. This part of the dissertation evaluates the benefits of applying query optimization in partitioned query processing and shows dramatic performance improvement of more than 300%. Several load balancing strategies are then proposed to consider the heterogeneity of plan shapes across machines caused by dynamic query optimization. The effectiveness of the proposed strategies is analyzed through extensive experiments using a cluster
Resource Allocation for Device-to-Device Communications Underlaying Heterogeneous Cellular Networks Using Coalitional Games
Heterogeneous cellular networks (HCNs) with millimeter wave (mmWave)
communications included are emerging as a promising candidate for the fifth
generation mobile network. With highly directional antenna arrays, mmWave links
are able to provide several-Gbps transmission rate. However, mmWave links are
easily blocked without line of sight. On the other hand, D2D communications
have been proposed to support many content based applications, and need to
share resources with users in HCNs to improve spectral reuse and enhance system
capacity. Consequently, an efficient resource allocation scheme for D2D pairs
among both mmWave and the cellular carrier band is needed. In this paper, we
first formulate the problem of the resource allocation among mmWave and the
cellular band for multiple D2D pairs from the view point of game theory. Then,
with the characteristics of cellular and mmWave communications considered, we
propose a coalition formation game to maximize the system sum rate in
statistical average sense. We also theoretically prove that our proposed game
converges to a Nash-stable equilibrium and further reaches the near-optimal
solution with fast convergence rate. Through extensive simulations under
various system parameters, we demonstrate the superior performance of our
scheme in terms of the system sum rate compared with several other practical
schemes.Comment: 13 pages, 12 figure
Resource Allocation for Device-to-Device Communications in Multi-Cell Multi-Band Heterogeneous Cellular Networks
Heterogeneous cellular networks (HCNs) with millimeter wave (mm-wave)
communications are considered as a promising technology for the fifth
generation mobile networks. Mm-wave has the potential to provide multiple
gigabit data rate due to the broad spectrum. Unfortunately, additional free
space path loss is also caused by the high carrier frequency. On the other
hand, mm-wave signals are sensitive to obstacles and more vulnerable to
blocking effects. To address this issue, highly directional narrow beams are
utilized in mm-wave networks. Additionally, device-to-device (D2D) users make
full use of their proximity and share uplink spectrum resources in HCNs to
increase the spectrum efficiency and network capacity. Towards the caused
complex interferences, the combination of D2D-enabled HCNs with small cells
densely deployed and mm-wave communications poses a big challenge to the
resource allocation problems. In this paper, we formulate the optimization
problem of D2D communication spectrum resource allocation among multiple
micro-wave bands and multiple mm-wave bands in HCNs. Then, considering the
totally different propagation conditions on the two bands, a heuristic
algorithm is proposed to maximize the system transmission rate and approximate
the solutions with sufficient accuracies. Compared with other practical
schemes, we carry out extensive simulations with different system parameters,
and demonstrate the superior performance of the proposed scheme. In addition,
the optimality and complexity are simulated to further verify effectiveness and
efficiency.Comment: 13 pages, 11 figures, IEEE Transactions on Vehicular Technolog
Global bifurcation of positive solutions for a class of superlinear elliptic systems
We are concerned with the global bifurcation of positive solutions for semilinear elliptic systems of the form −∆u = λ f(u, v) in Ω, −∆v = λg(u, v) in Ω, u = v = 0 on ∂Ω, where λ ∈ R is the bifurcation parameter, Ω ⊂ RN, N ≥ 2 is a bounded domain with smooth boundary ∂Ω. We establish the existence of an unbounded branch of positive solutions, emanating from the origin, which is bounded in positive λ-direction. The nonlinearities f , g ∈ C 1 (R × R,(0, ∞)) are nondecreasing for each variable and have superlinear growth at infinity. The proof of our main result is based upon bifurcation theory. In addition, as an application for our main result, when f and g subject to the upper growth bound, by a technique of taking superior limit for components, then we may show that the branch must bifurcate from infinity at λ = 0
- …