Leonard Kleinrock (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Leonard Kleinrock" in English language version.

refsWebsite
Global rank English rank
1st place
1st place
6th place
6th place
2nd place
2nd place
5th place
5th place
782nd place
585th place
11th place
8th place
3rd place
3rd place
6,184th place
4,465th place
34th place
27th place
652nd place
515th place
7th place
7th place
415th place
327th place
1,266th place
860th place
3,828th place
2,823rd place
4,501st place
3,002nd place
low place
low place
7,025th place
4,914th place
2,948th place
1,879th place
179th place
183rd place
120th place
125th place
low place
low place
1,185th place
840th place
26th place
20th place
28th place
26th place
7,854th place
4,513th place
9th place
13th place
low place
low place
2,268th place
1,400th place
1,734th place
1,312th place
2,128th place
1,553rd place
low place
low place
low place
low place
low place
low place
1,195th place
925th place
121st place
142nd place
1,994th place
1,215th place
1,389th place
2,996th place
low place
low place
8,673rd place
5,941st place
low place
7,932nd place
79th place
65th place
7,931st place
4,485th place
low place
9,066th place

academia.edu

  • Harris, Trevor, University of Wales (2009). Pasadeos, Yorgo (ed.). "Who is the Father of the Internet? The Case for Donald Davies". Variety in Mass Communication Research. ATINER: 123–134. ISBN 978-960-6672-46-0. Archived from the original on May 2, 2022. Leonard Kleinrock and Lawrence (Larry) Roberts, neither of whom were directly involved in the invention of packet switching ... Dr Willis H. Ware, Senior Computer Scientist and Research at the RAND Corporation, notes that Davies (and others) were troubled by what they regarded as in appropriate claims on the invention of packet switching{{cite journal}}: CS1 maint: multiple names: authors list (link)

acm.org

dl.acm.org

  • Roberts, Lawrence G.; Wessler, Barry D. (1970). "Computer network development to achieve resource sharing". Proceedings of the May 5-7, 1970, spring joint computer conference on - AFIPS '70 (Spring). New York, NY, USA: Association for Computing Machinery. pp. 543–549. doi:10.1145/1476936.1477020. ISBN 978-1-4503-7903-8. S2CID 9343511. The third paper by Kleinrock [5] derives procedures for optimizing the capacity of the transmission facility in order to minimize cost and average message delay. ... [5] L KLEINROCK. Analytic and simulation methods in Computer Network Design AFIPS Conference Proceedings, May 1970

archive.org

books.google.com

cdlib.org

oac.cdlib.org

cnn.com

core.ac.uk

  • Feldmann, Anja; Cittadini, Luca; Mühlbauer, Wolfgang; Bush, Randy; Maennel, Olaf (2009). "HAIR: Hierarchical architecture for internet routing" (PDF). Proceedings of the 2009 workshop on Re-architecting the internet. ReArch '09. New York, NY, USA: Association for Computing Machinery. pp. 43–48. doi:10.1145/1658978.1658990. ISBN 978-1-60558-749-3. S2CID 2930578. The hierarchical approach is further motivated by theoretical results (e.g., [16]) which show that, by optimally placing separators, i.e., elements that connect levels in the hierarchy, tremendous gain can be achieved in terms of both routing table size and update message churn. ... [16] KLEINROCK, L., AND KAMOUN, F. Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks (1977).

dailybruin.com

doi.org

fcw.com

frontiersofknowledgeawards-fbbva.es

gla.ac.uk

dcs.gla.ac.uk

historyofcomputercommunications.info

ieee.org

ieeexplore.ieee.org

imperial.ac.uk

spiral.imperial.ac.uk

  • Clarke, Peter (1982). Packet and circuit-switched data networks (PDF) (PhD thesis). Department of Electrical Engineering, Imperial College of Science and Technology, University of London. "Many of the theoretical studies of the performance and design of the ARPA Network were developments of earlier work by Kleinrock ... Although these works concerned message switching networks, they were the basis for a lot of the ARPA network investigations ... The intention of the work of Kleinrock [in 1961] was to analyse the performance of store and forward networks, using as the primary performance measure the average message delay. ... Kleinrock [in 1970] extended the theoretical approaches of [his 1961 work] to the early ARPA network."

inc.com

  • Haughney Dare-Bryan, Christine (June 22, 2023). Computer Freaks (Podcast). Chapter Two: In the Air. Inc. Magazine.

informs.org

internethalloffame.org

internetsociety.org

invent.org

jinfo.org

jstor.org

livinginternet.com

mathgenealogy.org

mit.edu

dspace.mit.edu

mit.edu

morganclaypoolpublishers.com

nae.edu

nap.edu

nsf.gov

nytimes.com

oxfordjournals.org

comjnl.oxfordjournals.org

researchgate.net

rfc-editor.org

scpr.org

semanticscholar.org

api.semanticscholar.org

  • Roberts, L.G. (1978). "The evolution of packet switching". Proceedings of the IEEE. 66 (11): 1307–1313. doi:10.1109/PROC.1978.11141. ISSN 1558-2256. S2CID 26876676.
  • Roberts, Lawrence G.; Wessler, Barry D. (1970). "Computer network development to achieve resource sharing". Proceedings of the May 5-7, 1970, spring joint computer conference on - AFIPS '70 (Spring). New York, NY, USA: Association for Computing Machinery. pp. 543–549. doi:10.1145/1476936.1477020. ISBN 978-1-4503-7903-8. S2CID 9343511. The third paper by Kleinrock [5] derives procedures for optimizing the capacity of the transmission facility in order to minimize cost and average message delay. ... [5] L KLEINROCK. Analytic and simulation methods in Computer Network Design AFIPS Conference Proceedings, May 1970
  • Feldmann, Anja; Cittadini, Luca; Mühlbauer, Wolfgang; Bush, Randy; Maennel, Olaf (2009). "HAIR: Hierarchical architecture for internet routing" (PDF). Proceedings of the 2009 workshop on Re-architecting the internet. ReArch '09. New York, NY, USA: Association for Computing Machinery. pp. 43–48. doi:10.1145/1658978.1658990. ISBN 978-1-60558-749-3. S2CID 2930578. The hierarchical approach is further motivated by theoretical results (e.g., [16]) which show that, by optimally placing separators, i.e., elements that connect levels in the hierarchy, tremendous gain can be achieved in terms of both routing table size and update message churn. ... [16] KLEINROCK, L., AND KAMOUN, F. Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks (1977).

stanford.edu

sloan.stanford.edu

ucla.edu

lk.cs.ucla.edu

engineer.ucla.edu

umn.edu

conservancy.umn.edu

umedia.lib.umn.edu

unipv.it

vision.unipv.it

washingtonpost.com

web.archive.org

weebly.com

alexmckenzie.weebly.com

worldcat.org

search.worldcat.org

wsj.com

youtube.com