教程slides计算机通信.pptxVIP

CHAPTER 12 ROUTING IN SWITCHED NETWORKS Routing in Packet-Switching Networks Routing Algorithms Routing Protocols;KEY POINTS ? A variety of routing algorithms have been developed for packet switching,frame relay, and ATM networks, and for the Internet and internetworks.These algorithms share many common principles. ? Routing schemes can be categorized based on a number of factors, such as what criterion is used to determine the best route between two nodes, what strategy is used for obtaining information needed to determine route, and whether a distributed or centralized algorithm is used. ? The routing function attempts to find the least-cost route through the network, with cost based on number of hops, expected delay, or other metrics. Adaptive routing algorithms typically rely on the exchange of information about traffic conditions among nodes.;12.1 ROUTING IN PACKET-SWITCHING NETWORKS;Performance Criteria The selection of a route is generally based on some performance criterion.The simplest criterion is to choose the minimum-hop route (one that passes through the least number of nodes) through the network.1 This is an easily measured criterion and should minimize the consumption of network resources. A generalization of the minimum-hop criterion is least-cost routing.;The shortest path (fewest hops) from node 1 to node 6 is 1-3-6 (cost=5+5=10).but the least-cost path is 1-4-5-6(cost=1+1+4=6). Costs are assigned to links to support one or more design objectives.;Decision Time and Place Routing decisions are made on the basis of some performance criterion.Two key characteristics of the decision are the time and place that the decision is made. Decision time is determined by whether the routing decision is made on a packet or virtual circuit basis. When the internal operation of the network is datagram, a routing decision is made individually for each packet. For internal virtual circuit operation, a routing decision is made at the time the virtual circuit is est