The data communication method in which communication occurs between hosts with
no previous setup. Packets sent between two hosts may take different routes. UDP
is a connectionless protocol. Also called packet switching. Contrast circuit
connect « connected graph « connected subgraph «
connectionless protocol » Connection Machine
LISP » connection-oriented » connection-oriented
Connection Machine LISP
<language> Lisp with a parallel data structure, the 'xapping', an array
of values assigned to an array of sites.
[G.L. Steele et al, "Connection Machine LISP: Fine-Grained Parallel Symbolic
Processing", in Proc 1986 ACM Conf on LISP and Functional Prog, Aug 1986,
["Connection Machine LISP Reference Manual", Thinking Machines Corp, Feb 1987].
connected graph « connected subgraph «
connectionless protocol « Connection Machine LISP
» connection-oriented » connection-oriented network
service » connective
<networking> (Or connection-based, stream-oriented). A type of transport
layer data communication service that allows a host to send data in a continuous
stream to another host. The transport service will guarantee that all data will
be delivered to the other end in the same order as sent and without duplication.
Communication proceeds through three well-defined phases: connection
establishment, data transfer, connection release. The most common example is
Transmission Control Protocol (TCP).
Opposite of connectionless, datagram. See also circuit switching, packet
switching, virtual circuit.
connected subgraph « connectionless protocol «
Connection Machine LISP « connection-oriented
» connection-oriented network service » connective »
connection-oriented network service
<networking> (CONS) Because of the relatively long transit delays and
inferior bit error rate of WANs, a more sophisticated connection-oriented
protocol is normally used.
connectionless protocol « Connection Machine LISP «
connection-oriented « connection-oriented network
» connective » connector conspiracy » CONNIVER