Download or read book Decentralized Resources Allocation Mechanisms in Networks written by Tudor Mihai Stoenescu and published by . This book was released on 2004 with total page 428 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Resource Allocation in Decentralized Systems with Strategic Agents written by Ali Kakhbod and published by Springer Science & Business Media. This book was released on 2013-01-24 with total page 99 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis presents a significant contribution to decentralized resource allocation problems with strategic agents. The study focused on three classes of problems arising in communication networks. (C1). Unicast service provisioning in wired networks. (C2). Multi-rate multicast service provisioning in wired networks. (C3). Power allocation and spectrum sharing in multi-user multi-channel wireless communication systems. Problems in (C1) are market problems; problems in (C2) are a combination of markets and public goods; problems in (C3) are public goods. Dr. Kakhbod developed game forms/mechanisms for unicast and multi-rate multicast service provisioning that possess specific properties. First, the allocations corresponding to all Nash equilibria (NE) of the games induced by the mechanisms are optimal solutions of the corresponding centralized allocation problems, where the objective is the maximization of the sum of the agents' utilities. Second, the strategic agents voluntarily participate in the allocation process. Third, the budget is balanced at the allocations corresponding to all NE of the game induced by the mechanism as well as at all other feasible allocations. For the power allocation and spectrum sharing problem, he developed a game form that possesses the second and third properties as detailed above along with a fourth property: the allocations corresponding to all NE of the game induced by the mechanism are Pareto optimal. The thesis contributes to the state of the art of mechanism design theory. In particular, designing efficient mechanisms for the class of problems that are a combination of markets and public goods, for the first time, have been addressed in this thesis. The exposition, although highly rigorous and technical, is elegant and insightful which makes this thesis work easily accessible to those just entering this field and will also be much appreciated by experts in the field.

Download or read book Decentralized Resource Allocation for Interdependent Infrastructure Networks Restoration written by Katherine Barnett and published by . This book was released on 2020 with total page 37 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Market based Control A Paradigm For Distributed Resource Allocation written by Scott H Clearwater and published by World Scientific. This book was released on 1996-01-11 with total page 329 pages. Available in PDF, EPUB and Kindle. Book excerpt: Market-Based Control is a paradigm for controlling complex systems that would otherwise be very difficult to control, maintain, or expand. The purpose of this volume is to illustrate the utility of market-based control through a series of papers focusing on different applications. This volume, for the first time, brings together the research from a wide range of fields all using a market-based conceptual framework. The features of markets that have provided motivation for these works include decentralization, interacting agents, and some notion of a resource that needs to be allocated. The papers span a range including theoretical considerations, simulations, and implementations.

Download or read book Decentralization In Infinite Horizon Economies written by Mukul Majumdar and published by CRC Press. This book was released on 2019-03-07 with total page 205 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book summarizes some issues involved in developing a theory of decentralized resource allocation mechanism in infinite horizon economies. It constitutes a definitive account of cutting-edge research on a topic of continuing importance in price theory. .

Download or read book Decentralized Resource Allocation Algorithms with Applications to Flow Control of Communication Networks written by Beverly Ann Sanders and published by . This book was released on 1985 with total page 196 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book On Informational Decentralization and Efficiency in Resource Allocation Mechanisms written by University of Minnesota. Institute for Mathematics and Its Applications and published by . This book was released on 1986 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Allocation in Networks written by Jens Leth Hougaard and published by MIT Press. This book was released on 2018-11-06 with total page 297 pages. Available in PDF, EPUB and Kindle. Book excerpt: A comprehensive overview of networks and economic design, presenting models and results drawn from economics, operations research, and computer science; with examples and exercises. This book explores networks and economic design, focusing on the role played by allocation rules (revenue and cost-sharing schemes) in creating and sustaining efficient network solutions. It takes a normative approach, seeking economically efficient network solutions sustained by distributional fairness, and considers how different ways of allocating liability affect incentives for network usage and development. The text presents an up-to-date overview of models and results currently scattered over several strands of literature, drawing on economics, operations research, and computer science. The book's analysis of allocation problems includes such classic models from combinatorial optimization as the minimum cost spanning tree and the traveling salesman problem. It examines the planner's ability to design mechanisms that will implement efficient network structures, both in large decentralized networks and when there is user-agent information asymmetry. Offering systematic theoretical analyses of various compelling allocation rules in cases of fixed network structures as well as discussions of network design problems, the book covers such topics as tree-structured distribution systems, routing games, organizational hierarchies, the “price of anarchy,” mechanism design, and efficient implementation. Appropriate as a reference for practitioners in network regulation and the network industry or as a text for graduate students, the book offers numerous illustrative examples and end-of-chapter exercises that highlight the concepts and methods presented.

Download or read book Decentralized Resource Allocation Algorithms with Applications to Flow Control of Communications Networks written by Beverly Ann Sanders and published by . This book was released on 1985 with total page 98 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Managing and Optimizing Decentralized Networks with Resource Sharing written by Luyi Gui and published by . This book was released on 2013 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Resource sharing is a common collaborative strategy used in practice. It has the potential to create synergistic value and leads to higher system efficiency. However, realizing this synergistic value can be challenging given the prevalence of decentralization in practice, where individual operators manage resources based on their own benefits. Hence, optimizing a decentralized system requires understanding not only the optimal operational strategy in terms of the overall system efficiency, but also the implementation of the strategy through proper management of individual incentives. However, traditional network optimization approaches typically assume a centralized perspective. The classic game theory framework, on the other hand, addresses incentive issues of decentralized decision makers, but mainly takes a high-level, economic perspective that does not fully capture the operational complexity involved in optimizing systems with resource sharing. The purpose of this thesis is to bridge this gap between practice and theory by studying the design of tools to manage and optimize the operations in decentralized systems with resource sharing using approaches that combine optimization and game theory. In particular, we focus on decentralized network systems and analyze two research streams in two application domains: (i) implementation of environmental legislation, and (ii) managing collaborative transportation systems. These applications are characterized by their decentralized multi-stakeholder nature where the conflicts and tension between the heterogeneous individual perspectives make system management very challenging. The main methodology used in this thesis is to adopt game theory models where individual decisions are endogenized as the solutions to network optimization problems that reflect their incentives. Such an approach allows us to capture the connection between the operational features of the system (e.g., capacity configuration, network structure, synergy level from resource sharing) and the individual incentives thus the effectiveness of the management tools, which is a main research contribution of this thesis. In the first research stream, we consider designing effective, efficient and practical implementation of electronic waste take-back legislation based on the widely-adopted Extended Producer Responsibility (EPR) concept that mandates the financial responsibility of post-use treatment of their products. Typical implementations of EPR are collective, and allocate the resulting operating cost to involved producers. In this thesis, we demonstrate the complexity of collective EPR implementation due to the tension among different stakeholder perspectives, based on a case analysis of the Washington implementation. We then perform analytical studies of the two prominent challenges identified in current implementations: (i) developing cost allocation mechanisms that induce the voluntary participation of all producers in a collective system, thus promoting implementation efficiency; and (ii) designing collective EPR so as to encourage environmentally-friendly product design, thus promoting implementation effectiveness. Specifically, we prescribe new cost allocation methods to address the first challenge, and demonstrate the practicality and economic impact of the results using implementation data from the state of Washington. We then analyze the tensions between design incentives, efficiency and the effectiveness of the cost allocation to induce voluntary participation under collective EPR implementation. We show there exists a tradeoff among the three dimensions, driven by the network effects inherent in a collective system. The main contribution of this research stream is to demonstrate how the implementation outcomes of an environmental policy is influenced by the way that the policy ``filters' through operational-level factors, and to propose novel and implementation mechanisms to achieve efficient and effective EPR implementation. Hence, our study has the potential to provide guidance for practice and influence policy-making. In the second research stream, motivated by the practice of transportation alliances, we focus on a decentralized network setting where the individual entities make independent decisions regarding the routing of their own demand and the management of their own capacity, driven by their own benefits. We study the use of market-based exchange mechanisms to motivate and regulate capacity sharing so as to achieve the optimal overall routing efficiency in a general multicommodity network. We focus on the design of capacity pricing strategies in the presence of several practical operational complexities, including multiple ownership of the same capacity, uncertainty in network specifications, and information asymmetry between the central coordinator and individual operators. Our study in this research stream produces two sets of results. First, we demonstrate the impact of the underlying network structure on the effectiveness of using market-based exchange mechanisms to coordinate resource sharing and to allocate the resulting synergistic benefit, and characterize the network properties that matter. Second, we propose efficient and effective pricing policies and other mechanism design strategies to address different operational complexities. Specifically, we develop duality-based pricing algorithms, and evaluate different pricing strategies such as commodity-based price discrimination, which is shown to have an advantage in coordinating networks under uncertainty.

Download or read book Informational Aspects of Decentralized Resource Allocation written by Takashi Ishikida and published by . This book was released on 1992 with total page 298 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Cost aware Resource Management for Decentralized Internet Services written by Venugopalan Saraswati Ramasubramanian and published by . This book was released on 2007 with total page 462 pages. Available in PDF, EPUB and Kindle. Book excerpt: Decentralized network services, such as naming systems, content distribution networks, and publish-subscribe systems, play an increasingly critical role and are required to provide high performance, low latency service, achieve high availability in the presence of network and node failures, and handle a large volume of users. Judicious utilization of expensive system resources, such as memory space, network bandwidth, and number of machines, is fundamental to achieving the above properties. Yet, current network services typically rely on less-informed, heuristic-based techniques to manage scarce resources, and often fall short of expectations. This thesis presents a principled approach for building high performance, robust, and scalable network services. The key contribution of this thesis is to show that resolving the fundamental cost-benefit tradeoff between resource consumption and performance through mathematical optimization is practical in large-scale distributed systems, and enables decentralized network services to meet efficiently system-wide performance goals. This thesis presents a practical approach for resource management in three stages: analytically model the cost-benefit tradeoff as a constrained optimization problem, determine a near-optimal resource allocation strategy on the fly, and enforce the derived strategy through light-weight, decentralized mechanisms. It builds on self-organizing structured overlays, which provide failure resilience and scalability, and complements them with stronger performance guarantees and robustness under sudden changes in workload. This work enables applications to meet system-wide performance targets, such as low average response times, high cache hit rates, and small update dissemination times with low resource consumption. Alternatively, applications can make the maximum use of available resources, such as storage and bandwidth, and derive large gains in performance. I have implemented an extensible framework called Honeycomb to perform costaware resource management on structured overlays based on the above approach and built three critical network services using it. These services consist of a new name system for the Internet called CoDoNS that distributes data associated with domain names, an open-access content distribution network called CobWeb that caches web content for faster access by users, and an online information monitoring system called Corona that notifies users about changes to web pages. Simulations and performance measurements from a planetary-scale deployment show that these services provide unprecedented performance improvement over the current state of the art. (Abstract).

Download or read book The Informational Requirements of Local Stability in Decentralized Allocation Mechanisms written by J. S. Jordan and published by . This book was released on 1982 with total page 48 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Advances in Control Communication Networks and Transportation Systems written by Eyad H. Abed and published by Springer Science & Business Media. This book was released on 2006-09-10 with total page 380 pages. Available in PDF, EPUB and Kindle. Book excerpt: This unified volume is a collection of invited articles on topics presented at the Symposium on Systems, Control, and Networks, held in Berkeley June 5–7, 2005, in honor of Pravin Varaiya on his 65th birthday. Varaiya is an eminent faculty member of the University of California at Berkeley, widely known for his seminal contributions in areas as diverse as stochastic systems, nonlinear and hybrid systems, distributed systems, communication networks, transportation systems, power networks, economics, optimization, and systems education. The book will serve as an excellent resource for practicing and research engineers, applied mathematicians, and graduate students working in such areas as communication networks, sensor networks, transportation systems, control theory, hybrid systems, and applications.

Download or read book Techniques for Decentralized and Dynamic Resource Allocation written by Lorenzo Ferrari and published by . This book was released on 2017 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis investigates three different resource allocation problems, aiming to achieve two common goals: i) adaptivity to a fast-changing environment, ii) distribution of the computation tasks to achieve a favorable solution. The motivation for this work relies on the modern-era proliferation of sensors and devices, in the Data Acquisition Systems (DAS) layer of the Internet of Things (IoT) architecture. To avoid congestion and enable low-latency services, limits have to be imposed on the amount of decisions that can be centralized (i.e. solved in the "cloud") and/or amount of control information that devices can exchange. This has been the motivation to develop i) a lightweight PHY Layer protocol for time synchronization and scheduling in Wireless Sensor Networks (WSNs), ii) an adaptive receiver that enables Sub-Nyquist sampling, for efficient spectrum sensing at high frequencies, and iii) an SDN-scheme for resource-sharing across different technologies and operators, to harmoniously and holistically respond to fluctuations in demands at the eNodeB' s layer. The proposed solution for time synchronization and scheduling is a new protocol, called PulseSS, which is completely event-driven and is inspired by biological networks. The results on convergence and accuracy for locally connected networks, presented in this thesis, constitute the theoretical foundation for the protocol in terms of performance guarantee. The derived limits provided guidelines for ad-hoc solutions in the actual implementation of the protocol. The proposed receiver for Compressive Spectrum Sensing (CSS) aims at tackling the noise folding phenomenon, e.g., the accumulation of noise from different sub-bands that are folded, prior to sampling and baseband processing, when an analog front-end aliasing mixer is utilized. The sensing phase design has been conducted via a utility maximization approach, thus the scheme derived has been called Cognitive Utility Maximization Multiple Access (CUMMA). The framework described in the last part of the thesis is inspired by stochastic network optimization tools and dynamics. While convergence of the proposed approach remains an open problem, the numerical results here presented suggest the capability of the algorithm to handle traffic fluctuations across operators, while respecting different time and economic constraints. The scheme has been named Decomposition of Infrastructure-based Dynamic Resource Allocation (DIDRA).

Download or read book Distributed Cooperative Mechanism for Overlay Networks written by Ryota Egashira and published by . This book was released on 2009 with total page 104 pages. Available in PDF, EPUB and Kindle. Book excerpt: Overlay networks are becoming increasingly important to support a variety of applications without requiring significant changes to the substrate network architecture (e.g., the Internet architecture). In supporting applications using overlay networks, there are two key technical challenges: 1) efficient discovery of objects (e.g., files, software components or computational resources) distributed in an overlay network and 2) efficient allocation of resources (e.g., link bandwidth) on an underlying substrate network to overlay networks. This dissertation proposes solutions for each technical challenge. First, this dissertation explains a novel discovery mechanism using user preference for objects. The proposed mechanism allows query originators to return their feedback that describes the degree of the preference for discovered objects. The returned preference information is stored at nodes and utilized to decide where to forward subsequent queries. Through guiding a query using the preference information stored at nodes, the proposed mechanism can selectively locate objects preferred by query originators in an efficient manner. Second, this dissertation explains a novel decentralized network architecture that allocates resources on a substrate network to overlay networks deployed atop using a market-based mechanism. In the proposed architecture, a substrate network prices resources, and an overlay network provider purchases resources from a substrate network to configure itself with sufficient resources at a minimum cost to meet its requirements. The proposed architecture also allows an overlay network provider to purchase resources from other overlay network providers when the resources are not available in a substrate network. Through employing such a market concept, the proposed architecture achieves fair and efficient resource allocation in a decentralized manner The proposed discovery mechanism and resource allocation architecture are investigated through extensive simulation experiments. The obtained simulation results demonstrate validity of the proposed discovery mechanism and resource allocation architecture.

Download or read book Mechanisms and Games for Dynamic Spectrum Allocation written by Tansu Alpcan and published by Cambridge University Press. This book was released on 2014 with total page 604 pages. Available in PDF, EPUB and Kindle. Book excerpt: An innovative and comprehensive book presenting state-of-the-art research into wireless spectrum allocation based on game theory and mechanism design.