CCNA Cisco Certified Network Associate Study Guide - FTP Server

686 Glossary
learning bridge A bridge that transparently builds a dynamic database of
MAC addresses and the interfaces associated with each address. Transparent
bridges help to reduce traffic congestion on the network.
LE ARP LAN Emulation Address Resolution Protocol: The protocol providing
the ATM address that corresponds 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 higherlevel
protocols 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 registration 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 information regarding the cost of reaching all its
neighbors to every node in the internetwork. Link-state algorithms provide
a consistent view of the network and are therefore not vulnerable to routing
loops. However, this is achieved at the cost of somewhat greater difficulty in
computation and more widespread traffic (compared with distance-vector
routing algorithms). See also: distance-vector routing algorithm.