Improving the Efficiency of Energy Supply Shipbuilding and Ship-Repairing Enterprises

Prihodko, V.; Prihodko, Irina Valentinovna; Ignatov, Dmitriy Ivanovich

doi:10.21821/2309-5180-2015-7-3-175-186

Cited by 4 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lighting [1], Raidon [2] Flare [6], Sprites (FC '19) [7] REVIVE (CCS '17) [8] Spider (NSDI '20) [9] Flash (CoNEXT '19) [10] TumbleBit (NDSS '17) [3] A 2 L (S&P '21) [4] Perun (S&P '19) [11] Commit-Chains [12] Splicer (This work) Improving throughput Support large transactions Payment channel balance Deadlock-free routing Transaction unlinkability Optimal hub placement other requests can easily cause deadlocks. Existing PCHs (e.g., [3], [4], [11], [12]) inherit the above source routing flaw and design complex cryptographic primitives to provide unlinkability [3], [4] for off-chain payments to obfuscate the relationship between transaction parties, with limited scalability improvements [11], [12], which is the second flaw.…”

Section: Literaturesmentioning

confidence: 99%

“…Flash [10] is also based on source routing, using a modified max-flow algorithm to find paths for large payments, and routing small payments randomly through precomputed paths. Landmark routing is adopted in many prior PCN routing schemes [6], [29], [30]. Each sender computes the shortest path to the wellconnected landmark nodes, and then the landmark nodes route to the destination in k distinct shortest paths.…”

Section: B Performance Of Splicermentioning

confidence: 99%

“…The inappropriate placement of PCHs in PCNs can easily lead to an unbalanced network communication load. However, as shown in Table I, the existing scalable schemes (e.g., [1], [2], [6]- [10]) mainly study the improvement of routing strategies to improve performance. The placement problem has never been discussed, which is the first flaw.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal Hub Placement and Deadlock-Free Routing for Payment Channel Network Scalability

Yang¹,

Dong²,

Gao³

et al. 2023

Preprint

View full text Add to dashboard Cite

<p>As a promising implementation model of payment channel network (PCN), payment channel hub (PCH) could achieve high throughput by providing stable off-chain transactions through powerful hubs. However, existing PCH schemes assume hubs preplaced in advance, not considering payment requests' distribution and may affect network scalability, especially network load balancing. In addition, current source routing protocols with PCH allow each sender to make routing decision on his/her own request, which may have a bad effect on performance scalability (e.g., deadlock) for not considering other senders' requests. This paper proposes a novel multi-PCHs solution with high scalability. First, we are the first to study the PCH placement problem and propose optimal/approximation solutions with load balancing for small-scale and large-scale scenarios, by trading off communication costs among participants and turning the original NP-hard problem into a mixed-integer linear programming (MILP) problem solving by supermodular techniques. Then, on global network states and local directly connected clients' requests, a routing protocol is designed for each PCH with a dynamic adjustment strategy on request processing rates, enabling high-performance deadlock-free routing. Extensive experiments show that our work can effectively balance the network load, and improve the performance on throughput by 29.3% on average compared with state-of-the-arts. </p>

show abstract

Section: Literaturesmentioning

confidence: 99%

Section: B Performance Of Splicermentioning

confidence: 99%

See 1 more Smart Citation

Optimal Hub Placement and Deadlock-Free Routing for Payment Channel Network Scalability

Yang¹,

Dong²,

Gao³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…We use standard linearization techniques to achieve this conversion process. First, we introduce two vectors ϑ and ϕ as the additional optimization variables ϑ = (ϑ nl ∈ {0, 1} : n, l ∈ VSNC), (6) ϕ = (ϕ nlm ∈ {0, 1} : n, l ∈ VSNC, m ∈ VCLI). (7) Second, the linear constraints for ϑ and ϕ are as follows…”

Section: Optimization Placement Problem Solutionsmentioning

confidence: 99%

Optimal Hub Placement and Deadlock-Free Routing for Payment Channel Network Scalability

Yang,

Dong,

Gao

et al. 2023

2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)

View full text Add to dashboard Cite

As a promising implementation model of payment channel network (PCN), payment channel hub (PCH) could achieve high throughput by providing stable off-chain transactions through powerful hubs. However, existing PCH schemes assume hubs are preplaced in advance, not considering payment requests' distribution and may affect network scalability, especially network load balancing. In addition, current source routing protocols with PCH allow each sender to make routing decision on his/her own request, which may have a bad effect on performance scalability (e.g., deadlock) for not considering other senders' requests. This paper proposes a novel multi-PCHs solution with high scalability. First, we are the first to study the PCH placement problem and propose optimal/approximation solutions with load balancing for small-scale and large-scale scenarios, by trading off communication costs among participants and turning the original NP-hard problem into a mixed-integer linear programming (MILP) problem solving by supermodular techniques. Then, on global network states and local directly connected clients' requests, a routing protocol is designed for each PCH with a dynamic adjustment strategy on request processing rates, enabling high-performance deadlock-free routing. Extensive experiments show that our work can effectively balance the network load, and improve the performance on throughput by 29.3% on average compared with state-of-the-arts.

show abstract

“…Solutions to find routes through a payment network in a scalable and decentralized way have been proposed, based on central hubs [ 26 ], rotating global beacons [ 27 ], personal beacons, where overlaps between sender and receiver provide paths [ 28 ], or combinations of multiple schemes [ 29 ].…”

Section: Related Workmentioning

confidence: 99%

Scalable funding of Bitcoin micropayment channel networks

2018

View full text Add to dashboard Cite

The Bitcoin network has scalability problems. To increase its transaction rate and speed, micropayment channel networks have been proposed; however, these require to lock funds into specific channels. Moreover, the available space in the blockchain does not allow scaling to a worldwide payment system. We propose a new layer that sits in between the blockchain and the payment channels. The new layer addresses the scalability problem by enabling trustless off-blockchain channel funding. It consists of shared accounts of groups of nodes that flexibly create one-to-one channels for the payment network. The new system allows rapid changes of the allocation of funds to channels and reduces the cost of opening new channels. Instead of one blockchain transaction per channel, each user only needs one transaction to enter a group of nodes—within the group the user can create arbitrarily many channels. For a group of 20 users with 100 intra-group channels, the cost of the blockchain transactions is reduced by 90% compared to 100 regular micropayment channels opened on the blockchain. This can be increased further to 96% if Bitcoin introduces Schnorr signatures with signature aggregation.

show abstract

Improving the Efficiency of Energy Supply Shipbuilding and Ship-Repairing Enterprises

Cited by 4 publications

References 0 publications

Optimal Hub Placement and Deadlock-Free Routing for Payment Channel Network Scalability

Optimal Hub Placement and Deadlock-Free Routing for Payment Channel Network Scalability

Optimal Hub Placement and Deadlock-Free Routing for Payment Channel Network Scalability

Scalable funding of Bitcoin micropayment channel networks

Contact Info

Product

Resources

About