ls3-www.cs.tu-dortmund.de/cms/medien/publikationen/EM-1996.pdf
) represented by corresponding GO- paths P={po,pt,p2,...,pn], find the worst-case blocking time of po by PI,...,P,,, denoted by WCBTu(to,Po)(t,,p,) ,..., (t,,p,)’
In [5] a novel algorithm has been described [...] [S] that WCBTR(tO*pO)(t,,p,) .(t p ) z 7.. 7 “. ”
WCBTE(tO*jiO)(t,,&) ,.... (tn.&) where pi for i=l,...,n is the GO-path
associated to the reduced path Fi (see 1.2), i.e. WCBTR(tO,pO)(t,.p,) ,..., (tn.pn) [...] presented in section I.
As in@duced in PI let WCBTE(to9&)~t,.p,) ,..., (tn,p,) denote the estimated worst-case blocking time of the distributed reduced path P that consists of the set of reduced paths {PO,. …