Connection caching under various models of communication

Edith Cohen; Haim Kaplan; Uri Zwick

doi:10.1145/341800.341808

Connection caching under various models of communication

Edith Cohen^*, Haim Kaplan, Uri Zwick

^*Corresponding author for this work

AT&T

Research output: Contribution to conference › Paper › peer-review

8 Scopus citations

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 language	English
Pages	54-63
Number of pages	10
DOIs	https://doi.org/10.1145/341800.341808
State	Published - 2000
Externally published	Yes
Event	12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000) - Bar Harbor, ME, USA Duration: 9 Jul 2000 → 12 Jul 2000

Conference

Conference	12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000)
City	Bar Harbor, ME, USA
Period	9/07/00 → 12/07/00

Access to Document

10.1145/341800.341808

Cite this

@conference{e1f445e9cd3348eca16a1484145b145f,

title = "Connection caching under various models of communication",

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.",

author = "Edith Cohen and Haim Kaplan and Uri Zwick",

year = "2000",

doi = "10.1145/341800.341808",

language = "אנגלית",

pages = "54--63",

note = "12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000) ; Conference date: 09-07-2000 Through 12-07-2000",

}

TY - CONF

T1 - Connection caching under various models of communication

AU - Cohen, Edith

AU - Kaplan, Haim

AU - Zwick, Uri

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033659262&partnerID=8YFLogxK

U2 - 10.1145/341800.341808

DO - 10.1145/341800.341808

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0033659262

SP - 54

EP - 63

T2 - 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000)

Y2 - 9 July 2000 through 12 July 2000

ER -

Connection caching under various models of communication

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this