Problems in the Information Dissemination of the Internet Routing

Internet routing is achieved by a set of nodes running distributedalgorithms --- routing protocols. However, many nodesare resistless to wrong messages or improper operations, unable todetect or correct them. Thus a wrong message or an improper operationcan easily sweep almost the whole Internet. Such a fragile Internetrouting comes from the features of these algorithms and protocols.Besides, the strategies taken by the network equipment manufacturers andadministrators also are of important influence. When determining theoptions or selections in the implementation/operation, they always paymore attention to the expense of a single node or a single area andmake some simplifications in implementations and configurations whilecaring less about the influence on the whole network. This paper triesto illustrate such a scheme is not reasonable at all and suggests theconsideration from the view of the overall optimization. From threetypical cases involved in the Internet routing, a general model isabstracted, which makes the results significative for more Internetrelated aspects. This paper evaluates the complexity of the theoreticalanalysis, then acquires the effect of error information on the wholenetwork through the simulation on the Internet topology. It is shownthat even very little error information can incur severe impact on theInternet. And it will take much more efforts of downstream nodes tomake remedies. This result is intuitively revealed through thecomparisons in the charts and the visual presentations. Then a hierarchicalsolution to establish the upgrade plan is given, which helps to upgradethe nodes of the network in a most efficient and economicalway.