密查电影在线观看完整版|行尸走肉第7季在线观看免费完整版|欧美区日韩区|五月婷婷深爱五月,一级不卡免费视频 ,色戎 同类电影大尺度未删减版,国产色宗合

軟題庫 學習課程
當前位置:信管網 >> 在線考試中心 >> 網絡工程師題庫 >> 試題查看
試卷名稱
考試中心《》在線考試
試卷年份2011年上半年
試題題型【單選題】
試題內容

Border Gateway Protocol(BGP) is inter-autonomous system  (1)  protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest  (2)  count is not the preferred route. For example, we may not want a packet through an autonomous system that is not secure even though it is shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without defining the path that leads to that  (3)  . A router that receives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link  (4)  routing is also not a good candidate for inter-autonomous system routing because an internet is usually too big for this routing method. To use link state routing for the whole internet would require each router to have a huge link state database. It would also take a long time for each router to calculate its routing  (5)  using the Dijkstra algorism.
(1)A、routing
B、switching
C、transmitting
D、receiving
(2)A、path
B、hop
C、route
D、packet
(3)A、connection
B、window
C、source
D、destination
(4)A、status
B、search
C、state
D、research
(5)A、table
B、state
C、metric
D、cost

查看答案

相關試題



更多試題