On the Latency in Client/Server Networks

Authors:
Affiliations:
Venue:
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Year:
1995

Citing 2
Cited 1

Contention in shared memory algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Intelligent congestion control for ABR service in ATM networks

ACM SIGCOMM Computer Communication Review

Data management issues for large scale, distributed workflow systems on the Internet

ACM SIGMIS Database

Quantified Score

Hi-index	0.01

Visualization

Abstract

We formalize the notions of latency, effective throughput, fairness, and transient period in a complexity theoretic framework. This new framework allows us to prove the first known complexity results and tight bounds on the latency in a client/server distributed computing system. Using this formal complexity model, we study a general class of fair and maximally efficient control algorithms that maximizes effective throughput and minimizes transient period. We show that any fair and maximally efficient algorithm will result in at least [cN log N + O(N)] latency, where N is the number of greedy clients in the network and the constant c is a parameter of the chosen algorithm. This lower bound is also shown to be tight.