Science Fair Project Encyclopedia
Lightweight Directory Access Protocol
Lightweight Directory Access Protocol (LDAP) is a protocol for accessing on-line directory services.
The IETF designed and specified LDAP as a better way to make use of X.500 directories - having found the original Directory Access Protocol (DAP) too complex for simple internet clients to use. LDAP defines a relatively simple protocol for updating and searching directories running over TCP/IP.
The common term "LDAP directory" can mislead. No specific type of directory is an "LDAP directory". One could reasonably use the term to describe any directory accessible using the LDAP protocol and which can identify objects in the directory with X.500 identifiers. Directories such as OpenLDAP and its predecessors from the University of Michigan, though primarily designed as native repositories optimized for access by LDAP rather than as a gateway to X.500 protocols as was provided in ISODE, are nevertheless no more "LDAP directories" than any other directory accessible by the LDAP protocol.
The protocol was authored by Tim Howes of Netscape, Steve Kille of ISODE and Mark Wahl of Critical Angle Inc.
LDAP has gained wide support from vendors such as:
- Apple (through Open Directory)
- AT&T
- Banyan
- HP
- IBM/Lotus
- Microsoft (through Active Directory)
- Novell (through eDirectory)
- Oracle (through Oracle Internet Directory)
- SGI and
- Sun (through iPlanet directory server)
as well as in open source/free software implementations such as OpenLDAP.
An LDAP directory entry consists of a collection of attributes and is referenced unambiguously with a name, called a distinguished name (DN). For example, a DN might be the value "cn=John Doe,ou=people,dc=wikipedia,dc=org". Each of the entry's attributes are defined as part of an object class and are grouped together into schemas; those schemas for representing individual people within organizations are termed white pages schema. Each entry in the database is associated with one or more these object classes, which define whether an attribute is optional or mandatory, and what type of information it stores. The attribute names are typically mnemonic strings, like "cn" for common name, or "mail" for e-mail address. The values depend on the type, and most non-binary values in LDAPv3 use UTF-8 string syntax. For example, a mail attribute might contain the value "user@example.com". A jpegPhoto attribute would contain a photograph in binary JPEG/JFIF format.
LDAP directory entries feature a hierarchical structure that reflects political, geographic, and/or organizational boundaries. In the original X.500 model, entries representing countries appear at the top of the tree; below them come entries representing states or national organizations. Typical LDAP deployments use DNS names for structuring the top levels of the hierarchy. Further below might appear entries representing people, organizational units, printers, documents, or just about anything else.
LDAP has influenced subsequent Internet protocols, including later versions of X.500, Directory Services Markup Language (DSML), Service Provisioning Markup Language (SPML) and the Service Location Protocol.
RFCs
- RFC 1777 LDAPv2
- RFC 1778 LDAPv2 String Representation of Standard Attribute Syntaxes
- RFC 1959 URL Format
- RFC 1960 - RFC 2254 String Representation of LDAP Search Filters
- RFC 1823 C API
- RFC 2247 Use of DNS domains in distinguished names
- RFC 2251 - RFC 2256 LDAPv3 base protocol, syntaxes and attributes
- RFC 3377 LDAPv3
References
External links
- OpenLDAP
- EDS Admin tool
- Linux LDAP HOWTO
- LDAP Articles, Links, Whitepapers
- LDAP Software, Tools & Utilities
- LDAP (v3) Revision (ldapbis) Working Group
- What is LDAP?
- Nice Neat Introduction To LDAP with examples
- Using OpenLDAP - Installing OpenLDAP under Debian GNU/Linux
- LDAP Authentication for Linux - Integrating LDAP into PAM
- LDAP Libraries for C#.
- LDAP for Rocket Scientists
- LDAP implemention for PerLDAP 1.4
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


