论文部分内容阅读
Internet routing is achieved by a set of nodes running distributed algorithms -routing protocols. However, many nodes are resistless to wrong messages or improper operations,unable to detect or correct them. Thus a wrong message or an improper operation can easilysweep almost the whole Internet. Such a fragile Internet routing comes from the features of thesealgorithms and protocols. Besides, the strategies taken by the network equipment manufacturersand administrators also are of important influence. When determining the options or selectionsin the implementation/operation, they always pay more attention to the expense of a single nodeor a single area and make some simplifications in implementations and configurations while caringless about the influence on the whole network. This paper tries to illustrate such a scheme is notreasonable at all and suggests the consideration from the view of the overall optimization. Fromthree typical cases involved in the Internet routing, a general model is abstracted, which makes theresults signiflcative for more Internet related aspects. This paper evaluates the complexity of thetheoretical analysis, then acquires the effect of error information on the whole network through thesimulation on the Internet topology. It is shown that even very little error information can incursevere impact on the Internet. And it will take much more efforts of downstream nodes to makeremedies. This result is intuitively revealed through the comparisons in the charts and the visualpresentations. Then a hierarchical solution to establish the upgrade plan is given, which helps toupgrade the nodes of the network in a most efficient and economical way.