P. Ramanathan, K. Sivalingam, P. Agrawal, and S. Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks," IEEE JSAC, 17(7), Jul. 1999, pp. 1270-1283.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....estimate of the handoff arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoff block probability close to the targeted objective while constraining the new call blocking probability to be below a given level. In [9], the dynamic guard channel scheme is extended to provide admission control for multiple traffic classes; the handoff blocking probabilities are minimized at any cost without paying attention to the degradation of the new call blocking probabilities. In this paper, we propose a multiple dynamic ....

P. Ramanathan, K. M. Sivalingam, P. Agrawal and S. Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks," IEEE J. Select. Areas Commun., vol. 17, pp. 1270-1283, July 1999.

....estimate of the handoff arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoff block probability close to the targeted objective while constraining the new call blocking probability to be below a given level. In [8], the dynamic guard channel scheme is extended for multiple traffic classes; the handoff blocking probabilities are minimized at any cost without considering the degradation of the new call blocking probability. This paper proposes the Adaptive Prioritizedhandoff CAC (AP CAC) protocol, which ....

P. Ramanathan, IC M. Sivalingam, P. Agrawal and S. Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks," IEEE JSAC, vol. 17,pp.1270-1283, July 1999.

....handled by active and passive reservation. Modified RSVP is used to accommodate for new QoS parameters such as loss profiles, probability of seamless communication, and rate reduction. Other proposals related to modification of RSVP to support mobility have been discussed [6, 9] amanathan et al. [8] present strategies for accommodating continuous service to mobile users through estimating resource requirements of potential handoff connections. This paper investigates static as well as dynamic resource allocation schemes. The results indicate that using dynamic estimation and allocation ....

P. Ramanathan, K. M. Sivalingam, P. Agrawal, and S. Kishore. Dynamic resource allocation schemes during handoff for mobile multimedia wireless networks. IEEE Journal on Selected Areas in Communications, 17(7):1270-- 1283, July 1999.

....and refresh the reservation state on the new path. To provide real time services during handover two mechanisms are envisioned. The first is the use of passive, statically configured bandwidth guard bands , reserved for use by traffic during handover until the reservation has been re established [10]. This process must be initiated by identification of mobility event (known as coupling [11] The second is the use of a context transfer protocol to pass information about the reservations between ARs involved in the handover To avoid the excess of signalling over a wireless interface. III. ....

P. Ramanathan, K.M. Sivalingam, P. Agrawal, S. Kishore, "Dynamic resource allocation schemes during handoff for mobile multimedia wireless networks", IEEE Journal on Selected Areas in Communications, vol.17, no.7, July 1999.

....control has been typically achieved through trunk reservation in each cell. An a priori resource reservation in the form of guard channels provides priority to handover calls over new calls. Proposals include fixed and dynamic reservation of resources as well as optimal and heuristic solutions ([1] [3] The current study integrates the two quality metrics in an optimization process that maximizes resource utilization while keeping the handover dropping probability per service below a predefined limit. The problem is formulated as a sequential decision one, and solved by making use of the ....

...., the algorithm prevents the system from taking an action a in a state s, when rc rc thr . VI. PRIOR DYNAMIC RESOURCE ALLOCATION DURING HANDOVER (EXPECTEDMAX) In this section we present the prior ExpectedMax algorithm for dynamic resource allocation during handover, which has been introduced in [1]. The objective in this algorithm is to minimize the handover dropping probability for every service in a wireless cellular network. Different cells can have different service mixes, different capacities, and can be characterized by different mobility patterns. Upon a new arrival of service s, ....

[Article contains additional citation context not shown here]

P. Ramanathan, K.M. Sivalingam, P. Agrawal, and S. Kishore, "Dynamic resource allocation schemes during handoff for mobile multimedia wireless networks", IEEE Journal on Selected Areas in Communications, Vol. 17, No. 7, July 1999

....This is because a user would rather be denied service than have an ongoing communication abruptly terminated. In this paper, we deal with mechanisms to incorporate user mobility into bandwidth allocation schemes of cellular networks. Several such schemes have been proposed in [1] 3] 5] and [6]. The algorithm proposed in [5] uses the number of active calls in neighboring cells along with handoff and call arrival rates to decide on call admission. It does not consider the actual mobility characteristics of users such as speed and direction of movement. It also assumes that each call ....

....decide on call admission. It does not consider the actual mobility characteristics of users such as speed and direction of movement. It also assumes that each call request is identical. This scheme is, therefore, not suitable in networks supporting multimedia applications. The scheme proposed in [6] dynamically estimates the resource requirements for calls in neighboring cells that may be handed off to the current cell. Such estimates are used to reserve resources for handoffs. However, this scheme fails to consider calls in non adjacent cells that may be handed off to the current cell. This ....

P. Ramanathan, K.M. Sivalingam, P. Agrawal and S. Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks", IEEE JSAC, Vol.17, No.7, pp 1270-1283, July 1999.

.... in a particular cell, and will attempt to adapt the amount of bandwidth reserved to ensure that this requirement is met (handoff drops per time period for a given cell do not exceed the predetermined limit) Three variations of this Admission Control scheme are proposed in [2] Ramanathan et al. [3], propose a dynamic scheme called ExpectedMax, which basically computes the maximum expected value of the bandwidth requirement in a cell, taking into account information from neighbouring cells. This scheme is compared with a modified version of the work of Yu and Leung [8] which was originally ....

....predicting the direction in which mobiles are moving and using that for Call admission control and bandwidth reservation. However, our attempt will be to see what can be achieved without directly attempting to predict the mobility of calls. We make further comparisons with Ramanathan et al. [3] during and after the description of our schemes. In the current paper, we make three main contributions for studying this question. 1) Topology: Previous work [1] 2] 3] has focussed on either a straight line scenario in the simplest case, or a regular, hexagonal structure. Both of these are ....

[Article contains additional citation context not shown here]

P. Ramanathan, K.M. Sivalingam, P.Agrawal, and S.Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks", IEEE JSAC, July 1999, Vol 17 No. 7, pp.1270-1283.

....handoff calls vis a vis new calls are needed, for instance, by maintaining bandwidth reserves for future handoffs. The concept of bandwidth reservation for handoffs was first introduced in the mid 80s [2] Since then, various strategies that assign priority to handoffs have been studied [3] [14]. Ideally, no handoff drops are desirable. This, however, requires that the network reserve bandwidth in all cells that a mobile might pass through, resulting in potentially lower utilization and or higher new call blocking probability (# # ) To achieve increased efficiency, several approaches ....

....# Call duration is exponentially distributed with mean ###. # The unencumbered cell residence time 4 is exponentially distributed with mean ###. # The capacity of each cell is # . Under these assumptions, the probability distribution function of the cell residence time 5 is given by (see [14]) ######## # ####### # (6) # Our admission control schemes do not make use of any of these assumptions. # Cell residence time for a call which will be handed over. # The probability that a mobile will either handoff or complete in the residing cell within time # . The probability that a ....

P. Ramanathan, K. M. Sivalingam, P. Agrawal and S. Kishore, "Dynamic resource allocation schemes during handoff for mobile multimedia wireless networks," IEEE Journal on Selected Areas in Communications, 17(7), July 1999.

....bandwidth. There are several possible solutions to the problem of which two solutions are considered in our framework. In the rst solution, a class called new mobile class is set up and is allocated a small percentage of the bandwidth. Several methods to estimate this percentage are studied in [26]. This class is used for mobiles handed o from neighboring cells. When the bandwidth of this class is not being used, it is implicitly distributed among the various classes that need extra bandwidth. A mobile entering the region will use the new mobile class for a speci ed amount of time. After ....

Ramanathan, P., Sivalingam, K. M., Agrawal, P., and Kishore, S. Dynamic resource allocation schemes during hando for mobile multimedia wireless networks. IEEE Journal on Selected Areas in Communications 17, 7 (July 1999), 1270-1283.

No context found.

P. Ramanathan, K. Sivalingam, P. Agrawal, and S. Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks," IEEE JSAC, 17(7), Jul. 1999, pp. 1270-1283.

No context found.

P. Ramanathan, K. Sivalingam, P. Agrawal, and S. Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks," IEEE JSAC, 17(7), Jul. 1999, pp. 1270-1283.

No context found.

P. Ramanathan, K. Sivalingam, P. Agrawal, and S. Kishore, "Dynamic Resource Allocation Schemes During Handoff for Mobile Multimedia Wireless Networks," IEEE JSAC, 17(7), Jul. 1999, pp. 1270-1283.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC