Radia J. Perlman

Affiliations:
  • EMC Corp., Bellevue, WA, USA
  • Digital Equipment Corp., Tewksbury, MA, USA (former)
  • Intel Laboratories, USA (former)
  • Massachusetts Institute of Technology, Cambridge, MA, USA (PhD 1988)


According to our database1, Radia J. Perlman authored at least 64 papers between 1981 and 2022.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2016, "For contributions to the theory and practice of Internet routing and bridging protocols".

IEEE Fellow

IEEE Fellow 2008, "For contributions to network routing and security protocols".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Single Nickname for an Area Border RBridge in Multilevel Transparent Interconnection of Lots of Links (TRILL).
RFC, February, 2022

2019
Network protocol folklore.
Comput. Commun. Rev., 2019

2018
Transparent Interconnection of Lots of Links (TRILL) Smart Endnodes.
RFC, July, 2018

Transparent Interconnection of Lots of Links (TRILL) Multilevel Using Unique Nicknames.
RFC, May, 2018

Directory-Assisted Transparent Interconnection of Lots of Links (TRILL) Encapsulation.
RFC, May, 2018

Transparent Interconnection of Lots of Links (TRILL): ARP and Neighbor Discovery (ND) Optimization.
RFC, January, 2018

2017
Transparent Interconnection of Lots of Links (TRILL): MTU Negotiation.
RFC, September, 2017

Alternatives for Multilevel Transparent Interconnection of Lots of Links (TRILL).
RFC, September, 2017

Transparent Interconnection of Lots of Links (TRILL): Edge Directory Assistance Mechanisms.
RFC, June, 2017

Blockchain: Hype or Hope?
login Usenix Mag., 2017

2016
Transparent Interconnection of Lots of Links (TRILL) Active-Active Edge Using Multiple MAC Attachments.
RFC, February, 2016

Transparent Interconnection of Lots of Links (TRILL): Pseudo-Nickname for Active-Active Access.
RFC, February, 2016

Transparent Interconnection of Lots of Links (TRILL): Clarifications, Corrections, and Updates.
RFC, February, 2016

2014
Problem Statement and Goals for Active-Active Connection at the Transparent Interconnection of Lots of Links (TRILL) Edge.
RFC, October, 2014

Transparent Interconnection of Lots of Links (TRILL): End Station Address Distribution Information (ESADI) Protocol.
RFC, September, 2014

Transparent Interconnection of Lots of Links (TRILL): Adjacency.
RFC, May, 2014

Transparent Interconnection of Lots of Links (TRILL): Fine-Grained Labeling.
RFC, May, 2014

Routing Protocols.
Proceedings of the Computing Handbook, 2014

2013
Directory Assistance Problem and High-Level Design Proposal.
RFC, November, 2013

Byzantine robustness, hierarchy, and scalability.
Proceedings of the IEEE Conference on Communications and Network Security, 2013

2012
Secure Overlay Cloud Storage with Access Control and Assured Deletion.
IEEE Trans. Dependable Secur. Comput., 2012

Scalable per-flow resource management for large hierarchical networks.
Proceedings of the 13th IEEE International Conference on High Performance Switching and Routing, 2012

2011
Routing Bridges (RBridges): Appointed Forwarders.
RFC, November, 2011

Routing Bridges (RBridges): Adjacency.
RFC, July, 2011

Transparent Interconnection of Lots of Links (TRILL) Use of IS-IS.
RFC, July, 2011

Routing Bridges (RBridges): Base Protocol Specification.
RFC, July, 2011

Hierarchical networks with Byzantine Robustness.
Proceedings of the Third International Conference on Communication Systems and Networks, 2011

2010
Protocol design for effective communication among silicon or carbon-based nodes.
Proceedings of the ACM SIGCOMM 2010 Conference on Applications, 2010

FADE: Secure Overlay Cloud Storage with File Assured Deletion.
Proceedings of the Security and Privacy in Communication Networks, 2010

Privacy-preserving DRM.
Proceedings of the 9th Symposium on Identity and Trust on the Internet, 2010

2009
Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement.
RFC, May, 2009

Folklore of robust network routing.
Proceedings of the 7th International Workshop on Design of Reliable Communication Networks, 2009

2008
User-centric PKI.
Proceedings of the IDtrust 2008, 2008

2007
File System Design with Assured Delete.
Proceedings of the Network and Distributed System Security Symposium, 2007

2006
Routing Without Tears, Bridging Without Danger.
Proceedings of the 2006 USENIX Annual Technical Conference, 2006

2005
What's a PKI, Why Would I Want One, and How Should it Be Designed?
Proceedings of the 19th Conference on Systems Administration (LISA 2005), 2005

2004
Rbridges: Transparent Routing.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Models for IP multicast.
Proceedings of the 12th IEEE International Conference on Networks, 2004

2003
DoS protection for UDP-based protocols.
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002
Mythology and Folklore of Network Protocols.
Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (LCN 2002), 2002

Deadlock-Free Routing Based on Ordered Links.
Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (LCN 2002), 2002

2001
Analysis of the IPSec Key Exchange Standard.
Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE 2001), 2001

PDM: A New Strong Password-Based Protocol.
Proceedings of the 10th USENIX Security Symposium, 2001

Building Certifications Paths: Forward vs. Reverse.
Proceedings of the Network and Distributed System Security Symposium, 2001

2000
Overview of the 1998 IAB Routing Workshop.
RFC, August, 2000

Key Exchange in IPSec: Analysis of IKE.
IEEE Internet Comput., 2000

1999
An overview of PKI trust models.
IEEE Netw., 1999

Techniques for Making IP Multicast Simple and Scalable.
Proceedings of the Networked Group Communication, 1999

Secure Password-Based Protocol for Downloading a Private Key.
Proceedings of the Network and Distributed System Security Symposium, 1999

1997
Routing Protocols.
Proceedings of the Computer Science and Engineering Handbook, 1997

1995
Network security - private communication in a public world.
Prentice Hall series in computer networking and distributed systems, Prentice Hall, ISBN: 978-0-13-061466-7, 1995

1993
Routing Architecture
Digit. Tech. J., 1993

1991
A comparison between two routing protocols: OSPF and IS-IS.
IEEE Netw., 1991

1988
Network layer protocols with Byzantine robustness.
PhD thesis, 1988

Comparison of two LAN bridge approaches.
IEEE Netw., 1988

Choosing the appropriate ISO layer for LAN interconnection.
IEEE Netw., 1988

Pitfalls in the design of distributed routing algorithms.
Proceedings of the ACM Symposium on Communications Architectures and Protocols, 1988

1987
Transparent interconnection of incompatible local area networks using bridges.
Comput. Commun. Rev., 1987

1985
Hierarchical Networks and the Subnetwork Partition Problem.
Comput. Networks, 1985

Directory services/IBM versus CCITT (panel session, title only).
Proceedings of the Ninth Symposium on Data Communications, 1985

An algorithm for distributed computation of a spanningtree in an extended LAN.
Proceedings of the Ninth Symposium on Data Communications, 1985

1983
Fault-Tolerant Broadcast of Routing Information.
Comput. Networks, 1983

Incorporation of multiaccess links into a routing protocol.
Proceedings of the Eighth Symposium on Data Communications, 1983

1981
Incorporation of service classes into a network architecture.
Proceedings of the seventh symposium on Data communications, 1981


  Loading...