《網(wǎng)絡(luò)管理》第三版PPT課件
網(wǎng)絡(luò)管理第三版PPT課件,網(wǎng)絡(luò)管理,網(wǎng)絡(luò),管理,第三,PPT,課件
網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 1網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 2Routing Technology lRoutingSelect the nodes and links to establish a communication channel between the source and destinationlRouting in circuit switching networksPre-determined routeBypassing routes are selected only when overflow or fault happens 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 3lRouting in packet switching networksStorage and forwardingNeed to select the next node and link when a packet reaches a nodelRouting equipmentSwitch:circuit switching networkRouter:packet switching network網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 4lRouting is a problem of optimizationOptimization parameterslHop,distance,delay,error rate and securityFundamental algorithmslShortest path algorithmlMaximum flow algorithmlMinimum cost algorithmlThe functions of routingReduce the loss and balance the load in a CSNReduce the delay in a PSN網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 5Routing in circuit switching networks lThe fundamental routing structure of the PTSN in China網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 6Dynamic routing in CSNs lStatic routing modeLower efficiency of resourcesLoad balance problemLower putting-through rate 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 7lDynamic routing mode Change routing rules according to time or loadTwo kinds of approacheslDynamic routing by timelDynamic routing by stateThe condition for adopting dynamic routinglClassless networkThe state in China網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 8lDynamic routing by time網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 9lDynamic routing by time網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 10lDynamic routing by stateRouting according to load parameters網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 11Routing in packet switching networks lBasic requirementsCorrectnessSimplenessReliability Fairness Optimization 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 12lOptimization parametersHop,delay,throughput etclClassification FloodingSelective floodingUnitary routelStatic strategylDynamic strategyIsolated typeCentralized typeDistributed type網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 13l擴(kuò)散式和選擇擴(kuò)散式 擴(kuò)散式l只要目的節(jié)點(diǎn)是可達(dá)的,分組總能傳送成功。且最先到達(dá)目的節(jié)點(diǎn)的分組走的是最佳路由l迅速產(chǎn)生許多復(fù)制的分組,網(wǎng)絡(luò)資源利用率低,吞吐量小選擇擴(kuò)散式l保持了擴(kuò)散式算法的優(yōu)點(diǎn),但付出的額外信息流的代價(jià)要小l僅適合于負(fù)荷輕的小規(guī)模網(wǎng)絡(luò)14l擴(kuò)散式和選擇擴(kuò)散式算法(a)擴(kuò)散式(b)選擇擴(kuò)散式網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 15lRandom typeRandomly select an out-port for sending an arriving packetSimpleCannot guarantee that the packet reaches the destination in timelPermanent unitary route typeA routing table stored in each nodeSimple,optimized route in normal casesCannot do on-line modification on the routing tablelPermanent multiple routes typeStatic strategy 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 16Dynamic strategylCentralized typeRoute Control Center(RCC)lCollect global routing informationlDesign optimized routing tableslSend the routing tables to related nodesMeritslGlobal computation,global optimizationlAdapt the changes of topology and trafficProblemslLower reliabilitylDifferent nodes have different delays for receiving the routing tableslCentralized traffic in the links to the RCC 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 17lIsolated typeNodes do not exchange information each other for routingTypical methodslHot PotatolStatic routing combined Hot PotatolReversed learning 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 18lDistributed typeEach node exchanges routing information with its neighboring nodesMake new routing tables when necessary lHierarchical typeIf there are a large number of nodes in a routing table,it will spend a long time to scan the tableHierarchy can reduce the number of nodes in a routing tableInternet 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 19Routing in IP networks lNetwork interconnecting and internets Various network standardslDifferent networks are necessary in a big organizationlPhysical networks are separated Internet lInterconnect different physical networksTCP/IP and IP networks網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 20lThe Routing procedure in IP networkssource host local network routerlocal network router destination network routerdestination network router destination host網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 21lAutonomous systemA group of networks governed by an independent entityInterior routing protocols are independent on other ASesExchanges routing information with other ASes by routers網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 22lAutonomous systemTwo routers belonging different ASes are called exterior neighbors when they exchange routing informationTwo routers in the same AS are called interior neighbors when they exchange routing informationThe routing protocols applied by interior neighbors are named as IGP(Interior Gateway Protocol)The routing protocols applied by exterior neighbors are named as EGP(Exterior Gateway Protocol)網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 23Routing Information Protocol(RIP)lDistance vector routing protocollThe RIP working in hostsPassive working stateCannot send own routing information to other routersBut can receive the routing information broadcasted by other routers,and modify own routing table according to the informationlThe RIP working in routersActive working stateSend own routing information to others periodicallyReceive routing information and modify own routing table網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 24lThe routing table used by RIPDestination(IP address),hops,next router(IP address)lRIP routerBroadcasts routing information once 30 secondsAlso can send the request message to inquire some routing information held by other routersAfter receiving routing information,compares the route through the sending router and the present routeIf can construct a shorter route,changes the route table網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 25lProblems to be solved in applicationsCount-to-infinityLooped routeDelay problem網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 26Open Shortest Path First(OSPF)lOpen:public protocollShortest:Dijkstras shortest routing algorithmlEach router maintains its local link state informationneighboring routers and the costs sending packets to themlRouters broadcast updated information to all others in the ASlEach router knows the topology and link state in the ASlThe router computes the shortest route to each destination according to the link state database網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 27lMajor featuresAll routers maintain a same link state database the network topological graphLink state refers to which subnets or routers the router neighbors on and how much the costs areEach router computes own routing table according to the line state database網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 28lMessages HellolNeighboring routers exchange Hello messages once 10 secondslIf have not received Hello from a router for 40 seconds,it is considered that the router is unreachableDatabase Description lAnnounce neighboring routers which updates the sender hasLink State RequestlRequest detail routing information on specified link state items from the partnerLink State UpdatelProvide the senders costs to its neighborsLink State Acknowledgment lAcknowledgment to a link state update message網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 29Exterior Gateway Protocol(EGP)lUsed by the Internet during early timelTwo routers exchanging EGP messages must be exterior neighborsEGP messages are exchanged only by one hoplThird-party restrictionsASes are connected to the backbone through Core gatewaysTree structure topology for each network to be interconnected網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 30Border Gateway Protocol(BGP)lBGP(v4)Standard Internet exterior gateway protocolHas no restraint on the interconnected networks topologyWhen a pair of ASes agree to exchange routing information,each must designate a BGP router,the two routers are said to become BGP peers of one anotherA BGP router must communicate with a peer in another AS,it should be near the edge of the AS網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 31lBGP messages Open:initialize communication Update:advertise or withdraw routes Keepalive:actively test peer connectivity Notification:response to an incorrect message網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 32lThree basic functionsInitial peer acquisitionlTwo peers establish a communication relationship with the OPEN messageSending reachability informationlA sender can advertise that one or more destinations are reachable by giving a next hop for eachlA sender can also declare that one or more destinations are no longer reachableProviding ongoing verificationlVerify the peers and the network connections are functioning correctly網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 網(wǎng)網(wǎng) 絡(luò)絡(luò) 管管 理理 教教 程程 33lBGP characteristicsDistance vector protocol:supply next hop for each destinationUse reliable transport:TCP connectionProvide path informationPropagate reachability informationSend incremental updates:deltas
收藏
編號(hào):65492060
類型:共享資源
大小:6.81MB
格式:ZIP
上傳時(shí)間:2022-03-24
40
積分
- 關(guān) 鍵 詞:
-
網(wǎng)絡(luò)管理
網(wǎng)絡(luò)
管理
第三
PPT
課件
- 資源描述:
-
《網(wǎng)絡(luò)管理》第三版PPT課件,網(wǎng)絡(luò)管理,網(wǎng)絡(luò),管理,第三,PPT,課件
展開閱讀全文
- 溫馨提示:
1: 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
2: 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
3.本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
5. 裝配圖網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。
裝配圖網(wǎng)所有資源均是用戶自行上傳分享,僅供網(wǎng)友學(xué)習(xí)交流,未經(jīng)上傳用戶書面授權(quán),請(qǐng)勿作他用。