Network topology

About: Network topology is a research topic. Over the lifetime, 52259 publications have been published within this topic receiving 1006627 citations.

Decentralized Environmental Modeling by Mobile Sensor Networks

Abstract: Cooperating mobile sensors can be used to model environmental functions such as the temperature or salinity of a region of ocean. In this paper, we adopt an optimal filtering approach to fusing local sensor data into a global model of the environment. Our approach is based on the use of proportional-integral (PI) average consensus estimators, whereby information from each mobile sensor diffuses through the communication network. As a result, this approach is scalable and fully decentralized, and allows changing network topologies and anonymous agents to be added and subtracted at any time. We also derive control laws for mobile sensors to move to maximize their sensory information relative to current uncertainties in the model. The approach is demonstrated by simulations including modeling ocean temperature.

CORE: A real-time network emulator

Abstract: We present CORE (common open research emulator), a real-time network emulator that allows rapid instantiation of hybrid topologies composed of both real hardware and virtual network nodes. CORE uses FreeBSD network stack virtualization to extend physical networks for planning, testing and development, without the need for expensive hardware deployments. We evaluate CORE in wired and wireless settings, and compare performance results with those obtained on physical network deployments. We show that CORE scales to network topologies consisting of over a hundred virtual nodes emulated on a typical server computer, sending and receiving traffic totaling over 300,000 packets per second. We demonstrate the practical usability of CORE in a hybrid wired-wireless scenario composed of both physical and emulated nodes, carrying live audio and video streams.

Communication Structures for Large Networks of Microcomputers

Abstract: This paper compares nine network interconnection schemes and introduces "dual-bus hypercubes," a cost-effective method of connecting thousands of dual-port single-chip microcomputers into a room-sized information processing system, a "network computer." Each network node is a chip containing memory and a pair of processors for tasks and input/output. Nodes are linked by shared communication buses, each conceptually spanning a D-dimensional, W-wide hypercube of N = WD nodes. Each node shares two buses. Each bus is shared by up to W nodes. The number of bus connections per node is fixed to satisfy chip pin limitations.

Linear-programming-based techniques for synthesis of network-on-chip architectures

Abstract: Application-specific system-on-chip (SoC) design offers the opportunity for incorporating custom network-on-chip (NoC) architectures that are more suitable for a particular application, and do not necessarily conform to regular topologies. This paper presents novel mixed integer linear programming (MILP) formulations for synthesis of custom NoC architectures. The optimization objective of the techniques is to minimize the power consumption subject to the performance constraints. We present a two-stage approach for solving the custom NoC synthesis problem. The power consumption of the NoC architecture is determined by both the physical links and routers. The power consumption of a physical link is dependent upon the length of the link, which in turn, is governed by the layout of the SoC. Therefore, in the first stage, we address the floorplanning problem that determines the locations of the various cores and the routers. In the second stage, we utilize the floorplan from the first stage to generate topology of the NoC and the routes for the various traffic traces. We also present a clustering-based heuristic technique for the second stage to reduce the run times of the MILP formulation. We analyze the quality of the results and solution times of the proposed techniques by extensive experimentation with realistic benchmarks and comparisons with regular mesh-based NoC architectures.

Scalable laws for stable network congestion control

Abstract: Discusses flow control in networks, in which sources control their rates based on feedback signals received from the network links, a feature present in current TCP protocols. We develop a congestion control system which is arbitrarily scalable, in the sense that its stability is maintained for arbitrary network topologies and arbitrary amounts of delay. Such a system can be implemented in a decentralized way with information currently available in networks plus a small amount of additional signaling.