Topic
Network topology
About: Network topology is a research topic. Over the lifetime, 52259 publications have been published within this topic receiving 1006627 citations.
Papers published on a yearly basis
Papers
More filters
08 Jun 1997
TL;DR: This paper uses an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone, and maintains local copies of the global topology of the network, along with shortest paths between all pairs of nodes.
Abstract: We impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) it is not used primarily for routing packets or flows, but only for computing and updating routes. The primary routes for packets and flows are still computed by a shortest-paths computation; the virtual backbone can, if necessary provide backup routes to handle interim failures. Because of the dynamic nature of the virtual backbone, our approach splits the routing problem into two levels: (a) find and update the virtual backbone, and (b) then find and update routes. The key contribution of this paper is to describe several alternatives for the first part of finding and updating the virtual backbone. To keep the virtual backbone as small as possible we use an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs of nodes.
836 citations
09 Jul 2003
TL;DR: This paper analytically prove several important properties of LMST: 1) the topology derived under LMST preserves the network connectivity; 2) the node degree of any node in the resulting topology is bounded by 6; and 3) the bottomology can be transformed into one with bidirectional links after removal of all unidirectional Links.
Abstract: In this paper, we present a minimum spanning tree (MST) based topology control algorithm, called local minimum spanning tree (LMST), for wireless multi-hop networks. In this algorithm, each node builds its local minimum spanning tree independently and only keeps on-tree nodes that are one-hop away as its neighbors in the final topology. We analytically prove several important properties of LMST: (1) the topology derived under LMST preserves the network connectivity; (2) the node degree of any node in the resulting topology is bounded by 6; and (3) the topology can be transformed into one with bidirectional links (without impairing the network connectivity) after removal of all uni-directional links. These results are corroborated in the simulation study.
827 citations
TL;DR: In this article, the authors search all possible three-node enzyme network topologies to identify those that could perform adaptation, and two major core topologies emerge as robust solutions: a negative feedback loop with a buffering node and an incoherent feed forward loop with proportioner node.
826 citations
27 Aug 2001
TL;DR: A 'crawler' is built to extract the topology of Gnutella's application level network, a topology graph is analyzed and the current configuration has the benefits and drawbacks of a power-law structure.
Abstract: Despite recent excitement generated by the P2P paradigm and despite surprisingly fast deployment of some P2P applications, there are few quantitative evaluations of P2P system behavior. Due to its open architecture and achieved scale, Gnutella is an interesting P2P architecture case study. Gnutella, like most other P2P applications, builds at the application level a virtual network with its own routing mechanisms. The topology of this overlay network and the routing mechanisms used have a significant influence on application properties such as performance, reliability, and scalability. We built a 'crawler' to extract the topology of Gnutella's application level network, we analyze the topology graph and evaluate generated network traffic. We find that although Gnutella is not a pure power-law network, its current configuration has the benefits and drawbacks of a power-law structure. These findings lead us to propose changes to the Gnutella protocol and implementations that bring significant performance and scalability improvements.
824 citations
TL;DR: This work shows that a network of loads and DC/AC inverters equipped with power-frequency droop controllers can be cast as a Kuramoto model of phase-coupled oscillators, and proposes a distributed integral controller based on averaging algorithms, which dynamically regulates the system frequency in the presence of a time-varying load.
819 citations