psinet.go 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387
  1. /*
  2. * Copyright (c) 2016, Psiphon Inc.
  3. * All rights reserved.
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. *
  18. */
  19. // Package psinet implements psinet database services. The psinet database is a
  20. // JSON-format file containing information about the Psiphon network, including
  21. // sponsors, home pages, stats regexes, available upgrades, and other servers for
  22. // discovery. This package also implements the Psiphon discovery algorithm.
  23. package psinet
  24. import (
  25. "encoding/json"
  26. "math"
  27. "math/rand"
  28. "strconv"
  29. "strings"
  30. "time"
  31. "github.com/Psiphon-Labs/psiphon-tunnel-core/psiphon/common"
  32. )
  33. const (
  34. MAX_DATABASE_AGE_FOR_SERVER_ENTRY_VALIDITY = 48 * time.Hour
  35. )
  36. // Database serves Psiphon API data requests. It's safe for
  37. // concurrent usage. The Reload function supports hot reloading
  38. // of Psiphon network data while the server is running.
  39. type Database struct {
  40. common.ReloadableFile
  41. Sponsors map[string]*Sponsor `json:"sponsors"`
  42. Versions map[string][]ClientVersion `json:"client_versions"`
  43. DefaultSponsorID string `json:"default_sponsor_id"`
  44. ValidServerEntryTags map[string]bool `json:"valid_server_entry_tags"`
  45. DiscoveryServers []*DiscoveryServer `json:"discovery_servers"`
  46. fileModTime time.Time
  47. }
  48. type DiscoveryServer struct {
  49. DiscoveryDateRange []time.Time `json:"discovery_date_range"`
  50. EncodedServerEntry string `json:"encoded_server_entry"`
  51. }
  52. type Sponsor struct {
  53. ID string `json:"id"`
  54. HomePages map[string][]HomePage `json:"home_pages"`
  55. MobileHomePages map[string][]HomePage `json:"mobile_home_pages"`
  56. HttpsRequestRegexes []HttpsRequestRegex `json:"https_request_regexes"`
  57. }
  58. type ClientVersion struct {
  59. Version string `json:"version"`
  60. }
  61. type HomePage struct {
  62. Region string `json:"region"`
  63. URL string `json:"url"`
  64. }
  65. type HttpsRequestRegex struct {
  66. Regex string `json:"regex"`
  67. Replace string `json:"replace"`
  68. }
  69. // NewDatabase initializes a Database, calling Reload on the specified
  70. // filename.
  71. func NewDatabase(filename string) (*Database, error) {
  72. database := &Database{}
  73. database.ReloadableFile = common.NewReloadableFile(
  74. filename,
  75. true,
  76. func(fileContent []byte, fileModTime time.Time) error {
  77. var newDatabase *Database
  78. err := json.Unmarshal(fileContent, &newDatabase)
  79. if err != nil {
  80. return common.ContextError(err)
  81. }
  82. // Note: an unmarshal directly into &database would fail
  83. // to reset to zero value fields not present in the JSON.
  84. database.Sponsors = newDatabase.Sponsors
  85. database.Versions = newDatabase.Versions
  86. database.DefaultSponsorID = newDatabase.DefaultSponsorID
  87. database.ValidServerEntryTags = newDatabase.ValidServerEntryTags
  88. database.DiscoveryServers = newDatabase.DiscoveryServers
  89. database.fileModTime = fileModTime
  90. return nil
  91. })
  92. _, err := database.Reload()
  93. if err != nil {
  94. return nil, common.ContextError(err)
  95. }
  96. return database, nil
  97. }
  98. // GetRandomizedHomepages returns a randomly ordered list of home pages
  99. // for the specified sponsor, region, and platform.
  100. func (db *Database) GetRandomizedHomepages(sponsorID, clientRegion string, isMobilePlatform bool) []string {
  101. homepages := db.GetHomepages(sponsorID, clientRegion, isMobilePlatform)
  102. if len(homepages) > 1 {
  103. shuffledHomepages := make([]string, len(homepages))
  104. perm := rand.Perm(len(homepages))
  105. for i, v := range perm {
  106. shuffledHomepages[v] = homepages[i]
  107. }
  108. return shuffledHomepages
  109. }
  110. return homepages
  111. }
  112. // GetHomepages returns a list of home pages for the specified sponsor,
  113. // region, and platform.
  114. func (db *Database) GetHomepages(sponsorID, clientRegion string, isMobilePlatform bool) []string {
  115. db.ReloadableFile.RLock()
  116. defer db.ReloadableFile.RUnlock()
  117. sponsorHomePages := make([]string, 0)
  118. // Sponsor id does not exist: fail gracefully
  119. sponsor, ok := db.Sponsors[sponsorID]
  120. if !ok {
  121. sponsor, ok = db.Sponsors[db.DefaultSponsorID]
  122. if !ok {
  123. return sponsorHomePages
  124. }
  125. }
  126. if sponsor == nil {
  127. return sponsorHomePages
  128. }
  129. homePages := sponsor.HomePages
  130. if isMobilePlatform {
  131. if len(sponsor.MobileHomePages) > 0 {
  132. homePages = sponsor.MobileHomePages
  133. }
  134. }
  135. // Case: lookup succeeded and corresponding homepages found for region
  136. homePagesByRegion, ok := homePages[clientRegion]
  137. if ok {
  138. for _, homePage := range homePagesByRegion {
  139. sponsorHomePages = append(sponsorHomePages, strings.Replace(homePage.URL, "client_region=XX", "client_region="+clientRegion, 1))
  140. }
  141. }
  142. // Case: lookup failed or no corresponding homepages found for region --> use default
  143. if len(sponsorHomePages) == 0 {
  144. defaultHomePages, ok := homePages["None"]
  145. if ok {
  146. for _, homePage := range defaultHomePages {
  147. // client_region query parameter substitution
  148. sponsorHomePages = append(sponsorHomePages, strings.Replace(homePage.URL, "client_region=XX", "client_region="+clientRegion, 1))
  149. }
  150. }
  151. }
  152. return sponsorHomePages
  153. }
  154. // GetUpgradeClientVersion returns a new client version when an upgrade is
  155. // indicated for the specified client current version. The result is "" when
  156. // no upgrade is available. Caller should normalize clientPlatform.
  157. func (db *Database) GetUpgradeClientVersion(clientVersion, clientPlatform string) string {
  158. db.ReloadableFile.RLock()
  159. defer db.ReloadableFile.RUnlock()
  160. // Check lastest version number against client version number
  161. clientVersions, ok := db.Versions[clientPlatform]
  162. if !ok {
  163. return ""
  164. }
  165. if len(clientVersions) == 0 {
  166. return ""
  167. }
  168. // NOTE: Assumes versions list is in ascending version order
  169. lastVersion := clientVersions[len(clientVersions)-1].Version
  170. lastVersionInt, err := strconv.Atoi(lastVersion)
  171. if err != nil {
  172. return ""
  173. }
  174. clientVersionInt, err := strconv.Atoi(clientVersion)
  175. if err != nil {
  176. return ""
  177. }
  178. // Return latest version if upgrade needed
  179. if lastVersionInt > clientVersionInt {
  180. return lastVersion
  181. }
  182. return ""
  183. }
  184. // GetHttpsRequestRegexes returns bytes transferred stats regexes for the
  185. // specified sponsor.
  186. func (db *Database) GetHttpsRequestRegexes(sponsorID string) []map[string]string {
  187. db.ReloadableFile.RLock()
  188. defer db.ReloadableFile.RUnlock()
  189. regexes := make([]map[string]string, 0)
  190. sponsor, ok := db.Sponsors[sponsorID]
  191. if !ok {
  192. sponsor, _ = db.Sponsors[db.DefaultSponsorID]
  193. }
  194. if sponsor == nil {
  195. return regexes
  196. }
  197. // If neither sponsorID or DefaultSponsorID were found, sponsor will be the
  198. // zero value of the map, an empty Sponsor struct.
  199. for _, sponsorRegex := range sponsor.HttpsRequestRegexes {
  200. regex := make(map[string]string)
  201. regex["replace"] = sponsorRegex.Replace
  202. regex["regex"] = sponsorRegex.Regex
  203. regexes = append(regexes, regex)
  204. }
  205. return regexes
  206. }
  207. // DiscoverServers selects new encoded server entries to be "discovered" by
  208. // the client, using the discoveryValue -- a function of the client's IP
  209. // address -- as the input into the discovery algorithm.
  210. func (db *Database) DiscoverServers(discoveryValue int) []string {
  211. db.ReloadableFile.RLock()
  212. defer db.ReloadableFile.RUnlock()
  213. var servers []*DiscoveryServer
  214. discoveryDate := time.Now().UTC()
  215. candidateServers := make([]*DiscoveryServer, 0)
  216. for _, server := range db.DiscoveryServers {
  217. // All servers that are discoverable on this day are eligible for discovery
  218. if len(server.DiscoveryDateRange) == 2 &&
  219. discoveryDate.After(server.DiscoveryDateRange[0]) &&
  220. discoveryDate.Before(server.DiscoveryDateRange[1]) {
  221. candidateServers = append(candidateServers, server)
  222. }
  223. }
  224. timeInSeconds := int(discoveryDate.Unix())
  225. servers = selectServers(candidateServers, timeInSeconds, discoveryValue)
  226. encodedServerEntries := make([]string, 0)
  227. for _, server := range servers {
  228. encodedServerEntries = append(encodedServerEntries, server.EncodedServerEntry)
  229. }
  230. return encodedServerEntries
  231. }
  232. // Combine client IP address and time-of-day strategies to give out different
  233. // discovery servers to different clients. The aim is to achieve defense against
  234. // enumerability. We also want to achieve a degree of load balancing clients
  235. // and these strategies are expected to have reasonably random distribution,
  236. // even for a cluster of users coming from the same network.
  237. //
  238. // We only select one server: multiple results makes enumeration easier; the
  239. // strategies have a built-in load balancing effect; and date range discoverability
  240. // means a client will actually learn more servers later even if they happen to
  241. // always pick the same result at this point.
  242. //
  243. // This is a blended strategy: as long as there are enough servers to pick from,
  244. // both aspects determine which server is selected. IP address is given the
  245. // priority: if there are only a couple of servers, for example, IP address alone
  246. // determines the outcome.
  247. func selectServers(
  248. servers []*DiscoveryServer, timeInSeconds, discoveryValue int) []*DiscoveryServer {
  249. TIME_GRANULARITY := 3600
  250. if len(servers) == 0 {
  251. return nil
  252. }
  253. // Time truncated to an hour
  254. timeStrategyValue := timeInSeconds / TIME_GRANULARITY
  255. // Divide servers into buckets. The bucket count is chosen such that the number
  256. // of buckets and the number of items in each bucket are close (using sqrt).
  257. // IP address selects the bucket, time selects the item in the bucket.
  258. // NOTE: this code assumes that the range of possible timeStrategyValues
  259. // and discoveryValues are sufficient to index to all bucket items.
  260. bucketCount := calculateBucketCount(len(servers))
  261. buckets := bucketizeServerList(servers, bucketCount)
  262. if len(buckets) == 0 {
  263. return nil
  264. }
  265. bucket := buckets[discoveryValue%len(buckets)]
  266. if len(bucket) == 0 {
  267. return nil
  268. }
  269. server := bucket[timeStrategyValue%len(bucket)]
  270. serverList := make([]*DiscoveryServer, 1)
  271. serverList[0] = server
  272. return serverList
  273. }
  274. // Number of buckets such that first strategy picks among about the same number
  275. // of choices as the second strategy. Gives an edge to the "outer" strategy.
  276. func calculateBucketCount(length int) int {
  277. return int(math.Ceil(math.Sqrt(float64(length))))
  278. }
  279. // bucketizeServerList creates nearly equal sized slices of the input list.
  280. func bucketizeServerList(servers []*DiscoveryServer, bucketCount int) [][]*DiscoveryServer {
  281. // This code creates the same partitions as legacy servers:
  282. // https://bitbucket.org/psiphon/psiphon-circumvention-system/src/03bc1a7e51e7c85a816e370bb3a6c755fd9c6fee/Automation/psi_ops_discovery.py
  283. //
  284. // Both use the same algorithm from:
  285. // http://stackoverflow.com/questions/2659900/python-slicing-a-list-into-n-nearly-equal-length-partitions
  286. // TODO: this partition is constant for fixed Database content, so it could
  287. // be done once and cached in the Database ReloadableFile reloadAction.
  288. buckets := make([][]*DiscoveryServer, bucketCount)
  289. division := float64(len(servers)) / float64(bucketCount)
  290. for i := 0; i < bucketCount; i++ {
  291. start := int((division * float64(i)) + 0.5)
  292. end := int((division * (float64(i) + 1)) + 0.5)
  293. buckets[i] = servers[start:end]
  294. }
  295. return buckets
  296. }
  297. // IsValidServerEntryTag checks if the specified server entry tag is valid.
  298. func (db *Database) IsValidServerEntryTag(serverEntryTag string) bool {
  299. db.ReloadableFile.RLock()
  300. defer db.ReloadableFile.RUnlock()
  301. // Default to "valid" if the valid list is unexpectedly empty or stale. This
  302. // helps prevent premature client-side server-entry pruning when there is an
  303. // issue with updating the database.
  304. if len(db.ValidServerEntryTags) == 0 ||
  305. db.fileModTime.Add(MAX_DATABASE_AGE_FOR_SERVER_ENTRY_VALIDITY).Before(time.Now()) {
  306. return true
  307. }
  308. // The tag must be in the map and have the value "true".
  309. return db.ValidServerEntryTags[serverEntryTag]
  310. }