Network topology

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

Initializing newly deployed ad hoc and sensor networks

Abstract: A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems existing during the initialization phase of ad hoc and sensor networks. Particularly, we model the network as a multi-hop quasi unit disk graph and allow nodes to wake up asynchronously at any time. Further, nodes do not feature a reliable collision detection mechanism, and they have only limited knowledge about the network topology. We show that even for this restricted model, a good clustering can be computed efficiently. Our algorithm efficiently computes an asymptotically optimal clustering. Based on this algorithm, we describe a protocol for quickly establishing synchronized sleep and listen schedule between nodes within a cluster. Additionally, we provide simulation results in a variety of settings.

A review of transmission switching and network topology optimization

Abstract: Currently, there are multiple national directives that call for the development of a smarter electrical grid. This includes, but is not limited to, the development of advanced transmission technologies as well as optimizing the use of transmission. Transmission control has been identified as a valuable mechanism for a variety of benefits, from improving the system reliability to improving the market surplus. However, the use of transmission as a controllable asset today is limited. This paper provides a literature review on transmission control and discusses current industry practices involving transmission control; the goal of this paper is to reemphasize the importance of transmission control in order to initiate future research and development in this area so that we are able to truly build and operate a smarter, more flexible transmission grid.

Efficient broadcasting using network coding

Abstract: We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of log n, where n is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.

ICP: Design and evaluation of an Interest control protocol for content-centric networking

Abstract: Content-centric networking (CCN) brings a paradigm shift in the present Internet communication model by addressing named-data instead of host locations. With respect to TCP/IP, the transport model is connectionless with a unique endpoint at the receiver, driving a retrieval process natively point to multi-point. Another salient feature of CCN is the possibility to embed storage capabilities into the network, adding a new dimension to the transport problem. The focus of this work is on the design of a receiver-driven Interest control protocol for CCN, whose definition, to the best of our knowledge, still lacks in literature. ICP realizes a window-based Interest flow control, achieving full efficiency and fairness under proper parameters setting. In this paper, we provide an analytical characterization of average rate, expected data transfer delay and queue dynamics in steady state on a single and multi-bottleneck network topology. Our model accounts for the impact of on-path caches. Protocol performance is also assessed via packet-level simulations and design guidelines are drawn from previous analysis.

The Segment Routing Architecture

Abstract: Network operators anticipate the offering of an increasing variety of cloud-based services with stringent Service Level Agreements. Technologies currently supporting IP networks however lack the flexibility and scalability properties to realize such evolution. In this article, we present Segment Routing (SR), a new network architecture aimed at filling this gap, driven by use-cases defined by network operators. SR implements the source routing and tunneling paradigms, letting nodes steer packets over paths using a sequence of instructions (segments) placed in the packet header. As such, SR allows the implementation of routing policies without per-flow entries at intermediate routers. This paper introduces the SR architecture, describes its related ongoing standardization efforts, and reviews the main use-cases envisioned by network operators.