Skip to main content
Log in

Constant time per edge is optimal on rooted tree networks

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract.

 We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stochastic comparison methods. For this class of networks, we extend a previously known result that the expected delay when the crossing time is exponentially distributed yields an upper bound for the expected delay when the crossing time is constant [20] using a different approach. An important aspect of our result is that unlike most other previous work, we do not assume Poisson arrivals. Our result also extends to a variety of service distributions, and it can be used to bound the expected value of all convex, increasing functions of the packet delays. An interesting corollary of our work is that in rooted tree networks, if the expectation of the crossing time is fixed, the distribution of the crossing time that minimizes both the expected delay and the expected maximum delay is constant. Our result also holds in multi-casting rooted tree networks, where a single message can have several possible destinations.

Besides offering a useful analysis on this restricted class of networks, we also provide a small improvement to the bounding technique. Surprisingly, this improvement is also applicable to previously developed comparison methods, leading to an improvement in the upper bounds for greedy routing on butterfly and hypercube networks given by Stamoulis and Tsitsiklis [20].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: September 1996 / accepted: April 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitzenmacher, M. Constant time per edge is optimal on rooted tree networks. Distrib Comput 10, 189–197 (1997). https://doi.org/10.1007/s004460050036

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460050036

Navigation