Pankaj Kakkar
University of Pennsylvania
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Pankaj Kakkar.
IEEE Network | 1998
D S Alexander; William A. Arbaugh; Michael Hicks; Pankaj Kakkar; Angelos D. Keromytis; Jonathan T. Moore; Carl A. Gunter; Scott M. Nettles; Jonathan M. Smith
Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance must be achieved while maintaining the usability of the network. The SwitchWare active network architecture is a novel approach to achieving this balance using three layers: active packets, which contain mobile programs that replace traditional packets; active extensions, which provide services on the network elements and can be dynamically loaded; and a secure active router infrastructure, which forms a high-integrity base on which the security of the other layers depends. In addition to integrity checking and cryptography-based authentication, security in our architecture depends heavily on verification techniques from programming languages, such as strong type checking.
international conference on computational logistics | 1998
Michael Hicks; Pankaj Kakkar; Jonathan T. Moore; Carl A. Gunter; Scott M. Nettles
We present here a methodology for programming active networks in the environment defined by our new language PLAN (Packet Language for Active Networks). This environment presumes a two-level architecture consisting of: 1. active packets carrying PLAN code; and 2. downloadable, node-resident services written in more general-purpose languages. We present several examples which illustrate how these two features can be combined to implement various network functions.
Proceedings DARPA Active Networks Conference and Exposition | 2002
Livio Ricciulli; Phillip A. Porras; Patrick Lincoln; Pankaj Kakkar; Steven L. Dawson
We present ANCORS, an adaptable network control and reporting system that merges technology from network management and distributed simulation to provide a unified paradigm for assessing, controlling, and designing active networks. ANCORS introduces a framework to assist in managing the substantial complexities of software reuse and scalability in active network environments. Specifically, ANCORS provides an extensible approach to the dynamic integration, management, and runtime assessment of various network protocols in live network operations. We present some of the advantages that can be obtained by merging technology from network management, distributed simulation, and active networking, and describe how ANCORS leverages complementary elements of each. We describe ANCORSs network engineering support to enable efficient, high-fidelity distributed simulation of networking software. We then use ANCORS to perform a quantitative study of the Random Drop SYN attack defense mechanism.
Lecture Notes in Computer Science | 2000
Pankaj Kakkar; Michael Mcdougall; Carl A. Gunter; Trevor Jim
Any security architecture for a wide area network system spanning multiple administrative domains will require support for policy delegation and certificate distribution across the network. Practical solutions will support local autonomy requirements of participating domains by allowing local policies to vary but imposing restrictions to ensure overall coherence of the system. This paper describes the design of a such a system to control access to experiments on the ABone active network testbed. This is done through a special-purpose language extending the Query Certificate Manager (QCM) system to include protocols for secure mirroring. Our approach allows significant local autonomy while ensuring global security of the system by integrating verification with retrieval. This enables transparent support for a variety of certificate distribution protocols. We analyze requirements of the ABONE application, describe the design of a security infrastructure for it, and discuss steps toward implementation, testing and deployment of the system.
Electronic Notes in Theoretical Computer Science | 1999
Pankaj Kakkar; Michael Hicks; Jonathan T. Moore; Carl A. Gunter
Abstract We discuss how the specification of the PLAN programming language supports the design objectives of the language. The specification aims to provide a mathematically precise operational semantics that can serve as a standard for implementing interpreters and portable programs. The semantics should also support proofs of key properties of PLAN that would hold of all conformant implementations. This paper discusses two such properties. (1) Type checking is required, but interpreters are given significant flexibility about when types are checked; the specification must support a clear description of the possible behaviors of a network of conformant implementations. (2) It is essential to have guarantees about how PLAN programs use global resources, but the specification must be flexible about extensions in the network service layer. We illustrate on of kind of issue that will arise in using to specification to prove properties of the network based on the choice of services.
international conference on functional programming | 1998
Michael Hicks; Pankaj Kakkar; Jonathan T. Moore; Carl A. Gunter; Scott M. Nettles
international conference on functional programming | 1998
Michael Hicks; Pankaj Kakkar; Jonathan T. Moore; Carl A. Gunter; Scott M. Nettles
Archive | 1998
D. Scott Alexander; William A. Arbaugh; Michael Hicks; Pankaj Kakkar; Angelos D. Keromytis; Carl A. Gunter; Scott M. Nettles; Jonathan M. Smith
Archive | 1999
Livio Ricciulli; Patrick Lincoln; Pankaj Kakkar
Archive | 1998
D. Scott Alexander; Michael Hicks; Pankaj Kakkar; Angelos D. Keromytis