مرکز منطقه ای اطلاع رساني علوم و فناوري - Constant time per edge is optimal on rooted tree networks

Title of article :

Constant time per edge is optimal on rooted tree networks

Author/Authors :

Michael Mitzenmacher، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 1997

Pages :

From page :

189

To page :

197

Keywords :

Queueing theory ? Stochastic comparisons? Increasing convex ordering ? Tree networks

Journal title :

DISTRIBUTED COMPUTING

Serial Year :

1997

Journal title :

DISTRIBUTED COMPUTING

Record number :

297696

Link To Document :