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 passant the 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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holma, H., Toskala, A. (eds.): WCDMA for UMTS. Wiley & Sons, U.K (2000)
Kotsis, G., Spaniol, O. (eds.): Euro-NGI 2004. LNCS, vol. 3427. Springer, Heidelberg (2005)
Hayzelden, A., Bigham, J. (eds.): Software Agents for Future Communication Systems. Springer, Heidelberg (1999)
Busuioc, M.: Software Agents for Future Telecommunication Systems. In: Hayzelden, A., Bigham, J. (eds.) Distributed Intelligent Agents - A Solution for the Management of Complex Telecommunications Services. Springer, Heidelberg (1999)
Maros, I.: Computational Techniques of the Simplex Method. Kluwer Academic Publishers, Dordrecht (2003)
McDermott, D.: The formal semantics of processes in PDDL. In: Proceedings of ICAPS Workshop on PDDL (2003)
Englert, R.: Planning to Optimize the UMTS Call Set-up for the Execution of Mobile Applications. Int. Journal of Applied Artificial Intelligence 19(2), 99–107 (2005)
Hoffmann, T., Edelkamp, S., Thiébaux, S., Englert, R., Liporace, F., Trüg, S.: Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC4. Int. Journal of Artifical Intelligence Research (JAIR), 1–91 (2006)
Boche, H., Stanczak, S.: Optimal QoS Tradeoff and Power Control in CDMA Systems. IEEE Infocom. (2004)
Haslum, P., Geffner, H.: Heuristic planning with time and resources. In: Proc. IJCAI Workshop on Planning with Resources (2001)
Koch, T.: Rapid Mathematical Programming. PhD thesis, Technische Universität Berlin (2004)
Farjami, P., Görg, C., Bell, F.: Advanced service provisioning based on mobile agents. Computer Communications 23, 754–760 (2000); Special Issue: Mobile Software Agents for Telecommunication Applications
Ghallab, M., Milani, A. (eds.): New Directions in AI Planning. Series Frontiers in Artificial Intelligence and Applications, vol. 31. IOS Press, Amsterdam (1996)
Fox, M., Long, D.: PDDL2.1: An Extension of PDDL for Expressing Temporal Planning Domains. Journal of AI Research 20, 61–124 (2003)
Englert, R.: Execution scheduling for mobile applications in 3g networks, Habilitation thesis at the Faculty of Computer Science and Electrical Engineering, Technical University of Berlin (2008)
IPC: International planning competition (2004), http://ipc.icaps-conference.org
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Englert, R. (2008). Optimal Scheduling with Resources for Application Execution in 3G Networks. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds) KI 2008: Advances in Artificial Intelligence. KI 2008. Lecture Notes in Computer Science(), vol 5243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85845-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-85845-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85844-7
Online ISBN: 978-3-540-85845-4
eBook Packages: Computer ScienceComputer Science (R0)