A. K. ERLANG

  

Copyright © Philip M. Parker, INSEAD. Terms of Use.

A. K. ERLANG

Specialty Definition: A. K. ERLANG

DomainDefinition

Computing

A. K. Erlang (1878-1929) A Danish mathematician. Erlang the language and unit were named after him. Interested in the theory of probability, in 1908 Erlang joined the Copenhagen Telephone Company where he studied the problem of waiting times for telephone calls. He worked out how to calculate the fraction of callers who must wait due to all the lines of an exchange being in use. His formula for loss and waiting time was published in 1917. It is now known as the "Erlang formula" and is still in use today. Biography (http://www-history.mcs.st-andrews.ac.uk/~history/Mathematicians/Erlang.html), Biography (http://pass.maths.org.uk/issue2/erlang/index.html). [What was his name?] (2000-10-28). Source: The Free On-line Dictionary of Computing.

Source: compiled by the editor from various references; see credits.

Top     

Specialty Definition: A. K. Erlang

(From Wikipedia, the free Encyclopedia)

Agner Krarup Erlang (Born at Lonborg (Lønborg), near Tarm, in Jutland, Denmark on January 1 1878; died at Copenhagen, Denmark on February 3, 1929), was a Danish mathematician, statistician, and engineer who invented the fields of queueing theory and traffic engineering.

He was the son of a schoolmaster and with his maternal mathematical ancestor Thomas Fincke, he demonstrated his potential from an early age by being able to read books upside down. He passed the Preliminary Examination offered by the University of Copenhagen, with distinction, at age 14, after receiving dispensation to sit because he was younger than the usual minimum age.

For the next two years he taught alongside his father.

With a distant relative providing free board and lodgings, he prepared for and sat the University of Copenhagen entrance examination in 1896, which he passed with distinction. He won a scholarship to the University of Copenhagen and majored in mathematics, but also studied astronomy, physics and chemistry. He graduated in 1901 with an MA and subsequently taught at several schools over the next 7 years. He maintained his interest in mathematics and received an award for one paper that he submitted to the University of Copenhagen.

He was a member of the Danish Mathematicians' Association and through this met amateur mathematician Johan Jensen, the Chief Engineer of the Copenhagen Telephone Company, an offshoot of the International Bell Telephone Company. Erlang subsequently obtained employment with the company in 1908. He worked for the Copenhagen Telephone Company for almost 20 years, until his death after an abdominal operation.

It was while working for the Copenhagen Telephone Company that Erlang was presented with the classic problem of determining how many circuits were needed to provide an acceptable telephone service. However, his thinking went further in that he also realised that mathematics could be applied to assess how many operators were needed to handle a given volume of telephone calls. At that time most telephone exchanges used human operators and cord boards to switch telephone calls by means of jack plugs.

Out of necessity, Erlang was a hands-on researcher. He would conduct his own measurements and was prepared to climb into street manholes to do so.

Erlang was also an expert in both the history and calculation of the numerical tables of mathematical functions, particularly logarithms. He devised new calculation methods for certain forms of mathematical tables.

He developed his theory concerning telephone traffic over several years. His significant publications include:

These and other notable papers were translated into English, French and German. His papers were prepared in a very brief style and can be difficult to understand without a background in the field. So that his papers could be studied in the original Danish, one researcher from Bell Telephone Laboratories learnt the language.

The British Post Office accepted his formula as the basis for calculating circuit facilities.

He was an associate of the British Institution of Electrical Engineers.

The unit of communication activity in these fields is now known as the erlang, in recognition of his achievements.

Ericsson Communications has also named the Erlang programming language, a programming language for large industrial real-time systems, in his honour.

His name is also given to the statistical probability distribution that arises from his work.

See also:

External Links

Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "A. K. Erlang."

Top     


Anagrams: A. K. ERLANG

Scrabble® Enable2K-Verified Anagrams

Words within the letters ".-.-a-a-e-g-k-l-n-r"

-4 letters: aglare, alegar, alkane, angler, anlage, galena, laager, lanker, raglan, rankle, regnal.

-5 letters: akela, alane, alang, algae, anear, angel, anger, angle, ankle, areal, arena, argal, argle, galea, glare, glean, gnarl, graal, grana, kraal, lagan, lager, laker, large, learn, range, regal, regna, renal.

Source: compiled by the editor from various references; see credits.

SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Top     

Alternative Orthography: A. K. ERLANG


Hexadecimal (or equivalents, 770AD-1900s) (references)

41 2E      4B 2E      45 52 4C 41 4E 47

Leonardo da Vinci (1452-1519; backwards) (references)

        

Binary Code (1918-1938, probably earlier) (references)

01000001 00101110 00100000 01001011 00101110 00100000 01000101 01010010 01001100 01000001 01001110 01000111

HTML Code (1990) (references)

&#65 &#46 &#32 &#75 &#46 &#32 &#69 &#82 &#76 &#65 &#78 &#71

ISO 10646 (1991-1993) (references)

0041 002E      004B 002E      0045 0052 004C 0041 004E 0047

Encryption (beginner's substitution cypher): (references)

3516245162395246354841

Top     



INDEX

1. Anagrams
2. Orthography
3. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.