List of Internet pioneers (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "List of Internet pioneers" in English language version.

refsWebsite
Global rank English rank
1st place
1st place
2nd place
2nd place
5th place
5th place
6,184th place
4,465th place
11th place
8th place
3rd place
3rd place
6th place
6th place
214th place
176th place
1,185th place
840th place
low place
low place
low place
low place
652nd place
515th place
low place
low place
low place
low place
2,213th place
1,495th place
2,509th place
2,329th place
415th place
327th place
8th place
10th place
2,810th place
1,907th place
179th place
183rd place
34th place
27th place
low place
7,932nd place
691st place
581st place
32nd place
21st place
7,594th place
4,706th place
low place
low place
low place
low place
7,025th place
4,914th place
low place
7,456th place
340th place
295th place
7th place
7th place
26th place
20th place
low place
low place
18th place
17th place
low place
low place
459th place
360th place
916th place
706th place
782nd place
585th place
741st place
577th place
488th place
374th place
2,921st place
2,118th place
2,948th place
1,879th place
low place
low place
833rd place
567th place
121st place
142nd place
low place
low place
low place
6,798th place
low place
low place
low place
low place
low place
low place
low place
low place
193rd place
152nd place
712th place
526th place
1,734th place
1,312th place
910th place
593rd place
355th place
454th place
low place
low place
low place
low place
92nd place
72nd place
low place
low place
4th place
4th place
446th place
308th place
low place
low place
low place
low place
low place
low place
low place
low place
699th place
479th place
254th place
236th place
4,903rd place
3,679th place
390th place
227th place
69th place
59th place
615th place
407th place
120th place
125th place
1,266th place
860th place
482nd place
552nd place
1,306th place
885th place
744th place
547th place
low place
low place
448th place
269th place
low place
low place
low place
low place
low place
low place
low place
low place
613th place
456th place
low place
low place
low place
low place
4,858th place
3,506th place
3,828th place
2,823rd place
249th place
169th place
388th place
265th place
4,121st place
2,662nd place
315th place
209th place
2,882nd place
2,105th place
8,369th place
4,542nd place
low place
low place
580th place
462nd place
low place
8,044th place
14th place
14th place
low place
low place
low place
low place
7,189th place
6,078th place
5,990th place
3,752nd place
low place
low place
1,349th place
866th place
7,132nd place
5,975th place
54th place
48th place
20th place
30th place
low place
low place
low place
low place
low place
9,691st place
low place
low place
1,959th place
1,611th place
low place
low place

academia.edu

acm.org

dl.acm.org

  • Edmondson-Yurkanan, Chris (2007). "SIGCOMM's archaeological journey into networking's past". Communications of the ACM. 50 (5): 63–68. doi:10.1145/1230819.1230840. ISSN 0001-0782. In his first draft dated Nov. 10, 1965 [5], Davies forecast today's "killer app" for his new communication service: "The greatest traffic could only come if the public used this means for everyday purposes such as shopping... People sending enquiries and placing orders for goods of all kinds will make up a large section of the traffic... Business use of the telephone may be reduced by the growth of the kind of service we contemplate."
  • 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
  • List of Internet pioneers author profile page at the ACM Digital Library

awards.acm.org

  • "Robert E Kahn". A. M. Turing Award. ACM. 2004. Archived from the original on 3 July 2012. Retrieved 23 January 2010. For pioneering work on internetworking, including the design and implementation of the Internet's basic communications protocols, TCP/IP, and for inspired leadership in networking.
  • "ACM Turing Award, list of recipients". Awards.acm.org. Archived from the original on 12 December 2009. Retrieved 2 December 2011.

fellows.acm.org

acm.org

portal.acm.org

  • "Congestion avoidance and control", Van Jacobson, ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue, Highlights from 25 years of the Computer Communication Review, Volume 25 Issue 1, Jan. 1995, pp.157-187

alleyinsider.com

almanacnews.com

amazon.co.uk

apress.com

archive-it.org

wayback.archive-it.org

  • "Robert E Kahn". A. M. Turing Award. ACM. 2004. Archived from the original on 3 July 2012. Retrieved 23 January 2010. For pioneering work on internetworking, including the design and implementation of the Internet's basic communications protocols, TCP/IP, and for inspired leadership in networking.

archive.org

archive.today

archives.gov

georgewbush-whitehouse.archives.gov

army.mil

ftp.arl.army.mil

arstechnica.com

arxiv.org

bbc.co.uk

news.bbc.co.uk

bbc.com

bbn.com

openmap.bbn.com

berkeley.edu

icsi.berkeley.edu

books.google.com

botw.org

businessweek.com

businesswire.com

cern.ch

tenyears-web.cern.ch

cisco.com

newsroom.cisco.com

columbia.edu

computerconservationsociety.org

computerhistory.org

archive.computerhistory.org

computerhistory.org

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).

council-on-tribunals.gov.uk

crainsdetroit.com

ddj.com

doi.org

doi.org

dx.doi.org

dougengelbart.org

dtic.mil

apps.dtic.mil

economist.com

  • "The internet's fifth man". The Economist. 30 November 2013. ISSN 0013-0613. Retrieved 22 April 2020. In the early 1970s Mr Pouzin created an innovative data network that linked locations in France, Italy and Britain. Its simplicity and efficiency pointed the way to a network that could connect not just dozens of machines, but millions of them. It captured the imagination of Dr Cerf and Dr Kahn, who included aspects of its design in the protocols that now power the internet.

ethw.org

  • "Oral-History:Donald Davies & Derek Barber". Retrieved 13 April 2016. the ARPA network is being implemented using existing telegraphic techniques simply because the type of network we describe does not exist. It appears that the ideas in the NPL paper at this moment are more advanced than any proposed in the USA
  • Abbate, Janet (April 2001), "Silvia Wilbur", IEEE History Center Interview #634, Institute of Electrical and Electronics Engineers, I mean, when we actually got it working, and started sending emails—it was one of the first things we started to do. I was probably one of the first people in this country [the United Kingdom] ever to send an email, back in 1974.

forbes.com

  • Press, Gil. "A Very Short History Of The Internet And The Web". Forbes. Retrieved 7 February 2020. Roberts' proposal that all host computers would connect to one another directly ... was not endorsed ... Wesley Clark ... suggested to Roberts that the network be managed by identical small computers, each attached to a host computer. Accepting the idea, Roberts named the small computers dedicated to network administration 'Interface Message Processors' (IMPs), which later evolved into today's routers.

gcn.com

ghostarchive.org

gla.ac.uk

dcs.gla.ac.uk

harvard.edu

ui.adsabs.harvard.edu

historyofcomputercommunications.info

hpcwire.com

icann.org

icannwatch.org

ieee.org

ieee.org

ieeexplore.ieee.org

spectrum.ieee.org

ieeeghn.org

  • IEEE, "Sally Floyd", IEEE Global History Network (last visited 7 October 2012).

ietf.org

datatracker.ietf.org

tools.ietf.org

ietf.org

illinois.edu

ncsa.illinois.edu

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. "As well as the packet switched network actually built at NPL for communication between their local computing facilities, some simulation experiments have been performed on larger networks. A summary of this work is reported in [69]. The work was carried out to investigate networks of a size capable of providing data communications facilities to most of the U.K. ... Experiments were then carried out using a method of flow control devised by Davies [70] called 'isarithmic' flow control. ... The simulation work carried out at NPL has, in many respects, been more realistic than most of the ARPA network theoretical studies."
  • 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."

incits.org

independent.ie

inria.fr

internet-guide.co.uk

internethalloffame.org

internetsociety.org

isoc.org

jhu.edu

muse.jhu.edu

jisc.ac.uk

archiveshub.jisc.ac.uk

jstor.org

jucs.org

  • "Evolution of Internet Gopher", Mark P. McCahill and Farhad X. Anklesaria, Journal of Universal Computer Science, vol 1, issue 4 (April 1995), pages 235-246.

kurzweilai.net

lbl.gov

ee.lbl.gov

crd.lbl.gov

livemint.com

livinginternet.com

man.ac.uk

cs.man.ac.uk

  • Barber, Derek (Spring 1993). "The Origins of Packet Switching". The Bulletin of the Computer Conservation Society (5). ISSN 0958-7403. Retrieved 6 September 2017. Roger actually convinced Larry that what he was talking about was all wrong and that the way that NPL were proposing to do it was right. I've got some notes that say that first Larry was sceptical but several of the others there sided with Roger and eventually Larry was overwhelmed by the numbers.

mit.edu

mercury.lcs.mit.edu

medg.lcs.mit.edu

dspace.mit.edu

csail.mit.edu

web.mit.edu

mpi-sws.org

people.mpi-sws.org

multicians.org

nae.edu

nationalacademies.org

www8.nationalacademies.org

nationalarchives.gov.uk

webarchive.nationalarchives.gov.uk

nethistory.info

  • "On packet switching". Net History. Retrieved 8 January 2024. [Scantlebury said] We referenced Baran's paper in our 1967 Gatlinburg ACM paper. You will find it in the References. Therefore I am sure that we introduced Baran's work to Larry (and hence the BBN guys).

networkworld.com

nih.gov

pubmed.ncbi.nlm.nih.gov

nist.gov

nvlpubs.nist.gov

  • "DESIGN ALTERNATIVES FOR COMPUTER NETWORK SECURITY" (PDF). January 1978. The discussion will generally be limited to ARPA-like protocols (CRO-71), but will also consider suggested variations such as Walden's message-switching protocol. ... At the same time, the basic protocol selection should be reviewed to see if the message-switching protocol of Walden might be better suited for a secure net. He discusses the handling of "ports" as capabilities (in an access control sense) but does not consider the potential problems of controlling the establishment of end-to-end communications paths (i.e., setting up the encipherment keys). Since the "connections" in his scheme would only exist for the flow of one message, the dialog-oriented approach that we have taken for the SC might not apply. [*The notion of connection appears to be prerequisite for end-to-end encipherment (using a separate encryption key for each dialog), and to implement the explicit opening and closing of a particular communication path. However, end-to-end protection is possible by a combination of encipherment and other protection means.] In contrast, the current ARPA net protocol is connection-oriented (a connection is created by control commands for use during a dialog) and therefore seems to fit well with our scheme. However, the intuitive appeal of using a message-oriented protocol for a message-switched network deserves additional attention.

nominum.com

npr.org

nsf.gov

nsrc.org

ntp.org

support.ntp.org

nytimes.com

opencobalt.org

ox.ac.uk

oii.ox.ac.uk

packet.cc

  • Roberts, Dr. Lawrence G. (May 1995). "The ARPANET & Computer Networks". Archived from the original on 24 March 2016. Retrieved 13 April 2016. Then in June 1966, Davies wrote a second internal paper, "Proposal for a Digital Communication Network" In which he coined the word packet,- a small sub part of the message the user wants to send, and also introduced the concept of an "Interface computer" to sit between the user equipment and the packet network.

postel.org

princeton.edu

cs.princeton.edu

  • Cerf, V.; Kahn, R. (1974). "A Protocol for Packet Network Intercommunication" (PDF). IEEE Transactions on Communications. 22 (5): 637–648. doi:10.1109/TCOM.1974.1092259. ISSN 1558-0857. The authors wish to thank a number of colleagues for helpful comments during early discussions of international network protocols, especially R. Metcalfe, R. Scantlebury, D. Walden, and H. Zimmerman; D. Davies and L. Pouzin who constructively commented on the fragmentation and accounting issues; and S. Crocker who commented on the creation and destruction of associations.

rand.org

researchgate.net

reston.va.us

cnri.reston.va.us

rfc-editor.org

scribd.com

searchenginewatch.com

semanticscholar.org

api.semanticscholar.org

pdfs.semanticscholar.org

si.edu

americanhistory.si.edu

  • "Smithsonian Oral and Video Histories: Vinton Cerf". National Museum of American History. Smithsonian Institution. 24 April 1990. Retrieved 23 September 2019. Roger Scantlebury was one of the major players. And Donald Davies who ran, at least he was superintendent of the information systems division or something like that. I absolutely had a lot of interaction with NPL at the time. They in fact came to the ICCC 72 and they had been coming to previous meetings of what is now called Datacomm. Its first incarnation was a long title having to do with the analysis and optimization of computer communication networks, or something like that. This started in late 1969, I think, was when the first meeting happened in Pine Hill, Georgia. I didn't go to that one, but I went to the next one that was at Stanford, I think. That's where I met Scantlebury, I believe, for the first time. Then I had a lot more interaction with him. I would come to the UK fairly regularly, partly for IFIP or INWG reasons
  • "Smithsonian Oral and Video Histories: Vinton Cerf". National Museum of American History. Smithsonian Institution. 24 April 1990. Retrieved 23 September 2019. I had a whole team of graduate students, some of whose names are now fairly familiar in the industry. Judy Estrin, who is Gerald Estrin's daughter, was one of my master's degree students. Of course, she went on to found Bridge Communications, and now she's running, or she's executive VP of the company that makes those little NCD X displays. A guy named Richard Karp, another old high school friend of mine, decided to go back to graduate school and I took him on as a research assistant. He wrote the first TCP in BCPL on the PDP 11/20 at Stanford. He went on to get a Ph.D. in theorem proving and now is president of a company called ISDN Technologies out on the west coast in Palo Alto. Another person is Yogan Dalal who was a graduate student at Stanford and was deeply involved in the design of the TCP, the first go around, and also did a lot of work on the first documents that came out in 1974. He is now vice president of software engineering at Claris Corporation, a spin off from Apple. A guy named Carl Sunshine, who has written several books on the subject of internetting, did his dissertation work in my group, and is now running a lab at Aerospace Corporation. He took a job that Steve Crocker vacated in order to go to work for Trusted Information Systems. (Laugh) I mean, you'll never be able to disentangle this group. Let's see. Then I had visitors who were there, not graduate students. I already mentioned that Gerard Lelann was with us for a year. There was another guy from Norway, Dag Belsnes. He did some really interesting work on pure datagram protocols and how you get reliable connection initiation. In fact, he managed to prove that a three way handshake was not enough and that you actually needed a five way handshake to make sure that everything was right. And we decided that was overkill and accepted the limitations the three way handshake imposed on us. There were some others. A guy named James Mathis who went on to work at SRI International on the packet radio project and now is at Apple. He built the first TCP for an Apple system. Also Darryl Rubin, now a vice president at Microsoft, and Ronald Crane who is a key person at Apple.

sigcomm.org

sri.com

stanford.edu

sloan.stanford.edu

exhibits.stanford.edu

news.stanford.edu

web.stanford.edu

techfestival.org

topquark.co.uk

  • Scantlebury, Roger; Wilkinson, Peter; Barber, Derek (2001). NPL, Packet Switching and the Internet. Symposium of the Institution of Analysts & Programmers 2001. Archived from the original on 7 August 2003. Retrieved 13 June 2024. The system first went 'live' early in 1969

ucf.edu

ece.ucf.edu

ucl.ac.uk

cs.ucl.ac.uk

ucla.edu

web.cs.ucla.edu

magazine.ucla.edu

  • Lyon, Matthew (Fall 1997). "Wired!". UCLA Magazine.

udel.edu

eecis.udel.edu

umich.edu

deepblue.lib.umich.edu

umn.edu

umedia.lib.umn.edu

usenix.org

utexas.edu

cs.utexas.edu

vefsafn.is

wayback.vefsafn.is

w3.org

washingtonpost.com

  • "A Flaw in the Design". The Washington Post. 30 May 2015. Archived from the original on 8 November 2020. Retrieved 20 February 2020. The Internet was born of a big idea: Messages could be chopped into chunks, sent through a network in a series of transmissions, then reassembled by destination computers quickly and efficiently. Historians credit seminal insights to Welsh scientist Donald W. Davies and American engineer Paul Baran. ... The most important institutional force ... was the Pentagon's Advanced Research Projects Agency (ARPA) ... as ARPA began work on a groundbreaking computer network, the agency recruited scientists affiliated with the nation's top universities.
  • "A Flaw in the Design". The Washington Post. 30 May 2015. Archived from the original on 8 November 2020. Retrieved 20 February 2020. The Internet was born of a big idea: Messages could be chopped into chunks, sent through a network in a series of transmissions, then reassembled by destination computers quickly and efficiently. Historians credit seminal insights to Welsh scientist Donald W. Davies and American engineer Paul Baran. ... The most important institutional force ... was the Pentagon's Advanced Research Projects Agency (ARPA) ... as ARPA began work on a groundbreaking computer network, the agency recruited scientists affiliated with the nation's top universities.
  • "A history of e-mail: Collaboration, innovation and the birth of a system". Washington Post. 20 May 2023. ISSN 0190-8286. Retrieved 7 July 2024.

web.archive.org

wired.com

wiwiw.org

worldcat.org

search.worldcat.org

worldcat.org