We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic ...
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...