西安电子科技大学计算机通信与网络 Routing算法和路由协议.pdfVIP

Routing in Circuit Switched Network • Many connections will need paths through more than one switch • Need to find a route — Efficiency — Resilience • Public telephone switches are a tree structure —Static routing uses the same approach all the time • Dynamic routing allows for changes in routing depending on traffic —Uses a peer structure for nodes 第22章 路由算法 Alternate Routing • Possible routes between end offices predefined • Originating switch selects appropriate route • Routes listed in preference order • Different sets of routes may be used at different times Routing in Packet Switched Network • Complex, crucial aspect of packet switched networks • Characteristics required — Correctness — Simplicity — Robustness — Stability — Fairness — Optimality — Efficiency • Performance Criteria — Minimum hop — Least cost Routing Considerations • Decision Time — Packet or virtual circuit basis • Decision Place — Distributed • Made by each node — Centralized — Source • Information Source — Distributed routing • Nodes use local knowledge • May collect info from adjacent nodes • May collect info from all nodes on a potential route — Central routing • Collect info from all nodes • Update timing — When is network info held by nodes updated — Fixed - never updated — Adaptive - regular updates Routing Strategies • Fixed Routing • Flooding Routing • Random Routing • Adaptive Routing Fixed Routing • Single permanent route for each source to destination pair • Determine routes using a least cost algorithm • Route fixed, at least until a change in network topology Fl