We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

Disclosed are a method, upstream processing node, and computer readable medium for
dynamically stabilizing a stream processing system. The method includes receiving at least …

We explore the allocation problem in combinatorial auctions with submodular bidders. We
provide an e/e-1 approximation algorithm for this problem. Moreover, our algorithm applies …

Distributed stream processing systems offer a highly scalable and dynamically configurable
platform for time-critical applications ranging from real-time, exploratory data mining to high …

This paper concerns the design of mechanisms for online scheduling in which agents bid for
access to a re-usable resource such as processor time or wireless network access. Each …

Over the past decade, there has been great interest in the study of buffer management
policies in the context of packet transmission for network switches. In a typical model, a …

Disclosed is a method, upstream processing node, and computer readable medium for
processing data packets. The method includes receiving an allocation for at least one …

We study an online unit-job scheduling problem arising in buffer management. Each job is
specified by its release time, deadline, and a nonnegative weight. Due to overloading …

We consider dynamic auction mechanisms for the allocation of multiple items. Items are
identical, but have different expiration times, and each item must be allocated before it …

 Motivation: best-effort service provided by today's networks cannot support assured data
transmission for real-time applications. Goal: if the arriving packets cannot all be stored in a …