Optimal Scheduling with Resources for Application Execution in 3G Networks

  • Authors:
  • Roman Englert

  • Affiliations:
  • Deutsche Telekom Laboratories at Ben Gurion University, Beer-Sheva, Israel 84150

  • Venue:
  • KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Today the number of data applications for cellular phones increases rapidly. Most of these data applications require a connection to the Service Delivery Platform (SDP) in the cellular network. As a consequence the booting of the cellular phone and the starting of mobile applications take several minutes. In this paper an approach is presented to optimise the start time of mobile applications. The idea is to partition the call set-up of mobile applications into modules and to apply them to scheduling. Main challenges are to take into account the required temporal and operational resources, and to generate the schedule in real-time. The applied scheduler is based on the Simplex method from Discrete Mathematics and delivers en passantthe proof for the optimality. Experiments demonstrate the approach and the results are compared with former experiments based on a temporal planner from the field of Artificial Intelligence (AI).