For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
This paper describes a new tool for gathering (performance) data from optical network devices. During the last few years many National Research and Education Networks (NRENs) have ...
In this paper we present a cost-effective, high bandwidth server I/O network architecture, named PaScal (Parallel and Scalable). We use the PaScal server I/O network to support da...
ng Link Abstraction for Wireless Sensor Networks Joseph Polastre, Jonathan Hui, Philip Levis, Jerry Zhao, David Culler, Scott Shenker, and Ion Stoica Computer Science Department In...
Joseph Polastre, Jonathan Hui, Philip Levis, Jerry...
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...