Concepts inMinimizing average latency in oblivious routing
Routing
Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the telephone network, electronic data networks (such as the Internet), and transportation networks. This article is concerned primarily with routing in electronic data networks using packet switching technology.
more from Wikipedia
Online algorithm
In computer science, an online algorithm is one that can process its input piece-by-piece in a serial fashion, i.e. , in the order that the input is fed to the algorithm, without having the entire input available from the start. In contrast, an offline algorithm is given the whole problem data from the beginning and is required to output an answer which solves the problem at hand.
more from Wikipedia
Competitive analysis (online algorithm)
Competitive analysis is a method invented for analyzing online algorithms, in which the performance of an online algorithm (which must satisfy an unpredictable sequence of requests, completing each request without being able to see the future) is compared to the performance of an optimal offline algorithm that can view the sequence of requests in advance. An algorithm is competitive if its competitive ratio¿the ratio between its performance and the offline algorithm's performance¿is bounded.
more from Wikipedia
Graph (mathematics)
In mathematics, a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links that connect some pairs of vertices are called edges. Typically, a graph is depicted in diagrammatic form as a set of dots for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics.
more from Wikipedia
Upper and lower bounds
In mathematics, especially in order theory, an upper bound of a subset S of some partially ordered set (P, ¿) is an element of P which is greater than or equal to every element of S. The term lower bound is defined dually as an element of P which is less than or equal to every element of S. A set with an upper bound is said to be bounded from above by that bound, a set with a lower bound is said to be bounded from below by that bound.
more from Wikipedia
E (mathematical constant)
is the unique value of a, such that the derivative of f(x) = a at the point x = 0 is equal to 1. The blue curve illustrates this case, e. For comparison, functions 2 (dotted curve) and 4 (dashed curve) are shown; they are not tangent to the line of slope 1 and y-intercept 1 (red). ]] The number e is an important mathematical constant, approximately equal to 2.71828, that is the base of the natural logarithm.
more from Wikipedia
Latency (engineering)
Latency is a measure of time delay experienced in a system, the precise definition of which depends on the system and the time being measured. Latencies may have different meaning in different contexts.
more from Wikipedia