Amortized efficiency of list update and paging rules
Communications of the ACM
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Web caching with request reordering
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Internet Computing
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Combining request scheduling with web caching
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the value of coordination in network design
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Tradeoffs and average-case equilibria in selfish routing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
An experimental study of new and known online packet buffering algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The Network Processing Forum switch fabric benchmark specifications: an overview
IEEE Network: The Magazine of Global Internetworking
Constant factor approximations for the hotlink assignment problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
This survey article revisits resource management problems arising in large networks. More specifically, we focus on two fundamental memory management problems. In the first part of this paper we study buffer management in network routers and switches. We present various online strategies and report on their competitiveness and experimentally observed performance. The second part of the survey addresses web caching where a limited reordering of requests is allowed. We present both online and offline strategies.