Call Setup Time Opt

7/31/2019 Call Setup Time Opt

http://slidepdf.com/reader/full/call-setup-time-opt 1/20



AbstractThe 3 rd 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 termi-nal. Radio bearers have restrictions in the quality of service (QoS) forapplications due to limited resources. And the call set-up for the exe-cution of several mobile applications may lead to inacceptable waitingperiods for the user. As an example consider the WAP access, wherethe connection to the gateway takes in general approximately half aminute. This period increases if one starts several applications on onemobile terminal. Another hindering is an insufficient QoS availabilityduring 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 severalmobile applications is investigated. The optimization uses planning toschedule the necessary modules for the call set-up. As a result theuser has a shorter waiting period until the execution of several mobileapplications is started and thus mobile terminals can be used moreexibly.

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



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

1 Introduction

The Universal Mobile Telecommunication Standard (UMTS) enables the imple-mentation of various new applications like video telephony and online group games[17, 6]. The broad bandwidth based on the UMTS frequencies and the more effi-cient encoding compared to GSM make the execution of mobile applications possible[18]. Several problems can occur during the call set-up (gure 1): incompatibilityof the mobile phone (short: mobile) with the WAP 1 gateway, memory violation of a J2ME 2 application, and insufficient resources of the radio bearer, to name onlya few. Whenever a problem occurs, a goal is to restart immediately the call set-up with adapted parameters. Another challenge is the following: assume someonestarts several applications on his mobile, e.g. a chess game and a news ticker formarket prices. Then the goal is to execute both applications immediately aftertheir initiation. Unfortunately, in most situations the radio bearer can only beused 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 user’sside. Limited resources in mobile terminals and the radio bearer make a subsequent

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

1



execution of applications necessary. The examined hypothesis is that the call set-upfor the execution of several mobile applications can be optimized by planning. Asa result, mobile applications are executed immediately more or less in parallel aftertheir start on the mobile. Thus, the waiting period is reduced for the user. Severalcore questions occur, where we focus on the following:

Real-time Can plans for the execution of mobile applications be built in an appro-priate time? The following section describes the call set-up for the executionof mobile applications. The call set-up can be modularized and expressedby actions of a plan. The bottleneck is the necessary effort for the plangeneration.

Completeness Do planning domains exist for which no plans can be computed?The above problems of incompatibility and insufficient resources must besolvable by planning, or with other words, the generated plan for the callset-up must contain actions to tackle these difficulties despite resource avail-ability.

Negotiation Is the call set-up modularizable in the sense, that agents can trans-port quality of service (QoS) information through the radio network duringthe call set-up? Mobile applications are divided into classes by their QoSrequirements. The QoS of mobile applications contains calling parameterslike the maximum transfer delay and is described in the subsequent section.As an example, a voice call requires an immediate voice data transport to thesecond 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 Grasshop-per [7]. Grasshopper enables the use of mobile agents [15, 8] in next generationbroadband 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 (sec-tion 2). The above mentioned problems of incompatibility, memory violation, andinsufficient resources arise also in the core network of the radio bearer or in thepublic domain network (which can be eg the internet or a LAN).The concepts of planning and scheduling are described in section 3. The task toplan the call set-up for mobile applications, such as a chess game and a news tickerfor market prices, illustrates the concept of scheduling for UMTS. This task is notrestricted to the execution of applications on one mobile and rather can be appliedto several mobiles. The implementation of this task is done in PDDL + [12] (sec-tion 4). Experiments for the performance show the appropriateness to optimize theUMTS call set-up. The number of mobile applications which has the same start-ing time on one mobile is varied in the experiments. The computed plans of theexperiments are examined and discussed. Section 5 concludes and sketches furtherwork. Abbreviations are listed before the references.

2



Class Conversational Streaming Interactive BackgroundPreserve time Preserve time Request res- Undenedrelation between relation between ponse pattern. delay.

Con- information ow information Preserve data Preserve datastrai- on the stream. entities of the integrity integritynts Conversational stream

pattern (stringentand low delay)

Ex- Voice, video Streaming Web browsing, Backgroundam- telephony & multimedia network games downloadples video games of e-mails

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

2 UMTS Call Set-up and Quality of Service

Probably the best known feature of UMTS is higher bit rate [17]: on packet-switchedconnections up to 2 Mbps can be reached in the optimal scenario. Compared toexisting mobile networks, UMTS provides a new and important feature, namely ne-gotiation of the radio bearer and transfer properties. The attributes that dene thecharacteristics of the transfer are throughput, transfer delay, and data error rate.UMTS bearers have to be generic to provide good support for existing applicationsand the evolution of new applications. Applications and services are divided into 4classes by their so-called Quality of Service (QoS) [1, 17], where the traffic classes,their fundamental characteristics, and examples for applications are summarized intable 1. The main distinguishing factor between these classes is how delay-sensitivethe traffic is: the conversational class is very delay sensitive (approximately 40 mstime preservation), and the background class has no dened maximum delay. Inthe 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 onthe UMTS bearer is given. It is assumed that mobile applications are executed inthe 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 startthe application chess in their mobiles and the moves are transfered via the radionetwork. Finally, the problem elds described in the introduction are highlightedwith respect to the call set-up ow. In general networks for mobile data trans-fer can be divided into two units [20]: the access network domain (AND) and the

core network domain (CND). The widespread global system for mobile telecommu-nication (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 transmissionof information over the air and to enable the base station controllers (BSC) for thecommunication with mobiles. The communication includes the call set-up, control-ling, and triggering of connections. As second part of the network, the CND consists

3



Figure 2: GSM architecture.

mainly of the mobile services switching center (MSC) for the routing of the wiredGSM system with the visitor location register (VLR) containing information aboutthe 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 pro-vide information about mobile terminals and user’s 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 ANDand CND there is the terminal equipment domain (TED). TED underlines the ideaof the evolution of new applications for mobiles, PDAs, and Laptops. The mobileterminals (short: terminals) are connected via the user services identity module

(USIM) – physically on the subscriber identity module (SIM) card – with the nodeB, which is the counterpart to BTS for UMTS networks (gure 4). The referencepoint for the connection in the radio network is the interface U u , where the general control (GC) is the distribution service of general information to the terminal, thenotication (Nt) is the distribution service for user-specic information like mes-saging, and the dedicated control (DC) maintains the call set-up, data transfer and

4



Figure 3: Global multimedia mobility: domains and access.

the QoS. Within UMTS networks the BSC has also a counterpart, namely the radionetwork Controler (RNC), and nally, the MSC, SGSN, and GGSN are expandedfor the 3 rd 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 thetraffic:

Dedicated control channel (DCCH) enables a narrowband call set-up via theAND to the medium access control (MAC) level, where logical resources aremapped to physical transport channels.

Dedicated traffic 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 basedon the dedicated control channel. The call set-up is provided by the followingmodules 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

5



Figure 4: UMTS radio network architecture.

resources of the mobile (display, . . . ) are checked by the terminal resourcemanagement and allocated, if possible.

CT Transmission of ”Ready for service” via the node B to the mobile to ensurethe connection timing for service availability.

AM Information of mobile (location, . . . ) is sent to AEEI. The transmission canbe 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 cannegotiate with the terminal’s agent about another QoS class (cf. section 5).

AEEM Service agent with QoS class and parameters of application are sent fromthe mobile to AEEI.

RRC Provision of QoS by logical resources from the MAC level (DCCH) in theradio bearer AND.

RAB Radio bearer resources are supplied (from the CND) and the DCH is set-up.

6



Figure 5: Mobile Java application: chess.

AEEI Establishing data transfer from the core network to PDN (e.g. internet) andsending service agent (controlled by AM) to the application in the PDN toensure the QoS for the application.

BS Establishing radio bearer resources with QoS and provide messages to themodules 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.

3 Planning and Scheduling

Planning tasks have two point of views [19]: the generation of a goal-orientedmethod based on a sequence of actions, which is called action planning and theresulting sequence of actions is the plan . Alternatively, actions are mapped to lim-ited resources with constraints and a given cost function is optimized. Often, themapping is based on time parameters. This kind of planning tasks is called schedul-ing . Scheduling tasks investigate the temporal order of given actions (sometimesthey are called jobs). The described UMTS call set-up is a scheduling problemwith limited time resources. Let us consider an example for the execution of twomobile applications. The rst application is a chess game, where the chess boardsare displayed in the mobiles and each move is transfered over the air to the otherplayer (gure 5). Assume player 1 moves the white tower from A1 to B1, then thismove is transfered to the mobile of player 2, where the display of the chess boardis refreshed. Note, this application can be implemented in Java MIDP [5] and forsignalling the always on bearer GPRS [9] can be used. Always on means, that theradio bearer is only busy, when data (here chess moves) are transfered. The otherapplication is a news ticker for market prices. The ticker shows continuously mar-ket prices on a horizontal scrolling display. Both applications can be executed inparallel on the display of one mobile. Assume, the user starts the chess game and

7



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

the news ticker on one mobile with an equal start time. The goal is to minimizethe response time of the radio bearer to the user until the execution of both ap-plications in the radio network is started, i.e. the call set-up for both applicationsis executed. To illustrate the minimization consider gure 6: the naive scenarioshows the subsequent execution of the applications. In the previous section theUMTS call set-up and its modularization is described. Within the optimized callset-up the second application will be started after a minimal number of modulesfor 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 summarizedand their modeling in PDDL + is described. Experiments provide the solution tothe above example and furthermore, the appropriateness of planning to ensure thereal-time UMTS call set-up is shown.

4 Implementation and Experiments

The involvement of time into the planning process is a main challenge of planningtasks [12, 13]. This resource is a duration of actions, where the preconditon of anaction holds at the beginning and the effects add and del take place at some pointafter the beginning and before the end. In the following, two kinds of resources aredistinguished [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 theaction.

Consumable resources vanish when used by an action. Actions can also produce a

8



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 thebackground class) and each module of the call set-up has an estimated duration.Therefore, the (consumable) resources used in the experiments decrease the timeavailable.The application of a planner to nd an optimal temporal order for the modulesof at least two call set-ups requires the handling of renewable and consumableresources and of time. TP4 from the class HSP [14] is a planner with metrictime and certain kinds of resources, based on heuristic search. These features andspecially the domain-independence resulted in the choice of TP4 from the availableplanners 3 . A heuristic planner can be described by considering the search spacewith 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, astate 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 planare met) are searched. Plan tails are incremented by regression with actionsto achieve the subgoals, compatible with the concurrent actions. Afterwards,the preconditions of the latest actions become new subgoals, while the actionsare removed from the state.

Branching rule enables the construction of successors to states by the selectionof establishers. An establisher ensures that actions are compatible to eachother 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 beconstructed from the initial search state by repeated application of the rule.

Heuristic is a combination of the optimal cost with two approximation schemes tosimplify the computation of the Bellmann equation for the optimal cost [14].The heuristic is admissible. HSP uses in its current version the heuristic toprecompute sets of at most two atoms.

Search method is based on the admissible heuristic. The search method appliedis IDA , which nds always an optimal solution, uses space linear in solutiondepth, is asymptotically not slower than A . HSP improves the space usethrough enhancing IDA by a transposition table, cycle checking, and a sym-metry 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 mod-ules and their functions are summarized in table 2. The execution of each module

3 An overview of planning systems which handle resources like time, machines, etc. canbe found in [2].

9



Service Description Set-upduration

TRM After initiation of a mobile application the resourcesof the mobile (display, . . . ) are checked and allocated 70 ms

CT Transmission of ”Ready for service” from the node Bto the mobile 40 ms

AM Information of mobile (location, . . . ) is sent to AEEI 70 msAEEM Service agent with QoS of application is sent to AEEI 70 msRRC Provision of QoS by logical resources in the RAND 210 msRAB Radio bearer resources are supplied (from the CND) 70 msAEEI Establishing data transfer from CN to PDN 40 msBS Establishing radio bearer resources with QoS and

feedback to TRM and AEEI 30 ms

Table 2: Durations of the UMTS call set-up modules for interactive appli-cations like chess (interactive QoS class).

has duration which can be estimated based on the QoS class criteria. For offlineapplications like a market ticker the module execution durations are shorter, sincethe QoS criteria are weaker, e.g. the answering delay is more insensitive comparedto voice calls. The modules for one call set-up must be executed sequentially inthe given order. In section 2 the initially described problems (cf. introduction)are depicted. If there are insufficient radio bearer resources, then the service agentfrom 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 againwith the transfer of the negotiated QoS from the terminal (module AEEM) to theAND (module RRC). Each initiation of a mobile application requires the execu-tion of the UMTS call set-up. As an example consider the initiation of two mobileapplications, the chess game and the ticker for market prices from section 3: thegoal is to minimize the delay between initiation and start of both applications. Themain difference between both applications is their QoS class: the chess game isinteractive 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 latterrequires in maximum 210 ms and the former 70 ms. Then the waiting period forthe user, until both mobile applications are started, is optimized. Figure 7 showsthe plan generated with TP4: the smallest waiting period for the user results bythe start of the ticker with a delay of 180 ms after the start of the chess game. TheUMTS call set-up for the chess game requires approximately 570 ms and hence theuser’s waiting period is reduced by 570 − 180 = 390 ms, or 68 %. This optimizationis 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 down-load 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) anda ticker for market prices (bottom).

the user would be annoyed by sequential application execution and unmotivated touse the service/ application. The representation of the planning domain is basedon the eight modules for the UMTS call set-up. Resources may be renewable orconsumable: an example for a renewable resource is the keyboard of the mobile. Itcan be used to input data for several applications. Consumable resources which arerealized in the experiments are summarized in table 3 (a complete list of resourcesfor the UMTS call set-up can be found in [3]). Figure 4 in section 2 depicts, that amobile application can be executed, when the radio bearer with the required QoSis established. The predicate BS for the bearer establishment has as preconditionsthe 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 messagesof the set-up status to the application in the mobile and the PDN (the complete listof predicates can be found in the appendix). The resources are already allocatedby the preceding modules. Only the cost for the plan generation (after initiatingan application the user is waiting for the plan geneneration and the call set-up)are considered. As effect the I u bearer and the network connection for the mobileapplication are set up (representation in PDDL + [12]; enhancement of the planningdomain 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 used with x per cent per applicationd-available partition of the display, e.g. ticker and chesse-balance energy balance of mobile accumulatormobile-channels used for data transfer-availablenum-mobiles number of mobiles which are tractable

by a node Bnum-calls mobile network load for a node Bmobile-storage memory on S(IM)AT cardlogical-channels number of logical channels available in the CNcell-update report UE location into RNChandover handover required to get a higher bit rate

active-set-up update connectionggsn-bitrate capacity (kbit/s) from GGSN to PDNmax-no-pdp max. no. of packet data protocols per mobilemax-no-apn 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 callset-up is the radio access bearer procedure in the CND, which is described in moredetail. As rst step the logical resources must be allocated (RRC), e.g. the requirednumber of channels must be provided on the logical level and later they are mappedto 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 factrab − ok

is not true and aservice agent must be sent to the mobile in order to negotiate with the applicationor user for weaker QoS requirements (cf. section 5). In case of success the predicateRAB is true and the connection to the PDN must be checked. Finally, the goalpredicate BS can be fulled if all resources are available.To demonstrate the above modeling the challenges described in the introductionare 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 connectionset-up of the mobile with the gateway. During the call set-up all modulesfrom TRM to the AEEI are executed until the gateway connection is triedto 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 smalldisplay. Here the call set-up has been executed errorless, but it must berepeated 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 radioresource controler recognizes the insufficient radio resources and provides amessage to the terminal. Hence, the modules of the core network need notto be executed. Alleviation to this scenario can be given by a negotation of the radio resources between the terminal’s agent and a network’s agent thatis 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. Formeasurement 4 the precompilation time (cf. heuristic of HSP ; the plan generationtime is neglectible compared to the precompilation time), the branching factor, thenumber of actions and the number of pairs of instances are taken. For the experi-ments it is assumed that all resources are sufficiently available. Table 4 shows theefforts to generate plans for 2 to 20 mobile applications (assumed the required re-sources are available). In general users may execute not more than 10 applicationsin parallel (e.g. messaging services like e-mail and voice, calendar, news, and gameapplications) [4], then the (pre-) compilation time is in maximum 1 second. Thistime duration is an appropriate waiting period for users. Compare this result withthe simple application of a naive heuristic like earliest due date to the plan gener-ation: each module should be executed as early as possible. This heuristic leads toa 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 chessgame and for the market price ticker are executed, then CT for both, afterwards

4 Pentium III with 500 MHz

13



#Applications /Parameters 2 5 10 20Precompilationtime (sec.) 0 0.05 0.54 23.54Branching factor 1.14 2.86 5.71 11.43#Actions 20 50 100 200#Pairs of instances 210 1275 5050 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 theexecution times for all modules.The difference between the application of TP4 and a naive heuristic to mobile call-set-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 consid-ered. In contrast the planner examines the global situation by estimating the totaldue time of the tasks, and additionally, a subsequent choice from the remaindermodule 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 onone mobile and rather can be applied to several terminals.The good result demonstrates that experiments with a further planner are notrequired, since TP4 is a multi purpose planner with time and several kinds of re-sources. However, the application of specic solving algorithms like from the eldof CSP may lead to an improvement.

5 Conclusion and Further Work

The UMTS call set-up for the execution of applications in mobile terminals hasbeen described. The planning language PDDL + is appropriate to represent themodules of the call set-up. Planners with time and resources, here TP4, can beapplied to generate optimal plans w.r.t. IDA . The resulting plans demonstratethat the user’s waiting period for the execution of several mobile applications isoptimized. TP4 provides good results for the mobile domain with stable states. As

output an efficient order for the execution of the modules is given within in a staticworld.During the planning process consumable and renewable resources like transportchannels are considered. In the experiments the number of mobile applications hasbeen varied up to 20 applications. However, improvements are possible since somemodules 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 casethe RB resources are insufficient to execute the desired mobile application, thena service agent can negotiate with the controler of the node B (RNC) or the ter-minal (TRM). The negotiation considers the different 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 toexamine the appropriateness of negotation and handover to ensure the QoS withinthe UMTS radio bearer.Another challenge arises from the assumption of a dynamic world, where the initi-ation of a new mobile service requires re-scheduling of a previously existing plan.

6 Appendix

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

6.1 Abbreviations3G 3rd Generation (of mobile communication systems)AEEI Agent Execution Environment InternetAEEM Agent Execution Environment MobileAM Agent ManagementAND Access Network DomainAPN Access Point NodeAuC Authentication CenterBS Bearer Service

BSC Base Station ControllerBTS Base Transceiver StationCND Core Network DomainCT Connection TimingDC Dedicated ControlDCCH Dedicated Control CHannelDTCH Dedicated Traffic CHannelEIR Equipment Identity RegisterGC General ControlGMM Global Multimedia MobilityGPRS General Packet Radio ServiceGSM Global System for Mobile communicationsHLR Home Location RegisterHSP Heuristic Search Planner based on IDAIDA Iterative Deepening AJ2ME Java 2 Micro EditionMAC Medium Access ControlMSC Mobile services Switching CenterNt Notication

15



PDA Personal Digital AssistantPDDL + Planning Domain Denition LanguagePDN Public Domain NetworkQoS Quality of ServiceRAB Radio Access BearerRNC Radio Network ControllerRRC Radio Resource ControllerSAT SIM Application ToolkitSIM Subscriber Identity ModuleTED Terminal Equipment DomainTP4 Temporal Planner 4TRM Terminal Resource ManagementUE User Equipment

UMTS Universal Mobile Telecommunication SystemUSIM User Services Identity ModuleUTRAN UMTS Terrestrial Radio Access NetworkVLR Visitor Location RegisterWAP 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



AcknowledgmentsThe author likes to thank Joachim Hertzberg, J¨ urgen Sauer and Armin B. Cre-mers for their discussions and valuable improvements. Furthermore he thanks Jan-Hinnerk Reemtsma (T-Mobile Deutschland GmbH) for comments on the UMTScall set-up description.

References

[1] 3rd Generation Partnership Project: Technical Specication Group Serviceand 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 Telecom-munication Networks , chapter 11 in Hayzelden, A./Bigham, J. (eds.), SoftwareAgents for Future Telecommunication Systems. Springer, 1999.

[7] M. Breugst, I. Busse, S. Covaci, and T. Magedanz. Grasshopper: A mobileagent 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 gen-eration mobile communication. In J. Sauer, editor, Proceedings of the KI-2001Workshop ”AI in Planning, Scheduling, Conguration and Design” . Vienna,Austria, 2001.

[11] P. Farjami, C. G¨org, and F. Bell. Advanced service provisioning based onmobile 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 temporalplanning domains. www.dur.ac.uk/maria.fox, July 2001.

17



[13] M. Ghallab and A. Milani (Eds.). New directions in AI planning. Vol. 31 inSeries Frontiers in Articial Intelligence and Applications, IOS Press Omsha,Amsterdam, 1996.

[14] P. Haslum and H. Geffner. Heuristic planning with time and resources. InProc. IJCAI Workshop on Planning with Resources , 2001.

[15] A. Hayzelden and J. Bigham, editors. Software Agents for Future Communi-cation Systems . Springer, 1999.

[16] A. Hayzelden, J. Bigham, M. Wooldridge, and L. Cuthbert. Future Communi-cation Networks Using Software Agents , chapter 1 in Hayzelden and Bigham1999. 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. Kohler. Von der Aufzugssteuerung Zur Wartung Von U-Booten - KIPlanungs- und Schedulingverfahren Auf Erfolgskurs in der Industrie. Kon-radin Verlag, 1999. Informatiktage.

[20] B. Walke. Mobilfunknetze und ihre Protokolle . Teubner, Braunschweig, Ger-many, 2000.

18

Documents

Call Setup Time Opt