Connection caching under various models of communication

Edith Cohen, Haim Kaplan, Uri Zwick

Research output: Contribution to conferencePaperpeer-review

Abstract

Three different models of communication were presented to address the connection-caching problem. In the first model, hosts are allowed no extra communication. In the second model, hosts are notified by connection closures but are allowed no additional communication. In the third model, hosts are allowed to exchange information regarding shared open connections. All algorithms belonging to a natural class of marking algorithms were proved to be optimally competitive.

Original languageEnglish
Pages54-63
Number of pages10
DOIs
StatePublished - 2000
Externally publishedYes
Event12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000) - Bar Harbor, ME, USA
Duration: 9 Jul 200012 Jul 2000

Conference

Conference12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000)
CityBar Harbor, ME, USA
Period9/07/0012/07/00

Fingerprint

Dive into the research topics of 'Connection caching under various models of communication'. Together they form a unique fingerprint.

Cite this