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

Joint Wireless and Edge Computing Resource Management With Dynamic Network Slice Selection

IEEE-ACM TRANSACTIONS ON NETWORKING 2022年第4期30卷 1865-1878页

作者： Josilo, Sladana Dan, Gyorgy KTH Royal Inst Technol Sch Elect Engn & Comp Sci Div Network & Syst Engn S-11428 Stockholm Sweden

Network slicing is a promising approach for enabling low latency computation offloading in edge computing systems. In this paper, we consider an edge computing system under network slicing in which the wireless devices generate latency sensitive computational tasks. We address the problem of joint dynamic assignment of computational tasks to slices, management of radio resources across slices and management of radio and computing resources within slices. We formulate the Joint Slice Selection and Edge Resource Management (JSS-ERM) problem as a mixed-integer problem with the objective to minimize the completion time of computational tasks. We show that the JSS-ERM problem is NP-hard and develop an approximation algorithm with bounded approximation ratio based on a game theoretic treatment of the problem. We use extensive simulations to provide insight into the performance of the proposed solution from the perspective of the whole system and from the perspective of individual slices. Our results show that the proposed slicing policy can achieve significant gains compared to the equal slicing policy, and that the computational complexity of the proposed task placement algorithm is approximately linear in the number of devices.

关键词： Task analysis Resource management Edge computing Network slicing Wireless communication Heuristic algorithms Computational modeling Edge computing network slicing resource allocation computation offloading game theory decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

A decentralized Method for Scaling Up Genome Similarity Search Services

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2009年第3期20卷 303-315页

作者： Wang, Chen Zhou, Bing Bing Zomaya, Albert Y. CSIRO ICT Ctr Epping NSW 1710 Australia Univ Sydney Sch Informat Technol Sydney NSW 2006 Australia

As genome sequence databases grow in size, the accuracy and speed of sequence similarity detection have become more important. Over the last few years, a number of methods have been introduced for detecting sequence similarity. Also, the demands for genome sequence search and alignment services have also increased. It is a tremendous challenge to scale up computer systems so that they can host various methods and service requests to these methods in a timely manner. Traditional clusters, which are used in most scientific centers today, cannot cope with this challenge very well. This paper tackles this problem in a novel way, which treats sequence search requests as content requests to both genome databases and similarity detection methods. Therefore, scaling up the computer systems that serve these contents is a process of constructing a content distribution network (CDN). This paper proposes a decentralized method to dynamically construct CDNs for a variety of genome sequence similarity detection services. This paper also provides a scheduling algorithm for the efficient use of content nodes. The simulation study shows that scalability and high content node utilization can be achieved in such a system at a reasonable cost.

关键词： decentralized algorithms scalability sequence database BLAST

来源：评论

学校读者我要写书评

暂无评论

Information dissemination in VANETs based upon a tree topology

引用

AD HOC NETWORKS 2012年第1期10卷 111-127页

作者： Ruiz, Patricia Dorronsoro, Bernabe Bouvry, Pascal Tardon, Lorenzo Univ Luxembourg Fac Sci Technol & Commun L-1359 Luxembourg Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust 6 L-1359 Luxembourg Luxembourg Univ Malaga Higher Tech Sch Telecommun Engn Malaga 29010 Spain

In this work, we focus on vehicular ad hoc networks, also called VANETs, which are communication networks that devices (in this case vehicles) use to exchange messages in a decentralized fashion, i.e., using no preexisting infrastructure. We first assess the feasibility of relying on a tree-based topology management structure for mobile ad hoc networks and in particular for VANETs. Next, we enhance DAGRS, an existing decentralized model for enabling distributed tree management and build BODYF on it, an efficient broadcast algorithm. Several broadcasting algorithms of the state of the art are implemented in order to compare the performance of BODYF. The approach is validated by simulation through three realistic scenarios located in Luxembourg city: the city center for both pedestrian and vehicles, and a highway environment. The comparison is made in terms of the coverage achieved by the broadcasting process as well as the complexity of the messages. DAGRS/BODYF approach outperforms other existing protocols in terms of both the number of devices reached and the network use. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Vehicular ad hoc networks decentralized algorithms Tree topology Broadcasting algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Beam Coordination Strategies With Rate-Dependent Processing Power

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2017年第22期65卷 6097-6112页

作者： Tervo, Oskari Tolli, Antti Juntti, Markku Le-Nam Tran Univ Oulu Ctr Wireless Commun Oulu 90014 Finland Maynooth Univ Dept Elect Engn Maynooth Kildare Ireland

This paper proposes energy-efficient coordinated beamforming strategies for multicell multiuser multiple-input single-output system. We consider a practical power consumption model, where part of the consumed power depends on the base station or user specific data rates due to coding, decoding, and backhaul. This is different from the existing approaches where the base station power consumption has been assumed to be a convex or linear function of the transmit powers. Two optimization criteria are considered, namely network energy efficiency maximization and weighted sum energy efficiencymaximization. We develop successive convex approximation-based algorithms to tackle these difficult nonconvex problems. We further propose decentralized implementations for the considered problems, in which base stations perform parallel and distributed computation based on local channel state information and limited backhaul information exchange. The decentralized approaches admit closed-form solutions and can be implemented without invoking a generic external convex solver. We also show an example of the pilot contamination effect on the energy efficiency using a heuristic pilot allocation strategy. The numerical results are provided to demonstrate that the rate dependent power consumption has a large impact on the system energy efficiency, and, thus, has to be taken into account when devising energy-efficient transmission strategies. The significant gains of the proposed algorithms over the conventional low-complexity beamforming algorithms are also illustrated.

关键词： Coordinated beamforming centralized algorithms decentralized algorithms energy efficiency successive convex approximation fractional programming pilot contamination circuit power processing power

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT FAULT-TOLERANT decentralized COMMIT PROTOCOL

引用

PARALLEL COMPUTING 1994年第1期20卷 101-114页

作者： YUAN, SM Department of Computer & Information Science National Chiao Tung University Hsinchu 30050 Taiwan

A new efficient decentralized commit protocol is proposed for distributed database systems. This protocol can be applied to systems of all sizes and is [log(2) N] - 2 resilient to site failures, where N is the number of sites in the system. In addition, the number of messages sent among the N sites is (N log(2)(2)N) which is only a factor of log(2) over the message complexity lower bound O(N In N) of decentralized commit protocols.

关键词： COMMIT PROTOCOLS decentralized algorithms FAULT-TOLERANT algorithms

来源：评论

学校读者我要写书评

暂无评论

RYNSORD: A novel decentralized algorithm for railway networks with "soft reservation"

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1998年第4期47卷 1350-1364页

作者： Lee, TS Ghosh, S NASA Ames Res Ctr Network Res Grp Moffett Field CA 94035 USA Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA

This paper presents a novel decentralized algorithm with SOft Reservation for efficient scheduling and congestion mitigation in RailwaY Networks (RYNSORD), wherein every train utilizes lookahead to dynamically replan its route. Thus, a train, currently at position X and headed for the ultimate destination Y, first requests and reserves N tracks, i.e., the lookahead, ahead of its current position for use at appropriate future times. The train moves through the N tracks and, upon completion, it again requests and reserves N subsequent tracks ahead of itself. The process continues until the train reaches its destination. The reservation process is characterized as "soft," i.e., less abrupt and more flexible in negotiation between the trains and stations, in contrast to the traditional rigid "hard" reservations. RYNSORD is modeled and implemented on a network of SUN spare workstations, configured as a loosely coupled parallel processor. Experimental results, obtained from simulating realistic example train networks and utilizing stochastic input train traffic data, reveal that: 1) soft reservation is superior to hard reservations in achieving both fast train travel times and higher quality of routing and 2) while trains under low lookahead experience higher average hop count and high probability of doublebacks, relative to large lookahead values, they also have lower travel times.

关键词： autonomous systems congestion mitigation coordinating processes decentralized algorithms decision making distributed algorithm distributed decision making distributed optimization flexible negotiation hard reservation lookahead scheduling soft reservation train network resource allocation

来源：评论

学校读者我要写书评

暂无评论

decentralized and Privacy-Preserving Learning of Approximate Stackelberg Solutions in Energy Trading Games With Demand Response Aggregators

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2024年第10期54卷 6304-6319页

作者： Kampezidou, Styliani I. Romberg, Justin Vamvoudakis, Kyriakos G. Mavris, Dimitri N. Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Georgia Inst Technol Daniel Guggenheim Sch Aerosp Engn Atlanta GA 30332 USA

In the pathway to 2030 electricity generation decarbonization and 2050 net-zero economies, scalable integration of distributed load can support environmental goals and also help alleviate smart grid operational issues through its electricity market participation. In this work, a novel Stackelberg game theoretic framework is proposed for trading the energy bidirectionally between the demand-response (DR) aggregator and the prosumers (distributed load). This formulation allows for flexible energy arbitrage and additional monetary rewards while ensuring that the prosumers' desired daily energy demand is met. Then, a scalable (linear with the number of prosumers and the number of learning samples), the decentralized privacy-preserving algorithm is proposed to find approximate equilibria with online sampling and learning of the prosumers' cumulative best response, which finds applications beyond this energy game. Moreover, cost bounds are provided on the quality of the approximate equilibrium solution. Finally, the real data from the California day-ahead market and the UC Davis campus building energy demands are utilized to demonstrate the efficacy of the proposed framework and the algorithm.

关键词： Games Approximation algorithms Optimization Reactive power Privacy Electricity Heuristic algorithms Approximate equilibria bidirectional energy trading decentralized algorithms demand-response (DR) aggregator learning-assisted bilevel optimization privacy preservation scalable online learning Stackelberg games

来源：评论

学校读者我要写书评

暂无评论

Optimal decentralized Kalman filter and Lainiotis filter

引用

DIGITAL SIGNAL PROCESSING 2013年第1期23卷 442-452页

作者： Assimakis, Nicholas Adam, Maria Koziri, Maria Voliotis, Stamatis Asimakis, Konstantinos Univ Cent Greece Dept Comp Sci & Biomed Informat Lamia Greece Technol Educ Inst Lamia Dept Elect Lamia Greece Univ Thessaly Dept Comp & Commun Engn Thessaly Greece Technol Educ Inst Chalkis Dept Elect Engn Chalkis Greece Univ Patras Dept Comp Engn & Informat GR-26110 Patras Greece

A method to implement the optimal decentralized Kalman filter and the optimal decentralized Lainiotis filter is proposed;the method is based on the a priori determination of the optimal distribution of measurements into parallel processors, minimizing the computation time. The resulting optimal Kalman filter and optimal Lainiotis filter require uniform distribution or near to uniform distribution of measurements into parallel processors. The optimal uniform distribution has the advantages of elimination of idle time for the local processors and of low hardware cost, but it is not always applicable. The optimal filters present high parallelism speedup;this is verified through simulation results and is very important due to the fact that, in most real-time applications, it is essential to obtain the estimate in the shortest possible time. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Kalman filter Lainiotis filter Discrete time decentralized algorithms Analysis of algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Joint Management of Wireless and Computing Resources for Computation Offloading in Mobile Edge Clouds

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2021年第4期9卷 1507-1520页

作者： Josilo, Sladana Dan, Gyorgy KTH Royal Inst Technol Sch Elect Engn & Comp Sci Div Network & Syst Engn S-11428 Stockholm Sweden

We consider the computation offloading problem in an edge computing system in which an operator jointly manages wireless and computing resources across devices that make their offloading decisions autonomously with the objective to minimize their own completion times. We develop a game theoretical model of the interaction between the devices and an operator that can implement one of two resource allocation policies, a cost minimizing or a time fair resource allocation policy. We express the optimal cost minimizing resource allocation policy in closed form and prove the existence of Stackelberg equilibria for both resource allocation policies. We propose two efficient decentralized algorithms that devices can use for computing equilibria of offloading decisions under the cost minimizing and the time fair resource allocation policies. We establish bounds on the price of anarchy of the games played by the devices and by doing so we show that the proposed algorithms have bounded approximation ratios. Our simulation results show that the cost minimizing resource allocation policy can achieve significantly lower completion times than the time fair allocation policy. At the same time, the convergence time of the proposed algorithms is approximately linear in the number of devices, and thus they could be effectively implemented for edge computing resource management.

关键词： Edge computing resource management computation offloading game theory decentralized algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantization for Communication-Efficient Change-Point Detection Over Networks

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2022年 70卷 142-157页

作者： Jiao, Yuchen Xu, Xingyu Gu, Yuantao Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

Change-Point Detection (CPD) has been researched for a long time in statistical signal processing, and has been widely used in many applications such as monitoring and anomaly detection. When detecting over networks, existing algorithms require sensors to exchange information via transmitting full-precision variables, which requires large bandwidth and consumes a large amount of energy. To address these problems, we explore the idea of quantizing data with low precision without deteriorating the detection performance. Specifically, considering the strong autocorrelation of the transmitted sequence in time domain and the accumulation of quantization error due to the autocorrelation, we design a scheme that combines the differential quantization technique and the error feedback technique. Based on this scheme, we propose a communication-efficient decentralized CPD algorithm named Quantized CUSUM (Q-CUSUM), which only requires small bandwidth and has low energy consumption. We theoretically analyze two commonly-used detection criteria, namely Average Run Length (ARL) and Expected Detection Delay (EDD), and compute their theoretical bounds. It is proved that the detection performance is robust to the quantization error. The proposed quantization scheme can be easily extended to the partial-communication case, where at each time only a subset of sensor pairs are allowed to exchange information. Experiments are implemented on both synthetic and real-world datasets. The results indicate that the proposed quantization scheme can effectively reduce the communication cost without deteriorating the detection performance.

关键词： Quantization (signal) Sensors Signal processing algorithms Bandwidth Detection algorithms Delays Protocols Change-point detection decentralized algorithms CUSUM differential quantization error feedback

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：