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

maxREE: Maximizing Flow by Replacing Exhausted Edges in Lightning Network

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2025年第2期12卷 1011-1025页

作者： Sharma, Neeraj Kapoor, Kalpesh Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 India Indian Inst Technol Guwahati Dept Math North Guwahati 781039 India

Blockchain-based cryptocurrencies have grown rapidly over the past decade, but issues with scalability are limiting their wider adoption. Payment Channel Network, a layer two solution, is an alternative for enhancing the scalability of a blockchain network. Two users can engage in some off-chain transactions via payment channels in the network they build in order to avoid the time and expense of on-chain settlement. The number of nodes in the Bitcoin payment channel network has nearly doubled over the last two years, and this network size is proliferating. The number of transactions on the network will increase along with its growth. However, the existing distributed routing algorithms cannot effectively schedule several concurrent transactions due to their static nature. We propose the maxREE algorithm, which efficiently handles concurrent transactions with negligible overhead. Our algorithm considers substituting the necessary edges with superior alternatives to prevent the saturation of a channel's directional capacity while maintaining the height of the underlying routing tree. The transaction flow was enhanced by our proposed algorithm's self-rebalancing and link load sharing. Without compromising network privacy, the unused links are dynamically substituted for the congested ones. We have also developed a simulator, called DRLNsim, to compare our algorithm with existing techniques. On the simulator, the routing approaches are examined using multiple custom network sizes. The proposed method enabled concurrent transactions 58% more effectively on average than existing techniques. The simulation's outcomes mirror the patterns found through theoretical study.

关键词： routing Bitcoin Blockchains Peer-to-peer computing routing protocols Heuristic algorithms Lightning Topology System recovery Spread spectrum communication Blockchain concurrency distributed routing algorithms lightning network payment channel network rebalancing

来源：评论

学校读者我要写书评

暂无评论

Short-cuts on quantum network simulators 15

Short-cuts on quantum network simulators

引用

15th IEEE International Conference on Advanced Networks and Telecommunications Systems (IEEE ANTS)

作者： Srivastava, Anubhav Mishra, Devendra Annavazzala, Madhuri Franklin, Antony Patel, Nixon Rao, M. V. Panduranga IIT Hyderabad Comp Sci & Engn Hyderabad India Qulabs Software India Pvt Ltd Hyderabad India IIT Hyderabad AI & Elect Engn Hyderabad India

ISBN: (纸本)9781665448932

An important idea in quantum networks is that of employing virtual edges or "short-cuts" between quantum nodes. These edges, which are shared entangled pairs between two nodes that are not directly connected "physically", are expected to reduce the average latency of entanglement distribution in quantum network routing. In this work, we show how to create such edges on an existing discrete event simulator for quantum networks called SeQUeNCe, and study the impact that these edges have on latency. Additionally, we implement a distributed routing algorithm on the simulator and demonstrate its use in conjunction with the virtual edges. We observe a reduction in latency when short-cuts are used, as is expected. Thus, with these modifications, we believe that SeQUeNCe (and other similar simulators) can be used for experimenting with advanced quantum networking protocols.

关键词： Quantum Networks Virtual Edges SeQUeNCe Simulator distributed routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Hierarchical routing over dynamic wireless networks

引用

RANDOM STRUCTURES & algorithms 2015年第4期47卷 669-709页

作者： Tschopp, Dominique Diggavi, Suhas Grossglauser, Matthias Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed, trading off control overhead and route quality. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes, even in large networks where all the nodes are mobile. We present a scheme that maintains a hierarchical structure within which constant-stretch routes can be efficiently computed between every pair of nodes. The scheme rebuilds each level of the hierarchy periodically, at a rate that decreases exponentially with the level of the hierarchy. We prove that this scheme achieves constant stretch under a mild smoothness condition on the nodal mobility processes. Furthermore, we prove tight bounds for the network-wide control overhead under the additional assumption of the connectivity graph forming a doubling metric space. Specifically, we show that for a connectivity model combining the random geometric graph with obstacles, constant-stretch routes can be maintained with a total overhead of nlog2n bits of control information per time unit. (c) 2015 Wiley Periodicals, Inc.

关键词： distributed routing algorithms wireless networks geometric random graphs competitive analysis mobility

来源：评论

学校读者我要写书评

暂无评论

distributed Network Configuration for Wavelet-Based Compression in Sensor Networks

Distributed Network Configuration for Wavelet-Based Compress...

引用

3rd International GeoSensor Networks Conference

作者： Tarrio, Paula Valenzise, Giuseppe Shen, Godwin Ortega, Antonio Univ Politecn Madrid Dept Senales Sistemas & Radiocomunicac Madrid Spain Politecn Milan Dipartimento Elettr & Informat Milan Italy Univ Southern Calif Dept Elect Engn Los Angeles CA USA

ISBN: (纸本)9783642029028

En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in network compression schemes involve the distributed computation of some decorrelating transform on the data,;the structure along which the transform is computed influences both coding performance and transmission cost of the computed coefficients, and has been widely explored in the literature. However, few works have studied this interaction in the practical case when the routing configuration of the network is also built in a distributed manner. In this paper we aim at expanding this understanding by specifically considering the impact of distributed routing tree initialization algorithms on coding and transmission costs, when a tree-based wavelet lifting transform is adopted. We propose a simple modification to the collection tree protocol (CTP) which can be tuned to account for a vast range of spatial correlations. In terms of costs and coding efficiency, our methods do not improve the performance of more sophisticated routing trees such as, the shortest path tree, but they entail an easier manageability in case of node reconfigurations and update.

关键词： In-network compression wavelet lifting distributed routing algorithms collection tree protocol shortest path tree

来源：评论

学校读者我要写书评

暂无评论

Hierarchical routing over Dynamic Wireless Networks 08

Hierarchical Routing over Dynamic Wireless Networks

引用

International Conference on Measurement and Modeling of Computer Systems

作者： Tschopp, Dominique Diggavi, Suhas Grossglauser, Matthias Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland

ISBN: (纸本)9781605580050

In dynamic networks the topology evolves and routes are maintained by frequent updates, consuming throughput available for data transmission. We ask whether there exist low-overhead schemes for these networks, that produce routes that are within a small constant factor (stretch) of the optimal route-length. This is studied by using the underlying geometric properties of the connectivity graph ill wireless networks. For a class of models for wireless network that ful-fill some mild conditions on the connectivity and oil mobility over the time of interest, we call design distributed routing algorithm that maintain the routes over a changing topology. This scheme needs only node identities and integrates location service along with routing, therefore accounting for the complete overhead. We analyze the worst-case (conservative) overhead and route-quality (stretch) performance of this algorithm for the aforementioned class of models. Our algorithm allows constant stretch routing with a network wide control traffic overhead of O(n log(2) n) bits per mobility time step (time-scale of topology change) translating to O(log(2) n) overhead per node (with high probability for wireless networks with such mobility model). We call reduce the maximum overhead per node by using a load-balancing technique it, the cost of a slightly higher average overhead. Numerics show that these bounds are quite conservative.

关键词： distributed routing algorithms wireless networks geometric random graphs competitive analysis

来源：评论

学校读者我要写书评

暂无评论

An ant system-based routing algorithm for wireless sensor networks

An ant system-based routing algorithm for wireless sensor ne...

引用

3rd International Conference on Cybernetics and Information Technologies, Systems and Applications/4th International Conference on Computing, Communications and Control Technologies

作者： Aguilar, Jose Labrador, Miguel A. Univ Los Andes Merida 5201 Venezuela

ISBN: (纸本)9789806560833

In this paper, a general combinatorial Ant System-based distributed algorithm modeled like a dynamic optimization problem is presented. In the proposed algorithm, the solution space of the dynamic combinatorial optimization problem is mapped into the space where the ants will walk, and the transition probability and the pheromone update formula of the ant system are defined according to the objective function of the communication problem. We test and compare the performance of our routing algorithm against well-known routing schemes for wireless sensor networks and via simulations show that it consumes less energy per packet and extends the lifetime of the network.

关键词： dynamic combinatorial optimization distributed routing algorithms wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

ON THE BEHAVIOR OF LEARNING algorithms IN A CHANGING ENVIRONMENT WITH APPLICATION TO DATA NETWORK routing PROBLEM - MODELS, CONVERGENCE ANALYSIS AND OPTIMALITY

引用

COMPUTER STANDARDS & INTERFACES 1990年第1期11卷 29-39页

作者： VASILAKOS, AV UNIV PATRAS DEPT COMP ENGNGR-26500 PATRASGREECE UNIV PATRAS INST COMP TECHNOLGR-26500 PATRASGREECE

We present a routing algorithm for use within a network level protocol such as ISO's routing protocols. The viability of learning automata routing in message switched and packet switched networks and the theoretical basis for analyzing such communications systems are the subject of this paper. The behavior of the automata at the nodes is studied using well-defined and mathematically tractable abstract representations of the network. Both the equilibrium and transient performance of automata operating in these environments are considered. The behavior predicted by analysis of the abstract environments is verified by simulation of automata operating in simple data communication networks. Simulation studies of our algorithm and optimum adaptive algorithms have been considered.

关键词： distributed routing algorithms PACKET-SWITCHING WIDE AREA NETWORKS ISO NETWORK LAYER LEARNING algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：