Distributed Packet Rewriting and its Application to Scalable Server Architectures
Date
1998-02-01
DOI
Authors
Bestavros, Azer
Crovella, Mark
Liu, Jun
Martin, David
Version
OA Version
Citation
Bestavros, Azer; Crovella, Mark; Liu, Jun; Martin, David. "Distributed Packet Rewriting and its Application to Scalable Server Architectures", Technical Report BUCS-1998-003, Computer Science Department, Boston University, February 1, 1998. [Available from: http://hdl.handle.net/2144/1760]
Abstract
To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in distributed Web servers is the need to direct incoming connections to individual hosts. Previous methods for connection routing have employed a centralized node which handles all incoming requests. In contrast, we propose a distributed approach, called Distributed Packet Rewriting (DPR), in which all hosts of the distributed system participate in connection routing. We argue that this approach promises better scalability and fault-tolerance than the centralized approach. We describe our implementation of four variants of DPR and compare their performance. We show that DPR provides performance comparable to centralized alternatives, measured in terms of throughput and delay under the SPECweb96 benchmark. Finally, we argue that DPR is particularly attractive both for small scale systems and for systems following the emerging trend toward increasingly intelligent I/O subsystems.