Performance evaluation of path optimization schemes for inter‐switch handoff in wireless ATM networks

One of the major design issues in wireless ATM is the support of inter‐switch handoff. An inter‐switch handoff occurs when a mobile terminal moves to a new base station connecting to a different switch. Recently, a two‐phase handoff protocol has been proposed to support inter‐switch handoff in wireless ATM networks. With the aim of shortening handoff delay while using the network resources efficiently, the two‐phase handoff protocol employs path extension for each inter‐switch handoff, followed by path optimization if necessary. To implement the two‐phase handoff protocol efficiently, we need to determine when to trigger path optimization. In this paper, we propose and analyze three path optimization schemes, namely: periodic, exponential, and Bernoulli, for the two‐phase handoff protocol. The design objective is to determine the time to invoke path optimization such that the average cost per connection is minimized. We develop a discrete time analytical model and a discrete‐event simulation model for comparing the performance of the three path optimization schemes. Results indicate that the Bernoulli path optimization scheme outperforms the other two schemes by providing a lower average cost per connection. The proposed models can also be adapted to analyze other path optimization schemes in general. This revised version was published online in July 2006 with corrections to the Cover Date.     

An efficient handoff management scheme for mobile wireless ATMnetworks

A new handoff management scheme for wireless ATM networks is proposed. In this scheme, all cells are connected to their neighboring cells by permanent virtual circuits (PVCs) and to the access switch (AS) by switched virtual circuits (SVCs) which are only for new calls. Some carefully chosen cells, called rerouting cells, are also connected to the AS by PVCs. In summary, if a mobile roams to an ordinary neighboring cell, its traffic path is simply elongated by a PVC connecting the old and new cells. If a mobile roams to a rerouting cell, its traffic path is rerouted to a PVC between the AS and rerouting cell. By using PVC's for handoff calls, we can guarantee fast and seamless handoff. At the same time, our scheme improves the path efficiency by limiting the maximum number of hops that a path can be extended. Also, allowing path rerouting at a suitable time means the network resources are more efficiently utilized     

Stochastic control of path optimization for inter-switch handoffsin wireless ATM networks

One of the major design issues in wireless ATM networks is the support of inter-switch handoffs. An inter-switch handoff occurs when a mobile terminal moves to a new base station connecting to a different switch. Apart from resource allocation at the new base station, inter-switch handoff also requires connection rerouting. With the aim of minimizing the handoff delay while using the network resources efficiently, the two-phase handoff protocol uses path extension for each inter-switch handoff, followed by path optimization if necessary. The objective of this paper is to determine when and how often path optimization should be performed. The problem is formulated as a semi-Markov decision process. Link cost and signaling cost functions are introduced to capture the tradeoff between the network resources utilized by a connection and the signaling and processing load incurred on the network. The time between inter-switch handoffs follows a general distribution. A stationary optimal policy is obtained when the call termination time is exponentially distributed. Numerical results show significant improvement over four other heuristics     

Performance analysis of path rerouting algorithms for handoffcontrol in mobile ATM networks

This paper studies the effects of user mobility and handoff path rerouting on the traffic distributions in a mobile network environment. In mobile ATM networks, extra traffic load may be added to network links due to user mobility and handoff path rerouting. This requires higher network link capacity and possible topology reengineering in order to support the same quality of service (QoS) for mobile services. To capture the dynamic variations in mobile ATM networks, we propose to use a flow model. The model represents the mobile-generated traffic as a set of stochastic flows over a set of origin-destination (OD) pairs. The user mobility is defined by transfer probabilities of the flows and the handoff path rerouting algorithm is modeled by a transformation between the routing functions for traffic flows. The analysis shows that user mobility may cause temporal variations as well as smoothing effects on the network traffic. Using the flow network model, typical handoff path rerouting algorithms are evaluated through both analytical and experimental approaches. The evaluation methodology can be used for either redesigning the network topology for a given path rerouting algorithm or selecting a path rerouting algorithm for a given network topology under a specific mobile service scenario     

Mobility management in wireless ATM networks

Mobile ATM offers a common wired network infrastructure to support mobility of wireless terminals, independent of the wireless access protocol. In addition, it allows seamless migration to future wireless broadband services, such as wireless ATM, by enabling mobility of end-to-end ATM connections. In spite of the diversity in mobile networking technologies (e.g., cellular telephony, mobile-IP, packet data services, PCS), all of them require two fundamental mechanisms: location management and handoff. This article describes different schemes for augmenting a wired ATM network to support location management of mobile terminals and handoff protocols for rerouting a connection data path when the endpoint moves. A prototype implementation of mobile ATM integrating mobility support with ATM signaling and connection setup, is presented. It shows how mobile ATM may be used to provide mobility support to an IP terminal using non-ATM wireless access     

Enhanced hop-limited handoff scheme for linear broadband cellularnetworks

An enhanced handoff scheme for ATM-based cellular networks in linear environments is proposed. Some regularly spaced cells are assigned as rerouting cells. If a handoff call comes to a rerouting cell, its traffic path is rerouted to a PVC between the cell and the ATM switch. If a handoff call comes to an ordinary cell, its traffic path is simply elongated by a PVC between the new cell and its previous cell. The path efficiency is improved     

A comparative study of bandwidth reservation and admission control schemes in QoS‐sensitive cellular networks

This paper compares five different schemes – called CHOI, NAG, AG, BHARG, and NCBF – for reserving bandwidths for handoffs and admission control for new connection requests in QoS‐sensitive cellular networks. CHOI and NAG are to keep the handoff dropping probability below a target value, AG is to guarantee no handoff drops through per‐connection bandwidth reservation, and BHARG and NCBF use another type of per‐connection bandwidth reservation. CHOI predicts the bandwidth required to handle handoffs by estimating possible handoffs from adjacent cells, then performs admission control for each newly‐requested connection. On the other hand, NAG predicts the total required bandwidth in the current cell by estimating both incoming and outgoing handoffs at each cell. AG requires the set of cells to be traversed by the mobile with a newly‐requested connection, and reserves bandwidth for each connection in each of these cells. The last two schemes reserve bandwidth for each connection in the predicted next cell of a mobile where the two schemes use different admission control policies. We adopt the history‐based mobility estimation for the first two schemes. Using extensive simulations, the five schemes are compared quantitatively in terms of (1) handoff dropping probability, connection‐blocking probability, and bandwidth utilization; (2) dependence on the design parameters; (3) dependence on the accuracy of mobility estimation; and (4) complexity. The simulation results indicate that CHOI is the most desirable in that it achieves good performance while requiring much less memory and computation than the other four schemes. This revised version was published online in July 2006 with corrections to the Cover Date.     

Preplanned rerouting optimization and dynamic path rerouting for ATM VP restoration

The survivability for ATM based B‐ISDN has become an important challenge for telecommunication network planners and engineers. In this paper, we consider multiple grades of reliability concept and a multilayer survivable network architecture for survivable ATM networks. We address two complementary ATM VP restoration schemes in this paper. First, we propose preplanned rerouting models and algorithms based on combinatorial optimization to prepare efficient backup VP configuration. We test two formulations and algorithms for this problem. Efficient column generation technique to solve linear programming relaxation and strong valid inequalities incorporating the branch‐and‐bound scheme are suitable to solve the problem to optimality within small time limits. Second, we propose a new dynamic VP path restoration scheme to restore nonprotected VPs by the preplanned rerouting. Our protocol has shown the advantage in restoration effectiveness comparing a well‐known protocol in computational simulation. We, finally, address the relationships between the suggested models of this paper and the expected results of our ongoing project. This revised version was published online in August 2006 with corrections to the Cover Date.     

A two‐phase combined QoS‐based handoff scheme in a wireless ATM network

We describe the QoS‐based rerouting algorithm that is designed to implement a two‐phase inter‐switch handoff scheme for wireless ATM networks. We propose to use path extension for each inter‐switch handoff, and invoke path optimization when the handoff path exceeds the delay constraint or maximum path extension hops constraint. We study three types of path optimization schemes: combined QoS‐based, delay‐based and hop based path rerouting schemes. Copyright © 2001 John Wiley & Sons, Ltd.     

Mobility modeling, location tracking, and trajectory prediction inwireless ATM networks

Wireless ATM networks require efficient mobility management to cope with frequent mobile handoff and rerouting of connections. Although much attention has been given in the literature to network architecture design to support wide-area mobility in public ATM networks, little has been done to the important issue of user mobility estimation and prediction to improve the connection reliability and bandwidth efficiency of the underlying system architecture. This paper treats the problem by developing a hierarchical user mobility model that closely represents the movement behavior of a mobile user, and that, when used with appropriate pattern matching and Kalman filtering techniques, yields an accurate location prediction algorithm, HLP, or hierarchical location prediction, which provides necessary information for advance resource reservation and advance optimal route establishment in wireless ATM networks     

Performance evaluation of connection rerouting schemes forATM-based wireless networks

Supporting mobility in asynchronous transfer mode (ATM)-based broad-band networks with wireless access links poses many technical challenges. One of the most important of these challenges is the need to reroute ongoing connections to/from mobile users as these users move among base stations. Connection rerouting schemes must exhibit low handoff latency, maintain efficient routes, and limit disruption to continuous media traffic while minimizing reroute updates to the network switches. In this paper we propose, describe an implementation for, and experimentally evaluate the performance of five different connection rerouting schemes. We show that one of these schemes, which operates in two phases, executes very fast reroutes (with a measured latency of 6.5 ms) in a real-time phase and, if necessary, reroutes again in a nonreal-time phase to maintain efficient routing. The scheme also results in negligible disruption to both audio (e.g., a 1-in-100 chance of a single packet loss at CD-quality audio rates of 128 kb/s) and low-bit-rate video (e.g., a 2-in-100 chance of a single packet loss for 1-Mb/s video) traffic during connection rerouting. Based on these results, we conclude that simple handoff schemes coupled with a connection management architecture are sufficient for supporting low-bit-rate continuous media applications over ATM-based wireless networks     

A scalable wireless virtual LAN

This paper presents a Wireless Virtual Local Area Network (WVLAN) to support mobility in IPoverATM local area networks. Mobility is handled by a joint ATMlayer handoff for connection rerouting and MAClayer handoff for location tracking, such that the effects of mobility are localized and transparent to the higherlayer protocols. Different functions, such as Address Resolution Protocol (ARP), mobile location, and ATM connection admission are combined to reduce protocol overhead and frontend delay for connectionless packet transmission in connectionoriented ATM networks. The proposed WVLAN, through the use of ATM technology, provides a scalable wireless virtual LAN solution for IP mobile hosts.     

Seamless Handoff Scheme Based on Pre-registration and Pre-authentication for UMTS–WLAN Interworking

Interworking issues between Universal Mobile Telecommunication System (UMTS) and Wireless Local Area Network (WLAN) have become a great matter of interest as an increasing number of mobile internet users require broadband wireless access to IP services in the wide area. In this paper, we present a practical UMTS–WLAN interworking architecture based on 3GPP standards and propose a seamless handoff scheme that guarantees low delay and low packet loss during UMTS–WLAN handoff. For low handoff delay, the proposed handoff scheme performs pre-registration and pre-authentication processes before layer 2 handoff. Moreover, it uses packet buffering and forwarding functions in order to reduce packet loss during the handoff period. On the above basis, detailed signaling procedures are presented, together with system requirements when a mobile terminal moves from UMTS to WLAN and vice-versa. Numerical results show that the proposed scheme performs well with respect to signaling cost, handoff delay, and packet loss compared with conventional schemes.     

A Model for Enhancing Connection Rerouting in Mobile Networks

In active networks (ANs) programs can be injected into routers and switches to extend the functionalities of the network. This allows programmers to enhance existing protocols and enables the rapid deployment of new protocols. The main objective of this paper is to show why ANs are ideal in solving the problem of connection rerouting and how current end-to-end based approaches can be enhanced. In this paper we propose a new model called active connection rerouting (ACR). In the ACR model, programs are dynamically injected into switches/routers in mobile networks to faciliate efficient connection rerouting during mobile host (MH) migration. We show how connection rerouting can be performed efficiently within the network. The ACR model uses a two stage optimization process: (i) path extension and (ii) lazy optimization. Unlike previous work on two stage connection rerouting ACR has the following properties: elimination of loops within switches/routers and incremental optimization which minimizes buffer requirements and maximized path reuse. ACR performs well in all topologies. Our experimental results show that ACR is efficient and scalable and it performs well in all topologies.     

Hop-limited handoff scheme for ATM-based broadband cellularnetworks

In the proposed handoff scheme for a cellular ATM network, if the number of successive handoffs of a mobile is less than a preset number, the traffic path is simply elongated by a PVC between the new cell and the current cell. If the number reaches the preset number, the traffic path is rerouted to a PVC between the new cell and the ATM switch. By limiting the number of successive path elongations, the path efficiency can be improved and the network's processing load can be kept light     

Escrow techniques for mobile sales and inventory applications

We address the design of architectures and protocols for providing mobile users with integrated Personal Information Services and Applications (PISA), such as personalized news and financial information, and mobile database access. We present a system architecture for delivery of PISA based on replicated distributed servers connected to users via a personal communications services (PCS) network. The PISA architecture partitions the geographical coverage area into service areas, analogous to PCS registration areas, each of which is served by a single local server. When a user moves from one service area to another, the service is provided by the new local server. This is accomplished by a service handoff, analogous to a PCS call handoff, which entails some context information transfer from the old to the new server. We focus on the mobile sales and inventory application as an example of a PISA with a well‐defined market segment. We design a database management protocol for supporting both mobile and stationary salespersons. Our design uses the site‐transaction escrow method, thus allowing faster responses to mobile clients, minimizing the amount of context information which must be transferred during a service handoff, and allowing mobile clients to operate in disconnected mode by escrowing items on their local disks. We develop a formal model for reasoning about site‐transaction escrow, and develop a scheme for performing dynamic resource reconfiguration which avoids the need for time‐consuming and costly database synchronization operations (i.e., a two‐phase commit) when the mobile sales transaction completes. A further refinement to the scheme avoids an n‐way two‐phase commit during resource reconfiguration operations, replacing it with several simpler two‐phase commits. This revised version was published online in July 2006 with corrections to the Cover Date.     

A Fast Handoff Management Scheme in ATM-Based Personal Communication Networks

Future wireless personal communication networks will likely have infrastructures based on asynchronous transfer mode (ATM) networks. It is a challenge to support seamless, fast handoffs in such an environment. We propose a fast handoff management scheme using permanent virtual connections (PVCs) reserved between neighboring base stations (BSs). In the proposed scheme, the handoff can be quickly performed by rerouting the communication path via the PVCs. Handoff calls are distributively controlled only by the corresponding BSs without the involvement of any ATM switches. ATM cell sequence integrity during handoff can be maintained by the BSs. In order to dimension the PVC, we analytically derive the probability of handoff blocking due to the lack of PVCs. We give some numerical examples of PVC dimensioning. The proposed scheme can be utilized in the future IMT-2000 networks accommodating various narrowband services in the range of several kbps to several hundreds kbps.     

Route optimization in mobile ATM networks

This paper presents an algorithm for optimizing the route of a connection that becomes suboptimal due to operations such as handoffs and location-based reroutes, and applies this algorithm to the handoff management problem in mobile ATM (Asynchronous Transfer Mode) networks based on the PNNI (Private Network-to-Network Interface) standard. The route optimization algorithm uses hierarchical route information of the connection and summarized topology and loading information of the network to determine a “crossover node” such that adjusting the connection from that crossover node results in an optimally routed connection. Handoff management schemes that perform local rerouting of connections have been proposed in order to support fast handoffs. These methods result in suboptimally routed connections. In this paper, we demonstrate how this route optimization algorithm can be used to optimize the route of a connection after such a handoff is executed, as the second phase of a two-phase handoff scheme. This route optimization procedure can also be executed as part of the handoff procedure resulting in a one-phase handoff scheme. Applying this route optimization algorithm, we propose two one-phase schemes, the one-phase optimal scheme and the one-phase minimal scheme. A comparative performance analysis of one- and two-phase handoff schemes is presented. Measures of comparison are handoff latency and the amount of network resources used by a connection. Handoff latency in the one-phase optimal scheme is greater than that in the two-phase schemes, and handoff latency in the one-phase minimal scheme is smaller than that in the two-phase schemes. The one-phase methods show a significant increase in efficiency of the connection compared to the two-phase methods. This revised version was published online in June 2006 with corrections to the Cover Date.     

Performance of a large multicast ATM switch

In this paper, we present the design of a large self-routing multicast ATM switch. The switch consists of a sorting network followed by a 3-stage routing network. We first present a simple design of a large sorting network built using small sized shared memory that can be used as a building block for a large sorting network. Small sized shared memory is also used in the 3-stage routing network making the switch modular and easy to implement using current VLSI technology. As the network uses shared memory modules, multicasting functionality is easily built into the network. The performance of the proposed network is compared with an equivalent completely shared memory switch using computer simulations under bursty traffic model. The results show that the proposed network has better performance in terms of cell loss ratio than the completely shared memory switch under moderate to heavy traffic load (0.6 ≤ effective offered load ≤ 1.2). Furthermore, multicast cell delays are drastically improved. This revised version was published online in June 2006 with corrections to the Cover Date.     

Large-scale ATM multistage switching network with shared buffermemory switches

The configuration of an asynchronous transfer mode (ATM) switch architecture using a shared buffer memory switch (SBMS) is discussed. The scaling factors of the ATM switching network under a condition of mixed applications, including a conventional mix and telecommunication with video, are analyzed. The use of the SBMS as the unit switch for a multistage switching network is examined. A prototype system and its performance evaluation and experimental data are presented. The data indicate excellent performance under a burst cell arrival condition. The buffer size of the SBMS can be reduced in comparison with that of an individual (nonshared) buffer memory switch. A configuration for a large-scale ATM switching network with multistage switches is proposed