Questions tagged [peer-to-peer]
11 questions
4
votes
1 answer
How would P2P Kriegspiel be designed?
Kriegspiel chess is a variant of chess in which each player is not aware of where the opponent's pieces are. In a human match, a trusted intermediary relays piece losses, legality of moves etc. This is, of course possible on a computer as well. What…
Rusty
- 43
- 3
4
votes
0 answers
How to realize a distributed queue with unreliable participants?
I want to build an application that relies on a distributed queue with participants in a decentralized (peer-to-peer) network. The participants cannot be relied on to correctly follow a protocol.
I found the distributed queue dual-bus algorithm, but…
Marcel Klehr
- 229
- 1
- 4
4
votes
2 answers
Can systems that prevent double-spending (e.g. crypto-currencies) be used to attach other unique data?
The Bitcoin-solution can be described as "[...] a solution to the double-spending problem using a peer-to-peer network. (official Bitcoin paper, PDF, abstract, first page).
Now I wonder if a similar technology can be used to collect, send and…
nilshi
- 141
- 2
2
votes
2 answers
outside of bitcoin, how does a network negotiate what the next blockchain should be?
There are two problems I see with negotiating the next block chain:
which transactions to include in the chain (because consider transaction T which has propagated through exactly 49% of the network at the time the next block is negotiated)
which…
Leah Zorychta
- 233
- 3
- 7
2
votes
1 answer
Use AVL trees instead of Chord algorithm for Distributed Peer to peer Hash tables
In distributed systems we use the Chord algorithm to create a p2p distributed hash table. While this algorithm is very useful and efficient wouldn't it be better if we used an AVL tree? Chord algorithm relies a lot to the hash function (in order for…
John Demetriou
- 413
- 5
- 14
1
vote
1 answer
Local to global algorithms in gossip based P2P networks
Suppose we have a peer to peer network of, say, $n$ peers. Peers communicate by an asynchronous randomized gossip protocol (Push, Pull, Push/Pull doesn't really matter here). The task is for any local peer to get an (approximate) picture of the…
Mark Neuhaus
- 111
- 4
1
vote
1 answer
What mathmatical model shall be used for describing P2P processes interaction?
I am creating a distributed service system. It runs in the cloud on heterogeneous hardware. I am using C# .NET for business logic and C++ for different physics\chemical calculations. Having three logic applications and 2xN heavy calculation…
DuckQueen
- 201
- 1
- 2
1
vote
2 answers
Chord Ring with limited table size of 3
In the normal case of a chord ring the big O notation of the look up is O(logn) because of long haul pointers of the Finger Table (or Routing Table).
In this question what if the Finger Table has a limit of size 3
(1) I would like to ask the Big O…
DarkArtistry
- 121
- 2
1
vote
1 answer
About P2P networking
In P2P(peer-to-peer) networking, it is possible for the server program(software) and the client program(software) to be running on the same computer.
So the two must have the same IP address.
I am confused about this. Is there nothing going wrong if…
Kartikey
- 111
- 2
0
votes
1 answer
Chord protocol - How should I go about mapping nodes to placeholders on the ring?
In the real world, how is a node mapped to the position on the ring,
Each nodes's IP address is hashed using SHA-1 hashing algorithm which will produce this hash - 73.128.154.69 hashed into 60CBFB98C9052A425D684A2C3D8D8D38424129A3.
This should…
Shintu Joseph
- 103
- 3
0
votes
0 answers
Which option is most efficient for the design of my multi-peer connection (session)?
This is my first time working with peer to peer connections, Im using WebRTC. If possible I'd like to design my multi-peer connection (session) so that there's no limit to the number of peers who could potentially connect to this session.
The…
J.Todd
- 121
- 3