The theory of combinatorial designs has recently been used in order to build switch-centric data centre networks incorporating a large number of servers, in comparison with the popular Fat-Tree data centre network. The construction employed, called the 3-step method, revolves around an appropriately chosen (but relatively small) bipartite graph and a transversal design. In this paper, we clarif...

A wireless sensor network (WSN) is considered where each node estimates a number of node-specific desired signals by means of the distributed adaptive node-specific signal estimation (DANSE) algorithm. It is assumed that the topology of the WSN is constructed based on one of the two approaches, either a top-down approach where the WSN is composed of heterogeneous nodes, or a bottom-up approach ...

In this demonstration, we present IP Network Designer: interfaces for IP network simulation. The IP Network Designer consists of two subsystems: The IP Network Design Workbench and a 3D simulator. IP Network Design Workbench is intended to support a collaborative design and simulation of an IP network by a group of network designers and their customers. This system is based on a tangible user i...

In this paper, we present a datacenter interconnction network topology that performs at the minimal cost-latencypower product point of all Dragonfly routers in our design space. With a 1.2x cost savings and a 4x power savings over other Dragonfly designs at a 1.2x performance hit, our topology and choice of routing function are effective optimal for a modern datacenter where design choices are ...

In this paper, we present a novel approach to study and reveal network and protocol information from energy instrumentation in wireless sensor network. Unlike prior approaches which focused on analyzing the aggregate statistics of energy efficiency of a network or a protocol, our approach aims at revealing network protocols, application workloads, and topology information by fine-grained energy...

The exact calculation of all-terminal network reliability is an NP-hard problem, precluding its use in the design of optimal network topologies for problems of realistic size. This paper presents an improved upper bound for allterminal network reliability that is significantly more general than previously published bounds as it allows arcs of different reliabilities. The bound is calculated in ...

A revenue-maximizing monopolist is selling a single indivisible good to buyers who face a loss if a rival buyer obtains it. The rivalry is modeled through a network, an arc between a pair of buyers indicates that a buyer considers another buyer its rival, and the magnitude of the loss is the private information of each buyer. First, given a network, we characterize the optimal mechanism. Second...

We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, and an attacker who is capable of attacking a link in the network. We model their interaction as a zero-sum game and discuss a particular set of Nash equilibria. More specifically, we show that there always exists a Nas...

Network-on-chip designs promise to offer considerable advantages over the traditional bus-based designs in solving the numerous technological, economic and productivity problems associated with billion-transistor system-on-chip development. The authors believe that different types of networks will be required, depending on the application domain. Therefore, a very flexible network design is pro...