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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Janardhan Singaraju

dblp:52/1159 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 first-author

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 architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 100%
Computer networks
1 paper
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA-based network processing
0.112006
A generic lookup cache architecture for network processing applications · FPGA 2006
Routing and switching
IP lookup
0.012006
A generic lookup cache architecture for network processing applications · FPGA 2006
Routing and switching
network processing
0.012006
A generic lookup cache architecture for network processing applications · FPGA 2006

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

FPGA implementation · 0.1
YearPublicationVenuePosition
2015 Active storage networks: Using embedded computation in the network switch for cluster data processing
Janardhan Singaraju, Ajithkumar Thamarakuzhi, John A. Chandy
Future Gener. Comput. Syst.1
2006 A generic lookup cache architecture for network processing applications
abstract
In this paper, we introduce a novel architecture for constructing caches for lookup operations that are used in a variety of network processing applications. The distinguishing feature of the cache is the ability to match on keys that of arbitrary lengths. We show through an FPGA implementation, that the proposed design can speed up lookup operations significantly compared to a software implementation. In conjunction with a network processor, the use of such a cache can greatly improve the response time of lookup intensive applications such as DNS resolution, directory lookup in network storage, and LDAP queries.
Janardhan Singaraju, John A. Chandy
FPGA1
2005 A Signature Match Processor Architecture for Network Intrusion Detection
abstract
In this paper, we introduce a novel architecture for a hardware based network intrusion detection system (NIDS). NIDSs are becoming critical components of the network infrastructure as they serve as a key line of defense in network protection. However, current methods are much too compute intensive and cannot begin to meet the bandwidth requirements of a moderate sized corporate network. Thus, hardware techniques are desired to speed up network processing. This paper introduces a FPGA based signature match processor that can serve as the core of a hardware based NIDS. The signature match processor's key feature is a CAM-based cellular processor architecture that can match strings in an area efficient manner. Using a unique binary tree structure, we are also able to generate priority encoded addresses corresponding to multiple signature matches.
Janardhan Singaraju, Long Bu, John A. Chandy
FCCM1