716
Glossary
LAN switch
A high-speed, multiple-interface trans-
parent bridging mechanism, transmitting packets
between segments of data links, usually referred to
specifically as an Ethernet switch. LAN switches trans-
fer traffic based on MAC addresses. Multilayer
switches are a type of high-speed, special-purpose,
hardware-based router. See also: multilayer switch,
and store-and-forward packet switching.
LAPB
Link Accessed Procedure, Balanced: A bit-
oriented Data-Link layer protocol that is part of the
X.25 stack and has its origin in SDLC. See also:
SDLC and X.25.
LAPD
Link Access Procedure on the D channel. The
ISDN Data-Link layer protocol used specifically for
the D channel and defined by ITU-T Recommenda-
tions Q.920 and Q.921. LAPD evolved from LAPB
and is created to comply with the signaling require-
ments of ISDN basic access.
latency
Broadly, the time it takes a data packet to
get from one location to another. In specific network-
ing contexts, it can mean either (1) the time elapsed
(delay) between the execution of a request for access to
a network by a device and the time the mechanism
actually is permitted transmission, or (2) the time
elapsed between when a mechanism receives a frame
and the time that frame is forwarded out of the desti-
nation port.
Layer 1 S/T Interface
This connection uses a phys-
ical connector of RJ-45, as defined in ISO 8877. A
straight-through pin configuration connects the termi-
nal end point (TE) to the network termination (NT).
Layer-3 switch
See: multilayer switch.
layered architecture
Industry standard way of
creating applications to work on a network. Layered
architecture allows the application developer to
make changes in only one layer instead of the whole
program.
LCP
Link Control Protocol: The protocol designed
to establish, configure, and test data link connections
for use by PPP. See also: PPP.
leaky bucket
An analogy for the basic cell rate algo-
rithm (GCRA) used in ATM networks for checking the
conformance of cell flows from a user or network. The
bucket's "hole" is understood to be the prolonged rate
at which cells can be accommodated, and the "depth" is
the tolerance for cell bursts over a certain time period.
learning bridge
A bridge that transparently builds a
dynamic database of MAC addresses and the inter-
faces associated with each address. Transparent
bridges help to reduce traffic congestion on the net-
work.
LE ARP
LAN Emulation Address Resolution Proto-
col: The protocol providing the ATM address that cor-
responds to a MAC address.
leased lines
Permanent connections between two
points leased from the telephone companies.
LEC
LAN Emulation Client: Software providing the
emulation of the link layer interface that allows the
operation and communication of all higher-level pro-
tocols and applications to continue. The LEC client
runs in all ATM devices, which include hosts, servers,
bridges, and routers. The LANE client is responsible
for address resolution, data transfer, address caching,
interfacing to the emulated LAN, and driver support
for higher-level services. See also: ELAN and LES.
LECS
LAN Emulation Configuration Server: An
important part of emulated LAN services, providing
the configuration data that is furnished upon request
from the LES. These services include address registra-
tion for Integrated Local Management Interface
(ILMI) support, configuration support for the LES
addresses and their corresponding emulated LAN
identifiers, and an interface to the emulated LAN. See
also: LES and ELAN.
LES
LAN Emulation Server: The central LANE
component that provides the initial configuration data
for each connecting LEC. The LES typically is located
on either an ATM-integrated router or a switch.
Responsibilities of the LES include configuration and
support for the LEC, address registration for the LEC,
database storage and response concerning ATM
addresses, and interfacing to the emulated LAN. See
also: ELAN, LEC, and LECS.
link-state routing algorithm
A routing algorithm
that allows each router to broadcast or multicast infor-
mation regarding the cost of reaching all its neighbors to
every node in the internetwork. Link-state algorithms
Copyright ©2000 SYBEX , Inc., Alameda, CA
www.sybex.com