370 likes | 378 Views
This research focuses on designing routing in payment channel networks for high transaction throughput with a small amount of capital. The approach includes packet-switched networks and balance-aware-routing based on real-time balance information.
E N D
Routing Cryptocurrency with the Spider Network Vibhaalakshmi SIVARAMAN, SHAILESHH VENKATAKRISHNAN, MOHAMMAD ALIZADEH, GIULIA FANTI, PRAMOD VISWANATH
What is a blockchain? Blockchain (1) 4 Alice Bob Miners
Blockchain Transactions (2) (5) (4) (3) (1) 1 1 4 3 5 5 4 Alice Alice Alice Mary Charlie Bob Bob Bob Eve Eve 2 2
Cryptocurrencies don’t scale! STORAGE Needs 350 additional GB per day for faster transactions FEES Some transactions can be as expensive as $34 LATENCY Bitcoin transaction confirmation time ∼ 1 hr
Solution: Payment Channels 1 1 1 2 2 2 Key Idea: Use blockchain (as arbiter) only as necessary!
Solution: Payment Channels (1) 4 1 3 Open Channel Alice Bob 2
Solution: Payment Channels (1) 4 1 1 3 (2) 3 4 4 3 Open Channel Txn 1 Alice Bob 2 2 Alice Bob
Solution: Payment Channels (2) (1) 4 1 1 3 Open Channel Txn 1 (3) 5 3 2 4 Txn 2 Alice Alice Bob Bob 2 2 - Alice Alice Bob
Solution: Payment Channels (5…) (n) (4) (3) (1) (2) 4 5 3 5 5 5 1 1 3 2 2 2 2 4 Close Channel Open Channel Txn 2 Txn 1 Txn 2 Txn 2 Alice Alice Alice Alice Alice Alice Bob Bob Bob Bob Bob Bob 2 2 - Alice - Bob - Bob - Bob
Payment Channel Network Charlie Alice 6 6 3 Bob 0 1 1 3 3 3 1 Eve Mary
Payment Channel Network Alice wants to send 3 coins to Bob Charlie Alice 6 6 3 Bob 0 1 1 3 3 3 1 Eve Mary
Payment Channel Network Alice wants to send 3 coins to Bob Charlie Alice 6 6 3 Bob 0 1 1 3 3 3 1 Eve Mary
Payment Channel Network Alice wants to send 3 coins to Bob Charlie Alice 6 6 6 3 3 3 Bob 3 0 1 1 3 3 3 1 Eve Mary
Routing in Payment Channel Networks Alice wants to send 3 more coins to Bob Charlie Alice 6 3 3 Bob 3 1 1 3 3 3 1 Eve Mary
Routing in Payment Channel Networks Alice wants to send 3 more coins to Bob Charlie Alice 6 3 3 Bob 3 1 1 3 3 3 1 Eve Mary
Routing in Payment Channel Networks Alice wants to send 3 more coins to Bob Charlie Alice 6 3 3 Bob 3 1 1 3 3 3 1 Eve Mary
Routing in Payment Channel Networks Alice wants to send 3 more coins to Bob Charlie Alice 9 6 3 0 3 6 Bob 0 3 1 1 3 3 3 1 Eve Mary
Routing in Payment Channel Networks Charlie Alice 9 6 Bob 0 0 1 1 3 3 3 1 Eve Mary
Routing in Payment Channel Networks Charlie wants to send 3coins to Bob Charlie Alice 9 6 Bob 0 0 1 1 3 3 3 1 Eve Mary
Payment Channel Network Charlie wants to send 3coins to Bob Charlie Alice 9 6 Bob 0 0 1 1 3 3 3 1 Eve Mary
Payment Channel Network 😟 Charlie wants to send 3coins to Bob Charlie Alice 9 6 Bob 0 0 1 1 3 3 3 1 Eve Mary
The Spider Network Goal: Design routing in payment channel networks for high transaction throughput with a small amount of capital Approach: • Packet-switched Network: Split transactions at senders • Balance aware-routing: Route based on real time balance information
Packet-switched Payment Channel Network Alice wants to send 3 coins to Bob Charlie Alice 6 3 2 Bob 0 1 1 3 3 3 1 Eve Mary
Packet-switched Payment Channel Network Alice wants to send 3 coins to Bob Charlie Alice 6 3 2 Bob 0 1 1 3 3 3 1 Eve Mary
Packet-switched Payment Channel Network 1 Alice wants to send 3 coins to Bob Charlie Alice 2 6 3 2 Bob 0 1 1 3 3 3 1 Eve Mary
Packet-switched Payment Channel Network 1 Alice wants to send 3 coins to Bob Charlie Alice 2 3 3 2 Bob 0 1 1 3 3 3 1 Eve Mary
Packet-switched Payment Channel Network 1 Alice wants to send 3 coins to Bob Charlie Alice 2 3 3 2 Bob 0 1 1 3 3 3 1 Eve Mary
Packet-switched Payment Channel Network 1 Charlie Alice 2 3 6 5 3 2 Bob 0 0 0 1 1 4 3 3 2 3 2 2 1 Eve Mary
Supporting Large Payments Alice needs to send 30 coins to Bob Bob needs to send 30 coins to Alice 5/30 sent 3/30 sent 4/30 sent 1/30 sent Done 0/30 sent 2/30 more Charlie Alice 6 5 0/30 sent 2/30 sent 3/30 sent 1/30 sent Done 5/30 sent 4/30 sent 3 4 2 1 Bob 0
The Routing Problem Fluid Model: Transactions as continuous streams Rates per edge? Topology Payment Graph or Demand c1 Charlie 2 2 1 c6 c2 2 1 c3 2 1 1 c4 c5 Bob Alice Rate on forward edge = Rate on backward edge
What’s the best we can do? Payment Graph Circulation DAG Needs blockchain Can be routed 2 1 1 2 1 1 1 1 + = 2 1 1 1 2 2 1 1 1 1 1 1
Routing the Circulation Topology ruv rvu rvu rvu ruv rvu ruv ruv ruv rvu ruv rvu Maximize sum of rates Constraints: • Rate per edge < capacity • Rate on forward edge = Rate on backward edge
Decentralized Algorithm 6 3 9 pvu puv 0 Price increase Price decrease Eve Charlie
Evaluation Simulator to model transaction processing Transactions modelled off real-time currency exchange data Topology modelled off ISP graphs and currency exchange data
Preliminary Results Circulation Success Percentage
Summary Payment channels promise to improve cryptocurrencies’ scalability Yet, they suffer from imbalance problems We packetize transactions and use balance-aware routing to improve their transaction throughput • Future Work: • End-host rate control mechanisms • In-network scheduling algorithms • Economic incentives for intermediaries
Ripple Results Success Percentage Circulation