Backpressure routing
In queueing theory, a discipline within the mathematical theory of probability, the backpressure routing algorithm is a method for directing traffic around a queueing network that achieves maximum net
Two-tree broadcast
The two-tree broadcast (abbreviated 2tree-broadcast or 23-broadcast) is an algorithm that implements a broadcast communication pattern on a distributed system using message passing.A broadcast is a co
Drift plus penalty
In the mathematical theory of probability, the drift-plus-penalty method is used for optimization of queueing networks and other stochastic systems. The technique is for stabilizing a queueing network
Consolidation ratio
Consolidation ratio within network infrastructure for Internet hosting, is the number of virtual servers that can run on each physical host machine. Many companies arrive at that figure through trial
Lyapunov optimization
This article describes Lyapunov optimization for dynamical systems. It gives an example application to optimal control in queueing networks.
Nagle's algorithm
Nagle's algorithm is a means of improving the efficiency of TCP/IP networks by reducing the number of packets that need to be sent over the network. It was defined by John Nagle while working for Ford
Network-based diffusion analysis
Network-based diffusion analysis (NBDA) is a statistical tool to detect and quantify social transmission of information or a behaviour in social networks (SNA, etc.). NBDA assumes that of a behavior f
Generic cell rate algorithm
The generic cell rate algorithm (GCRA) is a leaky bucket-type scheduling algorithm for the network scheduler that is used in Asynchronous Transfer Mode (ATM) networks. It is used to measure the timing
Luleå algorithm
The Luleå algorithm of computer science, designed by , is a technique for storing and searching internet routing tables efficiently. It is named after the Luleå University of Technology, the home inst
Chung Kwei (algorithm)
Chung Kwei is a spam filtering algorithm based on the TEIRESIAS Algorithm for finding coding genes within bulk DNA. It is named after Zhong Kui, a figure in Chinese folklore.
Karn's algorithm
Karn's algorithm addresses the problem of getting accurate estimates of the round-trip time for messages when using the Transmission Control Protocol (TCP) in computer networking. The algorithm, also