Robustness of a routing tree for the Push Tree Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

Robustness of a routing tree for the Push Tree Problem

Abstract

The Push Tree problem contains elements from both the Steiner Tree and Shortest Path problem. It deals with the trade-offs between the push and pull mechanism used in information distribution and retrieval. In , a two step approach for the Push Tree Problem was proposed. In the first step, a «good» spanning tree (called routing tree) is constructed and then the problem is solved in this particular tree. Finding a routing tree is NP-hard but the second step may be performed easily, thus the idea is to use the routing tree as a (semi-) stable infrastructure and to perform adaptations to changing information patterns inside the routing tree. In this paper, we study the robustness of a routing tree when the information requests disappear at some nodes.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4464.pdf (171.01 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072124 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072124 , version 1

Cite

Frédéric Havet. Robustness of a routing tree for the Push Tree Problem. RR-4464, INRIA. 2002. ⟨inria-00072124⟩
86 View
67 Download

Share

Gmail Facebook Twitter LinkedIn More