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

1st ACM CoNEXT Workshop on Emerging in-Network Computing Paradigms (ENCP) part of 15th ACM International Conference on Emerging Networking EXperiments and Technologies (CoNEXT)

作者： Iordanou, Costas Kourtellis, Nicolas Carrascosa, Juan Miguel Soriente, Claudio Cuevas, Ruben Laoutaris, Nikolaos MPI Informat Saarbrucken Germany Telefon Res Madrid Spain LSTech Milton Keynes Bucks England NEC Labs Europe Heidelberg Germany Univ Carlos III Madrid Telemat Engn Dept Madrid Spain UC3M Santander Big Data Inst Madrid Spain IMDEA Networks Inst Madrid Spain

ISBN: (纸本)9781450369985

Being able to check whether an online advertisement has been targeted is essential for resolving privacy controversies and implementing in practice data protection regulations like GDPR, CCPA, and COPPA. In this paper we describe the design, implementation, and deployment of an advertisement auditing system called eyeWnder that uses crowdsourcing to reveal in real time whether a display advertisement has been targeted or not. Crowdsourcing simplifies the detection of targeted advertising, but requires reporting to a central repository the impressions seen by different users, thereby jeopardizing their privacy. We break this deadlock with a privacy preserving data sharing protocol that allows eyeWnder to compute global statistics required to detect targeting, while keeping the advertisements seen by individual users and their browsing history private. We conduct a simulation study to explore the effect of different parameters and a live validation to demonstrate the accuracy of our approach. Unlike previous solutions, eyeWnder can even detect indirect targeting, i.e., marketing campaigns that promote a product or service whose description bears no semantic overlap with its targeted audience.

关键词： Crowdsourcing Display Advertisements Security and Privacy distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Decentralized Collaborative Flow Monitoring in distributed SDN Control-Planes

Decentralized Collaborative Flow Monitoring in Distributed S...

引用

International Conference on Networked Systems (NetSys)

作者： Hark, Rhaban Tounsi, Khalil Rizk, Amr Steinmetz, Ralf Tech Univ Darmstadt Multimedia Commun Lab Darmstadt Germany

ISBN: (纸本)9781728105680

The Software-defined Networking paradigm became widely accepted in academia as well as the industry in the last decade. The logically centralized control-plane provides simple mechanisms to support efficient monitoring as proposed in a plethora of works recently. However, existing works simplify the control-plane to a single entity whereas it is proven that the control-plane must be implemented physically distributed. To this end, we lately proposed DISTTM, a system to increase the efficiency while monitoring flows in distributed control-planes by eliminating redundant measurements of shared flows. The system is based on a centralized coordinator that introduces a single-point-of-failure and is vulnerable to network partitioning. To overcome this shortage, we propose a distributed algorithm to assign redundant measurement responsibilities to single controllers and share information among controllers in the work in hand. In an evaluation, we show that we decrease the number of measurements strongly and improve the load fairness among controllers through the collaboration of networks.

关键词： Software-defined Networking Flow Monitoring distributed algorithms distributed Control Plane

来源：评论

学校读者我要写书评

暂无评论

A distributed Wheel Sieve Algorithm 33

A Distributed Wheel Sieve Algorithm

引用

33rd IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Paillard, Gabriel A. L. Franca, Felipe M. G. Lavault, Christian Univ Fed Ceara Inst Univ Virtual Av Humberto Monte S-NBloco 901 BR-60440554 Fortaleza Ceara Brazil Univ Fed Rio de Janeiro Programa Engn Sistemas & Comp COPPE UFRJ Caixa Postal 68511 BR-21941972 Rio De Janeiro RJ Brazil Univ Paris 13 Sorbonne Paris Cite Lab Informat Paris Nord LIPN CNRSUMR 7030 F-93430 Villetaneuse France

ISBN: (纸本)9781538655559

This paper presents a new distributed approach for generating all prime numbers in a given interval of integers. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the current generation of parallel computers, which have permitted to reach larger bounds on the interval or to obtain previous results in a shorter time, prime numbers generation still represents an attractive domain of research and plays a central role in cryptography. We propose a fully distributed algorithm for finding all primes in the interval [2, n], based on the wheel sieve and the SMER (Scheduling by Multiple Edge Reversal) multigraph dynamics which runs in O(n+ root(n)) computational complexity, close to the theoretical lower bound on sieve methods, that is O(n), without making use of preprocessing techniques.

关键词： distributed algorithms Prime Numbers Generation Wheel Sieve Scheduling by Edge Reversal Scheduling by Multiple Edge Reversal

来源：评论

学校读者我要写书评

暂无评论

distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model 33

Distributed Dominating Set and Connected Dominating Set Cons...

引用

33rd IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Yu, Dongxiao Zou, Yifei Zhang, Yong Li, Feng Yu, Jiguo Wu, Yu Cheng, Xiuzhen Lau, Francis C. M. Shandong Univ Sch Comp Sci & Technol Inst Intelligent Comp Jinan Peoples R China Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Qilu Univ Technol Sch Comp Sci & Technol Shandong Acad Sci Shandong Comp CtrNatl Supercomp Ctr Jinan Jinan 250014 Peoples R China Qufu Normal Univ Sch Informat Sci & Engn Rizhao 2767826 Peoples R China Dongguan Univ Technol Sch Comp Sci & Technol Dongguan Peoples R China

ISBN: (纸本)9781728112466

This paper investigates distributed Dominating Set (DS) and Connected Dominating Set (CDS) construction in dynamic wireless networks under the SINR interference model. Specifically, we present a new model for dynamic networks that admits both churns (due to node arrivals/departures) and node mobility. Under this dynamic model, we propose efficient algorithms to construct a DS and a CDS with constant approximation ratios w.r.t. the corresponding minimum ones in O(log n) time with a high probability guarantee. To the best of our knowledge, these algorithms are the first known ones for DS and CDS construction in dynamic networks assuming the SINR interference model. We believe our dynamic network model can greatly facilitate distributed algorithm studies in mobile and dynamic wireless networks.

关键词： Interference Signal to noise ratio Heuristic algorithms Vehicle dynamics distributed algorithms Wireless communication Network topology

来源：评论

学校读者我要写书评

暂无评论

Deterministic byzantine-resilient robot gathering

Deterministic byzantine-resilient robot gathering

引用

作者： Saha, Ullash University of Manitoba

学位级别：硕士

Gathering is a fundamental problem in the field of mobile robot algorithms. The goal is to gather the robots at a single point, which can be useful for sharing information or coordinating future actions. In this thesis, we consider models in which m robots are placed at nodes in a graph of size n, and the goal is to gather them at a single node of the graph. Here, each robot has an identifier (ID) and runs its own deterministic algorithm, i. e., there is no centralized coordinator. We consider a particularly challenging scenario: there are f maliciously faulty robots in the team that can behave arbitrarily, and even have the ability to change their IDs to any value at any time. There is no way to distinguish these robots from non-faulty robots, other than perhaps observing strange or unexpected behaviour. In this thesis, we seek to design a deterministic algorithm that is run by each robot to eventually have all the non-faulty robots located at the same node in the same round. It is known that no algorithm can solve this task unless there at least f+1 non-faulty robots in the team. In this thesis, we design an algorithm that runs in polynomial time with respect to n and m that matches this bound, i. e., it works in a team that has exactly f+1 non-faulty robots. In our model, we have equipped the robots with sensors that enable each robot to see the subgraph (including robots) within some distance H of its current node. We also prove that the gathering task is solvable if this visibility range H is at least the radius of the graph, and not solvable if H is any fixed constant.

关键词： Robot gathering Byzantine faults Visibility Graphs distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Joint Power Control and Routing for Rechargeable Wireless Sensor Networks

引用

IEEE ACCESS 2019年 7卷 123992-124007页

作者： Pal, Amitangshu Nasipuri, Asis Temple Univ Comp & Informat Sci Philadelphia PA 19122 USA Univ N Carolina Elect & Comp Engn Charlotte NC 28223 USA

Wireless sensor networks (WSN) that are powered by energy harvested from the environment, also known as rechargeable WSNs, typically experience wide variations of energy availability across the network. Such variations can cause frequent node outages at specific locations where energy availability is low, whereas the remaining nodes may receive sufficient energy for continuous operation. The energy availability also varies over time due to environmental factors, which exacerbates the problem. To minimize the impact of such spatial and temporal variations of energy resources, we propose a joint Power COntrol and Routing scheme (PCOR) that adapts the energy consumption in the sensor nodes according to its available energy resources in order to facilitate uninterrupted operations. The scheme is applied to data collecting WSNs with a MAC that utilizes asynchronous duty-cycling for energy conservation. PCOR achieves its objective by reducing the energy consumption at energy-critical sensor nodes, i.e. nodes that have comparatively lower energy resources, using network-wide cooperative power control and route adaptations. This is accomplished by reducing the overhearing at energy-critical nodes, which is a key cause of energy consumption in such networks. We demonstrate through simulations and experimental results that PCOR reduces overhearing at energy-constrained nodes by up to 75% without significantly affecting the end-to-end packet delivery rates.

关键词： Wireless sensor networks rechargeable networks power control adaptive routing distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A Partition-centric distributed Algorithm for Identifying Euler Circuits in Large Graphs 33

A Partition-centric Distributed Algorithm for Identifying Eu...

引用

33rd IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Jaiswal, Siddharth D. Simmhan, Yogesh Indian Inst Sci Dept Computat & Data Sci Bangalore Karnataka India

ISBN: (纸本)9781538655559

Finding the Eulerian circuit in graphs is a classic problem, but inadequately explored for parallel computation. With such cycles finding use in neuroscience and Internet of Things for large graphs, designing a distributed algorithm for finding the Euler circuit is important. Existing parallel algorithms are impractical for commodity clusters and Clouds. We propose a novel partition-centric algorithm to find the Euler circuit, over large graphs partitioned across distributed machines and executed iteratively using a Bulk Synchronous Parallel (BSP) model. The algorithm finds partial paths and cycles within each partition, and refines these into longer paths by recursively merging the partitions. We describe the algorithm, analyze its complexity, and validate it on Apache Spark for large graphs. Our experiments show that memory pressure still limits weak and strong scaling, and we propose an enhanced design to address it.

关键词： Partitioning algorithms Clustering algorithms Merging Complexity theory distributed algorithms Integrated circuit modeling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Finite-Time distributed Flow Balancing 58

Finite-Time Distributed Flow Balancing

引用

58th IEEE Conference on Decision and Control (CDC)

作者： Hadjicostis, Christoforos N. Dominguez-Garcia, Alejandro D. Rikos, Apostolos I. Univ Cyprus Dept Elect & Comp Engn Nicosia Cyprus Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113982

We consider a flow network that is described by a digraph (physical topology), each edge of which can admit a flow within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. The paper proposes and analyzes a distributed iterative algorithm for computing, in finite time, admissible and balanced flows, i.e., flows that are within the given intervals at each edge and balance the total in-flow with the total out-flow at each node. The algorithm assumes a communication topology that allows bidirectional exchanges between pairs of nodes that are physically connected (i.e., nodes that share a directed edge in the physical topology). If the given initial flows and flow limits are commensurable (i.e., integer multiples of a given constant), then the proposed distributed algorithm operates exclusively with flows that are commensurable and is shown to complete in a finite number of steps (assuming a solution set of admissible and balanced flows exists). When no upper limits are imposed on the flows, a variation of the proposed algorithm is shown to complete in finite time even when initial flows and lower limits are arbitrary nonnegative real values (not necessarily commensurable).

关键词： Flow Balancing distributed algorithms Finite Time algorithms

来源：评论

学校读者我要写书评

暂无评论

Scaling and Load-Balancing Equi-Joins

引用

ACM TRANSACTIONS ON DATABASE SYSTEMS 2025年第2期50卷

作者： Metwally, Ahmed Uber Technol Inc Trusted Ident Org Sunnyvale CA 94086 USA

The task of joining two tables is fundamental for querying databases. In this article, we focus on the equijoin problem, where a pair of records from the two joined tables are part of the join results if equality holds between their values in the join column(s). While this is a tractable problem when the number of records in the joined tables is relatively small, it becomes very challenging as the table sizes increase, especially if hot keys (join column values with a large number of records) exist in both joined tables. This article, an extended version of [60], proposes Adaptive-Multistage-Join (AM-Join) for scalable and fast equi-joins in distributed shared-nothing architectures. AM-Join utilizes (a) Tree-Join, a proposed novel algorithm that scales well when the joined tables share hot keys, and (b) Broadcast-Join, the fastest known algorithm when joining keys that are hot in only one table. Unlike the state-of-the-art algorithms, AM-Join (a) holistically solves the join-skew problem by achieving load balancing throughout the join execution, and (b) supports all outer-join variants without record deduplication or custom table partitioning. For the fastest AM-Join outer-join performance, we propose the Index-Broadcast-Join (IB-Join) family of algorithms for Small-Large joins, where one table fits in memory and the other can be up to orders of magnitude larger. The outer-join variants of IB-Join improve on the state-of-the-art Small-Large outer-join algorithms. The proposed algorithms can be adopted in any shared-nothing architecture. We implemented a MapReduce version using Spark. Our evaluation shows the proposed algorithms execute significantly faster and scale to more skewed and orders-of-magnitude bigger tables when compared to the state-of-the-art algorithms.

关键词： Big data data skew distributed algorithms load balancing

来源：评论

学校读者我要写书评

暂无评论

Gathering of mobile robots with weak multiplicity detection in presence of crash-faults

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2019年 123卷 145-155页

作者： Pattanayak, Debasish Mondal, Kaushik Ramesh, H. Mandal, Partha Sarathi Indian Inst Technol Guwahati Dept Math Gauhati 781039 India

We study the Gathering problem for mobile robots in presence of faults. In classical gathering, robots gather at a point not known a priori in finite time. In this paper, we focus on gathering of all non-faulty robots at a single point in the presence of faulty robots. We propose a wait-free algorithm (i.e., no robot waits for other robot and the algorithm instructs each robot to move in every step, unless it is already at the gathering location), that gathers all non-faulty robots in the semi-synchronous model without any agreement in the coordinate system and with weak multiplicity detection (i.e., a robot can only detect that either there is one or more robots at a location) in the presence of at most n - 1 faulty robots for n >= 3. We show that the required capability for gathering robots is minimal in the above model since relaxing it further makes gathering impossible to solve. Also, we introduce a scheduling model as the asynchronous model with instantaneous computation (ASYNC(IC)), which lies in between the asynchronous and the semi-synchronous model. Then we propose another algorithm in the ASYNC(IC) model for gathering all non-faulty robots with weak multiplicity detection and without any agreement on the coordinate system in the presence of at most (left perpendicilar)n/2(right perpendicular) - 2 faulty robots for n >= 7. (C) 2018 Elsevier Inc. All rights reserved.

关键词： distributed algorithms Fault-tolerance Oblivious mobile robots Gathering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：