Quantum Cryptography in Practice

BBN, Harvard, and Boston University are building the DARPA Quantum Network, the world's first network that delivers end-to-end network security via high-speed Quantum Key Distribution, and testing that Network against sophisticated eavesdropping attacks. The first network link has been up and steadily operational in our laboratory since December 2002. It provides a Virtual Private Network between private enclaves, with user traffic protected by a weak-coherent implementation of quantum cryptography. This prototype is suitable for deployment in metro-size areas via standard telecom (dark) fiber. In this paper, we introduce quantum cryptography, discuss its relation to modern secure networks, and describe its unusual physical layer, its specialized quantum cryptographic protocol suite (quite interesting in its own right), and our extensions to IPsec to integrate it with quantum cryptography.Comment: Preprint of SIGCOMM 2003 pape

Policy issues in interconnecting networks

To support the activities of the Federal Research Coordinating Committee (FRICC) in creating an interconnected set of networks to serve the research community, two workshops were held to address the technical support of policy issues that arise when interconnecting such networks. The workshops addressed the required and feasible technologies and architectures that could be used to satisfy the desired policies for interconnection. The results of the workshop are documented

Internetworking: an analysis and proposal

As the number of computer networks has grown, so has the desire for users on these networks to communicate with each other, thus the need for internetworking. Unfortunately, many of these networks were not designed with internetworking capabilities in mind. The internetworking facilities offered by a typical network range from non-existent to state of the art. Two major efforts towards internetworking are the DARPA Internet protocols and the OSI Internetworking protocols. The goals of this thesis are to acquaint the reader with the qualities which are desired in an internetworking scheme, to describe how internetworking is accomplished currently, and how these protocols might be modified to better suit the needs of the internetwork user. To this end, this thesis will develop the functional requirements for an ideal internetwork, describe two current methods for internetworking, and analyze these methods against the ideal internetwork. The advantages and disadvantages of each internetworking method will be discussed. After this analysis, suggestions will be made as to how these internetworking schemes could more closely resemble the ideal internetwork

Low tech connections into the ARPA internet : the RawPacket split-gateway

This report describes a "low technology" method for connecting into the ARPA Internet. The use of a RawPacket interface in a system which supoprts IP makes possible the construction of a split-gateway between two hosts. The RawPacket interface permits a user-level process to introduce arbitrary packets into the IP layer, resulting in a virtual network interface. Since the split-gateway is implemented using a RawPacket interface, two networks may be connected together using a convenient medium which does not require explicit kernel support. Hence, split-gateways are well-suited for use as stub-gateways, connecting a local network to a long-haul network such as the ARPA backbone. In particular, the split-gateway discussed in this report achieves a reasonable level of connectivity for a comparatively small expenditure.This report details how the RawPacket software and split-gateways are implemented. In addition, various daemon configurations are presented, modifications to the operating environment are discussed, and some performance measurements are given

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks.Comment: 24 Pages, JGraph-Hoc Journa

AI-Enabled radios for dynamic spectrum sharing

C

Robust Anomaly Detection in Dynamic Networks

We propose two robust methods for anomaly detection in dynamic networks in which the properties of normal traffic are time-varying. We formulate the robust anomaly detection problem as a binary composite hypothesis testing problem and propose two methods: a model-free and a model-based one, leveraging techniques from the theory of large deviations. Both methods require a family of Probability Laws (PLs) that represent normal properties of traffic. We devise a two-step procedure to estimate this family of PLs. We compare the performance of our robust methods and their vanilla counterparts, which assume that normal traffic is stationary, on a network with a diurnal normal pattern and a common anomaly related to data exfiltration. Simulation results show that our robust methods perform better than their vanilla counterparts in dynamic networks.Comment: 6 pages. MED conferenc