arXiv 1708.024192017-08-08cs.NIcs.CRcs.DC

Towards a Concurrent and Distributed Route Selection for Payment Channel Networks

Elias Rohrer, Jann-Frederik Laß, Florian Tschorsch

备注：: 8 pages
发表信息：: ESORICS 2017, DPM 2017, CBT 2017. Lecture Notes in Computer Science, vol 10436
DOI：: 10.1007/978-3-319-67816-0_23

英文摘要：

Payment channel networks use off-chain transactions to provide virtually arbitrary transaction rates. In this paper, we provide a new perspective on payment channels and consider them as a flow network. We propose an extended push-relabel algorithm to find payment flows in a payment channel network. Our algorithm enables a distributed and concurrent execution without violating capacity constraints. To this end, we introduce the concept of capacity locking. We prove that flows are valid and present first results.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks

Payment channel networks are a promising approach to improve the scalability of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion, along multi-hop routes in the network, without requiring consensus on the blockchain. However, during the discovery of cost-efficient routes for the transaction, critical information may be revealed about the transacting entities. This paper initiates the study of privacy-preserving route discovery mechanisms for payment channel networks. In particular, we present LightPIR, an approach which allows a source to efficiently discover a sho…

2021-04-09cs.CRcs.NI

High Throughput Cryptocurrency Routing in Payment Channel Networks

Despite growing adoption of cryptocurrencies, making fast payments at scale remains a challenge. Payment channel networks (PCNs) such as the Lightning Network have emerged as a viable scaling solution. However, completing payments on PCNs is challenging: payments must be routed on paths with sufficient funds. As payments flow over a single channel (link) in the same direction, the channel eventually becomes depleted and cannot support further payments in that direction; hence, naive routing schemes like shortest-path routing can deplete key payment channels and paralyze the system. Today's PCN…

2020-03-23cs.NI

Hijacking Routes in Payment Channel Networks: A Predictability Tradeoff

Off-chain transaction networks can mitigate the scalability issues of today's trustless electronic cash systems such as Bitcoin. However, these peer-to-peer networks also introduce a new attack surface which is not well-understood today. This paper identifies and analyzes, a novel Denial-of-Service attack which is based on route hijacking, i.e., which exploits the way transactions are routed and executed along the created channels of the network. This attack is conceptually interesting as even a limited attacker that manipulates the topology through the creation of new channels can navigate tr…

2019-09-15cs.CRcs.GTcs.MA

基于超图的多方支付通道

Hypergraph based Multi-Party Payment Channel

IIT Jodhpur（印度理工学院乔德普尔分校）

提出基于超图的COALESCE协议，通过集体资助的超边实现无领导者、高并发支付，消除路由依赖和流动性碎片化，在150节点测试中达到约94%的成功率。

2026-06-02cs.CRcs.DCcs.NI

Modeling Effective Lifespan of Payment Channels

While being decentralized, secure, and reliable, Bitcoin and many other blockchain-based cryptocurrencies suffer from scalability issues. One of the promising proposals to address this problem is off-chain payment channels. Since, not all nodes are connected directly to each other, they can use a payment network to route their payments. Each node allocates a balance that is frozen during the channel's lifespan. Spending and receiving transactions will shift the balance to one side of the channel. A channel becomes unbalanced when there is not sufficient balance in one direction. In this case, …

2022-09-11cs.CRcs.DCcs.NI

Flash: Efficient Dynamic Routing for Offchain Networks

Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants directly make payments through a network of payment channels without the overhead of committing onchain transactions. Routing is critical to the performance of offchain networks. Existing solutions use either static routing with poor performance or dynamic routing with high overhead to obtain the dynamic channel balance information. In this paper, we propose Flash, a new dynamic routing solution that leverages the unique characteristics of transactions in offchain networks to strik…

2019-06-11cs.NI

更多相关论文收起更多论文

Volur: Concurrent Edge/Core Route Control in Data Center Networks

A perennial question in computer networks is where to place functionality among components of a distributed computer system. In data centers, one option is to move all intelligence to the edge, essentially relegating switches and middleboxes, regardless of their programmability, to simple static routing policies. Another is to add more intelligence to the middle of the network in the hopes that it can handle any issue that arises. This paper presents an architecture, called Volur, that provides a third option by facilitating the co-existence of an intelligent network with an intelligent edge. …

2018-04-18cs.NI

An empirical study of availability and reliability properties of the Bitcoin Lightning Network

The Bitcoin Lightning network is a mechanism to enable fast and inexpensive off-chain Bitcoin transactions using peer-to-peer (P2P) channels between nodes that can also be composed into a routing path. Although the resulting possible channel graphs are well-studied, there is no empirical data on the network's reliability in terms of being able to successfully route payments at a given moment in time. In this paper we address this gap and investigate two forms of availability that are a necessary ingredient to achieve such reliability. We first study the Lightning network's ability to route pay…

2020-06-25cs.NI

PTP: Path-specified Transport Protocol for Concurrent Multipath Transmission in Named Data Networks

Named Data Networking (NDN) is a promising Future Internet architecture to support content distribution. Its inherent addressless routing paradigm brings valuable characteristics to improve the transmission robustness and efficiency, e.g. users are enabled to download content from multiple providers concurrently. However, multipath transmission NDN is different from that in Multipath TCP, i.e. the "paths" in NDN are transparent to and uncontrollable by users. To this end, the user controls the traffic on all transmission paths as an entirety, which leads to a noticeable problem of low bandwidt…

2018-08-24cs.NI

A Price Dynamics in Bandwidth Markets for Point-to-point Connections

We simulate a network of N routers and M network users making concurrent point-to-point connections by buying and selling router capacity from each other. The resources need to be acquired in complete sets, but there is only one spot market for each router. In order to describe the internal dynamics of the market, we model the observed prices by N-dimensional Ito-processes. Modeling using stochastic processes is novel in this context of describing interactions between end-users in a system with shared resources, and allows a standard set of mathematical tools to be applied. The derived models …

2001-02-15cond-mat.softcs.MAcs.NI

QF-MAC: Adaptive, Local Channel Hopping for Interference Avoidance in Wireless Meshes

The throughput efficiency of a wireless mesh network with potentially malicious external or internal interference can be significantly improved by equipping routers with multi-radio access over multiple channels. For reliably mitigating the effect of interference, frequency diversity (e.g., channel hopping) and time diversity (e.g., carrier sense multiple access) are conventionally leveraged to schedule communication channels. However, multi-radio scheduling over a limited set of channels to minimize the effect of interference and maximize network performance in the presence of concurrent netw…

2023-01-22cs.NI

数据中心网络中不可拆分流的最小拥塞路由

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks

本文研究数据中心 Clos 网络中不可拆分流的最小拥塞路由问题，证明最小拥塞下界为 3/2 且近似难度为 NP 难，提出保证拥塞至多 9/5 的多项式时间算法，并证明在线设置下近似比下界为 2，从而严格区分在线与离线场景。

2025-05-06cs.DScs.NIcs.PF