minimum access coding

The quickest path problem is to find a path to send data from the source to the destination with minimum transmission time.

最快路是在最短的时间内把信息从源发送到目的端的路。

All-pairs quickest path problems is to send δs,t units of data from the source vs to the sink vt and find out a quickest path in the input network for all-pairs <vs, vt> ∈ V×V.

所有点对之间最快路问题就是要在所有点对(vs,vt)之间传送数据δs,t,并找出一条最快的路线。

Changed into the quickest path problem, it can be solved in polynomial_time using the algorithm for the quickest path problem.

探讨了波分多路网络 (WDM)中基于流量的多播路由问题 ,并建立了该问题与实际网络极其相近的模型 ,将该模型转化为最快路问题 ,利用最快路算法可在多项式时间内求解该问题 。