A fast topology update algorithm for restoration under multiple failures in broadband networks

A topology update algorithm, a particular flooding algorithm, against multiple link, path, or node failures is proposed. The algorithm accomplishes restoration faster than a similar algorithm proposed by up to three times for the first failure, up to five times for the second failure, and up to 2n + 1 times for the nth failure. The algorithm simplifies the protocol used in restoration, and reduces the number of messages passed in the network.