交换网络的路由技术.pptVIP

Routing * routing 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 * Routing Requirements Characteristics required Correctness Simplicity Robustness Stability Fairness Optimality Efficiency * Performance Criteria Used for selection of route Minimum hop Least cost * Decision Time and Place Time Packet or virtual circuit basis Place Distributed Made by each node Centralized Source For example * Network Information Source and Update Timing Routing decisions usually based on knowledge of network (not always) 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 * 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 * Alternate Routing Diagram * Routing Strategies Fixed Flooding Random Adaptive * Fixed Routing Single permanent route for each source to destination pair Determine routes using a least cost algorithm (appendix 10A) Route fixed, at least until a change in network topology * Fixed RoutingTables * Flooding No network info required Packet sent by node to every neighbor Incoming packets retransmitted on every link except incoming link Eventually a number of copies will arrive at destination Each packet is uniquely numbered so duplicates can be discarded Nodes can remember packets already forwarded to keep network load in bounds Can include a hop count in packets * Flooding Example * Properties of Flooding All possible routes are tried