Evaluating DHT-Based Service Placement for Stream-Based Overlays

Stream-based overlay networks (SBONs) are one approach to implementing large-scale stream processing systems. A fundamental consideration in an SBON is that of service placement, which determines the physical location of in-network processing services or operators, in such a way that network resources are used efficiently. Service placement consists of two components: node discovery, which selects a candidate set of nodes on which services might be placed, and node selection, which chooses the particular node to host a service. By viewing the placement problem as the composition of these two processes we can trade-off quality and efficiency between them. A bad discovery scheme can yield a good placement, but at the cost of an expensive selection mechanism. Recent work on operator placement [3, 9] proposes to leverage routing paths in a distributed hash table (DHT) to obtain a set of candidate nodes for service placement. We evaluate the appropriateness of using DHT routing paths for...

• Type: Conference
• Year: 2005
• Where: IPTPS
• Authors: Peter R. Pietzuch, Jeffrey Shneidman, Jonathan Ledlie, Matt Welsh, Margo I. Seltzer, Mema Roussopoulos
• Keywords: Computer Networks, DHT Routing Paths, IPTPS 2005, Node Discovery, Service Placement