routing in circuit-switching networks has traditionally involved a static routing strategy with the use of （1） 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 （2） adaptive routing technique is used . adaptive routing algorithms typically rely on the （3） information about traffic conditions among nodes . in most cases , adaptive strategies depend n status information that is （4） at one place but used at another . there is a tradeoff here tween the quality of the information and the amount of （5） . the exchanged information itself a load on the constituent networks , causing a performance degradation
1. a . only b . single c . alternate d . series
2. a . hops b . sites c . members d . points
3. a . exchange b . transportation c . reception d . transmissio
4. a . rejected b collected c discarded d transmitted
5. a . packets b information c data d . overhead

點(diǎn)擊注冊(cè)會(huì)員>>>即可獲取網(wǎng)絡(luò)工程師免費(fèi)在線真題、觀看免費(fèi)公開(kāi)課！

真題自測(cè)：軟考各科目歷年真題及答案解析

更多資訊可關(guān)注希賽網(wǎng)軟考頻道，問(wèn)題咨詢(xún)請(qǐng)撥打客服電話400-111-9811。