Can novel Apo A-I polymorphisms be responsible for low HDL in South Asian immigrants? (2008)
Dodani Sunita, Dong Yanbin, Zhu Haidong, George Varghese
Coronary artery disease (CAD) is the leading cause of death in the world. Even though its rates have decreased worldwide over the past 30 years, event rates are still high in South Asians. South...
COGA phenotypes and linkages on chromosome 2 (2005)
Wiener Howard, Go Rodney, Tiwari Hemant, George Varghese, Page Grier
Abstract An initial linkage analysis of the alcoholism phenotype as defined by DSM-III-R criteria and alcoholism defined by DSM-IV criteria showed many, sometimes striking, inconsistencies. These...
Building a Better NetFlow (2004)
Cristian Estan, Ken Keys, David Moore, George Varghese
Network operators need to determine the composition of the tra#c mix on links when looking for dominant applications, users, or estimating tra#c matrices. Cisco's NetFlow has evolved into a solution...
Building a Better NetFlow (2004)
Cristian Estan, Ken Keys, David Moore, George Varghese
Network operators need to determine the composition of the traffic mix on links when looking for dominant applications, users, or estimating traffic matrices. Cisco's NetFlow has evolved into a...
Building a Better NetFlow: Technical Report (2004)
Cristian Estan, Ken Keys, David Moore, George Varghese
Network operators need to determine the composition of the tra#c mix on links when looking for dominant applications, users, or estimating tra#c matrices. Cisco's NetFlow has evolved into a solution...
Building a Better NetFlow (2004)
Cristian Estan, Ken Keys, David Moore, George Varghese
Network operators need to determine the composition of the tra#c mix on links when looking for dominant applications, users, or estimating tra#c matrices. Cisco's NetFlow has evolved into a solution...
Reduced State Fair Queuing for Edge and Core Routers (2004)
Ramana Rao Kompella, George Varghese
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the state needs for even...
The Impact of Address Allocation and Routing (2004)
Harsha Narayan, Ramesh Govindan, George Varghese
The recent growth in the size of the routing table has led to an interest in quantitatively understanding both the causes (e.g., multihoming) as well as the effects (e.g., impact on router lookup...
Reduced State Fair Queuing for Edge and Core Routers (2004)
Ramana Rao Kompella, George Varghese
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the state needs for even...
Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection (2004)
Nathan Tuck, Timothy Sherwood, Brad Calder, George Varghese
Intrusion Detection Systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting malicious attacks over the network. Essential to almost every intrusion...
Cone: Augmenting DHTs to Support Distributed Resource Discovery (2004)
Ranjita Bhagwan, George Varghese, Geoffrey M. Voelker
this paper is to ask whether DHTs can be generalized beyond exact and range lookups to also provide heap functionality. The answer to this question has both theoretical and practical ramifications....
Deterministic Memory-Efficient String Matching (2003)
Nathan Tuck, Timothy Sherwood, Brad Calder, George Varghese
Intrusion Detection Systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting malicious attacks over the network. Essential to almost every intrusion...
Deterministic Memory-Efficient String Matching (2003)
Nathan Tuck, Timothy Sherwood, Brad Calder, George Varghese
Intrusion Detection Systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting malicious attacks over the network. Essential to almost every intrusion...
The Measurement Manifesto (2003)
George Varghese, Cristian Estan
Useful measurement data is badly needed to help monitor and control large networks. Current approaches to solving measurement problems often assume minimal support from routers and protocols (e.g.,...
Bitmap Algorithms for Counting Active Flows on High (2003)
Cristian Estan, George Varghese, Mike Fisk
This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high speed link. Such counting can be used to detect...
The Measurement Manifesto (2003)
George Varghese, Cristian Estan
Useful measurement data is badly needed to help monitor and control large networks. Current approaches to solving measurement problems often assume minimal support from routers and protocols (e.g.,...
Bitmap Algorithms for Counting Active Flows on High (2003)
Cristian Estan, George Varghese, Mike Fisk
This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high speed link. Such counting can be used to detect...
An Architecture for Packet-Striping (2003)
George Varghese, Guru Parulkar
this article appeared in the ACM Sigcomm'96 Conference
The Impact of Address Allocation and Routing on the (2003)
Harsha Narayan, Ramesh Govindan, George Varghese
The recent growth in the size of the routing table has led to an interest in quantitatively understanding both the causes (e.g., multihoming) as well as the effects (e.g., impact on router lookup...
Packet Classification Using Multidimensional Cutting (2003)
Sumeet Singh, Florin Baboescu, George Varghese, Jia Wang
This paper introduces a classification algorithm called HyperCuts. Like the previously best known algorithm, HiCuts, HyperCuts is based on a decision tree structure. Unlike HiCuts, however, in which...
Automatically Inferring Patterns of Resource Consumption in Network Traffic (2003)
Cristian Estan, Stefan Savage, George Varghese
The Internet service model emphasizes flexibility -- any node can send any type of tra#c at any time. While this design has allowed new applications and usage models to flourish, it also makes the...
IP Lookups Using Multiway and Multicolumn Search (2003)
Butler Lampson, Venkatachary Srinivasan, George Varghese, Associate Member
IP address lookup is becoming critical because of increasing routing table sizes, speed, and traffic in the Internet. Given a set $ of prefixes and an IP address D, the IP address lookup problem is...
Efficient Implementation of a Statistics Counter Architecture (2003)
Sriram Ramabhadran, George Varghese
Internet routers and switches need to maintain millions of (e.g., per prefix) counters at up to OC-768 speeds that are essential for traffic engineering. Unfortunately, the speed requirements require...
A Pipelined Memory Architecture for High Throughput Network Processors (2003)
Timothy Sherwood, George Varghese, Brad Calder
Designing ASICs for each new generation of backbone routers is a time intensive and fiscally draining process. In this paper we focus on the design of a programmable architecture for backbone...
Packet Classification for Core Routers: Is there an alternative to CAMs (2003)
Florin Baboescu, Sumeet Singh, George Varghese
A classifier consists of a set of rules for classifying packets based on header fields. Because core routers can have fairly large (e.g., 2000 rule) database and must use limited SRAM to meet OC-768...
Packet Classification for Core Routers: Is there an alternative to CAMs? (2003)
Florin Baboescu, Sumeet Singh, George Varghese
A classifier consists of a set of rules for classifying packets based on header fields. Because core routers can have fairly large (e.g., 2000 rule) database and must use limited SRAM to meet OC-768...
A Lower Bound for Multicast Key Distribution (2003)
Jack Snoeyink, Subhash Suri, George Varghese
With the rapidly growing importance of multicast in the Internet there have been recent proposal, such as RFC 2627, for scalable key distribution such that when the r, th user joins or leaves a...
Girish P. Chandranmenon, George Varghese
To reduce web access latencies, we propose a new paradigm for caching at the reference point of a document. If a document is referred to from a , information is cached at to reduce the latency of...
Scalable Packet Classification (2003)
Florin Baboescu, George Varghese
Packet classification is important for applications such as firewalls, intrusion detection, and di#erentiated services. Existing algorithms for packet classification reported in the literature scale...
Automated Measurement of High Volume Traffic (2003)
Cristian Estan, Stefan Savage, George Varghese
Traffic measurement often focuses on measuring traffic at various granularities. Our paper considers an approach that generalizes previous solutions: we define a traffic cluster to consist of all...
Self-stabilization byCounter Flushing (2003)
A useful way to design simple and robust protocols is to make them self-stabilizing.
Fast Packet Classification for Two-Dimensional Conflict-Free Filters (2003)
Priyank Warkhede, Subhash Suri, George Varghese
Routers can use packet classification to support advanced functions such as QoS routing, virtual private networks and access control. Unlike traditional routers, which forward packets based on...
Fast Firewall Implementations for Software and Hardware-based Routers (2003)
Lili Qiu, George Varghese, Subhash Suri
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and diffserv. Classification can be based on an arbitrary number of fields in the packet...
The Fault Span of Crash Failures (2003)
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driven to arbitrary...
Multiway Range Trees: Scalable IP Lookup with Fast Updates (2003)
Subhash Suri, George Varghese, Priyank Ramesh Warkhede
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is based on a new data...
New Directions in Traffic Measurement and Accounting (2003)
Cristian Estan, George Varghese
Accurate network traffic measurement is required for accounting, bandwidth provisioning and detecting DoS attacks. These applications see the traffic as a collection of flows they need to measure. As...
Agile and Scalable Analysis of Network Events (2003)
The state of the art in general purpose software systems for large-scale traffic measurement has not progressed much past the venerable libpcap. In this paper we describe a new data analysis system...
Catching Accurate Profiles in Hardware (2003)
Satish Narayanasamy, Timothy Sherwood, Suleyman Sair, Brad Calder, George Varghese
Run-time optimization is one of the most important ways of getting performance out of modern processors. Techniques such as prefetching, trace caching, memory disambiguation etc., are all based upon...
Packet Classification for Core Routers: Is there an (2003)
Florin Baboescu, Sumeet Singh, George Varghese
A classifier consists of a set of rules for classifying packets based on header fields. Because core routers can have fairly large (e.g., 2000 rule) database and must use limited SRAM to meet OC-768...
Shidham Vinod, Chang Chung-Che, Shidham Ganesh, Ghazala Farrukh, Lindholm Paul, Kampalath Bal, ...
Abstract Background Proper histomorphological interpretation of intestinal acute graft versus host disease (A-GVHD) associated with allogeneic bone marrow transplantation (BMT) is critical for...
Information and Computation IC2581 (2002)
George Varghese, Nancy A. Lynch
this paper appeared in the 11th ACM Symposium on Principles of Distributed Computing, Aug 1992
Satish Narayanasamy, Timothy Sherwood, Suleyman Sair, Brad Calder, George Varghese
Run-time optimization is one of the most important ways of getting performance out of modern processors. Techniques such as prefetching, trace caching, memory disambiguation etc., are all based upon...
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack Protocols (2002)
George Varghese, Nancy A. Lynch
We study randomized, synchronous protocols for coordinated attack. Such protocols trade off the number of rounds (N), the worst case probability of disagreement (U), and the probability that all...
Catching Accurate Profiles in Hardware (2002)
Satish Narayanasamy, Timothy Sherwood, Suleyman Sair, Brad Calder, George Varghese
Run-time optimization is one of the most important ways of getting performance out of modern processors. Techniques such as prefetching, trace caching, memory disambiguation etc., are all based upon...
Agile and Scalable Analysis of Network Events (2002)
The state of the art in general purpose software systems for large-scale traffic measurement has not progressed much past the venerable libpcap. In this paper we describe a new data analysis system...
Fast and Scalable Conflict Detection for Packet Classifiers (2002)
Florin Baboescu, George Varghese
Packet filters provide rules for classifying packets based on header fields. High speed packet classification has received much study. However, the twin problems of fast updates and fast conflict...
Automated Measurement of High Volume Traffic (2002)
Cristian Estan, Stefan Savage, George Varghese
Traffic measurement often focuses on measuring traffic at various granularities. Our paper considers an approach that generalizes previous solutions: we define a traffic cluster to consist of all...
Fast and Scalable Conflict Detection for Packet Classifiers (2002)
Florin Baboescu, George Varghese
Packet filters provide rules for classifying packets based on header fields. High speed packet classification has received much study. However, the twin problems of fast updates and fast conflict...
Hardware-based Internet Protocol Prefix Lookups (2002)
William N. Eatherton, Prepared Professors, Jonathan S. Turner, George Varghese
Internet Protocol (IP) address lookup is a major bottleneck in high performance routers. IP address lookup is challenging because it requires a longest matching prefix lookup for databases of up to...
Scalable High-Speed Prefix Matching (2002)
Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
this paper, we introduce a taxonomy for prefix matching technologies, which we use as a basis for describing, categorizing, and comparing existing approaches. We then present in detail a fast scheme...
Scalable High Speed IP Routing Lookups (2002)
Marcel Waldvogel, George Varghese, Bernhard Plattner
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup...
Learning from the Grassroots: Lessons from Community Action for Policy Change (2002)
George Varghese, George Varughese, Working Draft
Grassroots Community action for progressive policy change has a historic lineage in India. A number of high-profile actions in recent years, such as the Chipko movement in forestry, and Sukhomajri...
New Directions in Traffic Measurement and Accounting (2001)
Cristian Estan, George Varghese
Accurate network traffic measurement is required for accounting, bandwidth provisioning, and detecting DOS attacks. However, keeping a counter to measure the traffic sent by each of a million...
Scalable High-Speed Prefix Matching (2001)
Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
Finding the longest matching prefix from a database of keywords is an old problem with a number of applications, ranging from dictionary searches to advanced memory management to computational...
Fast Packet Classification for Two-Dimensional Conflict-Free Filters (2001)
Priyank Warkhede, Subhash Suri, George Varghese
Routers can use packet classification to support advanced functions such as QoS routing, virtual private networks and access control. Unlike traditional routers, which forward packets based on...
A Lower Bound for Multicast Key Distribution (2001)
Jack Snoeyink, Subhash Suri, George Varghese
With the rapidly growing importance of multicast in the Internet there have been recent proposal, such as RFC 2627, for scalable key distribution such that when the nth user joins or leaves a group,...
Reducing Web Latency Using Reference Point Caching (2001)
Girish P. Chandranmenon, George Varghese
To reduce web access latencies, we propose a new paradigm for caching at the reference point of a document. If a document X is referred to from a document Y , information is cached at Y to reduce the...
Scalable Packet Classification (2001)
Florin Baboescu, George Varghese
Packet classification is important for applications such as firewalls, intrusion detection, and differentiated services. Existing algorithms for packet classification reported in the literature scale...
Aggregated Bit Vector Search Algorithms for Packet Filter Lookups (2001)
Florin Baboescu, George Varghese
Packet classification is important for applications such as firewalls, intrusion detection, and differentiated services. Existing algorithms for packet classification reported in the literature scale...
Fast Content-Based Packet Handling for Intrusion Detection (2001)
It is becoming increasingly common for network devices to handle packets based on the contents of packet payloads. Example applications include intrusion detection, firewalls, web proxies, and layer...
Scalable High-Speed Prefix Matching (2001)
Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
Finding the longest matching prefix from a database of keywords is an old problem with a number of applications, ranging from dictionary searches to advanced memory management to computational...
Scalable Best Matching Prefix Lookups (2001)
Marcel Waldvogel, George Varghese, Jonathan Turner, Bernhard Plattner
All global routing protocols use hierarchies to allow scaling to a world wide community while keeping the routing database size manageable. Databases of variable length prefixes are a powerful tool...
LMS: A Router Assisted Scheme for Reliable Multicast (2001)
Christos Papadopoulos, George Varghese
Building on the success of unicast IP, IP Multicast adopted a simple, open, best-effort delivery model with broadcast-within-a-group semantics. Despite several years of effort, the research community...
Fast Packet Classification for Two-Dimensional Conflict-Free Filters (2001)
Priyank Warkhede, Subhash Suri, George Varghese
Routers can use packet classification to support advanced functions such as QoS routing, virtual private networks and access control. Unlike traditional routers, which forward packets based on...
Memory-Efficient State Lookups with Fast Updates (2000)
Sandeep Sikka, George Varghese
Routers must do a best matching prefix lookup for every packet; solutions for Gigabit speeds are well known. As Internet link speeds higher, we seek a scalable solution whose speed scales with memory...
Fast Firewall Implementations for Software-based Routers (2000)
Qiu, Lili, Varghese, George, Subash, Suri
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls. The classification can be based on an arbitrary number of prefix and range fields in...
Fast Firewall Implementations for Software-based Routers (2000)
Qiu, Lili, Varghese, George, Subash, Suri
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls. The classification can be based on an arbitrary number of prefix and range fields in...
Tracking Mobile Units for Dependable Message Delivery (1999)
Amy L. Murphy, Gruia-catalin Roman, George Varghese
As computing components get smaller and people become accustomed to having computational power at their disposal at any time, mobile computing is developing as an important research area. One of the...
Efficient Fair Queuing using Deficit Round Robin (1999)
Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness...
Constraint Satisfaction as a Basis for Designing Nonmasking Fault-Tolerance (1999)
We present a method for the design of nonmasking fault-tolerant programs. In our method, a set of constraints is associated with each program. As long as faults do not occur, the constraints are...
ects include: working as part of DEC's Corporate Interconnect Task Force to design DEC's next generation network layer for Clusters, Storage, and Networks (a precursor to Gigabit Ethernet); helping...
Redesigning the BSD Callout and Timer Facilities (1999)
Adam M. Costello, George Varghese
We describe a new implementation of the BSD callout and timer facilities. Current BSD kernels take time proportional to the number of outstanding timers to set or cancel timers. Our implementation...
Trading Packet Headers for Packet Processing (1999)
In high speed networks, packet processing is relatively expensive while bandwidth is cheap. Thus it pays to add information to packet headers to make packet processing easier. While this is an old...
Conventional algorithms to implement an Operating System timer module take O(n) time to start or maintain a timer, where n is the number of outstanding timers: this is expensive for large n. This...
Reliable FIFO Load Balancing over Multiple FIFO Channels (1999)
Hari Adiseshu, Gurudatta M. Parulkar, George Varghese
Link striping algorithms are often used to overcome transmission bottlenecks in computer networks. However, traditional striping algorithms suffer from two major disadvantages. They provide...
Leap Forward Virtual Clock: (1999)
Subhash Suri, George Varghese, Girish Chandranmenon
Fair queuing is the mechanism by which routers schedule packets on output links in order to guarantee fairness and latency bounds. Fair queuing, along with with address lookup and switching, is one...
Scalable High Speed IP Routing Lookups (1999)
Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup...
Reliable and Efficient Hop-by-Hop Flow Control (1999)
Robert Simcoe, George Varghese
Hop-by-hop flow control can be used to fairly share the bandwidth of a network among competing flows. No data is lost even in overload conditions; yet each flow gets access to the maximum throughput...
The Pessimism behind Optimistic Simulation (1999)
George Varghese, Roger Chamberlain, William E. Weihl
In this paper we make an analogy between the time that storage must be maintained in a optimistic simulation and the blocking time in a conservative simulation. By exploring this analogy, we design...
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack (1999)
George Varghese, Nancy A. Lynch
We study randomized, synchronous protocols for coordinated attack. Such protocols trade off the number of rounds (N ), the worst case probability of disagreement (U ), and the probability that all...