Dissemin is shutting down on January 1st, 2025

Published in

MDPI, Applied Sciences, 1(9), p. 136, 2019

DOI: 10.3390/app9010136

Links

Tools

Export citation

Search in Google Scholar

Optimizing C-RAN Backhaul Topologies: A Resilience-Oriented Approach Using Graph Invariants

This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Green circle
Published version: archiving allowed
Data provided by SHERPA/RoMEO

Abstract

At the verge of the launch of the first commercial fifth generation (5G) system, trends in wireless and optical networks are proceeding toward increasingly dense deployments, supporting resilient interconnection for applications that carry higher and higher capacity and tighter latency requirements. These developments put increasing pressure on network backhaul and drive the need for a re-examination of traditional backhaul topologies. Challenges of impending networks cannot be tackled by star and ring approaches due to their lack of intrinsic survivability and resilience properties, respectively. In support of this re-examination, we propose a backhaul topology design method that formulates the topology optimization as a graph optimization problem by capturing both the objective and constraints of optimization in graph invariants. Our graph theoretic approach leverages well studied mathematical techniques to provide a more systematic alternative to traditional approaches to backhaul design. Specifically, herein, we optimize over some known graph invariants, such as maximum node degree, topology diameter, average distance, and edge betweenness, as well as over a new invariant called node Wiener impact, to achieve baseline backhaul topologies that match the needs for resilient future wireless and optical networks.