• Corpus ID: 1214580

Flare : An Approach to Routing in Lightning Network White Paper

@inproceedings{Prihodko2016FlareA,
  title={Flare : An Approach to Routing in Lightning Network White Paper},
  author={Pavel Prihodko and S. N. Zhigulin and Mykola Sahno and A B Ostrovskiy and Olaoluwa Osuntokun},
  year={2016}
}
This paper describes a hybrid routing algorithm Flare, which could be used for payment routing in Lightning Network. The design goal for the algorithm is to ensure that routes can be found as quickly as possible. This is accomplished at the cost of each node proactively gathering information about the Lightning Network topology. The collected information includes both payment channels close to the node in terms of hop distance and paths to beacon nodes, which are close to the node in the node… 
Imbalance measure and proactive channel rebalancing algorithm for the Lightning Network
TLDR
Results indicate that a collaborative approach within the friend of a friend network might be preferable from a practical point of view in terms of improving the balance of the network.
Hubs, Rebalancing and Service Providers in the Lightning Network
TLDR
It is found that the LN is resilient to the removal of hubs, that the passive rebalancing approach reduces of about one fourth the payments failures due to channel unbalancing, and that in the service-providers scenario a consistent part of payments fails because channels directing to the service providers become unbalanced.
Probing Channel Balances in the Lightning Network
TLDR
This work shows that an attacker can easily discover channel balances using probing, and argues that LN's balance between privacy and routing efficiency is suboptimal: channel balances are neither well protected nor utilized.
Discharged Payment Channels: Quantifying the Lightning Network's Resilience to Topology-Based Attacks
TLDR
This paper analyze the Lightning Network's PCN topology and investigates its resilience towards random failures and targeted attacks, and develops a series of strategies for targeted attacks and introduces metrics that allow us to quantify the adversary's advantage.
Attack-Resistant Spanning Tree Construction in Route-Restricted Overlay Networks
TLDR
This work designs a novel self-stabilizing spanning tree construction algorithm that utilizes cryptographic signatures and proves that it reduces the set of nodes affected by active attacks and indicates that this algorithm reduces the number of affected nodes by up to 74% compared to state-of-the-art attack-resistant spanning tree constructions.
Ant routing algorithm for the Lightning Network
TLDR
This work proposes a decentralized routing algorithm that can be implemented in Bitcoin Lightning Network and is inspired from ant path searching algorithms.
The CLoTH Simulator for HTLC Payment Networks with Introductory Lightning Network Performance Results
TLDR
CLoTH, a simulator for HTLC payment networks, is introduced, which simulates input-defined payments on an input- defined HTLC network and produces performance measures in terms of payment-related statistics (such as time to complete payments and probability of payment failure).
Optimal Fee Structure for Efficient Lightning Networks
TLDR
A good compromise is to have fees proportional to the square root of the channel capacity, such that reasonably short path lengths and overall balanced channel capacities can be achieved that makes the operation of the LN more sustainable.
Structural Attacks on Local Routing in Payment Channel Networks
TLDR
This work examines the effectiveness of attacks in PCNs that use routing algorithms based on local knowledge, where compromised intermediate nodes can delay or drop transactions to create denial-of-service attacks, and focuses on SpeedyMurmurs as a representative of such protocols.
Routing Algorithms in Blockchain-based Payment Channel Networks
TLDR
The focus of this thesis lies on discovering and comparing routing algorithms for PCNs, and a new interface will be introduced to support different implementations of routing algorithms in a single codebase.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 50 REFERENCES
Optimized Link State Routing Protocol (OLSR)
TLDR
The Optimized Link State Routing protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN and provides optimal routes (in terms of number of hops).
A review of current routing protocols for ad hoc mobile wireless networks
TLDR
Routing protocols for ad hoc networks are examined by providing an overview of eight different protocols by presenting their characteristics and functionality, and then a comparison and discussion of their respective merits and drawbacks are provided.
Routing in Ad Hoc Networks of Mobile Hosts
  • David B. Johnson
  • Computer Science
    1994 First Workshop on Mobile Computing Systems and Applications
  • 1994
TLDR
This position paper suggests a new approach based on separate route discovery and route maintenance protocols for routing in ad hoc networks, treating each mobile host as a router.
Safari : A Scalable Architecture for Ad Hoc Networking and Services
Within little more than a decade, digital information and the Internet have assumed a critical role in virtually all sectors of society, including education, commerce, science, government, and
Ad hoc On-Demand Distance Vector (AODV) Routing
TLDR
A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
HORNET: High-speed Onion Routing at the Network Layer
TLDR
HORNET is designed as a low-latency onion routing system that operates at the network layer thus enabling a wide range of applications and uses only symmetric cryptography for data forwarding yet requires no per-flow state on intermediate routers.
Tor: The Second-Generation Onion Router
TLDR
This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, and a practical design for location-hidden services via rendezvous points.
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Bitcoin: A Peer-to-Peer Electronic Cash System
A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
TLDR
A peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment is described using a novel XOR-based metric topology that simplifies the algorithm and facilitates the proof.
...
1
2
3
4
5
...