No abstract

The tremendous popularity of wireless systems in recent years has led to the commoditization of RF transceivers (radios) whose prices have fallen dramatically. The lower cost allows us to consider using two or more radios in the same device. Given this, we argue that wireless systems that use multiple radios in a collaborative manner dramatically improve system performance and functionality over the traditional single radio wireless systems that are popular today. In this context, we revisit some standard problems in wireless networking, including energy management, capacity enhancement, mobility management, channel failure recovery, and last-hop packet scheduling. We show that a systems approach can alleviate many of the performance and robustness issues prevalent in current wireless LAN systems. We explore the implications of the multi-radio approach on software and hardware design, as well as on algorithmic and protocol research issues. We identify three key design guidelines for constructing multi-radio systems and present results from two systems that we have built. Our experience supports our position that a multi-radio platform offers significant benefits for wireless systems. 1

Abstract

Abstract-Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays which use a numerical distance metric to route through a Cartesian hyper-space, e.g., CAN. Pastry and CAN are chosen as the representatives of each type of overlay.To the best of our knowledge, this paper reports the first headto-head comparison of CAN-style versus Pastry-style overlay networks, using multicast communication workloads running on an identical simulation infrastructure. The two approaches to multicast are independent of overlay network choice, and we provide a comparison of flooding versus tree-based multicast on both overlays. Results show that the tree-based approach consistently outperforms the flooding approach. Finally, for treebased multicast, we show that Pastry provides better performance than CAN.

No abstract

No abstract

Abstract

No abstract