Competitive router scheduling with structured data
نویسندگان
چکیده
منابع مشابه
Competitive Router Scheduling with Structured Data
We consider the task of transmitting structured information over bounded-capacity links. Our information model is a stream of basic units called superpackets that are broken into k packets each. To model the possible structure and redundancy of the superpackets, we assume that for each superpacket there is a collection of minimal subsets of packets whose delivery makes the superpacket useful. T...
متن کاملScheduling with Structured Preferences
The problem of finding a feasible schedule for a partially ordered set of tasks can be formulated as a Disjunctive Temporal Problem (DTP). While there exist extensions to DTPs that augment them by associating numeric costs to the violation of individual temporal constraints, they still make the restrictive assumption that the costs associated with constraints are independent of one another. In ...
متن کاملGeneration scheduling in a competitive environment
Electric power restructuring offers a major change to the vertically integrated monopoly. The change manifests the main part of engineers’ efforts to reshape the three components of today’s vertically integrated monopoly: generation, distribution and transmission. In a restructured environment, the main tasks of these three components will remain the same as before, however, to comply with ...
متن کاملScheduling Computations on a Programmable Router
It is becoming increasingly common for routers to compute on packets in addition to forwarding them, thereby exposing the problem of how the router’s CPU cycles are scheduled. To complicate matters, this scheduling decision may be constrained by the desire to differentiate the level of service given different packet flows. This paper addresses the issue of scheduling computations on a programma...
متن کاملPlaying Games with Optimal Competitive Scheduling
Introduction This paper is concerned with the problem of allocating a unit capacity resource to multiple users within a pre-defined time period. The resource is indivisible, so that at most one user can use it at each time instance. However, different users may use it at different times. The users have independent, selfish preferences for when and for how long they are allocated this resource. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.02.019