Heuristic routing:
Note: Heuristic routing allows a measure of
Source: From
Wikimedia Foundation. 2010.
heuristic routing — euristinis maršruto parinkimas statusas T sritis informatika apibrėžtis ↑Duomenų paketų ↑maršruto parinkimo metodas, pagrįstas sukaupta informacija apie ankstesnius mazgui priskirtus maršrutus, ↑delsą ir kt. parametrais. Naudojamas optimaliam… … Enciklopedinis kompiuterijos žodynas
Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). 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… … Wikipedia
Routing in delay tolerant networking — concerns itself with theability to transport, or route, data from a source to adestination is a fundamental ability all communication networks musthave. Delay and disruption tolerant networks(DTNs), arecharacterized by their lack of connectivity … Wikipedia
Hyper-heuristic — A hyper heuristic is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting, combining, generating or adapting several simpler heuristics (or components of such… … Wikipedia
MENTOR routing algorithm — The MENTOR routing algorithm is an algorithm for use in routing of mesh networks, specifically pertaining to their initial topology. It was developed in 1991 by Aaron Kershenbaum, Parviz Kermani, and George A. Grove and was published by the… … Wikipedia
Freenet — Infobox Software name = Freenet caption = An indexing freesite (a freenet hosted page) called The Freedom Engine developer = The Freenet Projectcite web | title = Freenet: People | url = http://freenetproject.org/people.html | date = 2008 09 22 | … Wikipedia
Layer four traceroute — (LFT) is a fast traceroute engine, that also implements numerous other features including AS number lookups through several reliable sources, loose source routing, netblock name lookups, etc. and goes through many configurations of packet filter… … Wikipedia
euristinis maršruto parinkimas — statusas T sritis informatika apibrėžtis ↑Duomenų paketų ↑maršruto parinkimo metodas, pagrįstas sukaupta informacija apie ankstesnius mazgui priskirtus maršrutus, ↑delsą ir kt. parametrais. Naudojamas optimaliam duomenų maršrutui parinkti… … Enciklopedinis kompiuterijos žodynas
эвристический выбор маршрута — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN heuristic routing … Справочник технического переводчика
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
