| podobné slovo | definícia |
grouting
(encz) | grouting,injektování [eko.] RNDr. Pavel Piskač |
rerouting
(encz) | rerouting,přesměrování n: Zdeněk Brož |
sprouting
(encz) | sprouting,pučení n: Zdeněk Brožsprouting,rašení n: Zdeněk Brož |
Grouting
(gcide) | Grout \Grout\, v. t. [imp. & p. p. Grouted; p. pr. & vb. n.
Grouting.]
To fill up or finish with grout, as the joints between
stones.
[1913 Webster]Grouting \Grout"ing\, n.
The process of filling in or finishing with grout; also, the
grout thus filled in. --Gwilt.
[1913 Webster] |
Routing
(gcide) | Rout \Rout\, v. t. [imp. & p. p. Routed; p. pr. & vb. n.
Routing.]
To break the ranks of, as troops, and put them to flight in
disorder; to put to rout.
[1913 Webster]
That party . . . that charged the Scots, so totally
routed and defeated their whole army, that they fied.
--Clarendon.
[1913 Webster]
Syn: To defeat; discomfit; overpower; overthrow.
[1913 Webster] |
Sprouting
(gcide) | Sprout \Sprout\ (sprout), v. i. [imp. & p. p. Sprouted; p. pr.
& vb. n. Sprouting.] [OE. sprouten, spruten; akin to
OFries. spr[=u]ta, AS. spre['o]tan, D. spruiten, G.
spriessen, Sw. spruta to squirt, to spout. Cf. Sprit, v. t.
& i., Sprit a spar, Spout, v. t., Spurt.]
1. To shoot, as the seed of a plant; to germinate; to push
out new shoots; hence, to grow like shoots of plants.
[1913 Webster]
2. To shoot into ramifications. [Obs.] --Bacon.
[1913 Webster] |
sprouting
(wn) | sprouting
n 1: the process whereby seeds or spores sprout and begin to
grow [syn: germination, sprouting] |
adaptive routing
(foldoc) | dynamic routing
adaptive routing
(Or "adaptive routing") Routing that adjusts
automatically to network topology or traffic changes.
(1997-05-08)
|
automatic network routing
(foldoc) | Automatic Network Routing
ANR
(ANR) A source routing protocol used to route
LU6.2 session and control traffic from node to node
through a High Performance Routing network or subnet. ANR
operates at the lower end of the SNA Path Control layer.
[Relationship to OS/390?]
(1997-05-08)
|
classless inter-domain routing
(foldoc) | Classless Inter-Domain Routing
CIDR
(CIDR) /sid*r/ A technique that summarises a
block of Internet addresses in a routing table as an
address in dotted decimal notation followed by a {forward
slash} and a two-digit decimal number giving the number of
leading one bits in the subnet mask. For example,
123.123.123.0/24 specifies a subnet mask of
11111111.11111111.11111111.00000000 (binary), implying the
block of addresses 123.123.123.0 through 123.123.123.255.
CIDR is "classless" because it is not limited to the subnet
masks specified by Internet address classes A, B and C.
According to RFC 1519, CIDR was implemented to distribute
Internet address space more efficiently and to provide a
mechanism for IP route aggregation. This in turn reduces
the number of entries in IP routing tables, enabling faster,
more efficient routing, e.g. using routing protocols such
as OSPF. CIDR is supported by BGP4.
See also RFC 1467, RFC 1518, RFC 1520.
(2006-01-26)
|
dynamic adaptive routing
(foldoc) | dynamic adaptive routing
Automatic rerouting of traffic based on analysis of current
network conditions. This does not include routing decisions
based on predefined information.
(1995-01-30)
|
dynamic routing
(foldoc) | dynamic routing
adaptive routing
(Or "adaptive routing") Routing that adjusts
automatically to network topology or traffic changes.
(1997-05-08)
|
generic routing encapsulation
(foldoc) | Generic Routing Encapsulation
GRE
(GRE) A protocol which allows an
arbitrary network protocol A to be transmitted over any other
arbitrary network protocol B, by encapsulating the packets
of A within GRE packets, which in turn are contained within
packets of B.
Defined in RFC 1701 and RFC 1702 (GRE over IP).
(1998-07-19)
|
hierarchical routing
(foldoc) | hierarchical routing
A way of simplifying routing a large network
like the Internet by breaking it into a hierarchy of
smaller networks where each level is responsible for its own
routing. The Internet has three levels: backbone networks,
mid-level networks (or transit networks) and {stub
networks}. The backbones know how to route between the
mid-levels, the mid-levels know how to route between
autonomous systems (sites) and each site knows how to route
internally.
Routers at each level cooperate by exchanging routing
information. Typically, between mid-level networks this is
via Exterior Gateway Protocol and within sites via {Interior
Gateway Protocol}.
(2017-12-02)
|
high performance routing
(foldoc) | High Performance Routing
HPR
(HPR) Routing designed to work in conjunction
with APPN Intermediate Session Routing (ISR) network
nodes. HPR nodes perform many of the same functions as ISR
nodes. For example, HPR nodes use the same method of
calculating routes based on the Topology Routing Service
database and class of service tables. HPR nodes also
supports such APPN features as connection networks and support
for parallel transmission groups (TGs). In the HPR
architecture, both partner nodes must support HPR for RTP
connections to take place between the nodes. If one node
supports HPR and the partner node does not, then the link will
support ISR functionality only.
["APPN Architecture and Product Implementations Tutorial",
IBM, GG24-3669-92].
(1997-05-08)
|
hot standby routing protocol
(foldoc) | Hot Standby Routing Protocol
HSRP
(HSRP) A CISCO standard, defined in RFC 2281,
that calls for a mirrored router in passive mode to send
hello packets, wait for a lead router to die and, without
dropping a packet, take over from that router.
Note: "standby", not "swappable" (and certainly not
"swapable").
(2005-01-26)
|
hot swapable routing protocol
(foldoc) | Hot Swapable Routing Protocol
Incorrect spelling of incorrect expansion of HSRP -
Hot Standby Routing Protocol.
(2005-01-26)
|
hot swappable routing protocol
(foldoc) | Hot Swappable Routing Protocol
Incorrect expansion of HSRP - {Hot Standby Routing
Protocol}.
(2005-01-26)
|
link state routing protocol
(foldoc) | Link State Routing Protocol
A routing protocol such as
OSPF which permits routers to exchange information with one
another about the reachability of other networks and the cost
or metric to reach the other networks.
The cost/metric is based on number of hops, link speeds,
traffic congestion, and other factors as determined by the
network designer. Link state routers use {Dijkstra's
algorithm} to calculate shortest (lowest cost) paths, and
normally update other routers with whom they are connected
only when their own routing tables change.
Link state routing is an improvement over {distance-vector
routing} protocols such as RIP which normally use only a
single metric (such as hop count) and which exchange all of
their table information with all other routers on a regular
schedule. Link state routing normally requires more
processing but less transmission overhead.
(2000-03-14)
|
routing information protocol
(foldoc) | Routing Information Protocol
1. (RIP) A distance vector, as opposed to {link
state}, routing protocol. RIP is an Internet standard
Interior Gateway Protocol defined in STD 34, RFC 1058
and updated by RFC 1388.
See also Open Shortest Path First.
2. (RIP) A companion protocol to IPX for
exchange of routing information in a Novell network.
RIP has been partly superseded by NLSP. It is not related
to the Internet protocol of the same name.
(1997-03-04)
|
routing policy
(foldoc) | routing policy
Rules implemented on a router or other network
device to select routes from peers, customers, and upstream
providers; select and modify routes you send to peers,
customers and upstream providers and identify routes within
your own Autonomous System.
(http://www.nanog.org/mtg-0202/ppt/golding/sld005.htm).
(2008-12-12)
|
routing table maintenance protocol
(foldoc) | Routing Table Maintenance Protocol
RTMP
(RTMP) A protocol used by AppleTalk to ensure
that all routers on the network have consistent routing
information.
(1997-05-11)
|
simplified multicast routing protocol
(foldoc) | Simplified Multicast Routing Protocol
SMRP
(SMRP) A transport-layer
protocol to route multimedia data streams over AppleTalk
networks. SMRP supports Apple's QuickTime Conferencing
(QTC).
{Documentation
(http://cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/smrp.htm)}.
(2001-07-02)
|
source routing
(foldoc) | source route
mail path
source routing
An electronic mail address which specifies the
route the message should take as a sequence of hostnames.
It is called a source route because the route is determined at
the source of the message rather than at each stage as is now
more common. The most common kind of source route is a UUCP
style bang path, "foo!bar!baz!fred'. The RFC 822 syntax,
"@foo:@bar:fred@baz", is seldom seen because most systems
which understand RFC 822 also perform automatic routing based
on the destination hostname. A third, intermediate, form is
sometimes seen: "fred%baz%bar@foo.com".
|
wormhole routing
(foldoc) | wormhole routing
A property of a message passing system in which
each part of a message is transmitted independently and one
part can be forwarded to the next node before the whole
message has been received. All parts of a single message
follow the same route.
The independent parts are normally small, e.g. one 32-bit
word. This reduces the latency and the storage requirements
on each node when compared with message switching where a
node receives the whole message before it starts to forward it
to the next node. It is more complex than message switching
because each node must keep track of the messages currently
flowing through it.
With cut-through switching, wormhole routing is applied to
packets in a packet switching system so that forwarding of
a packet starts as soon as its destination is known, before
the whole packet had arrived.
(2003-05-15)
|