default search action
Radia J. Perlman
Person information
- affiliation: EMC Corp., Bellevue, WA, USA
- affiliation (former): Digital Equipment Corp., Tewksbury, MA, USA
- affiliation (former): Intel Laboratories, USA
- affiliation (PhD 1988): Massachusetts Institute of Technology, Cambridge, MA, USA
- award (2014): Internet Hall of Fame
- award (2010): SIGCOMM Award
- award (2005): Anita Borg Institute Women of Vision Awards
- award: National Inventors Hall of Fame
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i22]Mingui Zhang, Donald E. Eastlake III, Radia J. Perlman, Margaret Cullen, Hongjun Zhai:
Single Nickname for an Area Border RBridge in Multilevel Transparent Interconnection of Lots of Links (TRILL). RFC 9183: 1-13 (2022)
2010 – 2019
- 2019
- [j13]Radia J. Perlman:
Network protocol folklore. Comput. Commun. Rev. 49(5): 48-53 (2019) - 2018
- [i21]Yizhou Li, Donald E. Eastlake III, Linda Dunbar, Radia J. Perlman, Mohammed Umair:
Transparent Interconnection of Lots of Links (TRILL): ARP and Neighbor Discovery (ND) Optimization. RFC 8302: 1-18 (2018) - [i20]Linda Dunbar, Donald E. Eastlake III, Radia J. Perlman:
Directory-Assisted Transparent Interconnection of Lots of Links (TRILL) Encapsulation. RFC 8380: 1-10 (2018) - [i19]Radia J. Perlman, Fangwei Hu, Donald E. Eastlake III, Ting Liao:
Transparent Interconnection of Lots of Links (TRILL) Smart Endnodes. RFC 8384: 1-17 (2018) - [i18]Mingui Zhang, Donald E. Eastlake III, Radia J. Perlman, Hongjun Zhai, Dongxin Liu:
Transparent Interconnection of Lots of Links (TRILL) Multilevel Using Unique Nicknames. RFC 8397: 1-16 (2018) - 2017
- [j12]Radia J. Perlman:
Blockchain: Hype or Hope? login Usenix Mag. 42(2) (2017) - [i17]Donald E. Eastlake III, Linda Dunbar, Radia J. Perlman, Yizhou Li:
Transparent Interconnection of Lots of Links (TRILL): Edge Directory Assistance Mechanisms. RFC 8171: 1-55 (2017) - [i16]Radia J. Perlman, Donald E. Eastlake III, Mingui Zhang, Anoop Ghanwani, Hongjun Zhai:
Alternatives for Multilevel Transparent Interconnection of Lots of Links (TRILL). RFC 8243: 1-29 (2017) - [i15]Mingui Zhang, Xudong Zhang, Donald E. Eastlake III, Radia J. Perlman, Somnath Chatterjee:
Transparent Interconnection of Lots of Links (TRILL): MTU Negotiation. RFC 8249: 1-15 (2017) - 2016
- [i14]Donald E. Eastlake III, Mingui Zhang, Radia J. Perlman, Ayan Banerjee, Anoop Ghanwani, Sujay Gupta:
Transparent Interconnection of Lots of Links (TRILL): Clarifications, Corrections, and Updates. RFC 7780: 1-57 (2016) - [i13]Hongjun Zhai, Tissa Senevirathne, Radia J. Perlman, Mingui Zhang, Yizhou Li:
Transparent Interconnection of Lots of Links (TRILL): Pseudo-Nickname for Active-Active Access. RFC 7781: 1-35 (2016) - [i12]Mingui Zhang, Radia J. Perlman, Hongjun Zhai, Muhammad Durrani, Sujay Gupta:
Transparent Interconnection of Lots of Links (TRILL) Active-Active Edge Using Multiple MAC Attachments. RFC 7782: 1-22 (2016) - 2014
- [p1]Radia J. Perlman:
Routing Protocols. Computing Handbook, 3rd ed. (1) 2014: 46: 1-16 - [i11]Donald E. Eastlake III, Mingui Zhang, Puneet Agarwal, Radia J. Perlman, Dinesh G. Dutt:
Transparent Interconnection of Lots of Links (TRILL): Fine-Grained Labeling. RFC 7172: 1-27 (2014) - [i10]Donald E. Eastlake III, Radia J. Perlman, Anoop Ghanwani, Howard Yang, Vishwas Manral:
Transparent Interconnection of Lots of Links (TRILL): Adjacency. RFC 7177: 1-35 (2014) - [i9]Hongjun Zhai, Fangwei Hu, Radia J. Perlman, Donald E. Eastlake III, Olen Stokes:
Transparent Interconnection of Lots of Links (TRILL): End Station Address Distribution Information (ESADI) Protocol. RFC 7357: 1-31 (2014) - [i8]Yizhou Li, Weiguo Hao, Radia J. Perlman, Jon Hudson, Hongjun Zhai:
Problem Statement and Goals for Active-Active Connection at the Transparent Interconnection of Lots of Links (TRILL) Edge. RFC 7379: 1-13 (2014) - 2013
- [c28]Radia J. Perlman, Charlie Kaufman:
Byzantine robustness, hierarchy, and scalability. CNS 2013: 242-250 - [i7]Linda Dunbar, Donald E. Eastlake III, Radia J. Perlman, Igor Gashinsky:
Directory Assistance Problem and High-Level Design Proposal. RFC 7067: 1-15 (2013) - 2012
- [j11]Yang Tang, Patrick P. C. Lee
, John C. S. Lui, Radia J. Perlman:
Secure Overlay Cloud Storage with Access Control and Assured Deletion. IEEE Trans. Dependable Secur. Comput. 9(6): 903-916 (2012) - [c27]Irena Atov, Charlie Kaufman, Radia J. Perlman:
Scalable per-flow resource management for large hierarchical networks. HPSR 2012: 160-167 - 2011
- [c26]Radia J. Perlman, Charlie Kaufman:
Hierarchical networks with Byzantine Robustness. COMSNETS 2011: 1-11 - [i6]Radia J. Perlman, Donald E. Eastlake III, Dinesh G. Dutt, Silvano Gai, Anoop Ghanwani:
Routing Bridges (RBridges): Base Protocol Specification. RFC 6325: 1-99 (2011) - [i5]Donald E. Eastlake III, Ayan Banerjee, Dinesh G. Dutt, Radia J. Perlman, Anoop Ghanwani:
Transparent Interconnection of Lots of Links (TRILL) Use of IS-IS. RFC 6326: 1-25 (2011) - [i4]Donald E. Eastlake III, Radia J. Perlman, Anoop Ghanwani, Dinesh G. Dutt, Vishwas Manral:
Routing Bridges (RBridges): Adjacency. RFC 6327: 1-26 (2011) - [i3]Radia J. Perlman, Donald E. Eastlake III, Yizhou Li, Ayan Banerjee, Fangwei Hu:
Routing Bridges (RBridges): Appointed Forwarders. RFC 6439: 1-15 (2011) - 2010
- [c25]Radia J. Perlman, Charlie Kaufman, Ray A. Perlner:
Privacy-preserving DRM. IDtrust 2010: 69-83 - [c24]Yang Tang, Patrick P. C. Lee
FADE: Secure Overlay Cloud Storage with File Assured Deletion. SecureComm 2010: 380-397 - [c23]Radia J. Perlman:
Protocol design for effective communication among silicon or carbon-based nodes. SIGCOMM 2010: 1-2
2000 – 2009
- 2009
- [c22]Radia J. Perlman:
Folklore of robust network routing. DRCN 2009: 21-28 - [i2]Joe Touch, Radia J. Perlman:
Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement. RFC 5556: 1-17 (2009) - 2008
- [c21]Radia J. Perlman, Charlie Kaufman:
User-centric PKI. IDtrust 2008: 59-71 - 2007
- [c20]Radia J. Perlman:
File System Design with Assured Delete. NDSS 2007 - 2006
- [c19]Radia J. Perlman:
Routing Without Tears, Bridging Without Danger. USENIX ATC, General Track 2006 - 2005
- [c18]Radia J. Perlman:
What's a PKI, Why Would I Want One, and How Should it Be Designed? LISA 2005 - [c17]Radia J. Perlman:
File System Design with Assured Delete. IEEE Security in Storage Workshop 2005: 83-88 - 2004
- [c16]Radia J. Perlman:
Models for IP multicast. ICON 2004: 678-682 - [c15]Radia J. Perlman:
Rbridges: Transparent Routing. INFOCOM 2004: 1211-1218 - 2003
- [c14]Charlie Kaufman, Radia J. Perlman, Bill Sommerfeld:
DoS protection for UDP-based protocols. CCS 2003: 2-7 - 2002
- [c13]Dah-Ming Chiu, Miriam Kadansky, Radia J. Perlman, John Reynders, Guy L. Steele Jr., Murat Yuksel:
Deadlock-Free Routing Based on Ordered Links. LCN 2002: 62-71 - [c12]Radia J. Perlman:
Mythology and Folklore of Network Protocols. LCN 2002: 289 - 2001
- [c11]Yassir Elley, Anne H. Anderson, Steve Hanna, Sean Mullan, Radia J. Perlman, Seth Proctor:
Building Certifications Paths: Forward vs. Reverse. NDSS 2001 - [c10]Charlie Kaufman, Radia J. Perlman:
PDM: A New Strong Password-Based Protocol. USENIX Security Symposium 2001 - [c9]Radia J. Perlman, Charlie Kaufman:
Analysis of the IPSec Key Exchange Standard. WETICE 2001: 150-156 - 2000
- [j10]Radia J. Perlman, Charlie Kaufman:
Key Exchange in IPSec: Analysis of IKE. IEEE Internet Comput. 4(6): 50-56 (2000) - [i1]Stephen E. Deering, Susan Hares, Charles E. Perkins, Radia J. Perlman:
Overview of the 1998 IAB Routing Workshop. RFC 2902: 1-16 (2000)
1990 – 1999
- 1999
- [j9]Radia J. Perlman:
An overview of PKI trust models. IEEE Netw. 13(6): 38-43 (1999) - [c8]Radia J. Perlman, Charlie Kaufman:
Secure Password-Based Protocol for Downloading a Private Key. NDSS 1999 - [c7]Radia J. Perlman, Suchitra Raman:
Techniques for Making IP Multicast Simple and Scalable. Networked Group Communication 1999: 270-285 - 1997
- [r1]Radia J. Perlman:
Routing Protocols. The Computer Science and Engineering Handbook 1997: 1800-1814 - 1995
- [b2]Charlie Kaufman, Radia J. Perlman, Mike Speciner:
Network security - private communication in a public world. Prentice Hall series in computer networking and distributed systems, Prentice Hall 1995, ISBN 978-0-13-061466-7, pp. I-XX, 1-504 - 1993
- [j8]Ross W. Callon, Radia J. Perlman, I. Michael C. Shand:
Routing Architecture. Digit. Tech. J. 5(1) (1993) - 1991
- [j7]Radia J. Perlman:
A comparison between two routing protocols: OSPF and IS-IS. IEEE Netw. 5(5): 18-24 (1991) - 1990
- [j6]George Varghese, Radia J. Perlman:
Transparent Interconnection of Incompatible Local Area Networks Using Bridges. IEEE J. Sel. Areas Commun. 8(1): 42-48 (1990)
1980 – 1989
- 1988
- [b1]Radia J. Perlman:
Network layer protocols with Byzantine robustness. Massachusetts Institute of Technology, Cambridge, MA, USA, 1988 - [j5]Michael Soha, Radia J. Perlman:
Comparison of two LAN bridge approaches. IEEE Netw. 2(1): 37-43 (1988) - [j4]Radia J. Perlman, Arthur Harvey, George Varghese:
Choosing the appropriate ISO layer for LAN interconnection. IEEE Netw. 2(1): 81-86 (1988) - [c6]Radia J. Perlman, George Varghese:
Pitfalls in the design of distributed routing algorithms. SIGCOMM 1988: 43-54 - 1987
- [j3]Radia J. Perlman, George Varghese:
Transparent interconnection of incompatible local area networks using bridges. Comput. Commun. Rev. 17(5): 381-389 (1987) - 1985
- [j2]Radia J. Perlman:
Hierarchical Networks and the Subnetwork Partition Problem. Comput. Networks 9: 297-303 (1985) - [c5]Radia J. Perlman:
An algorithm for distributed computation of a spanningtree in an extended LAN. SIGCOMM 1985: 44-53 - [c4]Radia J. Perlman, E. Stecher, P. Karp:
Directory services/IBM versus CCITT (panel session, title only). SIGCOMM 1985: 105 - 1983
- [j1]Radia J. Perlman:
Fault-Tolerant Broadcast of Routing Information. Comput. Networks 7: 395-405 (1983) - [c3]Radia J. Perlman:
Fault-Tolerant Broadcast of Routing Information. INFOCOM 1983: 93-102 - [c2]Radia J. Perlman:
Incorporation of multiaccess links into a routing protocol. SIGCOMM 1983: 85-94 - 1981
- [c1]Radia J. Perlman:
Incorporation of service classes into a network architecture. SIGCOMM 1981: 204-210
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: