routing in circuit-switching networks has traditionally involved a static routing strategy with the use of ( 71) paths to respond to increased load . modern routing strategies provide more adaptive and flexible approaches . the routing function of a pack
<尚大教育,教育至上,人才为大:sdedu.cc>
routing in circuit-switching networks has traditionally involved a static routing strategy with the use of ( 71) paths to respond to increased load . modern routing strategies provide more adaptive and flexible approaches . the routing function of a packet-switching network attempts to find the least-cost route through the network , with cost based on the number of expected delay , or other metrics in virtually all packet-switching networks , some sort f adaptive routing technique is used . adaptive routing algorithms typically rely on the ( 73 ) information about traffic conditions among nodes . in most cases , adaptive strategies depend n status information that is ( 74 ) at one place but used at another . there is a tradeoff here tween the quality of the information and the amount of ( 75) . the exchanged information itself a load on the constituent networks , causing a performance degradation
71 a . only b . single c . alternate d . series
72 a . hops b . sites c . members d . points
73. a . exchange b . transportation c . reception d . transmissio
74 a . rejected b collected c discarded d transmitted
75 a . packets b information c data d . overhead
<尚大教育,教育至上,人才为大:sdedu.cc>