itai and shachnai, adaptive source routing. Address for Proofs:
Itai, Shachnai: Adaptive Source Routing..
25
Appendix
Proof of Lemma 1: The network topology implies, that any link emanating from s belongs to a
single s-t path. The proof is by interchange argument: Since any path converging network is an sp graph, we use Theorem 1 to identify an optimal strategy with a unique order of trials on the network links. Assume that M (G)= (m1;:::; mn) is a complete order on paths for an optimal strategy S on G, then M (G) contains every s-t path in G. Let mi; mi+1 be two consecutive elements in M (G), with the success probabilities pm; pm+1 respectively, then it is su cient to show, that pm< pm+1=) S is not optimal: Denote by ProbS (T> r) the probability, that for a given network, the number of trials of paths under the strategy S is higher than r, then i i i i
ES (G; p)=
n?1 X r=0
ProbS (T> r):
(12) (13)
We denote by S 0 the strategy, which switches mi and mi+1, i.e. M
= (m1;:::; mi+1; mi;:::; mn):
We handle the following two cases separately: 1. mi and mi+1 are disjoint, then it follows from 15], that
ES (G; p)? ES 0 (G; p)> 0: 2. If mi and mi+1 are dependent, then let
(14) l)
mi= (ei;:::; eik ) 1
mi= (e i +1
(+1)1
;:::; e i
(+1)
:
For some 1 j min(l; j ), the last j links in mi; mi+1 are identical. We use the notation pir; p(i+1)r for the success probabilities on eir 1 r k, e(i+1)r 1 r j respectively, then pi(k?j)= p(i+1)(l?j);:::; pik= p(i+1)l; and since failure probabilities on the links are independent,
pm+1> pm=) i i
l?j?1 Y r=1
pi
(+1)
r>
k?j?1 Y r=1
pir;
thus, conditioning on the location of the rst fault on each of the paths under the strategies S and S 0, we nd ES (G; p)? ES 0 (G; p)> 0:
免费 Proposed running head On... 暂无评价 33页 免费 Proposed running head Dy... 暂无评价 42页 免费 Proposed Running Head Tw... 暂无评价 23页 免费搜...
PROPOSED RUNNING HEAD A geometrical area-preserving VOF method Mailing adresses PROPOSED RUNNING HEAD A geometrical area-preserving VOF method Mailing adressesPROP...
Proposed running head CO... 41页 免费 Proposed Running Head Pa... 暂无评价 34页 免费 Proposed running head Ze... 暂无评价 53页 免费 Running head Pa...
免费 Proposed running head Ap... 暂无评价 31页 免费 Proposed running head On... 暂无评价 33页 免费 Proposed running head Dy... 暂无评价 42页 免费搜...
Proposed running head Invertible integer DCT algorithms Author for correspondence Integer DCTs have important applications in lossless coding. In this paper, an...
32页 免费 Proposed running head Nu... 19页 免费 Proposed running head Be... 暂无评价 58页 免费 Proposed Running Head 25页 免费搜...
免费 Proposed running head Dr... 暂无评价 27页 免费 Proposed running head Ap... 暂无评价 31页 免费 Proposed running head On... 暂无评价 33页 免费搜...
Proposed running head Send proofs to The Wiener polynomial The Wiener index is a graphical invariant that has found extensive application in chemistry. We ...
Proposed running head Lazy Scheduling for Hypercube Computers Mailing Address for sending p Processor allocation and job scheduling are two complementary techniqu...
Proposed running head: Generalization of Supersolvability Send proofs to: From August 1993 to August 1994: Bruce E. Sagan Matematiska Institutionen Kungl. ...
热门文档