Package com.subgraph.orchid

Examples of com.subgraph.orchid.Router

56
57
58
59
60
61
62
63
64
65
66
   * @param routerFilter
   * @return The chosen router or 'null' if no suitable router is available.
   */
  public Router chooseRandomNode(WeightRule rule, RouterFilter routerFilter) {
    final List<Router> candidates = getFilteredRouters(routerFilter, true);
    final Router choice = chooseByBandwidth(candidates, rule);
    if(choice == null) {
      // try again with more permissive flags
      return null;
    }
    return choice;
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
   
    return routers;
  }

  private Router chooseByBandwidth(List<Router> candidates, WeightRule rule) {
    final Router choice = chooseNodeByBandwidthWeights(candidates, rule);
    if(choice != null) {
      return choice;
    } else {
      return chooseNodeByBandwidth(candidates, rule);
    }
View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
    return usableRouters;
  }
 
  private void addRouterIfUsableAndNotExcluded(GuardEntry entry, Set<Router> excluded, List<Router> routers) {
    if(entry.testCurrentlyUsable() && entry.getDownSince() == null) {
      final Router r = entry.getRouterForEntry();
      if(r != null && !excluded.contains(r)) {
        routers.add(r);
      }
    }
  }
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
  }

  private void addPendingInitialConnections(Set<Router> routerSet) {
    for(GuardEntry entry: pendingProbes) {
      if(!entry.isAdded()) {
        Router r = entry.getRouterForEntry();
        if(r != null) {
          routerSet.add(r);
        }
      }
    }
View Full Code Here
188
189
190
191
192
193
194
195
196
197
198
  }

  private void maybeChooseNew(int usableSize, int minSize, Set<Router> excluded) {
    int sz = usableSize + countPendingInitialProbes();
    while(sz < minSize) { 
      Router newGuard = chooseNewGuard(excluded);
      if(newGuard == null) {
        logger.warning("Need to add entry guards but no suitable guard routers are available");
        return;
      }
      logger.fine("Testing "+ newGuard + " as a new guard since we only have "+ usableSize + " usable guards");
View Full Code Here
19
20
21
22
23
24
25
26
27
28
29
    this.entryGuards = entryGuards;
    this.entry = entry;
  }
 
  public void run() {
    final Router router = entry.getRouterForEntry();
    if(router == null) {
      entryGuards.probeConnectionFailed(entry);
      return;
    }
    try {
View Full Code Here
50
51
52
53
54
55
56
57
    }
    return 0;
  }
 
  private String getHexIdForIndex(int idx) {
    final Router r = hsDirectories.get(idx);
    return r.getIdentityHash().toString();
  }
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
    }
  }
 
  private void swap(List<Router> dirs, int idx1, int idx2) {
    if(idx1 != idx2) {
      final Router r1 = dirs.get(idx1);
      final Router r2 = dirs.get(idx2);
      dirs.set(idx1, r2);
      dirs.set(idx2, r1);
    }
  }
View Full Code Here
TOP

Related Classes of com.subgraph.orchid.Router

  • com.subgraph.orchid.circuits.CircuitBuildTask
  • com.subgraph.orchid.circuits.CircuitCreationTask
  • com.subgraph.orchid.circuits.CircuitExtender
  • com.subgraph.orchid.circuits.guards.EntryGuards
  • com.subgraph.orchid.circuits.guards.GuardProbeTask
  • com.subgraph.orchid.circuits.hs.HSDirectories
  • com.subgraph.orchid.circuits.hs.RendezvousCircuitBuilder
  • com.subgraph.orchid.circuits.path.BandwidthWeightedRouters
  • com.subgraph.orchid.circuits.path.CircuitNodeChooser
  • com.subgraph.orchid.circuits.path.CircuitPathChooser
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.