TNET

by Liaskos C., Petridou S., Papadimitriou G.
(Access related resources below: )

This work belongs to the Scheduling research track.


Towards Realizable, Low-Cost Broadcast Systems for Dynamic Environments [[[Liaskos.2010]]]

Abstract:  A main design issue in a wireless data broadcasting system is to choose between push-based and pull-based logic: the former is used as a low cost solution, while the latter is preferred when performance is of utmost importance. Therefore, the most significant advantage of a push system is the minimal cost. This fact implies that hardware limitations do exist in the case of push systems. As a consequence, every related proposed algorithm should primarily be cost-effective. This attribute however has been overlooked in related research. In this paper, popular broadcast scheduling approaches are tested from an implementation cost aspect and the results render them only conditionally realizable. Moreover, a new, cost-effective, adaptivity-oriented schedule constructor is proposed as a realistic, minimal cost solution. 

In a nutshell

We focus on a realistic push-based system whose architecture is depicted below. A set of clients receives a common broadcast schedule emitted from a central source:

A broadcast schedule has limited lofespan. After a certain time interval it must be renewed to match the clients' demands. At his point the scheduling service must:

• Schedule data fetching over the data sites.

• Schedule storage at the beacon-local cache.

• Enter a state of client preference monitoring in order to prepare for the next renewal.

Key-remark: The size of the schedule is a critical performance index. A small program is constructed and transferred to the beacons fast, while its caching needs are minimal.

Susequently, the paper follows analytical reasoning to show that minimal-sized schedules exist, and propose an algorithm for their creation. 

Key-points

  • The minimization of the size of the broascast schedule yields:
    • Minimal scheduling compexity.
    • Minimal caching needs at the broadcast stations (beacons).
    • Minimal required communication between the scheduling service and the remote data sites.
  • The minimization of the schedule size does not affect the offered QoS level.

Acknowledgement

This work was funded by the European Research Council via Grant Agreement no. 338402, project ''NetVolution: Evolving Internet Routing''.


Reference & Resources

Powered by CMSimple| Template: ge-webdesign.de| Login