— We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...
– In contrast to a typical single source of data updates in Internet applications, data files in a networked information system are often distributed, replicated, accessed and up...
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
— Large-scale peer-to-peer systems span a wide range of Internet locations. Such diversity can be leveraged to build overlay “detours” to circumvent periods of poor performan...