ArticleslgStudy

computer science

Leonard Kleinrock

Leonard Kleinrock is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Leonard Kleinrock rather than just read about it. In short: Leonard Kleinrock (born June 13, 1934) is an American computer scientist and Internet pioneer. He is Distinguished Professor Emeritus of Computer Science at UCLA's Henry Samueli School of Engineering and Applied Science.

Leonard Kleinrock — main illustration
Leonard Kleinrock — illustration

Key takeaways

  • Leonard Kleinrock belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Leonard Kleinrock to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Leonard Kleinrock from memory before moving on to harder problems.

Reference excerpt

Leonard Kleinrock (born June 13, 1934) is an American computer scientist and Internet pioneer. He is Distinguished Professor Emeritus of Computer Science at UCLA's Henry Samueli School of Engineering and Applied Science. Kleinrock made several important contributions to the field of computer science, in particular to the mathematical foundations of data communication in computer networking. He has received numerous prestigious awards. In the early 1960s, Kleinrock pioneered the application of queueing theory to model delays in message switching networks in his Ph.D. thesis, published as a book in 1964. In the late 1960s and 1970s, he played an influential role in the development of the ARPANET. In the 1970s, he applied queueing theory to model and measure the performance of packet switching networks and published several of the standard works on the subject. He supervised graduate students who worked on the communication protocols for the ARPANET including students whose later work on internetworking and the Internet protocol suite led to the networking technology employed in the Internet. His theoretical work on hierarchical routing in the late 1970s with student Farouk Kamoun remains critical to the operation of the Internet today.

Education and career Leonard Kleinrock was born in New York City on June 13, 1934, to a Jewish family, and graduated from the noted Bronx High School of Science in 1951. He received a Bachelor of Electrical Engineering degree in 1957 from the City College of New York, and a master's degree and a doctorate (Ph.D.) in electrical engineering and computer science from the Massachusetts Institute of Technology (MIT) in 1959 and 1963 respectively. He then joined the faculty at the University of California at Los Angeles (UCLA), where he remains to the present day; during 1991–1995 he served as the chairman of the Computer Science Department there.

Achievements

Queueing theory Kleinrock's best-known and most-significant work is on queueing theory, a major topic of applied mathematics that has applications in many fields. His thesis proposal in 1961, Information Flow in Large Communication Nets, led to a doctoral thesis at MIT in 1962, Message Delay in Communication Nets with Storage, later published as book in 1964, Communication Nets: Stochastic Message Flow and Delay. In this work, he researched the configuration and operation of communication networks, considering design parameters such as "channel capacity, effect of priority discipline, choice of routing procedure, and design of topological structure". He analyzed delays in Plan 55-A, a message switching system operated by Western Union for processing telegrams. His thesis went on to apply probability theory to model queueing delays in a generalized communication network. Donald Davies, in his 1966 paper on packet switching, applied Kleinrock's techniques to show that "there is an ample margin between the estimated performance of the [packet-switched] system and the stated requirement" in terms of a satisfactory response time for a human user. This addressed a key question about the viability of computer networking.

ARPANET A contemporary from MIT, Larry Roberts, brought Leonard Kleinrock into the ARPANET project informally in early 1967. Roberts asked Frank Westervelt to explore the questions of message size and contents for the network, and to write a position paper on the intercomputer communication protocol including “conventions for character and block transmission, error checking and retransmission, and computer and user identification." Later that year, Roberts learned about packet switching from a paper written by Davies, presented at the October 1967 Symposium on Operating Systems Principles, and incorporated the concept into the proposal for the ARPANET. Kleinrock was awarded a contract in 1968 to establish a Network Measurement Center (NMC) to measure and model the performance of the network. His mathematical work studied and influenced the development of the early ARPANET. In addition, Kleinrock managed the software team at UCLA — including Steve Crocker, Jon Postel, and Vint Cerf — who developed the host-host protocol for the ARPANET, the Network Control Program (NCP). The first message on the ARPANET was sent by a UCLA undergraduate student, Charley Kline, who was supervised by Kleinrock. At 10:30 p.m, on October 29, 1969, from Boelter Hall 3420, the school's main engineering building, Kline transmitted from the university's SDS Sigma 7 host computer to the Stanford Research Institute's SDS 940 host computer. The message text was the word "login"; the "l" and the "o" letters were transmitted, but the system then crashed. Hence, the literal first message over the ARPANET was "lo". About an hour later, having recovered from the crash, the SDS Sigma 7 computer effected a full "login". The first permanent ARPANET link was established on November 21, 1969, between the Interface Message Processor (IMP) at UCLA and the IMP at the Stanford Research Institute. By December 5, 1969, the initial four-node network was established. Kleinrock used the ARPANET for instant messaging from the U.S. to Larry Roberts in England in 1973, employing the network for a modern every-day use.

… excerpt ends here. Continue reading the full article.

Illustrations

Leonard Kleinrock illustration
Leonard Kleinrock: 2012 Internet Hall of Fame inductees, including Leonard Kleinrock (seated, fifth from the left)
2012 Internet Hall of Fame inductees, including Leonard Kleinrock (seated, fifth from the left)

Worked examples

Example 1 — a first encounter with Leonard Kleinrock

Start with the simplest possible case. Write down what Leonard Kleinrock claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Leonard Kleinrock before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Leonard Kleinrock ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Leonard Kleinrock

In research
Leonard Kleinrock appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Leonard Kleinrock in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Leonard Kleinrock is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1934 births, 20th-century American scientists, 21st-century American scientists, so understanding it makes those chapters shorter.
In everyday life
Look for Leonard Kleinrock outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Leonard Kleinrock” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Leonard Kleinrock in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Leonard Kleinrock means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Leonard Kleinrock out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Leonard Kleinrock in simple terms?

Leonard Kleinrock (born June 13, 1934) is an American computer scientist and Internet pioneer. He is Distinguished Professor Emeritus of Computer Science at UCLA's Henry Samueli School of Engineering and Applied Science.

Why does Leonard Kleinrock matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Leonard Kleinrock?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Leonard Kleinrock.

Tags

  • 1934 births
  • 20th-century American scientists
  • 21st-century American scientists
  • American computer scientists
  • City College of New York alumni
  • Draper Prize winners
  • Fellows of the Association for Computing Machinery
  • Fellows of the Institute for Operations Research and the Management Sciences
  • Internet pioneers
  • Jewish American scientists
  • Living people
  • MIT School of Engineering alumni

Keep exploring