Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

G. Robert Malan

dblp:40/6503 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Computer networks · 6 · 2 first-authorSecurity and privacy · 2Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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
6 papers
Routing and switching · 65% Network measurement and analytics · 28% Transport protocols and congestion control · 7%
Network and information security
3 papers
Network security · 100%

Topics — the 13 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention
intrusion detection
0.122004
Protocol scrubbing: network security through transparent flow modification · IEEE/ACM Trans. Netw. 2004
Transport and Application Protocol Scrubbing · INFOCOM 2000
Routing and switching › routing
routing instability
0.131999
Origins of Internet Routing Instability · INFOCOM 1999
Internet routing instability · IEEE/ACM Trans. Netw. 1998
Internet Routing Instability · SIGCOMM 1997
Routing and switching
inter-domain routing
0.031999
Origins of Internet Routing Instability · INFOCOM 1999
Internet routing instability · IEEE/ACM Trans. Netw. 1998
Internet Routing Instability · SIGCOMM 1997
Network security › intrusion detection and prevention › intrusion detection
network intrusion detection
0.012004
Protocol scrubbing: network security through transparent flow modification · IEEE/ACM Trans. Netw. 2004
Network security
traffic analysis
0.012004
Protocol scrubbing: network security through transparent flow modification · IEEE/ACM Trans. Netw. 2004
Routing and switching › routing protocol
routing protocol evaluation
0.011999
Origins of Internet Routing Instability · INFOCOM 1999
Network measurement and analytics
passive measurement
0.011998
An Extensible Probe Architecture for Network Protocol Performance Measurement · SIGCOMM 1998
Network measurement and analytics › network performance measurement
protocol performance measurement
0.011998
An Extensible Probe Architecture for Network Protocol Performance Measurement · SIGCOMM 1998
Routing and switching › inter-domain routing
BGP
0.011997
Internet Routing Instability · SIGCOMM 1997
Network measurement and analytics › internet measurement › routing measurement
BGP update analysis
0.011997
Internet Routing Instability · SIGCOMM 1997
Transport protocols and congestion control › transport protocols
TCP/IP
0.022000
Defeating TCP/IP Stack Fingerprinting · USENIX Security Symposium 2000
Transport and Application Protocol Scrubbing · INFOCOM 2000
Network security › network scanning
OS fingerprinting
0.012004
Protocol scrubbing: network security through transparent flow modification · IEEE/ACM Trans. Netw. 2004
Network measurement and analytics › internet measurement › routing measurement
BGP measurement
0.011998
Internet routing instability · IEEE/ACM Trans. Netw. 1998

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

transparent interposition · 0.1kernel implementation · 0.1passive measurement · 0.0measurement · 0.0protocol reconstruction · 0.0online data reduction · 0.0
YearPublicationVenuePosition
2004 An extensible probe architecture for network protocol performance measurement
abstract
Abstract This paper describes the architecture, implementation, and application of Windmill, a passive network protocol performance measurement tool. Windmill enables experimenters to measure a broad range of protocol performance metrics both by reconstructing application‐level network protocols and by exposing the underlying protocol layers' events. Windmill is split into three functional components: a dynamically compiled Windmill Protocol Filter (WPF), a set of abstract protocol modules, and an extensible experiment engine. To demonstrate Windmill's utility, we present the results from several experiments. The first set of experiments validates a possible cause for the correlation between Internet routing instability and network bandwidth usage. The second set of experiments highlights Windmill's ability to act as a driver for a complementary active Internet measurement infrastructure, its ability to perform online data reduction, and the non‐intrusive measurement of a closed system. Copyright © 2003 John Wiley & Sons, Ltd.
David Watson 0001, G. Robert Malan, Farnam Jahanian
Softw. Pract. Exp.2
2004 Protocol scrubbing: network security through transparent flow modification
abstract
This paper describes the design and implementation of protocol scrubbers. Protocol scrubbers are transparent, interposed mechanisms for explicitly removing network scans and attacks at various protocol layers. The transport scrubber supports downstream passive network-based intrusion detection systems by converting ambiguous network flows into well-behaved flows that are unequivocally interpreted by all downstream endpoints. The fingerprint scrubber restricts an attacker's ability to determine the operating system of a protected host. As an example, this paper presents the implementation of a TCP scrubber that eliminates insertion and evasion attacks-attacks that use ambiguities to subvert detection-on passive network-based intrusion detection systems, while preserving high performance. The TCP scrubber is based on a novel, simplified state machine that performs in a fast and scalable manner. The fingerprint scrubber is built upon the TCP scrubber and removes additional ambiguities from flows that can reveal implementation-specific details about a host's operating system.
David Watson 0001, Matthew Smart, G. Robert Malan, Farnam Jahanian
IEEE/ACM Trans. Netw.3
2002 Fault-Tolerant Virtual Private Networks within An Autonomous System
abstract
This paper proposes the concept of a fault-tolerant virtual private network (FVPN) within an autonomous system-a framework for supporting seamless network fail-over by leveraging the inherent redundancy of the underlying Internet infrastructure. The proposed architecture includes an application-level module, which is integrated into gateways at VPN end-points. This module enables fail-over to a redundant path without waiting for the underlying routing protocol converging to a new route. The paper introduces two algorithms for establishing redundant backup paths while minimizing overlapping network links. The proposed schemes are evaluated using topology information and sample routing logs from a regional Internet service provider network.
Junghee Han, G. Robert Malan, Farnam Jahanian
SRDS2
2000 Transport and Application Protocol Scrubbing
abstract
This paper describes the design and implementation of a protocol scrubber, a transparent interposition mechanism for explicitly removing network attacks at both the transport and application protocol layers. The transport scrubber supports downstream passive network-based intrusion detection systems; whereas the application scrubbing mechanism supports transparent fail-closed active network-based intrusion detection systems. The transport scrubber's role is to convert ambiguous network flows into well-behaved flows that are unequivocally interpreted by all downstream endpoints. As an example, this paper presents the implementation of a TCP/IP scrubber that eliminates insertion and evasion attacks-attacks that use ambiguities to subvert detection-on passive network-based intrusion detection systems, while preserving high performance. The application protocol scrubbing mechanism is used as a substrate for building fail-closed active network based intrusion detections systems that can respond to attacks by eluding or modifying application data flows in real-time. This paper presents the high performance implementation of a general purpose transparent application-level scrubbing toolkit in the FreeBSD kernel.
G. Robert Malan, David Watson 0001, Farnam Jahanian, Paul Howell
INFOCOM1
2000 Defeating TCP/IP Stack Fingerprinting
Matthew Smart, G. Robert Malan, Farnam Jahanian
USENIX Security Symposium2
1999 Origins of Internet Routing Instability
abstract
This paper examines the network routing messages exchanged between core Internet backbone routers. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have led to the loss of internal connectivity in wide-area, national networks. In an earlier study of inter-domain routing, we described widespread, significant pathological behaviour in the routing information exchanged between backbone service providers at the major US public Internet exchange points. These pathologies included several orders of magnitude more routing updates in the Internet core than anticipated, large numbers of duplicate routing messages, and unexpected frequency components between routing instability events. The work described in this paper extends our earlier analysis by identifying the origins of several of these observed pathological Internet routing behaviour. We show that as a result of specific router vendor software changes suggested by our earlier analysis, the volume of Internet routing updates has decreased by an order of magnitude. We also describe additional router software changes that can decrease the volume of routing updates exchanged in the Internet core by an additional 30 percent or more. We conclude with a discussion of trends in the evolution of Internet architecture and policy that may lead to a rise in Internet routing instability.
Craig Labovitz, G. Robert Malan, Farnam Jahanian
INFOCOM2
1998 An Extensible Probe Architecture for Network Protocol Performance Measurement
abstract
This paper describes the architecture and implementation of Windmill, a passive network protocol performance measurement tool. Windmill enables experimenters to measure a broad range of protocol performance metrics by both reconstructing application-level network protocols and exposing the underlying protocol layers' events. Windmill is split into three functional components: a dynamically compiled Windmill Protocol Filter (WPF), a set of abstract protocol modules, and an extensible experiment engine. To demonstrate Windmill's utility, the results from several experiments are presented. The first set of experiments suggests a possible cause for the correlation between Internet routing instability and network utilization. The second set of experiments highlights: Windmill's ability to act as a driver for a complementary active Internet measurement apparatus, its ability to perform online data reduction, and the non-intrusive measurement of a closed system.
G. Robert Malan, Farnam Jahanian
SIGCOMM1
1998 Internet routing instability
abstract
This paper examines the network interdomain routing information exchanged between backbone service providers at the major US public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have led to the loss of internal connectivity in wide-area, national networks. We describe several unexpected trends in routing instability, and examine a number of anomalies and pathologies observed in the exchange of inter-domain routing information. The analysis in this paper is based on data collected from border gateway protocol (BGP) routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period. We show that the volume of these routing updates is several orders of magnitude more than expected and that the majority of this routing information is redundant, or pathological. Furthermore, our analysis reveals several unexpected trends and ill-behaved systematic properties in Internet routing. We finally posit a number of explanations for these anomalies and evaluate their potential impact on the Internet infrastructure.
Craig Labovitz, G. Robert Malan, Farnam Jahanian
IEEE/ACM Trans. Netw.2
1997 Comparison of Two Middleware Data Dissemination Services in a Wide-Area Distributed Systems
abstract
The paper provides an experimental comparison of two middleware data dissemination services: a distributed object based service, and a message based service. The paper compares these two services in the context of a common application: a wide area network collaboratory, namely the Upper Atmospheric Research Collaboratory (UARC). UARC is an example of an application that reliably streams data from a set of suppliers to a set of receivers. This comparison highlights the tradeoffs between ease of implementation and performance for a data streaming middleware service. By relying on a rigid language primitive, namely remote method invocation, the object based dissemination service gave up the control over its transport policies. In contrast, the lower level socket based service was specifically constructed to provide a flexible interface to its applications. This flexibility allowed the middleware to better support data delivery to a heterogeneous set of receivers. This is important in a wide area distributed system where hosts are connected together over a broad spectrum of network links. The paper provides a concrete example of the effects of high level design choices in the implementation of a wide area distributed system's communication middleware.
G. Robert Malan, Farnam Jahanian, Peter Knoop
ICDCS1
1997 Internet Routing Instability
abstract
This paper examines the network inter-domain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have lead to the loss of internal connectivity in wide-area, national networks. In this paper, we describe several unexpected trends in routing instability, and examine a number of anomalies and pathologies observed in the exchange of inter-domain routing information. The analysis in this paper is based on data collected from BGP routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period. We show that the volume of these routing updates is several orders of magnitude more than expected and that the majority of this routing information is redundant, or pathological. Furthermore, our analysis reveals several unexpected trends and ill-behaved systematic properties in Internet routing. We finally posit a number of explanations for these anomalies and evaluate their potential impact on the Internet infrastructure.
Craig Labovitz, G. Robert Malan, Farnam Jahanian
SIGCOMM2