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

Symposium on SDN Research (SOSR)

作者： Henzinger, Monika Paz, Ami Pourdamghani, Arash Schmid, Stefan Univ Vienna Dept Comp Sci Vienna Austria LISN CNRS Paris France Paris Saclay Univ Paris France TU Berlin Berlin Germany Fraunhofer SIT Berlin Germany

ISBN: (纸本)9781450398923

Emerging software-defined networking technologies enable more adaptive communication infrastructures, allowing for quick reactions to changes in networking requirements by exploiting the workload's temporal structure. However, operating networks adaptively is algorithmically challenging, as meeting networks' stringent dependability requirements relies on maintaining basic consistency and performance properties, such as loop freedom and congestion minimization, even during the update process. This paper leverages an augmentation-speed tradeoff to significantly speed up consistent network updates. We show that allowing for a small and short (hence practically tolerable, e.g., using buffering) oversubscription of links allows us to solve many network update instances much faster, as well as to reduce computational complexities (i.e., the running times of the algorithms). We first explore this tradeoff formally, revealing the computational complexity of scheduling updates. We then present and analyze algorithms that maintain logical and performance properties during the update. Using an extensive simulation study, we find that the tradeoff is even more favorable in practice than our analytical bounds suggest. In particular, we find that by allowing just 10% augmentation, update times reduce by more than 32% on average, across a spectrum of real-world networks.

关键词： Software-defined networking network algorithms scheduling

来源：评论

学校读者我要写书评

暂无评论

Optimal Location of Charging Stations for Electric Vehicles: A Theoretically-Sound Heuristic Approach 23

Optimal Location of Charging Stations for Electric Vehicles:...

引用

38th Annual ACM Symposium on Applied Computing (ACM SAC)

作者： Cuzzocrea, Alfredo Canade, Luigi Nicolicchia, Riccardo Roldo, Luca Univ Calabria iDEA Lab Arcavacata Di Rende Italy ISIRES Turin Italy

ISBN: (纸本)9781450395175

Due to the increasing awareness of the environmental dangerous effects of greenhouse gases emitted by fossil fuels, electricity is becoming a valid alternative as power source. Therefore, the amount of electric vehicles (EVs) in cities is gradually increasing. However, EVs suffer from driving range limitations compared to the traditional fossil-fuel-based vehicles. Users may need to charge their vehicle away from home and find a sufficient and convenient availability of public charging stations. In this so-delineated scenario, this paper proposes a theoretically-sound heuristic approach.

关键词： network algorithms Theory of Computing Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Methodology for Optimal Big Data Processing in Advanced Smart City Environments 23rd

A Machine Learning Methodology for Optimal Big Data Processi...

引用

23rd International Conference on Computational Science and its Applications (ICCSA)

作者： Cuzzocrea, Alfredo Canade, Luigi Nicolicchia, Riccardo Roldo, Luca Univ Calabria IDEA Lab Arcavacata Di Rende Italy Univ Paris City Dept Comp Sci Paris France ISIRES Turin Italy

ISBN: (纸本)9783031368042;9783031368059

This paper introduces a Machine Learning methodology for supporting optimal big data processing in advanced smart city environments. In particular, the proposed work focuses the attention on the issue of efficiently charging Electric Vehicles (EVs) in an urban area, given various specific constraints. Our preliminary evaluation and analysis proofs the quality of our heuristics.

关键词： network algorithms Theory of Computing Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Weighted Packet Selection for Rechargeable Links in Cryptocurrency networks: Complexity and Approximation 30th

Weighted Packet Selection for Rechargeable Links in Cryptocu...

引用

30th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Schmid, Stefan Svoboda, Jakub Yeo, Michelle Tech Univ Berlin Berlin Germany IST Austria Klosterneuburg Austria

ISBN: (纸本)9783031327322;9783031327339

We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v's capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is "rechargeable" in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes' decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1 + epsilon) center dot (1 +root 3) for some arbitrary epsilon > 0.

关键词： network algorithms approximation algorithms complexity cryptocurrencies payment channel networks

来源：评论

学校读者我要写书评

暂无评论

Poster: Modified Dynamic Beta RED - A New AQM Algorithm for Internet Congestion Control 23

Poster: Modified Dynamic Beta RED - A New AQM Algorithm for ...

引用

ACM on Internet Measurement Conference (IMC)

作者： Gimenez, Angel Bonastre, Oscar M. Valero, Jose Amigo, Jose M. Miguel Hernandez Univ Elche Spain

ISBN: (纸本)9798400703829

In this work we present a performance study of modified Dynamic Beta RED (mDBetaRED), a new Active Queue Management (AQM) RED-type algorithm based on dynamical variants with the ability to adapt to the characteristics of mixed networks. As well, we rely on real campus traffic traces to build a traffic model on which we evaluate our proposal under the NS3 simulator. The parameters of our AQM algorithm are dynamically adjusted so that the queue length remains stable around a predetermined reference value and according to changing network traffic conditions. We present a performance comparison of mDBetaRED with other AQM algorithms and diverse flows of Internet. Of all the AQM algorithms compared, the mDBetaRED algorithm offers the best throughput while effectively controlling delay and stability.

关键词： design and analysis of algorithms mathematics of computing network algorithms network performance analysis network performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Effective and Efficient Heuristic algorithms for Supporting Optimal Location of Hubs over networks with Demand Uncertainty 34th

Effective and Efficient Heuristic Algorithms for Supporting ...

引用

34th International Conference on Database and Expert Systems Applications (DEXA)

作者： Cuzzocrea, Alfredo Canade, Luigi Fornari, Giulia Gatto, Vittorio Hafsaoui, Abderraouf Univ Calabria iDEA Lab Arcavacata Di Rende Italy Univ Paris City Dept Comp Sci Paris France ISIRES Turin Italy

ISBN: (纸本)9783031398469;9783031398476

The problem faced in this paper concerns with finding the optimal location for the hubs in a network, under demand uncertainty, and where the allocation of the nodes is treated as a second stage decision. We proceed first with the definition of the mathematical model that we carved to fit the operational needs of GUROBI Optimizer. Afterwards, we propose a collection of heuristic algorithms able to solve the problem in a faster way with sub-optimal solutions. The heuristic algorithms proposed in our framework progressively reach a good approximation of the solution. Experimental results confirm the benefits of our approach.

关键词： network algorithms Demand Uncertainty Heuristics

来源：评论

学校读者我要写书评

暂无评论

On Comparing and Enhancing Two Common Approaches to network Community Detection

On Comparing and Enhancing Two Common Approaches to Network ...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Motschnig, Niko Ramharter, Alexander Schweiger, Oliver Zabka, Philipp Foerster, Klaus-Tycho Univ Vienna Fac Comp Sci Vienna Austria

ISBN: (纸本)9781728181042

In this work, we explore two common algorithms for community detection in networks, namely Agglomerative Hierarchical Clustering and the Louvain Method. We investigate their mechanics and compare their differences in terms of implementation and results of the clustering behavior on a standard dataset. We further propose some enhancements to these algorithms that show promising results in our evaluations, such as self-neighboring for Neighbor Matrix constructions and a deterministic and slightly faster version of the Louvain Method that favors fewer bigger clusters.

关键词： Community Detection Clustering Social networks network algorithms Partitioning network Analysis

来源：评论

学校读者我要写书评

暂无评论

R-MPLS: Recursive Protection for Highly Dependable MPLS networks 22

R-MPLS: Recursive Protection for Highly Dependable MPLS Netw...

引用

18th International Conference on Emerging networking Experiments and Technologies (ACM CoNEXT)

作者： Schmid, Stefan Schou, Morten Konggaard Srba, Jiri Vanerio, Juan TU Berlin Berlin Germany Univ Vienna Vienna Austria Aalborg Univ Dept Comp Sci Aalborg Denmark Univ Vienna Fac Comp Sci Vienna Austria

ISBN: (纸本)9781450395083

Most modern communication networks feature fast rerouting mechanisms in the data plane. However, design and configuration of such mechanisms even under multiple failures is known to be difficult. In order to increase the resilience of the widely deployed MPLS networks, we propose R-MPLS, an alternative link protection mechanism for MPLS networks that uses recursive protection and can route around multiple simultaneously failed links. Our new R-MPLS approach comes with strong theoretical underpinnings, is implementable in a fully distributed way and executable on existing MPLS hardware, and formally guarantees that no forwarding loops are introduced. We implement our R-MPLS protection in an automated tool which overcomes the complexity of configuring such resilient network data planes, and report on the benefits of recursive protection in realistic network topologies. We find that RMPLS significantly increases network robustness against multiple failures, with only moderate increase in the number of forwarding rules and communication overhead (both comparable to industrystandards like RSVP-TE FRR).

关键词： network Reliability network algorithms Fast Reroute MPLS

来源：评论

学校读者我要写书评

暂无评论

Compact Distributed Certification of Planar Graphs

引用

ALGORITHMICA 2021年第7期83卷 2215-2244页

作者： Feuilloley, Laurent Fraigniaud, Pierre Montealegre, Pedro Rapaport, Ivan Remila, Eric Todinca, Ioan Univ Adolfo Ibanez Fac Ingn & Ciencias Santiago Chile Univ Lyon 1 Univ Lyon LIRIS UMR CNRS 5205 F-69621 Lyon France Univ Paris CNRS IRIF Paris France Univ Chile DIM CMM UMI 2807CNRS Santiago Chile UJM UMR CNRS 5824 GATE Lyon St Etienne St Etienne France Univ Orleans LIFO INSA Ctr Val Loire Orleans France

Naor M., Parter M., Yogev E.: (The power of distributed verifiers in interactive proofs. In: 31st ACM-SIAM symposium on discrete algorithms (SODA), pp 1096-115, 2020. https://***/10.1137/1.9781611975994.67) have recently demonstrated the existence of a distributed interactive proof for planarity (i.e., for certifying that a network is planar), using a sophisticated generic technique for constructing distributed IP protocols based on sequential IP protocols. The interactive proof for planarity is based on a distributed certification of the correct execution of any given sequential linear-time algorithm for planarity testing. It involves three interactions between the prover and the randomized distributed verifier (i.e., it is a dMAM protocol), and uses small certificates, on O(log n) bits in n-node networks. We show that a single interaction with the prover suffices, and randomization is unecessary, by providing an explicit description of a proof-labeling scheme for planarity, still using certificates on just O(log n) bits. We also show that there are no proof-labeling schemes-in fact, even no locally checkable proofs-for planarity using certificates on o(log n) bits.

关键词： Distributed algorithms network algorithms Graph property certification Labeling schemes Planarity

来源：评论

学校读者我要写书评

暂无评论

Helix: A Fair Blockchain Consensus Protocol Resistant to Ordering Manipulation

引用

IEEE TRANSACTIONS ON network AND SERVICE MANAGEMENT 2021年第2期18卷 1584-1597页

作者： Yakira, David Asayag, Avi Cohen, Gad Grayevsky, Ido Leshkowitz, Maya Rottenstreich, Ori Tamari, Ronen Technion Israel Inst Technol Viterbi Dept Elect Engn IL-3200003 Haifa Israel Technion Israel Inst Technol Taub Dept Comp Sci IL-3200003 Haifa Israel Orbs IL-6701203 Tel Aviv Israel Univ Oxford Math Inst Oxford OX1 2JD England Hebrew Univ Jerusalem IL-9190501 Jerusalem Israel

We present Helix, a blockchain-based consensus protocol for fair ordering of transactions among nodes in a distributed network. Helix advances in rounds, in each an elected primary node proposes a potential block (a successive set of transactions). For being included in the blockchain, a block must pass validation by an elected committee of nodes. Nodes have two primary preferences. First, to be elected as committee members. Additionally, because each transaction is associated with one of the network nodes, nodes would like to prioritize their own transactions over those of others. Our definition of fairness incorporates three key elements. First, the process of electing nodes to committees is random and unpredictable. Second, a correlated sampling scheme is used to guarantee random selection and ordering of pending transactions in blocks. Third, transactions are encrypted to hide their associations with nodes and prevent censorship. Through the corresponding threshold decryption process we obtain an unpredictable and non-manipulable randomness beacon, which serves both the election process and the correlated sampling scheme. We define a quantitative measure of fairness in the protocol, prove theoretically that fairness manipulation in Helix is significantly limited, and present experiments evaluating fairness in practice.

关键词： Encryption Consensus protocol Voting Quality of service Mesh networks Distributed ledger Censorship Blockchain fairness network algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：