-
1 open shortest path first
"A routing protocol for Internet Protocol (IP) networks. OSPF allows a router to calculate the shortest path to each node for sending messages. The router sends information on the nodes it is linked to, called link-state advertisements, to other routers on the network to accumulate link-state information to make its calculations.""بروتوكول ""فتح أقصر مسار أولا""" -
2 backbone router
"In Open Shortest Path First (OSPF), a router that is connected to the backbone area. This includes routers that are connected to more than one area (area border routers (ABRs)). However, backbone routers do not have to be ABRs. Routers that have all networks connected to the backbone are internal routers." -
3 OSPF
"A routing protocol for Internet Protocol (IP) networks. OSPF allows a router to calculate the shortest path to each node for sending messages. The router sends information on the nodes it is linked to, called link-state advertisements, to other routers on the network to accumulate link-state information to make its calculations."
См. также в других словарях:
Shortest — Short Short, a. [Compar. {Shorter}; superl. {Shortest}.] [OE. short, schort, AS. scort, sceort; akin to OHG. scurz, Icel. skorta to be short of, to lack, and perhaps to E. shear, v. t. Cf. {Shirt}.] 1. Not long; having brief length or linear… … The Collaborative International Dictionary of English
shortest — adjective ; Least in stature, length or height. The two word poem Fleas is arguably the shortest poem in the English language. How could a poem have fewer words? … Wiktionary
shortest — adj. Shortest is used with these nouns: ↑way … Collocations dictionary
Shortest-Job-First — (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind Shortest Processing Time… … Deutsch Wikipedia
Shortest-Process-Next — Shortest Job First (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind… … Deutsch Wikipedia
Shortest-Processing-Time — Shortest Job First (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind… … Deutsch Wikipedia
Shortest-Job-Next — Shortest Job First (SJF) ist ein nonpräemptives Scheduling Verfahren, das eingesetzt wird, um rechenwillige Threads oder/und Prozesse auf die physischen Prozessoren des Rechners zu verteilen. Abwandlungen dieses Scheduling Verfahrens sind… … Deutsch Wikipedia
Shortest remaining time — is a method of CPU scheduling that is a preemptive version of shortest job next scheduling. In this scheduling algorithm, the process with the smallest amount of time remaining until completion is selected to execute. Since the currently… … Wikipedia
Shortest job next — (SJN) (also known as Shortest Job First (SJF)) is a scheduling policy that selects the waiting process with the smallest execution time to execute next.Shortest job next is advantageous because of its simplicity and because it maximizes process… … Wikipedia
Shortest seek first — is a disk scheduling algorithm to determine the motion of the disk s arm and head in servicing read and write requests. Description This is a direct improvement upon a first come first served (FIFO) algorithm. The drive maintains an incoming… … Wikipedia
Shortest seek first — Saltar a navegación, búsqueda Shortest seek first (SSTF, la búsqueda más corta primero) es un algoritmo de planificación de E/S para dispositivos de bloques (discos duros). Descripción Es una mejora directa del algoritmo FIFO para planifición de… … Wikipedia Español
