parent
feb7ad7de0
commit
5f38eb297f
11 changed files with 16 additions and 16 deletions
|
|
@ -288,7 +288,7 @@ class TcpConnectionSpec extends AkkaSpec("""
|
|||
}
|
||||
|
||||
/*
|
||||
* Disabled on Windows: http://support.microsoft.com/kb/214397
|
||||
* Disabled on Windows: https://support.microsoft.com/kb/214397
|
||||
*
|
||||
* "To optimize performance at the application layer, Winsock copies data buffers from application send calls
|
||||
* to a Winsock kernel buffer. Then, the stack uses its own heuristics (such as Nagle algorithm) to determine
|
||||
|
|
@ -462,7 +462,7 @@ class TcpConnectionSpec extends AkkaSpec("""
|
|||
}
|
||||
|
||||
/*
|
||||
* Partly disabled on Windows: http://support.microsoft.com/kb/214397
|
||||
* Partly disabled on Windows: https://support.microsoft.com/kb/214397
|
||||
*
|
||||
* "To optimize performance at the application layer, Winsock copies data buffers from application send calls
|
||||
* to a Winsock kernel buffer. Then, the stack uses its own heuristics (such as Nagle algorithm) to determine
|
||||
|
|
@ -1118,7 +1118,7 @@ class TcpConnectionSpec extends AkkaSpec("""
|
|||
try channel.socket.setSoLinger(true, 0) // causes the following close() to send TCP RST
|
||||
catch {
|
||||
case NonFatal(e) =>
|
||||
// setSoLinger can fail due to http://bugs.sun.com/view_bug.do?bug_id=6799574
|
||||
// setSoLinger can fail due to https://bugs.java.com/bugdatabase/view_bug.do?bug_id=6799574
|
||||
// (also affected: OS/X Java 1.6.0_37)
|
||||
log.debug("setSoLinger(true, 0) failed with {}", e)
|
||||
}
|
||||
|
|
|
|||
|
|
@ -97,7 +97,7 @@ abstract class GroupRouter[T] extends DeferredBehavior[T] {
|
|||
*
|
||||
* @param virtualNodesFactor This factor has to be greater or equal to 1. Assuming that the reader
|
||||
* knows what consistent hashing is
|
||||
* (if not, please refer: http://www.tom-e-white.com/2007/11/consistent-hashing.html or wiki).
|
||||
* (if not, please refer: https://www.tom-e-white.com/2007/11/consistent-hashing.html or wiki).
|
||||
* This number is responsible for creating additional,
|
||||
* virtual addresses for a provided set of routees,
|
||||
* so that in the total number of points on hashing ring
|
||||
|
|
@ -155,7 +155,7 @@ abstract class PoolRouter[T] extends DeferredBehavior[T] {
|
|||
*
|
||||
* @param virtualNodesFactor This factor has to be greater or equal to 1. Assuming that the reader
|
||||
* knows what consistent hashing is
|
||||
* (if not, please refer: http://www.tom-e-white.com/2007/11/consistent-hashing.html or wiki).
|
||||
* (if not, please refer: https://www.tom-e-white.com/2007/11/consistent-hashing.html or wiki).
|
||||
* This number is responsible for creating additional,
|
||||
* virtual addresses for a provided set of routees,
|
||||
* so that in the total number of points on hashing ring
|
||||
|
|
|
|||
|
|
@ -89,7 +89,7 @@ trait GroupRouter[T] extends Behavior[T] {
|
|||
*
|
||||
* @param virtualNodesFactor This factor has to be greater or equal to 1. Assuming that the reader
|
||||
* knows what consistent hashing is
|
||||
* (if not, please refer: http://www.tom-e-white.com/2007/11/consistent-hashing.html or wiki).
|
||||
* (if not, please refer: https://www.tom-e-white.com/2007/11/consistent-hashing.html or wiki).
|
||||
* This number is responsible for creating additional,
|
||||
* virtual addresses for a provided set of routees,
|
||||
* so that in the total number of points on hashing ring
|
||||
|
|
|
|||
|
|
@ -46,7 +46,7 @@ object ActorPaths {
|
|||
/**
|
||||
* This method is used to validate a path element (Actor Name).
|
||||
* Since Actors form a tree, it is addressable using an URL, therefore an Actor Name has to conform to:
|
||||
* <a href="http://www.ietf.org/rfc/rfc2396.txt">RFC-2396</a>.
|
||||
* <a href="https://www.ietf.org/rfc/rfc2396.txt">RFC-2396</a>.
|
||||
*
|
||||
* User defined Actor names may not start from a `$` sign - these are reserved for system names.
|
||||
*/
|
||||
|
|
@ -106,7 +106,7 @@ object ActorPath {
|
|||
/**
|
||||
* This method is used to validate a path element (Actor Name).
|
||||
* Since Actors form a tree, it is addressable using an URL, therefore an Actor Name has to conform to:
|
||||
* <a href="http://www.ietf.org/rfc/rfc2396.txt">RFC-2396</a>.
|
||||
* <a href="https://www.ietf.org/rfc/rfc2396.txt">RFC-2396</a>.
|
||||
*
|
||||
* User defined Actor names may not start from a `$` sign - these are reserved for system names.
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -79,7 +79,7 @@ akka.cluster.metrics {
|
|||
# duration, i.e. after 4 times the half-life, a data sample’s relevance is
|
||||
# reduced to 6% of its original relevance. The initial relevance of a data
|
||||
# sample is given by 1 – 0.5 ^ (collect-interval / half-life).
|
||||
# See http://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average
|
||||
# See https://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average
|
||||
moving-average-half-life = 12s
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -12,13 +12,13 @@ import scala.concurrent.duration.FiniteDuration
|
|||
* of its alpha, or decay factor, this provides a statistical streaming data model
|
||||
* that is exponentially biased towards newer entries.
|
||||
*
|
||||
* http://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average
|
||||
* https://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average
|
||||
*
|
||||
* An EWMA only needs the most recent forecast value to be kept, as opposed to a standard
|
||||
* moving average model.
|
||||
*
|
||||
* @param alpha decay factor, sets how quickly the exponential weighting decays for past data compared to new data,
|
||||
* see http://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average
|
||||
* see https://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average
|
||||
*
|
||||
* @param value the current exponentially weighted moving average, e.g. Y(n - 1), or,
|
||||
* the sampled value resulting from the previous smoothing iteration.
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@
|
|||
* (the "License"); you may not use this file except in compliance with
|
||||
* the License. You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
* https://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
|
|
|
|||
|
|
@ -54,7 +54,7 @@ trait ReplicatedData {
|
|||
* receiving side, resulting in set {'a', 'b', 'c', 'd'}.
|
||||
*
|
||||
* Learn more about this in the paper
|
||||
* <a href="http://arxiv.org/abs/1603.01529">Delta State Replicated Data Types</a>.
|
||||
* <a href="https://arxiv.org/abs/1603.01529">Delta State Replicated Data Types</a>.
|
||||
*/
|
||||
trait DeltaReplicatedData extends ReplicatedData {
|
||||
|
||||
|
|
|
|||
|
|
@ -603,7 +603,7 @@ Java
|
|||
|
||||
The ConsistentHashingPool uses [consistent hashing](https://en.wikipedia.org/wiki/Consistent_hashing)
|
||||
to select a routee based on the sent message. This
|
||||
[article](http://www.tom-e-white.com/2007/11/consistent-hashing.html) gives good
|
||||
[article](https://www.tom-e-white.com/2007/11/consistent-hashing.html) gives good
|
||||
insight into how consistent hashing is implemented.
|
||||
|
||||
There is 3 ways to define what data to use for the consistent hash key.
|
||||
|
|
|
|||
|
|
@ -5,7 +5,7 @@
|
|||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
* https://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
|
|
|
|||
|
|
@ -5,7 +5,7 @@
|
|||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
* https://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue