-
101 SPt
1) Компьютерная техника: Sql Pass Through2) Медицина: CФТ, селективный фототермолиз3) Военный термин: School of Physical Training, Super Powered Tracer, space parts transfer, special-purpose team, special-purpose test4) Техника: satellite pulse technique, shallover pay test, ship position transmitter, single point turret mooring system, special purpose test, standardized programming techniques, structural phase transition5) Астрономия: Телескоп Южного полюса, South Pole Telescope6) Ветеринария: Start Puppy Training7) Грубое выражение: Shit Post Thursday8) Сокращение: Standard Pokemon Time, septuple, shortest processing time, spraytight, System Page Table, System Performance Test, shortest process time, smallest process time9) Фото: Star Point Transfer10) Вычислительная техника: Sectors Per Track, Shortest Path Tree (PIM, ST, Multicast)11) Нефть: shallower pay test, standard penetration test, standard prevention test, straddle-packer test, испытания вышележащего коллектора (shallover pay test), система установки нефтяных платформ типа "башня на одной точке опоры"12) Аллергология: скарификационная проба (Skin Prick Test)13) Биотехнология: Single-particle tracking14) Фирменный знак: Shanghai Posts Telecommunications15) Бурение: испытание вышележащего коллектора (shallower pay test)16) Глоссарий компании Сахалин Энерджи: Social Performance Team, specially protected territories, статическое зондирование (static penetration test)17) Программирование: Set Process Title18) Расширение файла: Shared Page Table, Spitbol language source code file, Support file, Data support file (MITAC disk/system management utility pack), Split (one part of multi-part file) -
102 spt
1) Компьютерная техника: Sql Pass Through2) Медицина: CФТ, селективный фототермолиз3) Военный термин: School of Physical Training, Super Powered Tracer, space parts transfer, special-purpose team, special-purpose test4) Техника: satellite pulse technique, shallover pay test, ship position transmitter, single point turret mooring system, special purpose test, standardized programming techniques, structural phase transition5) Астрономия: Телескоп Южного полюса, South Pole Telescope6) Ветеринария: Start Puppy Training7) Грубое выражение: Shit Post Thursday8) Сокращение: Standard Pokemon Time, septuple, shortest processing time, spraytight, System Page Table, System Performance Test, shortest process time, smallest process time9) Фото: Star Point Transfer10) Вычислительная техника: Sectors Per Track, Shortest Path Tree (PIM, ST, Multicast)11) Нефть: shallower pay test, standard penetration test, standard prevention test, straddle-packer test, испытания вышележащего коллектора (shallover pay test), система установки нефтяных платформ типа "башня на одной точке опоры"12) Аллергология: скарификационная проба (Skin Prick Test)13) Биотехнология: Single-particle tracking14) Фирменный знак: Shanghai Posts Telecommunications15) Бурение: испытание вышележащего коллектора (shallower pay test)16) Глоссарий компании Сахалин Энерджи: Social Performance Team, specially protected territories, статическое зондирование (static penetration test)17) Программирование: Set Process Title18) Расширение файла: Shared Page Table, Spitbol language source code file, Support file, Data support file (MITAC disk/system management utility pack), Split (one part of multi-part file) -
103 routing
трассировка; маршрутизация- affinity routing
- alternate path routing
- alternative path routing
- automatic alternate routing
- automatic network routing
- avoidance routing
- backbone routing
- basic routing
- circuit routing
- collective routing
- controlled-flood routing
- delta routing
- destination routing
- deterministic routing
- disjoint-path routing
- document routing
- dynamically-adaptive routing
- dynamic-packet routing
- failure-adaptive routing
- flood-search routing
- forward-looking routing
- free routing
- heuristic routing
- hierarchical routing
- hot-potato routing
- hybrid routing
- internetwork message routing
- intra-node routing
- message routing
- minimum-hop routing
- nonbifurcated routing
- path-independent routing
- random routing
- sequential routing
- session-oriented routing
- shortest path routing
- source routing
- source-independent routing
- static routing
- switched-virtual routing
- wormhole routingEnglish-Russian dictionary of telecommunications and their abbreviations > routing
-
104 algorithm
- ad hoc algorithm
- adaptive algorithm
- aim algorithm
- algorithm for path connections
- automatic assessment algorithm
- back-propagation algorithm
- banker's algorithm
- best-route algorithm
- bicomponent algorithm
- bipartitioning algorithm
- bisection algorithm
- branch-bound algorithm
- branching algorithm
- cascading algorithm
- chain algorithm
- channel router algorithm
- coarse-to-fine algorithm
- column sweep algorithm
- combinatorial algorithm
- computational algorithm
- computing algorithm
- conservative algorithm
- control algorithm
- convergent algorithm
- curve-fitting algorithm
- cutting-plane algorithm
- D-algorithm
- decision algorithm
- decoding algorithm
- demand-paging algorithm
- deterministic algorithm
- digit-by-digit algorithm
- divide-and-conquer algorithm
- double-sweep algorithm
- draphics algorithm
- drawing algorithm
- DSP algorithm
- dual algorithm
- durable algorithm
- earliest-deadline-first algorithm
- edge-based algorithm
- event-scheduling algorithm
- exchange algorithm
- fault-handling algorithm
- fine-to-coarse algorithm
- fixed-stealing algorithm
- fixed-step-size algorithm
- flow-synthesis algorithm
- forward-looking algorithm
- generalized algorithm
- genetic algorithm
- Goto algorithm
- graph algorithm
- graph traversal algorithm
- greedy algorithm
- grid expansion algorithm
- hardware algorithm
- heuristic algorithm
- Hightower algorithm
- incorrect algorithm
- inference-based algorithm
- inferencing algorithm
- instruction issue algorithm
- integer algorithm
- integrated query optimization algorithm
- iteration algorithm
- iterative algorithm
- layout algorithm
- layout copmaction algorithm
- leaky bucket algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-expansion algorithm
- Lee-type algorithm
- levelization algorithm
- linear expansion algorithm
- line-placing algorithm
- line-probe algorithm
- logical algorithm
- mathematically based algorithm
- mathematically intensive algorithm
- maximum matching algorithm
- mesh algorithm - minimum path-length algorithm
- modeling algorithm
- multikey algorithm
- multipass algorithm
- nested algorithm
- network algorithm
- normal algorithm
- no-wait algorithm
- operative algorithm
- optimal assignment algorithm
- optimal cutting algorithm
- ordering algorithm
- page-replacement algorithm
- paging algorithm
- parallel algorithm
- partitioning algorithm
- path-tracing algorithm
- pipeline algorithm
- pitch algorithm
- placement algorithm
- prediction algorithm
- primal-dual algorithm
- primary algorithm
- problem algorithm
- procrastination algorithm
- public-key algorithm
- quorum-based algorithm
- random search algorithm
- recognition algorithm
- recursive algorithm
- relaxation algorithm
- replicate algorithm
- robust algorithm
- round-robin algorithm
- routing algorithm
- scanline algorithm
- scheduling algorithm
- sequential algorithm
- shortest path algorithm
- shrinking algorithm
- simplex algorithm
- simulated annealing algorithm
- software algorithm
- spanning tree algorithm
- speech generation algorithm
- speed-enhancing algorithm
- square rooting algorithm
- steepest ascent algorithm
- systolic algorithm
- testing algorithm
- text-to-speech algorithm
- threshold decoding algorithm
- timetable scheduling algorithm
- trace back algorithm
- translation algorithm
- transportation algorithm
- tree-search algorithm
- two-dimensional placement algorithm
- two-list algorithm
- type-inferencing algorithm
- unconstrained minimization algorithm
- universal algorithm
- variable-stealing algorithm
- Vintr algorithm
- VLSI algorithm
- write-back algorithmEnglish-Russian dictionary of computer science and programming > algorithm
-
105 network analysis
1) сетевой анализ, анализ сетейа) иссл. опер., т. граф. (группа пространственно-аналитических операций, имеющих целью исследование свойств линейных пространственных объектов, образующих сети, напр., гидрографические сети, сети коммуникаций и т. п.; анализ основан на формализмах и алгоритмах теории графов и обычно включает поиск наикратчайшего пути между узлами линейной сети, расчет маршрута движения с минимальными издержками, решение задачи размещения ресурсов и т. п.)See:б) упр. (метод планирования сложных проектов и контроля за их выполнением, основанный на графическом представлении последовательности операций и расчете критического пути)See:project network analysis, program evaluation and review technique, critical path, critical path analysis2) эк., соц. сетевой подход [анализ\], теория сетей (подход в к изучению отдельного рынка или всего хозяйства с учетом существующих социальных взаимоотношений между отдельными людьми или организациями; методологически близок структурной социологии)Syn:See:social network, formal network, informal network, network embeddedness, network properties, network ties, strong ties, weak ties, structural hole, structural similarity, bounded solidarity, Baker, Wayne E.* * * -
106 algorithm
1) алгоритм2) правило; процедура; метод•- adaptive algorithm
- Agarval-Cooley algorithm
- aim algorithm
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- backoff algorithm
- back propagation of error algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm - CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm - greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm - iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-Moore algorithm
- Lee algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm - min-cut algorithm - nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- quantum search algorithm
- quick-union algorithm
- quick-union algorithm with path compression
- Q-R-algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm - routing algorithm
- Rprop algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm - self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm - shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithm -
107 algorithm
1) алгоритм2) правило; процедура; метод•- Agarval-Cooley algorithm
- aim algorithm
- algorithm of doubtful convergence
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- back propagation of error algorithm
- backoff algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm
- British Telecom Lempel-Ziv algorithm
- BTLZ algorithm
- CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm
- genetic algorithm
- graph search algorithm
- greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm
- international data encryption algorithm
- iterative algorithm
- iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-algorithm
- Lee-Moore algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm
- message authentication algorithm
- metaheuristic algorithm
- min-cut algorithm
- modified Gram-Schmidt algorithm
- Nelder-Mead simplex algorithm
- nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- Q-R-algorithm
- quantum search algorithm
- quick-union algorithm with path compression
- quick-union algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm
- Rivest-Shamir-Adleman algorithm
- robust algorithm
- routing algorithm
- RProp algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm
- secure hash algorithm
- selective-trace algorithm
- self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm
- sequential leader clustering algorithm
- serial algorithm
- shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithmThe New English-Russian Dictionary of Radio-electronics > algorithm
-
108 movement
1) движение; перемещение (см. тж motion)•in one movement — одним движением (напр. подачи)
- amplitude movementmovement through 90° — поворот на 90°
- angular movement
- bidirectional movement
- clearing movement
- command movement
- commanded movement
- compound movement
- constrained movement
- continuous path X and Z movement
- controlled rate movement
- cooperative movements
- coordinate movement
- creeping movement
- cross traverse movement
- cross-feed movement
- crosswise movement
- cutting movement
- demanded movement
- disengaging movement
- down movement
- endlong movement
- engaging movement
- fall movement
- feed movement
- feeding movement
- fine movements
- finishing movement
- floating movement
- floor-level material movement
- free movement
- free ranging movement
- gross transfer movements
- incremental movement
- indexing movement
- infeed movement
- instrument movement
- intermittent feeding movement
- intermittent rotary movement
- interrupted movement
- inward movement
- jaw movement
- jog movement
- jogging movement
- lateral movement
- lengthwise movement
- lifting movement
- machine thermal movement
- maximum programmable movement
- minimum programmable movement
- movement of displacement
- multiaxis movement
- one-way movement
- operator's manual movement
- orthogonally related movements
- oscillating movement
- out-of-sequence movement
- outward movement
- parts movement from machine to machine
- pick-up movement
- pivotal movement
- pivoting movement
- play movement
- point-to-point movement
- position movement
- positive movement
- power movement
- powered movement
- rack movement
- radial movement
- rapid approach movement
- rapid movement
- rapid return movement
- reciprocating movement
- regulating unit movement
- relative movement between workpiece and tool
- relative movement
- resilient flexing movement
- retraction movement
- return movement
- returning movement
- reverse movement
- rolling movement
- rotary movement
- rotational movement
- shear movement
- shifting movement
- shortest path movement
- shuttling movement
- side movement
- simultaneous movement
- single-lever movement
- sliding movement
- sluggish movement
- spindle-axis movement
- spurious movement
- stage movement
- swinging movement
- swivel movement
- thermal movement
- tracking movement
- translation movement
- translational movement
- transport movements
- traverse movement
- trial-and-error movements
- turning movement
- unclamping movement
- vertical longitudinal movement
- wheelhead movement
- wrist movementEnglish-Russian dictionary of mechanical engineering and automation > movement
-
109 searching
1) поиск2) исследование; изучение•- nearest neighbor searching
- path searching
- shortest path searching
- tree searching -
110 searching
1) поиск2) исследование; изучение•- nearest neighbor searching
- path searching
- shortest path searching
- tree searchingThe New English-Russian Dictionary of Radio-electronics > searching
-
111 OSPF
[Open Shortest Path First] первоочередное открытие кратчайших маршрутов (алгоритм маршрутизации, при котором путь выбирается на основании информации о состоянии канала (link state) ;
является стандартом IGP для Internet) -
112 algorithm
-
ad hoc algorithm
-
adaptive algorithm
-
aim algorithm
-
best-route algorithm
-
branch-and-bound algorithm
-
branching algorithm
-
chain algorithm
-
coding algorithm
-
collision fronts algorithm
-
combinatorial algorithm
-
computational algorithm
-
construction algorithms
- contour following algorithm -
contour matching algorithm
-
control algorithm
-
curve-fitting algorithm
-
decoding algorithm
-
division algorithm
-
docking algorithm
-
edge-tracking algorithm
-
Euclidian algorithm
-
exact embedding algorithm
-
exchange algorithm
-
generalized algorithm
-
greedy algorithm
-
hardware algorithm
-
image understanding algorithm
-
itention algorithm
-
layout algorithm
-
learning algorithm
-
logical algorithm
-
logic algorithm
-
look-ahead control algorithm
-
LOS approach algorithm
-
min-cut algorithm
-
modeling algorithm
-
Monte-Carlo algorithm
-
numerical algorithm
-
obstacle-avoidance algorithm
-
operating algorithm
-
ordering algorithm
-
paging algorithm
-
partitioning algorithm
-
pattern generation algorithm
-
placement algorithm
-
prediction algorithm
-
probabalistic algorithm
-
problem algorithm
-
programming algorithm
-
random-search algorithm
-
recognition algorithm
-
recursive algorithm
-
rendezvous algorithm
-
routing algorithm
-
scheduling algorithm
-
shortest path algorithm
-
shrinking algorithm
-
simplex algorithm
-
software algorithm
-
sorting algorithm
-
stack algorithm
-
steering algorithm
-
stochastic algorithm
-
testing algorithm
-
transportation algorithm
-
tree-search algorithm
-
velocity compensated algorithm
-
vision algorithm
-
wiring algorithm -
113 backtracking
сущ.1) общ. возврат, откат, возвращение2) т. граф., комп. бектрекинг, пересмотр с возвратом (метод поиска оптимального пути, при котором осуществляется пересмотр вариантов и возврат на один шаг)See:3) упр. = bumping -
114 problem
nounзадача f, проблема farrangement problem задача размещения/ранжированияbin packing problem задача об упаковке мешков/контейнеровboundary problem for a random walk граничная задача для случайного блужданияdouble, selection problem задача о двойном выбореin-sensitivity problem проблема нечувствительности/инвариантностиАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > problem
-
115 DSPF
Сетевые технологии: "первым выбирается динамически кратчайший путь", Dynamic Shortest Path First -
116 SPED
1) Сокращение: Supersonic Planetary Entry Decelerator2) Сетевые технологии: Shortest Path Evaluation Device -
117 SSSP
1) Компьютерная техника: Single Source Shortest Path2) Военный термин: Single-Source SIGINT Processor, system source selection procedure3) Техника: site safeguards and security plan -
118 TDSP
1) Военный термин: tactical digital standardization program2) Университет: Technical Degree Sponsorship Program3) Сетевые технологии: Time Dependent Shortest Path4) Энергосистемы: Transmission and Distribution Service Provider5) Должность: Tax Deferred Savings Plan6) Правительство: Transportation Disadvantaged Service Plan -
119 sped
1) Сокращение: Supersonic Planetary Entry Decelerator2) Сетевые технологии: Shortest Path Evaluation Device -
120 MOSPF
комп. Multicast Open Shortest Path First, предпочтительное предоставление кратчайшего пути (сетевой протокол групповой рассылки)Англо-русский универсальный дополнительный практический переводческий словарь И. Мостицкого > MOSPF
См. также в других словарях:
Shortest-Path — Unter einem kürzesten Pfad versteht man in der Graphentheorie einen Pfad zwischen zwei Knoten u und v, welcher minimale Länge hat. Haben die Kanten im Graphen alle das gleiche Kantengewicht, so ist der kürzeste Pfad äquivalent zu dem Pfad mit den … Deutsch Wikipedia
Shortest Path — Unter einem kürzesten Pfad versteht man in der Graphentheorie einen Pfad zwischen zwei Knoten u und v, welcher minimale Länge hat. Haben die Kanten im Graphen alle das gleiche Kantengewicht, so ist der kürzeste Pfad äquivalent zu dem Pfad mit den … Deutsch Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Shortest path tree — A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root… … Wikipedia
Shortest Path First — Алгоритмы поиска на графах A* B* Поиск в ширину Поиск в глубину Алгоритм Дейкстры Двунаправленный поиск Поиск с ограничением глубины Поиск по первому наилучшему совпадению Алгоритм Дейкстры алгоритм на графах, изобретенный Э. Дейкстрой. Находит… … Википедия
shortest-path routing — A routing algorithm in which paths to all network destinations are calculated. The shortest path is then determined by a cost assigned to each link … Dictionary of networking
Shortest Path — kürzester Pfad … Acronyms
Shortest Path — kürzester Pfad … Acronyms von A bis Z
Open Shortest Path First — (OSPF) ist ein Verfahren aus der EDV Netztechnik. Es bezeichnet ein von der IETF entwickeltes Link State Routing Protokoll. Es ist im RFC 2328 (obsolet: RFC 1247 von 1991) festgelegt und basiert auf dem von Edsger W. Dijkstra entwickelten… … Deutsch Wikipedia
Constrained Shortest Path First — (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of… … Wikipedia
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia