• Publications
  • Influence
eBay in the Sky: strategy-proof wireless spectrum auctions
TLDR
Analytically, it is shown that VERITAS is truthful, efficient, and has a polynomial complexity of O(n3k) when n bidders compete for k spectrum bands, which makes an important contribution of maintaining truthfulness while maximizing spectrum utilization.
Packet classification using tuple space search
TLDR
The Pruned Tuple Space search is the only scheme known to us that allows fast updates and fast search times, and an optimal algorithm is described, called Rectangle Search, for two-dimensional filters.
Fast and scalable layer four switching
TLDR
Two new algorithms for solving the least cost matching filter problem at high speeds are described, based on a grid-of-tries construction and works optimally for processing filters consisting of two prefix fields using linear space.
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
TLDR
The algorithm is based on an efficient implementation of wavefront propagation among polygonal obstacles, and it actually computes a planar map encoding shortest paths from a fixed source point to all other points of the plane; the map can be used to answer single-source shortest path queries in O(log n) time.
Medians and beyond: new aggregation techniques for sensor networks
TLDR
This paper proposes a data aggregation scheme that significantly extends the class of queries that can be answered using sensor networks, and provides strict theoretical guarantees on the approximation quality of the queries in terms of the message size.
Towards realistic mobility models for mobile ad hoc networks
TLDR
Simulation results show that the use of obstacles and pathways has a significant impact on the performance of ad hoc network protocols.
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
TLDR
CABOB is a sophisticated optimal search algorithm that attempts to capture structure in any instance without making assumptions about the instance distribution, and it uses decomposition techniques, upper and lower bounding, elaborate and dynamically chosen bid-ordering heuristics, and a host of structural observations to do this.
Detecting and resolving packet filter conflicts
TLDR
This work proposes a new scheme for conflict resolution, which is based on the idea of adding resolve filters, and tries it on 3 existing firewall databases, and has found conflicts, which are potential security holes, in each of them.
Vickrey prices and shortest paths: what is an edge worth?
  • J. Hershberger, S. Suri
  • Computer Science, Economics
    Proceedings IEEE International Conference on…
  • 14 October 2001
TLDR
It is shown that the Vickrey prices for all the edges of the network can be computed in the same asymptotic time complexity as one single-source shortest path problem.
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
TLDR
CABOB, a sophisticated search algorithm forCombinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable.
...
...