A greedy source is a traffic generator that generates data at the maximum rate possible and at the earliest opportunity possible.
ee also
*
*
External links
* ftp://tenet.berkeley.edu/pub/tenet/Papers/BanKes93.ps
Wikimedia Foundation. 2010.
Greedy algorithm — A greedy algorithm is any algorithm that follows the problem solving metaheuristic of making the locally optimum choice at each stage Paul E. Black, greedy algorithm in Dictionary of Algorithms and Data Structures [online] , U.S. National… … Wikipedia
Traffic generation model — A traffic generation model is a stochastic model of the traffic flows or data sources in a communication network, for example a cellular network or a computer network. A packet generation model is a traffic generation model of the packet flows or … Wikipedia
Моделирование трафика — это создание стохастической модели потоков трафика в сети, к примеру это может быть сотовая или компьютерная сеть. Моделирование пакетов это создание потока пакетов в сети с коммутацией пакетов. Такой моделью является en:web traffic model, это… … Википедия
Throughput — This article is about the use of Throughput in communication networks. For disk drives, see Throughput (disk drive). For business management, see Throughput (business). In communication networks, such as Ethernet or packet radio, throughput or… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… … Wikipedia
Geographic routing — (also called georouting or position based routing) is a routing principle that relies on geographic position information. It is mainly proposed for wireless networks and based on the idea that the source sends a message to the geographic location … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
List of Tales from the Crypt episodes — The following is a list of episodes for the television series, Tales from the Crypt which aired from 1989 1996. During the series run, there were a total of 93 episodes and two feature length films. A third film was produced in 2001, after the… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
