We characterize the dynamic data management problem for location based services(LBS) in mobile environments and devise a cost model for servicing both location independent and loc...
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...
Ilwoo Chang, Matti A. Hiltunen, Richard D. Schlich...
A methodology for architecture exploration of look-up table based decoders is presented. For the degree of parallel processing a trade-off can be made by exploring system level an...