Network topology

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

A special-purpose peer-to-peer file sharing system for mobile ad hoc networks

Abstract: Establishing peer-to-peer (P2P) file sharing for mobile ad hoc networks (MANET) requires the construction of a search algorithm for transmitting queries and search results as well as the development of a transfer protocol for downloading files matching a query. In this paper, we present a special-purpose system for searching and file transfer tailored to both the characteristics of MANET and the requirements of peer-to-peer file sharing. Our approach is based on an application layer overlay network. As innovative feature, overlay routes are set up on demand by the search algorithm, closely matching network topology and transparently aggregating redundant transfer paths on a per-file basis. The transfer protocol guarantees low transmission overhead and a high fraction of successful downloads by utilizing overlay routes. In a detailed ns-2 simulation study, we show that both the search algorithm and the transfer protocol outperform off-the-shelf approaches based on a P2P file sharing system for the wireline Internet, TCP and a MANET routing protocol.

Cooperative Optimal Control for Multi-Agent Systems on Directed Graph Topologies

Abstract: This note brings together stability and optimality theory to design distributed cooperative control protocols that guarantee consensus and are globally optimal with respect to a positive semi-definite quadratic performance criterion. A common problem in cooperative optimal control is that global optimization problems generally require global information, which is not available to distributed controllers. Optimal control for multi-agent systems is complicated by the fact that the communication graph topology interplays with the agent system dynamics. In the note we use an inverse optimality approach together with partial stability to consider the cooperative consensus and pinning control. Agents with identical linear time-invariant dynamics are considered. Communication graphs are assumed directed and having fixed topology. Structured quadratic performance indices are derived that capture the topology of the graph, which allows for global optimal control that is implemented using local distributed protocols. A new class of digraphs is defined that admits a distributed solution to the global optimal control problem, namely those with simple graph Laplacian matrices.

Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

Abstract: The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration. Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint. We provide a method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration. Lower bounds on spare capacity requirements in span and path restorable networks are first compared, followed by an integer program formulation based on flow constraints which solves the spare and/or working capacity placement problem in either span or path restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed.

A dynamic routing concept for ATM-based satellite personal communication networks

Abstract: Satellite systems are going to build a part of the future personal communications infrastructure. The first-generation candidates for satellite personal communication networks (S-PCN) will rely on low Earth orbit (LEO) and medium Earth orbit (MEO) constellations. A noticeable trend in this field is toward broadband services and the use of ATM. For LEO satellite systems employing intersatellite links (ISLs), this paper proposes an overall networking concept that introduces the strengths of ATM to their operation. The core of the paper is the design of a new routing scheme for the periodically time-variant ISL subnetwork, discrete-time dynamic virtual topology routing (DT-DVTR), and its ATM implementation. DT-DVTR works completely off line, i.e., prior to the operational phase of the system. In a first step, a virtual topology is set up for all successive time intervals of the system period, providing instantaneous sets of alternative paths between all source-destination node pairs. In the second step, path sequences over a series of time interval are chosen from that according to certain optimization procedures. An ATM-based implementation of DT-DVTR in LEO satellite ISL networks is presented with some emphasis on the optimization alternatives, and the performance in terms of delay jitter is evaluated for an example ISL topology.

Geographic and Opportunistic Routing for Underwater Sensor Networks

Abstract: Underwater wireless sensor networks (UWSNs) have been showed as a promising technology to monitor and explore the oceans in lieu of traditional undersea wireline instruments. Nevertheless, the data gathering of UWSNs is still severely limited because of the acoustic channel communication characteristics. One way to improve the data collection in UWSNs is through the design of routing protocols considering the unique characteristics of the underwater acoustic communication and the highly dynamic network topology. In this paper, we propose the GEDAR routing protocol for UWSNs. GEDAR is an anycast, geographic and opportunistic routing protocol that routes data packets from sensor nodes to multiple sonobuoys (sinks) at the sea's surface. When the node is in a communication void region, GEDAR switches to the recovery mode procedure which is based on topology control through the depth adjustment of the void nodes, instead of the traditional approaches using control messages to discover and maintain routing paths along void regions. Simulation results show that GEDAR significantly improves the network performance when compared with the baseline solutions, even in hard and difficult mobile scenarios of very sparse and very dense networks and for high network traffic loads.