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

James Giles

dblp:61/7002 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none

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

Computer networks · 1Security and privacy · 1 · 1 first-authorTheory of computation · 1 · 1 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.

Theoretical computer science
1 paper
Information theory · 61% Coding theory · 30% Algorithmic game theory and mechanism design · 9%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.012002
An information-theoretic and game-theoretic study of timing channels · IEEE Trans. Inf. Theory 2002
Information theory
information measures
0.012002
An information-theoretic and game-theoretic study of timing channels · IEEE Trans. Inf. Theory 2002
Coding theory › channel coding
timing channel
0.012002
An information-theoretic and game-theoretic study of timing channels · IEEE Trans. Inf. Theory 2002
Algorithmic game theory and mechanism design › zero-sum game
minimax game
0.012002
An information-theoretic and game-theoretic study of timing channels · IEEE Trans. Inf. Theory 2002

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

saddle-point strategies · 0.0mutual information rate · 0.0game theory · 0.0
YearPublicationVenuePosition
2005 Policy management for networked systems and applications
abstract
In this paper, we present a novel policy middleware architecture for managing IT systems and applications that span multiple networks and administrative domains. The proposed policy middleware provides a standard infrastructure for the creation, storage, distribution, and execution of policies, and helps in reducing the cost of making IT systems policy-aware. In particular, we focus on three aspects of the proposed policy middleware that help in making the middleware fully general: (1) a platform-neutral and extensible specification of policies; (2) the local ratification of policies, which lets system administrators accept, reject, or flag an incoming policy; and (3) the transformation of policies, which allows system administrators to transform incoming policies to match their local environment. We present our experience in building an application on the proposed middleware to audit the configuration of a storage area network. We also present performance results from a prototype and show that our policy middleware design can scale to handle a large number of policies.
Dakshi Agrawal, Seraphin B. Calo, James Giles, Kang-Won Lee 0002, Dinesh C. Verma
Integrated Network Management3
2002 Authentication for Distributed Web Caches
James Giles, Reiner Sailer, Dinesh C. Verma, Suresh Chari
ESORICS1
2002 An information-theoretic and game-theoretic study of timing channels
abstract
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for continuous-time or discrete-time packet waveforms. Fluid waveform approximations of each of these classes of waveforms are employed to aid in analysis. Channel capacity is defined and an information-theoretic game based on mutual information rate is studied. Min-max optimal jammers and max-min optimal input processes are sought. Bounds on the min-max and max-min mutual information rates are described, and numerical examples are given. For maximum-delay-constrained (MDC) jammers with continuous-time packet waveforms, saddle-point input and jammer strategies are identified. The capacity of the maximum-delay constrained jamming channel with continuous-time packet waveforms is shown to equal the mutual information rate of the saddle point. For MDC jammers with discrete-time packet waveforms, saddle-point strategies are shown to exist. Jammers which have quantized batch departures at regular intervals are shown to perform well. Input processes with batches at regular intervals perform well for MDC or maximum-buffer-size-constrained jammers.
James Giles, Bruce E. Hajek
IEEE Trans. Inf. Theory1