Some Algorithmic Problems in Large Networks

Authors:
Susanne Albers
Affiliations:
-
Venue:
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Year:
2001

Citing 7
Cited 0

Page replacement with multi-size pages and applications to Web caching

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
TCP dynamic acknowledgment delay (extended abstract): theory and practice

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Connection caching

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Page replacement for general caching problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Connection caching under various models of communication

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Generalized connection caching

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Dynamic TCP acknowledgement and other stories about e/(e-1)

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We will investigate a number of algorithmic problems that arise in large networks such as the world-wide web. We will mostly concentrate on the following problems.