| 摘要 |
<p>Path computation involves determining (120, 930) an aggregate cost for a portion of the path, based at least on the power consumption attributable to use of interfaces along that portion, comparing (130, 930) the portion of the first possible path with a different portion corresponding to a different possible path for the traffic request, based at least on their respective aggregate costs, and selecting (140, 930) which portion to use for the traffic request based on the comparison. Having path selection influenced by the power consumption values, can lead to lower overall consumption in operation than relying only on optimizing nodes individually without regard to how the nodes are used. Path selection can take into account indications of which parts are in a power down mode, and can involve powering up such parts if needed.</p> |
