p*****h
发帖数: 3 | 1 【 以下文字转载自 CS 讨论区 】
【 原文由 peterzh 所发表 】
I am reviewing a paper.
The paper said:
Given an autonomous system including edge routers and core routers.
Each edge router knows the network topology and link state by OSPF protocol.
Now for each egress edge router a sink tree needs to be found, where
each leaf is an ingress edge router and each link in the tree satisfies
some conditions, such as bandwidth and delay constraints.
It can be proved the problem is NP-complete.
Then in reality some heuristic a |
|
