Matthew Condell

dblp:95/2929 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Routing and switching · 52% Software-defined and programmable networks · 35% Cellular and mobile networks · 14%
Network and information security
1 paper
Cryptographic protocols and secure computation · 67% Network security · 33%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › routing protocol
intra-domain routing
0.012001
FIRE: flexible intra-AS routing environment · IEEE J. Sel. Areas Commun. 2001
Software-defined and programmable networks
programmable routing
0.012000
FIRE: Flexible intra-AS routing environment · SIGCOMM 2000
Cryptographic protocols and secure computation
key management
0.011997
A Public-Key Based Secure Mobile IP · MobiCom 1997
Cryptographic protocols and secure computation › key management
public key infrastructure
0.011997
A Public-Key Based Secure Mobile IP · MobiCom 1997
Routing and switching › routing protocol
link-state routing
0.012001
FIRE: flexible intra-AS routing environment · IEEE J. Sel. Areas Commun. 2001
Cellular and mobile networks › mobility management
Mobile IP
0.011997
A Public-Key Based Secure Mobile IP · MobiCom 1997
Cellular and mobile networks
mobility management
0.011997
A Public-Key Based Secure Mobile IP · MobiCom 1997

Methods — techniques the papers use, named apart from their topics

x.509 · 0.0cross certification · 0.0IPsec · 0.0java implementation · 0.0
YearPublicationVenuePosition
2007 A Topological Analysis of Monitor Placement
abstract
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper behavior (e.g., attacks). The reality, however, is that it is impractical to fully instrument anything but relatively small networks and impossible to even partially instrument many parts of the Internet. This paper analyzes a subset of the general monitor placement problem where the goal is to maximize the coverage of the entire universe of potential communication pairs (i.e., source and destination are randomly distributed in the routable Internet address space). This issue arises, for example, when trying to detect/track a distributed attack. We present results from a simulation, seeded with data from skitter and RouteViews, that indicate we can monitor a packet with a high probability by monitoring relatively few points in the Internet. Our analysis suggests that the preferred strategy to place monitors should be to instrument one or two specific inter-AS links per AS for many ASes rather than deeply instrumenting a subset of the largest ASes.
Alden W. Jackson, Walter C. Milliken, Cesar A. Santivanez, Matthew Condell, W. Timothy Strayer
NCA4
2001 FIRE: flexible intra-AS routing environment
abstract
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop count), and the protocol used to distribute these metrics as an integrated package. The flexible intra-AS routing environment (FIRE) is a link-state, intradomain routing protocol that decouples these components. FIRE supports run-time-programmable algorithms and metrics over a secure link-state distribution protocol. By allowing the network operator to dynamically reprogram both the properties being advertised and the routing algorithms used to construct forwarding tables, FIRE enables the development and deployment of novel routing algorithms without the need for a new protocol to distribute state. FIRE supports multiple concurrent routing algorithms and metrics, each constructing separate forwarding tables. By using operator-specified packet filters, separate classes of traffic may be routed using completely different routing algorithms, all supported by a single routing protocol. This paper presents an overview of FIRE, focusing particularly on FIRE's novel aspects with respect to traditional routing protocols. We consider deploying several current unicast and multicast routing algorithms in FIRE, and describe our Java-based implementation.
Craig Partridge, Alex C. Snoeren, W. Timothy Strayer, Beverly Schwartz, Matthew Condell, Isidro Castiñeyra
IEEE J. Sel. Areas Commun.5
2000 FIRE: Flexible intra-AS routing environment
abstract
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and the protocol used to distribute these metrics as an integrated package. The Flexible Intra-AS Routing Environment (FIRE) is a link-state, intra-domain routing protocol that decouples these components. FIRE supports run-time-pro- grammable algorithms and metrics over a secure link-state distribution protocol. By allowing the network operator to dynamically reprogram both the information being advertised and the routing algorithm used to construct forwarding tables in Java, FIRE enables the development and deployment of novel routing algorithms without the need for a new protocol to distribute state. FIRE supports multiple concurrent routing algorithms and metrics, each constructing separate forwarding tables. By using operator-specified packet filters, separate classes of traffic are routed using completely different routing algorithms, all supported by a single routing protocol.
Craig Partridge, Alex C. Snoeren, W. Timothy Strayer, Beverly Schwartz, Matthew Condell, Isidro Castiñeyra
SIGCOMM5
1999 A public-key based secure Mobile IP
John Zao, Stephen T. Kent, Joshua Gahm, Gregory D. Troxel, Matthew Condell, Pam Helinek, Nina Yuan, Isidro Castiñeyra
Wirel. Networks5
1997 A Public-Key Based Secure Mobile IP
abstract
The need of scaleable key management support for Mobile IP, especially the route‐optimized Mobile IP, is well known. In this paper, we present the design and the implementation of a public key management system that can be used with IETF basic and route optimized Mobile IP. The system, known as the Mobile IP Security (MoIPS) system, was built upon a DNS based X.509 Public Key Infrastructure and the innovation in cross certification and zero‐message key generation. The system can supply cryptographic keys for authenticating Mobile IPv.4 location management messages and establishing IPSec tunnels for Mobile IP redirected packets. It can also be used to augment firewall traversal of Mobile IP datagrams. A FreeBSD UNIX implementation of the MoIPS prototype is available for non‐commercial uses.
John Zao, Stephen T. Kent, Joshua Gahm, Gregory D. Troxel, Matthew Condell, Pam Helinek, Nina Yuan, Isidro Castiñeyra
MobiCom5