Greedy routing has drawn a lot of attention in research community. To our best knowledge, stretch factor has not been studied for greedy routing algorithms. In this paper, we propose a new greedy routing algorithm and take the initiative to evaluate its stretch factor. Our algorithm generalizes the algorithm presented in [1]. It embeds an n-vertex connected graph G(V,E) in a semi-metric space. ...

In this paper we study the problem of on-line multicasting on directed graphs, and we demonstrate the competitiveness of a greedy algorithm in a worst case analysis. We prove that the greedy algorithm performs almost as well as any on-line algorithm: the greedy upper bound is very close to the lower bound of any on-line algorithm. First, we improve on the upper bound of the oo-line greedy algor...