Planning to Optimize the UMTS Call Set-up for the Execution of Mobile Applications

Roman Englert * Institute of Computer Science III Rheinische Friedrich Wilhelms University of Bonn Bonn, Germany englert@iai.uni-bonn.de October 1, 2002

Abstract The 3rd generation of mobile communication, the so-called UMTS, makes a broad variety of applications for mobile terminals available. An endeavor is the maintenance of several applications on one terminal. Radio bearers have restrictions in the quality of service (QoS) for applications due to limited resources. And the call set-up for the execution of several mobile applications may lead to inacceptable waiting periods for the user. As an example consider the WAP access, where the connection to the gateway takes in general approximately half a minute. This period increases if one starts several applications on one mobile terminal. Another hindering is an insucient QoS availability during the call set-up. Here, the execution of the mobile application is shut-down. In this paper, the optimization of the call set-up for several mobile applications is investigated. The optimization uses planning to schedule the necessary modules for the call set-up. As a result the user has a shorter waiting period until the execution of several mobile applications is started and thus mobile terminals can be used more exibly.

* The author is at T-Mobile International AG, Technology & Development division

Figure 1: Frequently occuring problems during the UMTS call set-up for the execution of mobile applications.

Introduction

The Universal Mobile Telecommunication Standard (UMTS) enables the implementation of various new applications like video telephony and online group games [17, 6]. The broad bandwidth based on the UMTS frequencies and the more ecient encoding compared to GSM make the execution of mobile applications possible [18]. Several problems can occur during the call set-up (gure 1): incompatibility of the mobile phone (short: mobile) with the WAP1 gateway, memory violation of a J2ME2 application, and insucient resources of the radio bearer, to name only a few. Whenever a problem occurs, a goal is to restart immediately the call setup with adapted parameters. Another challenge is the following: assume someone starts several applications on his mobile, e.g. a chess game and a news ticker for market prices. Then the goal is to execute both applications immediately after their initiation. Unfortunately, in most situations the radio bearer can only be used sequentially for the set-up of several calls from one terminal, and therefore, the execution of applications via the radio network requires patience on the users side. Limited resources in mobile terminals and the radio bearer make a subsequent
1 2

Wireless application protocol Java 2 micro edition (Java for mobiles) [5]

execution of applications necessary. The examined hypothesis is that the call set-up for the execution of several mobile applications can be optimized by planning. As a result, mobile applications are executed immediately more or less in parallel after their start on the mobile. Thus, the waiting period is reduced for the user. Several core questions occur, where we focus on the following: Real-time Can plans for the execution of mobile applications be built in an appropriate time? The following section describes the call set-up for the execution of mobile applications. The call set-up can be modularized and expressed by actions of a plan. The bottleneck is the necessary eort for the plan generation. Completeness Do planning domains exist for which no plans can be computed? The above problems of incompatibility and insucient resources must be solvable by planning, or with other words, the generated plan for the call set-up must contain actions to tackle these diculties despite resource availability. Negotiation Is the call set-up modularizable in the sense, that agents can transport quality of service (QoS) information through the radio network during the call set-up? Mobile applications are divided into classes by their QoS requirements. The QoS of mobile applications contains calling parameters like the maximum transfer delay and is described in the subsequent section. As an example, a voice call requires an immediate voice data transport to the second mobile, and a background data download requires a broad bandwidth. The use of agents in telecommunication systems is widespread [11, 16]. A powerful example for the execution of telecommunication services is the platform Grasshopper [7]. Grasshopper enables the use of mobile agents [15, 8] in next generation broadband intelligent networks, and the dynamic deployment and distribution of services onto enhanced switching equipment and service nodes of radio networks. The described questions are based on the ow of the call set-up for UMTS (section 2). The above mentioned problems of incompatibility, memory violation, and insucient resources arise also in the core network of the radio bearer or in the public domain network (which can be eg the internet or a LAN). The concepts of planning and scheduling are described in section 3. The task to plan the call set-up for mobile applications, such as a chess game and a news ticker for market prices, illustrates the concept of scheduling for UMTS. This task is not restricted to the execution of applications on one mobile and rather can be applied to several mobiles. The implementation of this task is done in PDDL+ [12] (section 4). Experiments for the performance show the appropriateness to optimize the UMTS call set-up. The number of mobile applications which has the same starting time on one mobile is varied in the experiments. The computed plans of the experiments are examined and discussed. Section 5 concludes and sketches further work. Abbreviations are listed before the references.

Class

Constraints

Examples

Conversational Preserve time relation between information ow on the stream. Conversational pattern (stringent and low delay) Voice, video telephony & video games

Streaming Preserve time relation between information entities of the stream

Interactive Request response pattern. Preserve data integrity

Background Undened delay. Preserve data integrity

Streaming multimedia

Web browsing, network games

Background download of e-mails

Table 1: UMTS quality of service classes and their characteristics.

UMTS Call Set-up and Quality of Service

Probably the best known feature of UMTS is higher bit rate [17]: on packet-switched connections up to 2 Mbps can be reached in the optimal scenario. Compared to existing mobile networks, UMTS provides a new and important feature, namely negotiation of the radio bearer and transfer properties. The attributes that dene the characteristics of the transfer are throughput, transfer delay, and data error rate. UMTS bearers have to be generic to provide good support for existing applications and the evolution of new applications. Applications and services are divided into 4 classes by their so-called Quality of Service (QoS) [1, 17], where the trac classes, their fundamental characteristics, and examples for applications are summarized in table 1. The main distinguishing factor between these classes is how delay-sensitive the trac is: the conversational class is very delay sensitive (approximately 40 ms time preservation), and the background class has no dened maximum delay. In the following the bearer architecture and the core network of UMTS are described. Then the ow of the call set-up for the execution of mobile applications based on the UMTS bearer is given. It is assumed that mobile applications are executed in the mobile and required data are provided via a public domain network (PDN) [9], e.g. the internet. As an example consider a chess game, where player A and B start the application chess in their mobiles and the moves are transfered via the radio network. Finally, the problem elds described in the introduction are highlighted with respect to the call set-up ow. In general networks for mobile data transfer can be divided into two units [20]: the access network domain (AND) and the core network domain (CND). The widespread global system for mobile telecommunication (GSM) is a circuit-switched bearer with a data transfer rate of 9600 Bps (gure 2). The AND consists of base transceiver stations (BTS) for the transmission of information over the air and to enable the base station controllers (BSC) for the communication with mobiles. The communication includes the call set-up, controlling, and triggering of connections. As second part of the network, the CND consists

Figure 2: GSM architecture.

mainly of the mobile services switching center (MSC) for the routing of the wired GSM system with the visitor location register (VLR) containing information about the mobiles in the area of the MSC. Further parts of the CND are the home location register (HLR) with information about users, the equipment identity register (EIR) with the unique identication numbers of mobiles, and the authentication center (AuC) with information about users authentication. In summary, the registers provide information about mobile terminals and users access. A detailed description of GSM can be found in [20]. The architecture for UMTS is called global multimedia mobility (GMM) (gure 3) and is based on domains [17]. Additionally, to the AND and CND there is the terminal equipment domain (TED). TED underlines the idea of the evolution of new applications for mobiles, PDAs, and Laptops. The mobile terminals (short: terminals) are connected via the user services identity module (USIM) physically on the subscriber identity module (SIM) card with the node B, which is the counterpart to BTS for UMTS networks (gure 4). The reference point for the connection in the radio network is the interface Uu , where the general control (GC) is the distribution service of general information to the terminal, the notication (Nt) is the distribution service for user-specic information like messaging, and the dedicated control (DC) maintains the call set-up, data transfer and

Figure 3: Global multimedia mobility: domains and access.

the QoS. Within UMTS networks the BSC has also a counterpart, namely the radio network Controler (RNC), and nally, the MSC, SGSN, and GGSN are expanded for the 3rd generation (3G) of mobile communication systems. In contrast to GSM, UMTS is based on one unique frequency for all users, and the signals are spread (encoded) over the required bandwidth for the execution of the application. The UMTS call set-up is based on two kinds of channels for the control and the trac: Dedicated control channel (DCCH) enables a narrowband call set-up via the AND to the medium access control (MAC) level, where logical resources are mapped to physical transport channels. Dedicated trac channel (DTCH) transports the information intended for the given user, including data for the application/ service. In the following the focus is set on the DCCH since the call set-up is mainly based on the dedicated control channel. The call set-up is provided by the following modules which are to be executed during the set-up [10] (cf. gure 4): TRM After initiation of a mobile application (for the execution on a terminal) the

Figure 4: UMTS radio network architecture.

resources of the mobile (display, . . . ) are checked by the terminal resource management and allocated, if possible. CT Transmission of Ready for service via the node B to the mobile to ensure the connection timing for service availability. AM Information of mobile (location, . . . ) is sent to AEEI. The transmission can be comfortably done by a so-called service agent [11] controlled by the agent management in the CND (gure 4). The advantage of a service agent is, that in case of failure, e.g. network resources are not available, the agent can negotiate with the terminals agent about another QoS class (cf. section 5). AEEM Service agent with QoS class and parameters of application are sent from the mobile to AEEI. RRC Provision of QoS by logical resources from the MAC level (DCCH) in the radio bearer AND. RAB Radio bearer resources are supplied (from the CND) and the DCH is set-up.

Figure 5: Mobile Java application: chess.

AEEI Establishing data transfer from the core network to PDN (e.g. internet) and sending service agent (controlled by AM) to the application in the PDN to ensure the QoS for the application. BS Establishing radio bearer resources with QoS and provide messages to the modules TRM and AEEI to start the execution of the application. The implementation of the modules in PDDL+ [12] for planning the execution of mobile applications is described in section 4.

Planning and Scheduling

Planning tasks have two point of views [19]: the generation of a goal-oriented method based on a sequence of actions, which is called action planning and the resulting sequence of actions is the plan. Alternatively, actions are mapped to limited resources with constraints and a given cost function is optimized. Often, the mapping is based on time parameters. This kind of planning tasks is called scheduling. Scheduling tasks investigate the temporal order of given actions (sometimes they are called jobs). The described UMTS call set-up is a scheduling problem with limited time resources. Let us consider an example for the execution of two mobile applications. The rst application is a chess game, where the chess boards are displayed in the mobiles and each move is transfered over the air to the other player (gure 5). Assume player 1 moves the white tower from A1 to B1, then this move is transfered to the mobile of player 2, where the display of the chess board is refreshed. Note, this application can be implemented in Java MIDP [5] and for signalling the always on bearer GPRS [9] can be used. Always on means, that the radio bearer is only busy, when data (here chess moves) are transfered. The other application is a news ticker for market prices. The ticker shows continuously market prices on a horizontal scrolling display. Both applications can be executed in parallel on the display of one mobile. Assume, the user starts the chess game and

Figure 6: Subsequent (top) and optimized (bottom) execution of mobile applications.

the news ticker on one mobile with an equal start time. The goal is to minimize the response time of the radio bearer to the user until the execution of both applications in the radio network is started, i.e. the call set-up for both applications is executed. To illustrate the minimization consider gure 6: the naive scenario shows the subsequent execution of the applications. In the previous section the UMTS call set-up and its modularization is described. Within the optimized call set-up the second application will be started after a minimal number of modules for the rst application is executed and the execution time for both call set-ups is optimized. In the following section the modules for the UMTS call set-up are summarized and their modeling in PDDL+ is described. Experiments provide the solution to the above example and furthermore, the appropriateness of planning to ensure the real-time UMTS call set-up is shown.

Implementation and Experiments

The involvement of time into the planning process is a main challenge of planning tasks [12, 13]. This resource is a duration of actions, where the preconditon of an action holds at the beginning and the eects add and del take place at some point after the beginning and before the end. In the following, two kinds of resources are distinguished [14]: Renewable resources are only used by an action and not used up. After the duration the resource has the same quantity as before the execution of the action. Consumable resources vanish when used by an action. Actions can also produce a

quantity of a resource, i.e. increase instead of decrease the quantity available. The QoS classes of the UMTS call set-up have maximum response times (except the background class) and each module of the call set-up has an estimated duration. Therefore, the (consumable) resources used in the experiments decrease the time available. The application of a planner to nd an optimal temporal order for the modules of at least two call set-ups requires the handling of renewable and consumable resources and of time. TP4 from the class HSP [14] is a planner with metric time and certain kinds of resources, based on heuristic search. These features and specially the domain-independence resulted in the choice of TP4 from the available planners3 . A heuristic planner can be described by considering the search space with the branching rule, the heuristic, and the search algorithm/ method: Search space States are represented by pairs consisting of a set of atoms (here: subgoals) and a set of concurrent actions. Since actions overlap in time, a state must also include the actions that may interfere with the achievement of those preconditions. The search space is regressed, where so-called plan tails (partial plans that achieve subgoals if the preconditions of the partial plan are met) are searched. Plan tails are incremented by regression with actions to achieve the subgoals, compatible with the concurrent actions. Afterwards, the preconditions of the latest actions become new subgoals, while the actions are removed from the state. Branching rule enables the construction of successors to states by the selection of establishers. An establisher ensures that actions are compatible to each other and actions with a duration must start at t to hold at time t. The branching rule is complete, in the sense that if a plan exists, it can be constructed from the initial search state by repeated application of the rule. Heuristic is a combination of the optimal cost with two approximation schemes to simplify the computation of the Bellmann equation for the optimal cost [14]. The heuristic is admissible. HSP uses in its current version the heuristic to precompute sets of at most two atoms. Search method is based on the admissible heuristic. The search method applied is IDA , which nds always an optimal solution, uses space linear in solution depth, is asymptotically not slower than A . HSP improves the space use through enhancing IDA by a transposition table, cycle checking, and a symmetry rule (right-shift equivalence) to avoid exploring redundant branches, but not node ordering. The UMTS call set-up described in section 2 consists of eight modules. The modules and their functions are summarized in table 2. The execution of each module
An overview of planning systems which handle resources like time, machines, etc. can be found in [2].
3

Service TRM CT AM AEEM RRC RAB AEEI BS

Description After initiation of a mobile application the resources of the mobile (display, . . . ) are checked and allocated Transmission of Ready for service from the node B to the mobile Information of mobile (location, . . . ) is sent to AEEI Service agent with QoS of application is sent to AEEI Provision of QoS by logical resources in the RAND Radio bearer resources are supplied (from the CND) Establishing data transfer from CN to PDN Establishing radio bearer resources with QoS and feedback to TRM and AEEI

Set-up duration 70 ms 40 70 70 210 70 40 ms ms ms ms ms ms

30 ms

Table 2: Durations of the UMTS call set-up modules for interactive applications like chess (interactive QoS class).
has duration which can be estimated based on the QoS class criteria. For oine applications like a market ticker the module execution durations are shorter, since the QoS criteria are weaker, e.g. the answering delay is more insensitive compared to voice calls. The modules for one call set-up must be executed sequentially in the given order. In section 2 the initially described problems (cf. introduction) are depicted. If there are insucient radio bearer resources, then the service agent from module AEEM can transport the available QoS to the TRM and initiate a negotation with the mobile or the user. Afterwards, the call set-up is started again with the transfer of the negotiated QoS from the terminal (module AEEM) to the AND (module RRC). Each initiation of a mobile application requires the execution of the UMTS call set-up. As an example consider the initiation of two mobile applications, the chess game and the ticker for market prices from section 3: the goal is to minimize the delay between initiation and start of both applications. The main dierence between both applications is their QoS class: the chess game is interactive and the ticker is a stream of information. This eases the provisioning of the QoS class (module RRC) for the ticker compared to the chess game: the latter requires in maximum 210 ms and the former 70 ms. Then the waiting period for the user, until both mobile applications are started, is optimized. Figure 7 shows the plan generated with TP4: the smallest waiting period for the user results by the start of the ticker with a delay of 180 ms after the start of the chess game. The UMTS call set-up for the chess game requires approximately 570 ms and hence the users waiting period is reduced by 570 180 = 390 ms, or 68 %. This optimization is essential in more complex scenarios where, e.g., applications are based on WAP. The connection to a WAP gateway takes in average half a minute and the download of one deck approximately 20 seconds (via the bearer CSD). As a consequence,

10

Figure 7: Plan for the optimized execution of a mobile chess game (top) and a ticker for market prices (bottom).
the user would be annoyed by sequential application execution and unmotivated to use the service/ application. The representation of the planning domain is based on the eight modules for the UMTS call set-up. Resources may be renewable or consumable: an example for a renewable resource is the keyboard of the mobile. It can be used to input data for several applications. Consumable resources which are realized in the experiments are summarized in table 3 (a complete list of resources for the UMTS call set-up can be found in [3]). Figure 4 in section 2 depicts, that a mobile application can be executed, when the radio bearer with the required QoS is established. The predicate BS for the bearer establishment has as preconditions the successful execution of the module AEEI during the call set-up, the fullment of the required QoS class parameters (denoted as list L), and the transfered messages of the set-up status to the application in the mobile and the PDN (the complete list of predicates can be found in the appendix). The resources are already allocated by the preceding modules. Only the cost for the plan generation (after initiating an application the user is waiting for the plan geneneration and the call set-up) are considered. As eect the Iu bearer and the network connection for the mobile application are set up (representation in PDDL+ [12]; enhancement of the planning domain denition language by time and resources): (:action BS :parameters (?A-new - application ?M - mobile ?L - list ?MSG1 - message) :precondition (and (aeei-ok ?A-new ?M ?L) (qos-params ?A-new ?L) (message-trm ?M MS1) (message-aeei ?A-new MS2)) :resources ((cost 1)) :effect (and (iu-bearer ?A-new ?M ?L) (bs-ok ?A-new ?M ?L))) The initiation of an application starts in the mobile with the TRM. Afterwards,

11

mobile-cpu d-available e-balance mobile-channels -available num-mobiles num-calls mobile-storage logical-channels cell-update handover active-set-up ggsn-bitrate max-no-pdp max-no-apn

used with x per cent per application partition of the display, e.g. ticker and chess energy balance of mobile accumulator used for data transfer number of mobiles which are tractable by a node B mobile network load for a node B memory on S(IM)AT card number of logical channels available in the CN report UE location into RNC handover required to get a higher bit rate update connection capacity (kbit/s) from GGSN to PDN max. no. of packet data protocols per mobile max. access point names (APN) per mobile

Table 3: Consumable resources of the UMTS call set-up.

the CT in the AND is asked for a ready-for-service signal. In the core of the call set-up is the radio access bearer procedure in the CND, which is described in more detail. As rst step the logical resources must be allocated (RRC), e.g. the required number of channels must be provided on the logical level and later they are mapped to the physical channels: (:action RRC :parameters (?A-new - application ?M - mobile ?L - list) :precondition (and (ct-ok ?A-new ?M ?L) (aeem-ok ?A-new ?M ?L)) :resources ( (logical-channels ?N : (required-channels ?A-new ?M ?N)) (cell-update 1) (handover 1) (active-set-up 1)) :effect (rrc-ok ?A-new ?M ?L)) (:action RAB :parameters (?A-new - application ?M - mobile ?L - list) :precondition (and (rrc-ok ?A-new ?M ?L) (qos-params ?A-new ?L)) :effect (rab-ok ?A-new ?M ?L))

12

If the requested QoS class is not available, then the fact rab ok is not true and a service agent must be sent to the mobile in order to negotiate with the application or user for weaker QoS requirements (cf. section 5). In case of success the predicate RAB is true and the connection to the PDN must be checked. Finally, the goal predicate BS can be fulled if all resources are available. To demonstrate the above modeling the challenges described in the introduction are discussed (cf. gure 1 and gure 4 for the call set-up modules): Compatibility Suppose a mobile phone is incompatible with the WAP gateway of the chosen network operator resulting in a timing out during the connection set-up of the mobile with the gateway. During the call set-up all modules from TRM to the AEEI are executed until the gateway connection is tried to set-up. In case of failure the error arises before the bearer service can be established. Hence, the modul BS cannot be executed. Mobile Computing During the execution of a Java application in the terminal arises a runtime violation since the terminal type is wrong, e.g. too small display. Here the call set-up has been executed errorless, but it must be repeated for the Java application with tting terminal parameters. Bearer Resources The required bandwidth for a video transfer is not available. In this case the call set-up will be stopped in an early phase: the radio resource controler recognizes the insucient radio resources and provides a message to the terminal. Hence, the modules of the core network need not to be executed. Alleviation to this scenario can be given by a negotation of the radio resources between the terminals agent and a networks agent that is responsible for the QoS parameters of the demanded application execution (cf. section 5). As experiments the number of mobile applications is varied from 2 to 20. For measurement4 the precompilation time (cf. heuristic of HSP ; the plan generation time is neglectible compared to the precompilation time), the branching factor, the number of actions and the number of pairs of instances are taken. For the experiments it is assumed that all resources are suciently available. Table 4 shows the eorts to generate plans for 2 to 20 mobile applications (assumed the required resources are available). In general users may execute not more than 10 applications in parallel (e.g. messaging services like e-mail and voice, calendar, news, and game applications) [4], then the (pre-) compilation time is in maximum 1 second. This time duration is an appropriate waiting period for users. Compare this result with the simple application of a naive heuristic like earliest due date to the plan generation: each module should be executed as early as possible. This heuristic leads to a concatenation of the modules from both applications resulting in a serial process. In contrast to the optimized process in gure 7 the modules TRM for the chess game and for the market price ticker are executed, then CT for both, afterwards
4

Pentium III with 500 MHz

13

#Applications / Parameters Precompilation time (sec.) Branching factor #Actions #Pairs of instances

2 0 1.14 20 210

5 0.05 2.86 50 1275

10 0.54 5.71 100 5050

20 23.54 11.43 200 20100

Table 4: Experiments with varying number of mobile applications.

AM, and so on. As result the execution time of the applications is the sum of the execution times for all modules. The dierence between the application of TP4 and a naive heuristic to mobile callset-up tasks is based on the fact that the latter examines only the local situation, i.e. only the the execution time of the current modules from both tasks is considered. In contrast the planner examines the global situation by estimating the total due time of the tasks, and additionally, a subsequent choice from the remainder module with respect to their execution time is done. It should be observed, that users may execute applications on several mobiles and/ or PDAs. The experiments do not assume that the generated plan is executed on one mobile and rather can be applied to several terminals. The good result demonstrates that experiments with a further planner are not required, since TP4 is a multi purpose planner with time and several kinds of resources. However, the application of specic solving algorithms like from the eld of CSP may lead to an improvement.

Conclusion and Further Work

The UMTS call set-up for the execution of applications in mobile terminals has been described. The planning language PDDL+ is appropriate to represent the modules of the call set-up. Planners with time and resources, here TP4, can be applied to generate optimal plans w.r.t. IDA . The resulting plans demonstrate that the users waiting period for the execution of several mobile applications is optimized. TP4 provides good results for the mobile domain with stable states. As output an ecient order for the execution of the modules is given within in a static world. During the planning process consumable and renewable resources like transport channels are considered. In the experiments the number of mobile applications has been varied up to 20 applications. However, improvements are possible since some modules can be executed in parallel, e.g. AEEM and RAB (cf. gure 4).

14

In future a further important aspect of QoS ensurance will be examined: in case the RB resources are insucient to execute the desired mobile application, then a service agent can negotiate with the controler of the node B (RNC) or the terminal (TRM). The negotiation considers the dierent types of handovers (soft, hard, service-based, mobile) to reduce the number of handovers and, if necessary, a weakening of the QoS. A modeling in PDDL+ will provide the necessary tool to examine the appropriateness of negotation and handover to ensure the QoS within the UMTS radio bearer. Another challenge arises from the assumption of a dynamic world, where the initiation of a new mobile service requires re-scheduling of a previously existing plan.

Appendix

In the following abbreviations and predicates of the planning domain are listed.

6.1

Abbreviations
3rd Generation (of mobile communication systems) Agent Execution Environment Internet Agent Execution Environment Mobile Agent Management Access Network Domain Access Point Node Authentication Center Bearer Service Base Station Controller Base Transceiver Station Core Network Domain Connection Timing Dedicated Control Dedicated Control CHannel Dedicated Trac CHannel Equipment Identity Register General Control Global Multimedia Mobility General Packet Radio Service Global System for Mobile communications Home Location Register Heuristic Search Planner based on IDA Iterative Deepening A Java 2 Micro Edition Medium Access Control Mobile services Switching Center Notication

3G AEEI AEEM AM AND APN AuC BS BSC BTS CND CT DC DCCH DTCH EIR GC GMM GPRS GSM HLR HSP IDA J2ME MAC MSC Nt

15

PDA PDDL+ PDN QoS RAB RNC RRC SAT SIM TED TP4 TRM UE UMTS USIM UTRAN VLR WAP

Personal Digital Assistant Planning Domain Denition Language Public Domain Network Quality of Service Radio Access Bearer Radio Network Controller Radio Resource Controller SIM Application Toolkit Subscriber Identity Module Terminal Equipment Domain Temporal Planner 4 Terminal Resource Management User Equipment Universal Mobile Telecommunication System User Services Identity Module UMTS Terrestrial Radio Access Network Visitor Location Register Wireless Application Protocol

6.2

Predicates of the Planning Domain

(initiated ?A-new - application ?M - mobile) (qos-params ?A-new - application ?L - list) (app-cpu ?A-new - application ?M - mobile ?Acp) (app-display ?A-new - application ?M - mobile ?Ad) (app-keyboard ?A-new - application ?M - mobile ?Ak) (app-energy ?A-new - application ?M - mobile ?Ae) (app-channels ?A-new - application ?M - mobile ?Ach) (trm-ok ?A-new - application ?M - mobile ?L - list) (ct-ok ?A-new - application ?M - mobile ?L - list) (location ?M - mobile) (authentication ?M - mobile) (am-ok ?A-new - application ?M - mobile ?L - list) (aeem-ok ?A-new - application ?M - mobile ?L - list) (required-channels ?A-new - application ?M - mobile ?N) (rrc-ok ?A-new - application ?M - mobile ?L - list) (rrc-negotiation-ok ?A-new - application ?M - mobile ?L - list) (rab-ok ?A-new - application ?M - mobile ?L - list) (aeei-ok ?A-new - application ?M - mobile ?L - list) (message-trm ?M - mobile ?MS - message) (message-aeei ?A-new - application ?MS - message) (iu-bearer ?A-new - application ?M - mobile ?L - list) (bs-ok ?A-new - application ?M - mobile ?L - list)

16

Acknowledgments
The author likes to thank Joachim Hertzberg, Jrgen Sauer and Armin B. Creu mers for their discussions and valuable improvements. Furthermore he thanks JanHinnerk Reemtsma (T-Mobile Deutschland GmbH) for comments on the UMTS call set-up description.

References
[1] 3rd Generation Partnership Project: Technical Specication Group Service and System Aspects: QoS Concept and Architecture (Release 5), TS 23.107, V5.3.0, www.3gpp.org, 2002. [2] www.ai-center.com/info/planningwithresources.html. [3] www.3gpp.com. [4] ARC group, wireless internet: Applications, technology & player strategies. Research Report, ISBN 1902 740 025, Cranleigh, U.K., 1999. [5] Java 2 platform micro edition. http://java.sun.com, 2001. [6] S. Appleby and T. Steward. Mobile Software Agents for Control in Telecommunication Networks, chapter 11 in Hayzelden, A./Bigham, J. (eds.), Software Agents for Future Telecommunication Systems. Springer, 1999. [7] M. Breugst, I. Busse, S. Covaci, and T. Magedanz. Grasshopper: A mobile agent platform for IN based service environments. In Proceedings of IEEE IN Workshop, pages 279 290, 1998. France. [8] M. Busuioc. Distributed Intelligent Agents - A Solution for the Management of Complex Telecommunications Services, chapter 4 in Hayzelden, A./Bigham, J. (eds.), Software Agents for Future Telecommunication Systems. Springer, 1999. [9] M. Witt (Ed.). GPRS - Start in die mobile Zukunft. MITP-Verlag, Bonn, 2000. [10] R. Englert and A. B. Cremers. Conguration of applications for the 3rd generation mobile communication. In J. Sauer, editor, Proceedings of the KI-2001 Workshop AI in Planning, Scheduling, Conguration and Design. Vienna, Austria, 2001. [11] P. Farjami, C. Grg, and F. Bell. Advanced service provisioning based on o mobile agents. Computer Communications, 23:754 760, 2000. Special Issue: Mobile Software Agents for Telecommunication Applications. [12] M. Fox and D. Long. PDDL2.1: An extension to PDDL for expressing temporal planning domains. www.dur.ac.uk/maria.fox, July 2001.

17

[13] M. Ghallab and A. Milani (Eds.). New directions in AI planning. Vol. 31 in Series Frontiers in Articial Intelligence and Applications, IOS Press Omsha, Amsterdam, 1996. [14] P. Haslum and H. Gener. Heuristic planning with time and resources. In Proc. IJCAI Workshop on Planning with Resources, 2001. [15] A. Hayzelden and J. Bigham, editors. Software Agents for Future Communication Systems. Springer, 1999. [16] A. Hayzelden, J. Bigham, M. Wooldridge, and L. Cuthbert. Future Communication Networks Using Software Agents, chapter 1 in Hayzelden and Bigham 1999. Springer, 1999. [17] H. Holma and A. Toskala (Editors). WCDMA for UMTS. Wiley & Sons, U.K., 2000. [18] H. Kaaranen, A. Ahtiainen, L. Laitinen, S. Naghian, and V. Niemi. UMTS Networks: Architecture, Mobility and Services. Wiley, Chichester, U.K., 2001. [19] J. Khler. Von der Aufzugssteuerung Zur Wartung Von U-Booten - KI o Planungs- und Schedulingverfahren Auf Erfolgskurs in der Industrie. Konradin Verlag, 1999. Informatiktage. [20] B. Walke. Mobilfunknetze und ihre Protokolle. Teubner, Braunschweig, Germany, 2000.

18