p*****h
发帖数: 3 | 1 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 algorithms can be used to find such a
tr | e***T
发帖数: 107 | 2 if you are not familiar with the area, why accept the task of reviewing
this paper?
The idea is to distribute the network status info to the edge routers
so that edge routers can make the admission control decision right at
the edge. But the point is whether the benefit of this algorithm can
overweigh the overhead of distributing the status of network. This
really depends on the framework of the proposal and how efficient the
sink tree algorithm is. As they claimed, it's a NP-complete, so how
ab
【在 p*****h 的大作中提到】
: 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 algorithms can be used to find such a
: tr
| p*****h
发帖数: 3 | 3 Thank you very much for your great comments!
The paper is dicussing the QoS flow setup in DiffServ architecture.
They argue that the conventional DiffServ schemes assume a centralized
Bandwidth Broker (BB), which is in charge of admission control and
resource allocation, and the centralized BB could be a bottleneck
under the burst of QoS flow setup activities. So they proposed the
distributed approach, where a sink tree is constructed for each egress
edge router and resource is pre-allocated alo | e***T
发帖数: 107 | 4 If you plan to stay in academia, paper review is inevitable.
If maintaining the sink-tree is efficient, (I don't know how exactly
they can analyze that quantitively, i can only assume they should include
some analysis, either mathematically or experimentally) This does avoid the
centralized BB issue and it should be feasbile.
Again, many research nowadays in research don't really care if it's easy to
implemented. Right now, the situation is no widely-accepted solution yet.
DiffServ seems a bette
【在 p*****h 的大作中提到】
: Thank you very much for your great comments!
: The paper is dicussing the QoS flow setup in DiffServ architecture.
: They argue that the conventional DiffServ schemes assume a centralized
: Bandwidth Broker (BB), which is in charge of admission control and
: resource allocation, and the centralized BB could be a bottleneck
: under the burst of QoS flow setup activities. So they proposed the
: distributed approach, where a sink tree is constructed for each egress
: edge router and resource is pre-allocated alo
|
|
