Fast heuristics for protection networks for dynamic routing

Fast heuristics for protection networks for dynamic routing

0.00 Avg rating0 Votes
Article ID: iaor20001043
Country: United Kingdom
Volume: 50
Issue: 3
Start Page Number: 262
End Page Number: 267
Publication Date: Mar 1999
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: communications
Abstract:

Traffic volatility and network reliability are important issues in the provision of high speed network services. We consider the construction of a second network, the protection network, which can carry overload traffic due to the failure or congestion of any two links in the original network. The level of protection against such contingencies can be specified by a traffic requirement matrix. We construct a fully connected protection network, for an n node network, using an O(n2) heuristic based on the largest two traffic requirements for each node. This procedure is then modified to generate a more effective O(n4) heuristic, both methods facilitate fast processing for two-hop dynamic routing. We compare the performance of the heuristics with the O(n15) optimal solution.

Reviews

Required fields are marked *. Your email address will not be published.