اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDynamic Profit Maximization of Cognitive Mobile Virtual Network Operator
328
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the profit maximization problem of a cognitive virtual network operator in a dynamic network environment. We consider a downlink OFDM communication system with various network dynamics, including dynamic user demands, uncertain sensing spectrum resources, dynamic spectrum prices, and time-varying channel conditions. In addition, heterogenous users and imperfect sensing technology are incorporated to make the network model more realistic. By exploring the special structural of the problem, we develop a low-complexity on-line control policies that determine pricing and resource scheduling without knowing the statistics of dynamic network parameters. We show that the proposed algorithms can achieve arbitrarily close to the optimal profit with a proper trade-off with the queuing delay.
قيم البحث
اقرأ أيضاً
It is well-known that cloud application performance critically depends on the network. Accordingly, new abstractions for cloud applications are proposed which extend the performance isolation guarantees to the network. The most common abstraction is
the Virtual Cluster V C(n, b): the n virtual machines of a customer are connected to a virtual switch at bandwidth b. However, today, not much is known about how to efficiently embed and price virtual clusters. This paper makes two contributions. (1) We present an algorithm called Tetris that efficiently embeds virtual clusters arriving in an online fashion, by jointly optimizing the node and link resources. We show that this algorithm allows to multiplex more virtual clusters over the same physical infrastructure compared to existing algorithms, hence improving the provider profit. (2) We present the first demand-specific pricing model called DSP for virtual clusters. Our pricing model is fair in the sense that a customer only needs to pay for what he or she asked. Moreover, it features other desirable properties, such as price independence from mapping locations.
Future wireless networks will progressively displace service provisioning towards the edge to accommodate increasing growth in traffic. This paradigm shift calls for smart policies to efficiently share network resources and ensure service delivery. I
n this paper, we consider a cognitive dynamic network architecture (CDNA) where primary users (PUs) are rewarded for sharing their connectivities and acting as access points for secondary users (SUs). CDNA creates opportunities for capacity increase by network-wide harvesting of unused data plans and spectrum from different operators. Different policies for data and spectrum trading are presented based on centralized, hybrid and distributed schemes involving primary operator (PO), secondary operator (SO) and their respective end users. In these schemes, PO and SO progressively delegate trading to their end users and adopt more flexible cooperation agreements to reduce computational time and track available resources dynamically. A novel matching-with-pricing algorithm is presented to enable self-organized SU-PU associations, channel allocation and pricing for data and spectrum with low computational complexity. Since connectivity is provided by the actual users, the success of the underlying collaborative market relies on the trustworthiness of the connections. A behavioral-based access control mechanism is developed to incentivize/penalize honest/dishonest behavior and create a trusted collaborative network. Numerical results show that the computational time of the hybrid scheme is one order of magnitude faster than the benchmark centralized scheme and that the matching algorithm reconfigures the network up to three orders of magnitude faster than in the centralized scheme.
Profit maximization (PM) is to select a subset of users as seeds for viral marketing in online social networks, which balances between the cost and the profit from influence spread. We extend PM to that under the general marketing strategy, and form
continuous profit maximization (CPM-MS) problem, whose domain is on integer lattices. The objective function of our CPM-MS is dr-submodular, but non-monotone. It is a typical case of unconstrained dr-submodular maximization (UDSM) problem, and take it as a starting point, we study UDSM systematically in this paper, which is very different from those existing researcher. First, we introduce the lattice-based double greedy algorithm, which can obtain a constant approximation guarantee. However, there is a strict and unrealistic condition that requiring the objective value is non-negative on the whole domain, or else no theoretical bounds. Thus, we propose a technique, called lattice-based iterative pruning. It can shrink the search space effectively, thereby greatly increasing the possibility of satisfying the non-negative objective function on this smaller domain without losing approximation ratio. Then, to overcome the difficulty to estimate the objective value of CPM-MS, we adopt reverse sampling strategies, and combine it with lattice-based double greedy, including pruning, without losing its performance but reducing its running time. The entire process can be considered as a general framework to solve the UDSM problem, especially for applying to social networks. Finally, we conduct experiments on several real datasets to evaluate the effectiveness and efficiency of our proposed algorithms.
This paper investigates the problem of providing ultra-reliable and energy-efficient virtual reality (VR) experiences for wireless mobile users. To ensure reliable ultra-high-definition (UHD) video frame delivery to mobile users and enhance their imm
ersive visual experiences, a coordinated multipoint (CoMP) transmission technique and millimeter wave (mmWave) communications are exploited. Owing to user movement and time-varying wireless channels, the wireless VR experience enhancement problem is formulated as a sequence-dependent and mixed-integer problem with a goal of maximizing users feeling of presence (FoP) in the virtual world, subject to power consumption constraints on access points (APs) and users head-mounted displays (HMDs). The problem, however, is hard to be directly solved due to the lack of users accurate tracking information and the sequence-dependent and mixed-integer characteristics. To overcome this challenge, we develop a parallel echo state network (ESN) learning method to predict users tracking information by training fresh and historical tracking samples separately collected by APs. With the learnt results, we propose a deep reinforcement learning (DRL) based optimization algorithm to solve the formulated problem. In this algorithm, we implement deep neural networks (DNNs) as a scalable solution to produce integer decision variables and solving a continuous power control problem to criticize the integer decision variables. Finally, the performance of the proposed algorithm is compared with various benchmark algorithms, and the impact of different design parameters is also discussed. Simulation results demonstrate that the proposed algorithm is more 4.14% energy-efficient than the benchmark algorithms.
Virtualization facilitates heterogeneous cloud applications to share the same physical infrastructure with admirable flexibility, while resource efficiency and survivability are critical concerns for virtual network embedding (VNE). As more and more
internet applications migrate to the cloud, the resource efficiency and the survivability of VNs, such as single link failure or large-scale disaster survivability, have become crucial issues. Separating the VNE problem into node and link mapping sub-problems without coordination might cause a high embedding cost. This dissertation presents two independent approaches to solve the aforementioned challenges. First, we study two-stage coordinated survivable VNE (SVNE) problem and propose an adaptive path splitting based SVNE (APSS) scheme. We first develop a concise anchor node strategy to restrict the solution space of the candidate substrate nodes, which coordinates node mapping with link mapping to limit the distance spans of the virtual links. Then, we employ an adaptive path splitting policy to provide full protection against single-link failures with partial backup resource, and design an agile frequency slot windows choosing mechanism to mitigate the spectrum fragmentation for link resource efficiency. Simulation results demonstrate that the proposed APSS scheme can achieve satisfactory performance in terms of spectrum utilization and blocking ratio. Second, we propose a synchronous evacuation strategy for VNs with dual virtual machines (VMs) inside a disaster risk zone (DRZ), which suffer higher risks than the VNs with single. The evacuation strategy exploits post-copy technique to sustain the online service alive and enhances synchronous VM migrations to shorten the dual-VM evacuation time. Numerical results show that the proposed strategy can outperform the best-effort scheme in terms of average and total evacuation times of dual-VMs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
