SearchSkip to Search Results
- 1Database Systems
- 1Energy efficiency
- 1Multiconstraint Shortest Path algorithms
- 1Multihop wireless networks
- 1Multipath oblivious routing
Technical report TR06-22. QoS routing has been shown to be NP-hard. A recent study of its hardness shows that the ``worst-case'' may not occur in practice . This suggests that there may exist fast exact algorithms for the multi-constraint shortest path (MCSP) problem, an instance of QoS...
Multipath Oblivious Routing for Traffic Engineering - Stable and Robust Routing in Changing and Uncertain EnvironmentsDownload
Technical report TR06-11. Intra-domain traffic engineering is essential for the operation of an Internet Service Provider (ISP). Demand-oblivious routing (Applegate and Cohen 2003) promises excellent performance guarantee with changing and uncertain traffic demands. However, it is non-trivial...
On the Trade-Off Between User-Location Privacy and Queried-Location Privacy in Wireless Sensor NetworksDownload
Technical report TR09-07. By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. Relying on the principle of k-anonymity, we propose an effective...
Technical report TR05-24. Energy efficiency is an important issue in multihop wireless networks with energy concerns. Usually it is achieved with accurate knowledge of the traffic pattern and/or the current network information such as load and remaining energy level (in an energy constrained...