Overview Over the past ten years, online algorithms have received considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study only started when Sleator and Tarjan (1985) suggested comparing an online algorithm to an optimal ooine algorithm and Karlin, Manasse, Rudolph and Sleator (1988) coined the term comp...

This paper discusses online power-aware routing in large sensor networks. We seek to optimize the lifetime of the network. We develop an approximation algorithm called max-min zPmin that has a good empirical competitive ratio. To ensure scalability, we introduce a hierarchical algorithm, which is called zone-based routing.

In the problem of Online Call Admission in Optical Networks, briefly called oca, we are given a graph G = (V,E) together with a set of wavelengths W (χ := |W |) and a finite sequence σ = r1, r2, . . . of calls which arrive in an online fashion. Each call rj specifies a pair of nodes to be connected. A lightpath is a path in G together with a wavelength λ ∈ W . Upon arrival of a call, an online ...