Sort relays in 50ms latency increments, shuffle relays within the same increment
This commit is contained in:
parent
9047d56aa0
commit
eeb5d99942
@ -6,6 +6,7 @@ import (
|
|||||||
"crypto/tls"
|
"crypto/tls"
|
||||||
"encoding/json"
|
"encoding/json"
|
||||||
"fmt"
|
"fmt"
|
||||||
|
"math/rand"
|
||||||
"net/http"
|
"net/http"
|
||||||
"net/url"
|
"net/url"
|
||||||
"sort"
|
"sort"
|
||||||
@ -82,7 +83,7 @@ func (c *dynamicClient) Serve() {
|
|||||||
addrs = append(addrs, ruri.String())
|
addrs = append(addrs, ruri.String())
|
||||||
}
|
}
|
||||||
|
|
||||||
for _, addr := range relayAddressesSortedByLatency(addrs) {
|
for _, addr := range relayAddressesOrder(addrs) {
|
||||||
select {
|
select {
|
||||||
case <-c.stop:
|
case <-c.stop:
|
||||||
l.Debugln(c, "stopping")
|
l.Debugln(c, "stopping")
|
||||||
@ -176,42 +177,44 @@ type dynamicAnnouncement struct {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// relayAddressesSortedByLatency adds local latency to the relay, and sorts them
|
// relayAddressesOrder checks the latency to each relay, rounds latency down to
|
||||||
// by sum latency, and returns the addresses.
|
// the closest 50ms, and puts them in buckets of 50ms latency ranges. Then
|
||||||
func relayAddressesSortedByLatency(input []string) []string {
|
// shuffles each bucket, and returns all addresses starting with the ones from
|
||||||
relays := make(relayList, len(input))
|
// the lowest latency bucket, ending with the highest latency buceket.
|
||||||
for i, relay := range input {
|
func relayAddressesOrder(input []string) []string {
|
||||||
if latency, err := osutil.GetLatencyForURL(relay); err == nil {
|
buckets := make(map[int][]string)
|
||||||
relays[i] = relayWithLatency{relay, int(latency / time.Millisecond)}
|
|
||||||
} else {
|
for _, relay := range input {
|
||||||
relays[i] = relayWithLatency{relay, int(time.Hour / time.Millisecond)}
|
latency, err := osutil.GetLatencyForURL(relay)
|
||||||
}
|
if err != nil {
|
||||||
|
latency = time.Hour
|
||||||
}
|
}
|
||||||
|
|
||||||
sort.Sort(relays)
|
id := int(latency/time.Millisecond) / 50
|
||||||
|
|
||||||
addresses := make([]string, len(relays))
|
buckets[id] = append(buckets[id], relay)
|
||||||
for i, relay := range relays {
|
|
||||||
addresses[i] = relay.relay
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
var ids []int
|
||||||
|
for id, bucket := range buckets {
|
||||||
|
shuffle(bucket)
|
||||||
|
ids = append(ids, id)
|
||||||
|
}
|
||||||
|
|
||||||
|
sort.Ints(ids)
|
||||||
|
|
||||||
|
addresses := make([]string, len(input))
|
||||||
|
|
||||||
|
for _, id := range ids {
|
||||||
|
addresses = append(addresses, buckets[id]...)
|
||||||
|
}
|
||||||
|
|
||||||
return addresses
|
return addresses
|
||||||
}
|
}
|
||||||
|
|
||||||
type relayWithLatency struct {
|
func shuffle(slice []string) {
|
||||||
relay string
|
for i := len(slice) - 1; i > 0; i-- {
|
||||||
latency int
|
j := rand.Intn(i + 1)
|
||||||
|
slice[i], slice[j] = slice[j], slice[i]
|
||||||
}
|
}
|
||||||
|
|
||||||
type relayList []relayWithLatency
|
|
||||||
|
|
||||||
func (l relayList) Len() int {
|
|
||||||
return len(l)
|
|
||||||
}
|
|
||||||
|
|
||||||
func (l relayList) Less(a, b int) bool {
|
|
||||||
return l[a].latency < l[b].latency
|
|
||||||
}
|
|
||||||
|
|
||||||
func (l relayList) Swap(a, b int) {
|
|
||||||
l[a], l[b] = l[b], l[a]
|
|
||||||
}
|
}
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user