On Minimizing Network Wide Node Update Time
In the maintenance of communication networks, nodes often need to be rebooted or brought off line for software updates, configuration updates or hardware maintenance. ISPs often run the same protocols and use equipment from the same vendor network-wide, increasing the probability that a maintenance window will be network wide. Some of the updates can be critical where the authors have to update fast, for example, updates against network viruses. This paper presents an algorithm that utilizes a priori knowledge of network traffic demand to minimize the rebooting time of the entire network, under the constraint that only a designated percentage of the network traffic volume be affected.