检索结果-内蒙古大学图书馆

Joint cache resource allocation and request routing for in-network caching services

COMPUTER NETWORKS 2018年 131卷 1-14页

作者： Chu, Weibo Dehghan, Mostafa Lui, John C. S. Towsley, Don Zhang, Zhi-Li Northwestern Polytech Univ Xian Shaanxi Peoples R China Northwestern Polytech Univ Sch Comp Sci & Technol Xian Shaanxi Peoples R China Google Inc Cambridge MA USA Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China Univ Massachusetts Dept Elect & Comp Engn Amherst MA 01003 USA Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA Univ Minnesota Comp Sci & Engn Fac Minneapolis MN USA

In-network caching is recognized as an effective 'solution to offload content servers and the network. A cache service provider (SP) always has incentives to better utilize its cache resources by taking into account diverse roles that content providers (CPs) play, e.g., their business models, traffic characteristics, preferences. In this paper, we study the cache resource allocation problem in a Multi-Cache Multi-CP environment. We propose a cache partitioning approach, where each cache can be partitioned into slices with each slice dedicated to a content provider. We propose a content-oblivious request routing algorithm, to be used by individual caches, that optimizes the routing strategy for each CP. We associate with each content provider a utility that is a function of its content delivery performance, and formulate an optimization problem with the objective to maximize the sum of utilities over all content providers. We establish the biconvexity of the problem, and develop decentralized (online) algorithms based on convexity of the subproblem. The proposed model is further extended to bandwidth-constrained and minimum delay scenarios, for which we prove fundamental properties, and develop efficient algorithms. Finally, we present numerical results to show the efficacy of our mechanism and the convergence of our algorithms. (C) 2017 Elsevier B.V. All rights reserved.

关键词： cache resource allocation cache partitioning request routing optimization distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

COLLABORATIVE CACHING AND MATCHING FOR D2D CONTENT SHARING

引用

IEEE WIRELESS COMMUNICATIONS 2018年第3期25卷 43-49页

作者： Wu, Dan Zhou, Liang Cai, Yueming Qian, Yi Army Engn Univ Zhengzhou Henan Peoples R China Nanjing Univ Posts & Telecommun Nanjing Jiangsu Peoples R China Univ Nebraska Dept Elect & Comp Engn Lincoln NE USA

D2D content sharing is recognized as an effective response to the prevalence of multimedia and local services, especially for 5G edge networks. We construct a content sharing framework based on cache-assisted D2D communications, which consists of the content placement and delivery phases. When considering the random content location and the limited storage and transmission capability of devices, which content should be cached and how to optimally match potential providers to requesters of contents are of importance. As such, we extend the concept of cacheability, and accordingly propose a distributed collaborative cache management scheme. It involves a caching decision and update model based on the submodularity over matroid constraints, and a best effort distributed algorithm framework. Moreover, we extend the sharing mode category, and propose the sharing mode selection scheme by constructing a general social welfare maximization with efficient incentive mechanisms. By leveraging the total unimodularity, it can be simplified to its linear relaxation without loss of optimization.

关键词： Device-to-device communication Collaboration Receivers Interference 5G mobile communication Internet distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Load-Optimal Local Fast Rerouting for Dense Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2018年第6期26卷 2583-2597页

作者： Borokhovich, Michael Pignolet, Yvonne-Anne Schmid, Stefan Tredan, Gilles AT&T Labs Florham Pk NJ 07932 USA ABB Corp Res CH-8037 Baden Switzerland Univ Vienna Fac Comp Sci A-1010 Vienna Austria CNRS Lab Architecture & Anal Syst F-1000 Toulouse France

Reliable and highly available computer networks must implement resilient fast rerouting mechanisms: upon a link or node failure, an alternative route is determined quickly, without involving the network control plane. Designing such fast failover mechanisms capable of dealing with multiple concurrent failures, however, is challenging, as failover rules need to be installed proactively, i.e., ahead of time, without knowledge of the actual failures happening at runtime. Indeed, only little is known today about the design of resilient routing algorithms. This paper introduces a general framework to reason about and design local failover algorithms that minimize the resulting load after failover on dense networks, beyond destination-based routing. We show that due to the inherent locality of the failover decisions at runtime, the problem is fundamentally related to the field of distributed algorithms without coordination. We derive an intriguing lower bound on the inherent network load overhead any local fast failover scheme that will introduce in the worst case, even though globally seen, much more balanced traffic allocations exist. We then present different randomized and deterministic failover algorithms and analyze their overhead load. In particular, we build upon the theory of combinatorial designs and develop a novel deterministic failover mechanism based on symmetric block design theory, which tolerates a maximal number of link failures while ensuring low loads.

关键词： Computer network reliability distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

From Clarity to Efficiency for distributed algorithms 12

From Clarity to Efficiency for Distributed Algorithms

引用

ACM International Conference on Object Oriented Programming Systems Languages and Applications

作者： Liu, Yanhong A. Stoller, Scott D. Lin, Bo Gorbovitski, Michael SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

ISBN: (纸本)9781450315616

This paper describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex synchronization conditions can be expressed using high-level queries, especially logic quantifications, over message history sequences. Unfortunately, the programs would be extremely inefficient, including consuming unbounded memory, if executed straightforwardly. We present new optimizations that automatically transform complex synchronization conditions into incremental updates of necessary auxiliary values as messages are sent and received. The core of the optimizations is the first general method for efficient implementation of logic quantifications. We have developed an operational semantics of the language, implemented a prototype of the compiler and the optimizations, and successfully used the language and implementation on a variety of important distributed algorithms.

关键词： algorithms Design Languages Performance distributed algorithms incrementalization logic quantifications program optimization very high-level languages

来源：评论

学校读者我要写书评

暂无评论

Resilient Randomized Quantized Consensus

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2018年第8期63卷 2508-2522页

作者： Dibaji, Seyed Mehran Ishii, Hideaki Tempo, Roberto MIT Dept Mech Engn Cambridge MA 02139 USA Tokyo Inst Technol Dept Comp Sci Yokohama Kanagawa 2268502 Japan Politecn Torino CNR IEIIT I-10129 Turin Italy

We consider the problem of multiagent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication links. The goal of the healthy normal agents is to form consensus in their state values, which may be disturbed by the non-normal, malicious agents. We develop update schemes to be equipped by the normal agents whose interactions are asynchronous and subject to nonuniform and time-varying time delays. In particular, we employ a variant of the so-called mean subsequence reduced algorithms, which have been long studied in computer science, where each normal agent ignores extreme values from its neighbors. We solve the resilient quantized consensus problems in the presence of totally/locally bounded adversarial agents and provide necessary and sufficient conditions in terms of the connectivity notion of graph robustness. Furthermore, it will be shown that randomization is essential both in quantization and in the updating times when normal agents interact in an asynchronous manner. The results are examined through a numerical example.

关键词： Asynchronous communication cyber security distributed algorithms fault tolerant systems multi-agent systems quantization

来源：评论

学校读者我要写书评

暂无评论

Non-cooperative and cooperative optimisation of battery energy storage system for energy management in multi-microgrid

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第10期12卷 2369-2377页

作者： Liu, Xiaofeng Gao, Bingtuan Zhu, Zhenyu Tang, Yi Southeast Univ Sch Elect Engn Nanjing 210096 Jiangsu Peoples R China

Multi-microgrid is an integrated system of microgrids, distributed generations, and battery energy storage system (BESS). As the significant equipment in microgrid, BESS can perform multitasking, such as load management and peak shaving. This study mainly focuses on the energy consumption scheduling of multi-microgrid considering the optimisation of BESS capacity. Energy management with BESS optimisation is studied by considering the cost of distributed generations, cost of BESS, and bidirectional energy trading. The optimisation problem is tackled from two different aspects: an individual-oriented optimisation and a coalition-based optimisation. In the first approach, each microgrid is optimised individually with a non-cooperative game;while in the second approach, the joint optimisation of all microgrids is formulated through cooperation among multi-microgrids. In order to achieve the optimal energy consumption strategy and BESS capacity, distributed algorithms for two formulations are presented, which combine particle swarm optimisation and interior point method. Simulation results show that both approaches can contribute to peak shaving and reducing the daily cost of multi-microgrid.

关键词： particle swarm optimisation game theory energy management systems battery storage plants distributed power generation power generation economics energy consumption power markets distributed algorithms cooperative optimisation noncooperative optimisation battery energy storage system energy management multimicrogrid distributed generation cost load management peak shaving energy consumption scheduling BESS capacity optimisation bidirectional energy trading BESS cost individual-oriented optimisation coalition-based optimisation noncooperative game optimal energy consumption strategy distributed algorithms particle swarm optimisation interior point method

来源：评论

学校读者我要写书评

暂无评论

Set Cover Problems with Small Neighborhood Covers

引用

THEORY OF COMPUTING SYSTEMS 2018年第8期62卷 1763-1797页

作者： Agarwal, Archita Chakaravarthy, Venkatesan T. Choudhury, Anamitra R. Roy, Sambudha Sabharwal, Yogish Brown Univ Providence RI 02912 USA IBM Res New Delhi India Amazon Bangalore Karnataka India

In this paper, we study a class of set cover problems that satisfy a special property which we call the small neighborhood cover property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval cover and tree cover. We design unified sequential, parallel and distributed algorithms that can handle any set cover problem falling under the above framework and yield constant factor approximations. The algorithms run in NC in the parallel setting and can be executed in polylogarithmic communication rounds in the distributed setting.

关键词： Approximation algorithms Parallel algorithms distributed algorithms Primal-dual method

来源：评论

学校读者我要写书评

暂无评论

Computing large independent sets in a single round

引用

distributed COMPUTING 2018年第1期31卷 69-82页

作者： Halldorsson, Magnus M. Konrad, Christian Reykjavik Univ Sch Comp Sci ICE TCS Menntavegur 1 IS-101 Reykjavik Iceland Univ Warwick Ctr Discrete Math & its Applicat DIMAP Dept Comp Sci Coventry W Midlands England

Independent sets play a central role in distributed algorithmics. We examine here the minimal requirements for computing non-trivial independent sets. In particular, we focus on algorithms that operate in a single communication round. A classic result of Linial shows that a constant number of rounds does not suffice to compute a maximal independent set. We are therefore interested in the size of the solution that can be computed, especially in comparison to the optimal. Our main result is a randomized one-round algorithm that achieves poly-logarithmic approximation on graphs of polynomially bounded-independence. Specifically, we show that the algorithm achieves the Caro-Wei bound (an extension of the Turan bound for independent sets) in general graphs up to a constant factor, and that the Caro-Wei bound yields a poly-logarithmic approximation on bounded-independence graphs. The algorithm uses only a single bit message and operates in a beeping model, where a node receives only the disjunction of the bits transmitted by its neighbors. We give limitation results that show that these are the minimal requirements for obtaining non-trivial solutions. In particular, a sublinear approximation cannot be obtained in a single round on general graphs, nor when nodes cannot both transmit and receive messages. We also show that our analysis of the Caro-Wei bound on polynomially bounded-independence graphs is tight, and that the poly-logarithmic approximation factor does not extend to -claw free graphs.

关键词： Maximum independent set Bounded-independence graphs distributed algorithms Randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Localization in Mobile Networks via Virtual Convex Hulls

引用

IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS 2018年第1期4卷 188-201页

作者： Safavi, Sam Khan, Usman A. Tufts Univ Dept Elect & Comp Engn Medford MA 02155 USA

In this paper, we develop a distributed algorithm to localize an arbitrary number of agents moving in a bounded region of interest. We assume that the network contains at least one agent with known location (hereinafter referred to as an anchor), and each agent measures a noisy version of its motion and the distances to the nearby agents. We provide a geometric approach, which allows each agent to (i) continually update the distances to the locations where it has exchanged information with the other nodes in the past;and (ii) measure the distance between a neighbor and any such locations. Based on this approach, we provide a linear update to find the locations of an arbitrary number of mobile agents when they follow some convexity in their deployment and motion. Since the agents are mobile, they may not be able to find nearby nodes (agents and/or anchors) to implement a distributed algorithm. To address this issue, we introduce the notion of a virtual convex hull with the help of the aforementioned geometric approach. In particular, each agent keeps track of a virtual convex hull of other nodes, which may not physically exist, and updates its location with respect to its neighbors in the virtual hull. We show that the corresponding localization algorithm, in the absence of noise, can be abstracted as a linear time-varying system, with nondeterministic systemmatrices, which asymptotically tracks the true locations of the agents. We provide simulations to verify the analytical results and evaluate the performance of the algorithm in the presence of noise on the motion as well as on the distance measurements.

关键词： distributed algorithms mobile agents sensor fusion sensor systems and applications time-varying systems wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Synergistic Operation of Electricity and Natural Gas Networks via ADMM

引用

IEEE TRANSACTIONS ON SMART GRID 2018年第5期9卷 4555-4565页

作者： Wen, Yunfeng Qu, Xiaobin Li, Wenyuan Liu, Xuan Ye, Xi Chongqing Univ State Key Lab Power Transmiss Equipment & Syst Se Chongqing 400044 Peoples R China IIT Dept Elect & Comp Engn Chicago IL 60616 USA Grid Sichuan Power Econ Res Inst Chengdu 610041 Sichuan Peoples R China

The increasing growth in the installation of natural-gas fired units has raised necessitates on synergy between the electricity and natural gas networks. This paper discusses how synergistic operation of electricity and natural gas networks can be achieved in a distributed fashion using alternating direction method of multipliers (ADMM). A standard ADMM approach and a consensus-based ADMM approach are developed, respectively, to solve the gas-electric integrated optimal power flow problem with and without a coordination operator. In both cases, the optimization formulation for each operator is modeled, and the solution procedure as well as data exchange among multiple decision-makers are explained. Case studies on both small and large gas-electric integrated systems show that the two ADMM-based distributed approaches have significant efficiencies over the traditional Lagrange relaxation (LR) and augmented LR-based methods.

关键词： Integrated energy network natural gas distributed algorithms optimal power flow synergy ADMM

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：