Reliable p‐Hub Location Problems in Telecommunication Networks

Abstract

Hubs are critical elements of telecommunication and transportation networks because they play a vital role in mass traffic movement. The design of more reliable networks in hub-and-spoke systems is a critical issue because current networks, particularly many commercial Internet backbones, are quite vulnerable. In hub-and-spoke-type topologies, any malfunction at a hub may cause degradation of the entire network's ability to transfer flows. This article presents a new hub location problem, termed the reliable p-hub location problem, which focuses on maximizing network performance in terms of reliability by locating hubs for delivering flows among city nodes. Two submodels, the p-hub maximum reliability model and the p-hub mandatory dispersion model, are formulated. Based on hypothetical and empirical analyses using telecommunication networks in the United States, the relationship between network performance and hub facility locations is explored. The results from these models could give useful insights into telecommunication network design.

A Multi-objective Fuzzy Goal Programming P-hub Location and Protection Model with Back-up Hubs Considering Hubs Establishment Fixed Costs

“…Hence, design of survivable and robust systems subjected to disruptions has been one of the important research topics in recent years. Survivability refers to the ability of a network to provide services uninterruptedly, despite damage to network components such as nodes and links [23]. The research on survivable network problems was addressed by Baybars and Edahl [24], in which they applied a heuristic method for facility location in telecommunication networks.…”

“…Kim and O'Kelly [23] introduced a group of models which are called P -hub protection models (PHPRO) and focus on survivable network design for telecommunications. This type of models is known as protection models, because they take precautions to make the networks manageable in the presence of unpredicted disruptions.…”

An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions

“…Kim and O'Kelly (2009) propose single and multiple allocation models to derive an optimal network structure that maximizes the expected network flow given that each arc or hub has a given reliability. Their work does not consider backup hubs and alternative routes and a tabu search heuristic is utilized to solve the real instances with up 20 nodes.…”

The reliable hub-and-spoke design problem: Models and algorithms

“…In [24], given that each arc or hub has a reliability (same as availability in this paper), they build SA and MA models to derive an optimal network structure that maximizes the expected network flow, without considering backup hubs and alternative routes. In [39] 3 The Reliable Single Allocation Hub-and-spoke Model…”