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.
|Number of pages||10|
|State||Published - 2000|
|Event||12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000) - Bar Harbor, ME, USA|
Duration: 9 Jul 2000 → 12 Jul 2000
|Conference||12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000)|
|City||Bar Harbor, ME, USA|
|Period||9/07/00 → 12/07/00|