251,046 research outputs found

    Constrained Network Slicing Games: Achieving service guarantees and network efficiency

    Get PDF
    Network slicing is a key capability for next generation mobile networks. It enables one to cost effectively customize logical networks over a shared infrastructure. A critical component of network slicing is resource allocation, which needs to ensure that slices receive the resources needed to support their mobiles/services while optimizing network efficiency. In this paper, we propose a novel approach to slice-based resource allocation named Guaranteed seRvice Efficient nETwork slicing (GREET). The underlying concept is to set up a constrained resource allocation game, where (i) slices unilaterally optimize their allocations to best meet their (dynamic) customer loads, while (ii) constraints are imposed to guarantee that, if they wish so, slices receive a pre-agreed share of the network resources. The resulting game is a variation of the well-known Fisher market, where slices are provided a budget to contend for network resources (as in a traditional Fisher market), but (unlike a Fisher market) prices are constrained for some resources to provide the desired guarantees. In this way, GREET combines the advantages of a share-based approach (high efficiency by flexible sharing) and reservation-based ones (which provide guarantees by assigning a fixed amount of resources). We characterize the Nash equilibrium, best response dynamics, and propose a practical slice strategy with provable convergence properties. Extensive simulations exhibit substantial improvements over network slicing state-of-the-art benchmarks

    Agent-Based Distributed Resource Allocation in Continuous Dynamic Systems

    Get PDF
    Intelligent agents and multiagent systems reveal new strategies to design highly flexible automation systems. There are first promising industrial applications of multiagent systems for the control of manufacturing, logistics, traffic or multi-robot systems. One reason for the success of most of these applications is their nature as some form of a distributed resource allocation problem which can be addressed very well by multiagent systems. Resource allocation problems solved by agents can be further categorized into static or dynamic problems. In static problems, the allocations do not depend on time and many resource allocation problem of practical interest can be solved using these static considerations, even in discrete-event systems like manufacturing or logistic systems. However, problems especially in highly dynamic environments cannot be addressed by this pure static approach since the allocations, i.e. the decision variables, depend on time and previous states of the considered system. These problems are hardly considered in the relevant agent literature and if, most often only discrete-event systems are considered. This work focuses on agent-based distributed dynamic resource allocation problems especially in continuous production systems or other continuous systems. Based on the current states of the distributed dynamic system, continuous-time allocation trajectories must be computed in real-time. Designing multiagent systems for distributed resource allocation mainly comprises the design of the local capabilities of the single agents and the interaction mechanisms that makes them find the best or at least a feasible allocation without any central control. In this work, the agents are designed as two-level entities: while the low-level functions are responsible for the real-time allocation of the resources in the form of closed-loop feedback control, the high-level functionalities realize the deliberative capabilities such as long-term planning and negotiation of the resource allocations. Herein, the resource allocation problem is considered as a distributed optimization problem under certain constraints. The agents play the role of local optimizers which then have to coordinate their local solutions to an overall consistent solution. It is shown in this contribution that the described approach can be interpreted as a market-based allocation scheme based on balancing of supply and demand of the resources using a virtual price. However, the agents calculate and negotiate complete supply and demand trajectories using model-based predictions which also leads to the calculation of a price trajectory. This novel approach does not only consider the dynamic behaviour of the distributed system but also combines control tasks and resource allocation in a very consistent way. The approach is demonstrated using two practical applications: a heating system and an industrial sugar extraction process

    Srovnání čínského akciového trhu a amerického akciového trhu

    Get PDF
    Since the establishment of the Shanghai Stock Exchange in 1990 and the Shenzhen Stock Exchange in 1991, China's securities market has played an active role in raising funds, adjusting economic structure, optimizing resource allocation, and promoting the country's economic development, and has become an indispensable part of China's economic activities. a part of. After China's share-trading reform, China's securities market has entered a new historical stage. At this time, it is of great practical significance to re-examine the history of China's securities market over the past decade and correctly evaluate its development. Based on the comparison of the Sino-US securities market, this paper finds the gap between the two. Based on the experience of the development of the US securities market, combined with China's national conditions, it puts forward some suggestions for the development of China's securities market.Since the establishment of the Shanghai Stock Exchange in 1990 and the Shenzhen Stock Exchange in 1991, China's securities market has played an active role in raising funds, adjusting economic structure, optimizing resource allocation, and promoting the country's economic development, and has become an indispensable part of China's economic activities. a part of. After China's share-trading reform, China's securities market has entered a new historical stage. At this time, it is of great practical significance to re-examine the history of China's securities market over the past decade and correctly evaluate its development. Based on the comparison of the Sino-US securities market, this paper finds the gap between the two. Based on the experience of the development of the US securities market, combined with China's national conditions, it puts forward some suggestions for the development of China's securities market.154 - Katedra financídobř

    Power Load Management as a Computational Market

    Get PDF
    Power load management enables energy utilities to reduce peak loads and thereby save money. Due to the large number of different loads, power load management is a complicated optimization problem. We present a new decentralized approach to this problem by modeling direct load management as a computational market. Our simulation results demonstrate that our approach is very efficient with a superlinear rate of convergence to equilibrium and an excellent scalability, requiring few iterations even when the number of agents is in the order of one thousand. Aframework for analysis of this and similar problems is given which shows how nonlinear optimization and numerical mathematics can be exploited to characterize, compare, and tailor problem-solving strategies in market-oriented programming

    Trade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link

    Full text link
    We propose Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared resource (e.g., a DSLAM link) so as to converge on what they perceive to be an equitable allocation, while ensuring efficient resource utilization. Under T&C, rather than acting as an arbiter, an Internet Service Provider (ISP) acts as an enforcer of what the community of rational users sharing the resource decides is a fair allocation of that resource. Our T&C mechanism proceeds in two phases. In the first, software agents acting on behalf of users engage in a strategic trading game in which each user agent selfishly chooses bandwidth slots to reserve in support of primary, interactive network usage activities. In the second phase, each user is allowed to acquire additional bandwidth slots in support of presumed open-ended need for fluid bandwidth, catering to secondary applications. The acquisition of this fluid bandwidth is subject to the remaining "buying power" of each user and by prevalent "market prices" – both of which are determined by the results of the trading phase and a desirable aggregate cap on link utilization. We present analytical results that establish the underpinnings of our T&C mechanism, including game-theoretic results pertaining to the trading phase, and pricing of fluid bandwidth allocation pertaining to the capping phase. Using real network traces, we present extensive experimental results that demonstrate the benefits of our scheme, which we also show to be practical by highlighting the salient features of an efficient implementation architecture.National Science Foundation (CCF-0820138, CSR-0720604, EFRI-0735974, CNS-0524477, and CNS-0520166); Universidad Pontificia Bolivariana and COLCIENCIAS–Instituto Colombiano para el Desarrollo de la Ciencia y la Tecnología “Francisco Jose ́ de Caldas”

    Industrial Symbiotic Relations as Cooperative Games

    Get PDF
    In this paper, we introduce a game-theoretical formulation for a specific form of collaborative industrial relations called "Industrial Symbiotic Relation (ISR) games" and provide a formal framework to model, verify, and support collaboration decisions in this new class of two-person operational games. ISR games are formalized as cooperative cost-allocation games with the aim to allocate the total ISR-related operational cost to involved industrial firms in a fair and stable manner by taking into account their contribution to the total traditional ISR-related cost. We tailor two types of allocation mechanisms using which firms can implement cost allocations that result in a collaboration that satisfies the fairness and stability properties. Moreover, while industries receive a particular ISR proposal, our introduced methodology is applicable as a managerial decision support to systematically verify the quality of the ISR in question. This is achievable by analyzing if the implemented allocation mechanism is a stable/fair allocation.Comment: Presented at the 7th International Conference on Industrial Engineering and Systems Management (IESM-2017), October 11--13, 2017, Saarbr\"ucken, German
    corecore