The Community for Technology Leaders
Policies for Distributed Systems and Networks, IEEE International Workshop on (2004)
Yorktown Heights, New York
June 7, 2004 to June 9, 2004
ISBN: 0-7695-2141-X
pp: 45
Apu Kapadia , University of Illinois at Urbana-Champaign
Prasad Naldurg , University of Illinois at Urbana-Champaign
Roy H. Campbell , University of Illinois at Urbana-Champaign
ABSTRACT
We propose a novel policy-based secure routing framework that extends the mandatory nature of network access-control policies and allows users to exercise discretionary control on what routes they choose in a given network. In contrast to existing research that focuses mainly on restricting network access based on user credentials, we present a model that allows users to specify discretionary constraints on path characteristics and discover routes based on situational trust attributes of routers in a network. In this context, we present three levels of trust-attribute certification based on inherent, consensus based, and inferred characteristics of routers. We also define a "confidence" measure that captures the "quality of protection" of a route with regard to various dynamic trust relationships that arise from this interaction between user preferences and network policy. Based on this measure, we show how to generate paths of highest confidence efficiently by using shortest path algorithms. We show how our model generalizes the notion of Quality of Protection (QoP) for secure routing and discuss how it can be applied to anonymous and privacy-aware routing, intrusion tolerant communication, and secure resource discovery for ubiquitous computing, high performance, and peer-to-peer environments.
INDEX TERMS
null
CITATION

P. Naldurg, A. Kapadia and R. H. Campbell, "Routing with Confidence: Supporting Discretionary Routing Requirements in Policy Based Networks," Policies for Distributed Systems and Networks, IEEE International Workshop on(POLICY), Yorktown Heights, New York, 2004, pp. 45.
doi:10.1109/POLICY.2004.1309149
89 ms
(Ver 3.3 (11022016))