aboutsummaryrefslogtreecommitdiffstats
path: root/p2p/discover/table.go
Commit message (Collapse)AuthorAgeFilesLines
* p2p/discover: prevent bonding selfFelix Lange2016-05-031-0/+4
|
* all: Rename crypto.Sha3{,Hash}() to crypto.Keccak256{,Hash}()Ricardo Catalinas Jiménez2016-02-221-3/+3
| | | | As we aren't really using the standarized SHA-3
* p2p, p2p/discover: track bootstrap state in p2p/discoverFelix Lange2015-12-181-37/+68
| | | | | | This change simplifies the dial scheduling logic because it no longer needs to track whether the discovery table has been bootstrapped.
* p2p/discover: support incomplete node URLs, add ResolveFelix Lange2015-12-181-2/+24
|
* node: customizable protocol and service stacksPéter Szilágyi2015-11-271-4/+3
|
* p2p/discover: remove unused lastLookup fieldFelix Lange2015-09-301-6/+1
|
* p2p/discover: fix race involving the seed node iteratorFelix Lange2015-09-301-56/+105
| | | | | | | | | | | | | | | | | | | nodeDB.querySeeds was not safe for concurrent use but could be called concurrenty on multiple goroutines in the following case: - the table was empty - a timed refresh started - a lookup was started and initiated refresh These conditions are unlikely to coincide during normal use, but are much more likely to occur all at once when the user's machine just woke from sleep. The root cause of the issue is that querySeeds reused the same leveldb iterator until it was exhausted. This commit moves the refresh scheduling logic into its own goroutine (so only one refresh is ever active) and changes querySeeds to not use a persistent iterator. The seed node selection is now more random and ignores nodes that have not been contacted in the last 5 days.
* p2p/discover: don't attempt to replace nodes that are being replacedFelix Lange2015-08-191-4/+11
| | | | | | | | PR #1621 changed Table locking so the mutex is not held while a contested node is being pinged. If multiple nodes ping the local node during this time window, multiple ping packets will be sent to the contested node. The changes in this commit prevent multiple packets by tracking whether the node is being replaced.
* p2p/discover: unlock the table during ping replacementFelix Lange2015-08-111-48/+73
| | | | | | Table.mutex was being held while waiting for a reply packet, which effectively made many parts of the whole stack block on that packet, including the net_peerCount RPC call.
* p2p/discover: close Table during testingFelix Lange2015-08-061-1/+3
| | | | Not closing the table used to be fine, but now the table has a database.
* all: fix license headers one more timeFelix Lange2015-07-241-1/+1
| | | | I forgot to update one instance of "go-ethereum" in commit 3f047be5a.
* all: update license headers to distiguish GPL/LGPLFelix Lange2015-07-231-4/+4
| | | | | All code outside of cmd/ is licensed as LGPL. The headers now reflect this by calling the whole work "the go-ethereum library".
* all: update license informationFelix Lange2015-07-071-0/+16
|
* p2p/discover: deflake TestUDP_successfulPingFelix Lange2015-06-101-0/+8
|
* p2p/discover: bond with seed nodes too (runs only if findnode failed)Péter Szilágyi2015-05-271-7/+4
|
* p2p/discovery: fix a cornercase loop if no seeds or bootnodes are knownPéter Szilágyi2015-05-271-5/+9
|
* p2p/discover: force refresh if the table is emptyPéter Szilágyi2015-05-271-13/+41
|
* p2p/discover: permit temporary bond failures for previously known nodesPéter Szilágyi2015-05-271-12/+15
|
* p2p/discover: watch find failures, evacuate on too many, rebond if failedPéter Szilágyi2015-05-271-8/+47
|
* p2p/discover: add ReadRandomNodesFelix Lange2015-05-251-0/+49
|
* p2p/discover: fix #838, evacuate self entries from the node dbPéter Szilágyi2015-05-221-2/+2
|
* p2p/discover: bump maxBondingPingPongs to 16Felix Lange2015-05-141-1/+1
| | | | | This should increase the speed a bit because all findnode results (up to 16) can be verified at the same time.
* p2p/discover: new distance metric based on sha3(id)Felix Lange2015-05-061-24/+30
| | | | | | | The previous metric was pubkey1^pubkey2, as specified in the Kademlia paper. We missed that EC public keys are not uniformly distributed. Using the hash of the public keys addresses that. It also makes it a bit harder to generate node IDs that are close to a particular node.
* p2p/discover: track sha3(ID) in NodeFelix Lange2015-04-301-5/+6
|
* p2p/discover: new endpoint formatFelix Lange2015-04-301-7/+2
| | | | | | This commit changes the discovery protocol to use the new "v4" endpoint format, which allows for separate UDP and TCP ports and makes it possible to discover the UDP address after NAT.
* p2p/discover: fix goroutine leak due to blocking on sync.OncePéter Szilágyi2015-04-281-1/+1
|
* p2p/discover: add node expirer and related testsPéter Szilágyi2015-04-271-0/+2
|
* p2p/discover: parametrize nodedb version, add persistency testsPéter Szilágyi2015-04-271-2/+2
|
* p2p/discover: wrap the pinger to update the node db tooPéter Szilágyi2015-04-271-4/+15
|
* p2p/discover: write the basic tests, catch RLP bugPéter Szilágyi2015-04-271-1/+1
|
* p2p/discovery: fix issues raised in the nodeDb PRPéter Szilágyi2015-04-271-3/+2
|
* cmd/bootnode, eth, p2p, p2p/discover: use a fancier db designPéter Szilágyi2015-04-241-11/+25
|
* cmd/bootnode, eth, p2p, p2p/discover: clean up the seeder and mesh into eth.Péter Szilágyi2015-04-241-13/+10
|
* p2p/discovery: use the seed table for finding nodes, auto drop stale onesPéter Szilágyi2015-04-241-2/+8
|
* cmd, eth, p2p, p2p/discover: init and clean up the seed cachePéter Szilágyi2015-04-241-3/+13
|
* p2p/discover: store nodes in leveldbFelix Lange2015-04-241-1/+2
|
* p2p/discover: remove unused field Node.activeStampFelix Lange2015-04-131-1/+0
|
* p2p/discover: fix off by one error causing buckets to contain duplicatesFelix Lange2015-04-011-1/+1
|
* p2p/discover: implement node bondingFelix Lange2015-04-011-50/+133
| | | | | | | | | | | | | | | | This a fix for an attack vector where the discovery protocol could be used to amplify traffic in a DDOS attack. A malicious actor would send a findnode request with the IP address and UDP port of the target as the source address. The recipient of the findnode packet would then send a neighbors packet (which is 16x the size of findnode) to the victim. Our solution is to require a 'bond' with the sender of findnode. If no bond exists, the findnode packet is not processed. A bond between nodes α and β is created when α replies to a ping from β. This (initial) version of the bonding implementation might still be vulnerable against replay attacks during the expiration time window. We will add stricter source address validation later.
* p2p: server>discover table Self=Node exportedzelig2015-03-151-3/+3
|
* p2p/discover: code review fixesFelix Lange2015-02-131-4/+4
|
* p2p/discover: deflake UDP testsFelix Lange2015-02-091-1/+2
|
* cmd/ethereum, cmd/mist: add flag for discovery bootstrap nodesFelix Lange2015-02-071-2/+2
|
* p2p/discover: add node URL functions, distinguish TCP/UDP portsFelix Lange2015-02-071-193/+4
| | | | | The discovery RPC protocol does not yet distinguish TCP and UDP ports. But it can't hurt to do so in our internal model.
* p2p/discover: add some helper functionsFelix Lange2015-02-061-8/+29
|
* p2p/discover: new package implementing the Node Discovery ProtocolFelix Lange2015-02-061-0/+447
generated by cgit v1.2.3 (git 2.25.1) at 2025-03-10 20:36:50 +0800