Orchestrating parallel TCP connections: Cyclic and probabilistic polling policies

► We study both the AIMD and MIMD mechanisms for parallel TCP. ► The AIMD mechanism is analyzed for both cyclic and probabilistic polling strategies. ► The AIMD optimal visit order, or optimal visit probabilities are found. ► The relation between the MIMD and the M/G/1 batch service queue is revealed.