B. A. Akyol, D. C. Cox, "Rerouting for Handoff in a Wireless ATM Network", IEEE Personal Communications Magazine, vol. 3, no. 5, 1996, pp. 26-33.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the original connection, while preserving the remainder. Finally, multicast connection rerouting combines the former three techniques but includes the maintenance of potential handoff connection routes to support the original connection, reducing the time spent in finding a new route for handoff [17]. 1) Full Connection Rerouting: Full connection reestablishment is the most optimal and the simplest rerouting technique in that all of the VC s in the connection path from the source to the previous switch are cleared [89] Then new VC s are established from the source to the new switch. It can ....

....technique attempts to route a connection more efficiently by preserving some portions of the original route for resource management and simplicity and rerouting other portions for optimality. a) Nearest common node algorithm: The nearest common node rerouting (NCNR) algorithm presented in [17] routes connections according to the LA (referred to by the authors as zones) Handoff within the LA or zone constitutes a VC table update. For handoff between zones, the algorithm attempts to bridge the connection at the nearest WATM network node that is common to both of the zones involved ....

B. Akyol and D. Cox, "Re-routing for handoff in a wireless ATM network," IEEE Personal Commun., vol. 3, pp. 26--33, Oct. 1996.

....only one EMASE is involved in the procedure, and the same EMAS E behaves as COS, all the protocols will be illustrated only for the more general case of global handovers. COS discovery is not discussed here but can be performed by using any of the algorithms described in the literature [17] [30], 31] 32] moreover, COS discovery can be performed off line and the results stored in a table, so that the time for COS discovery during the handover is minimized. The described protocols assume that the MT is already registered with the network; in fact, as discussed in Sec. II B, this task ....

B. A. Akyol, D. C. Cox, "Rerouting for Handoff in a Wireless ATM Network, " Proc. of ICUPC'96, pp. 26-33, Sep. 1996.

....stage, and then the execution of a new setup connection procedure in order to re establish the connection between the sender and the new switch. This solution is obviously not very suitable in an environment with a higher mobility degree or in a network that enables multiple connections per mobile [2], such as in WATM. Moreover, re establishing multiple user connections will significantly increase the connection setup overhead, the delay, and the blocking probability. A more appealing method is rerouting. In fact, rerouting avoids the disruption of the communication by pre establishing in ....

....where a communication requests several handovers and requires a higher storage capacity in the switches buffer. # Partial Rerouting : Partial Schemes are based on the rerouting of a part of the connection. Different algorithms propose to find the suitable switch for rerouting. The NCNR algorithm [2], and the CSDR algorithm [11] propose dynamics schemes to find the common switch between the new and the old connection. 4] 9] choose a fixed switch at setup connection to provide the rerouting in case of handoff. Selected rerouting switches can increase connection re establishment. Therefore, ....

B. A. Akyol and D. C. Cox. Rerouting for Handoff in a wireless ATM network. ICUPC, Cambridge, MA. USA., September 28-October 2 1996.

....is not necessarily optimum for a connection between two ground terminals, since the handovers between the ground terminals and the satellites result in changing satellite end nodes for the connection. The handover rerouting problem has been addressed in the context of terrestrial wireless networks [6, 7, 8]. In terrestrial cellular networks, the cells and the base stations serving those cells are stationary. The handover rerouting problem, then, arises due to the mobility of the endusers rather than the mobility of the base stations. One proposed solution to the handover rerouting problem in ....

B. A. Akyol and D. C. Cox. "Rerouting for Handoff in a Wireless ATM Networks," IEEE Personal Communications, 3(5):26-33, Oct. 1996.

....This paper proposes a new operating concept for the mobile ATM network and solutions for the hitless handover problem to address this requirement. 2 Requirements Analysis Several proposals already exist for virtual connection architectures to support wide area mobility in public ATM networks. 5][6][7] While [5] defines a virtual connection tree architecture as signing to the mobile at call setup a tree of permanent connections between a root node and the base stations likely to be visited during the call, 7] establishes a dynamic connection tree per call, which has to be reconfigured ....

....call setup a tree of permanent connections between a root node and the base stations likely to be visited during the call, 7] establishes a dynamic connection tree per call, which has to be reconfigured after each handover. Other proposals for dy namic connection rerouting during handover exist [6], which operate without a tree in a completely distributed fashion. The fixed tree of [5] limits mobility to within an area predetermined at connection setup and requires a large set of virtual connec tion identifiers (VCI) each defining a route from the root node to one of the base stations, ....

[Article contains additional citation context not shown here]

Akyol, B. A.; Cox, D. C.: "Rerouting for Handoff in a Wireless ATM Network", IEEE Personal Communications Magazine, vol. 3, no. 5, October 1996, pp. 26-33

....approach allows the mobile terminal to detach from the old RAP at any time instance with out waiting for a specific signaling cell. This is of particular importance in situations where the radio link fails unexpect edly. Quite a number of other handover protocols has already been proposed [1][2][3] 5] 7] 8] 12] 13] Each comprising a signaling and control scheme for hard handover, they can be grouped as indicated by the shaded areas of Fig. 3. The two basic handover techniques are hard and soft handover. In the case of hard handover, the handover control flow can be directed either ....

Akyol, Bora A.; Cox, Donald C.: "Rerouting for Handoff in a Wire- less ATM Network", IEEE Personal Communications Magazine, vol. 3, no. 5, pp. 26-33, October 1996.

....ordered so that there is no transition from # # to # # unless # # # # # . Weak automata have several attractive features in the context of veri cation [11] for example, symbolic cycle detection is e ectively linear in weak automata, whereas existing algorithms for the general case are quadratic [6]. Another feature of weak automata is importantto our study of timing diagrams: complementation of weak automata requires only complementation of the fair set # ; the structure of an automaton and its complement are otherwise identical. In Section 5, we explored translations of timing diagrams and ....

....report, UCSB, 1993. 4] Fisler, K. Diagrams and computational ecacy. In review, Proc. of the CSLI Workshop on Logic, Language, and Information, October 1999. 5] Fisler, K. Timing diagrams: Formalization and algorithmic veri cation. ####### ## ###### #### ###### ### ###########, 8:323 361, 1999. [6] Fisler, K. R. Fraer,G.Kahmi,M.Y.Vardi and Z. Yang. A new symbolic cycle detection algorithm. In preparation, March2000. 7] Gerth, R. D. Peled, M. Y. Vardi and P.Wolper. Simple on the y automatic veri cation of linear temporal logic. In ########### ## ######## ##### ######### ######## ### ....

[Article contains additional citation context not shown here]

Akyol, B. A. and Cox, D. C., "Rerouting for Handoff in a Wireless ATM Network", IEEE Personal Communications, Vol. 3, No. 5, pp. 26-33, October 1996.

....a handover procedure generally involves: 1. a procedure for the acquisition of a radio channel at the new cell, including a radio channel assignment strategy; 2. a procedure for mobile user routing update. We can distinguish between two kinds of handover. In the first one, referred to in [4] as intrazone handover, the mobile user moves between cells belonging to the same wireless local access network. In the second one, referred to in [4] as interzone handover, the mobile user moves between cells belonging to different wireless local access networks. The routing update determines a ....

....strategy; 2. a procedure for mobile user routing update. We can distinguish between two kinds of handover. In the first one, referred to in [4] as intrazone handover, the mobile user moves between cells belonging to the same wireless local access network. In the second one, referred to in [4] as interzone handover, the mobile user moves between cells belonging to different wireless local access networks. The routing update determines a reconfiguration of the routing tables in all the switches between the 1 CSS of the new cell and the switch which is the root of the minimum subtree ....

B. A. Akyol, D. C. Cox, "Rerouting for Handoff in a Wireless ATM Network," IEEE Personal Communications, vol. 3, no. 5, October 1996.

....been formulated as that of Virtual Connection (VC) rerouting, where the a new path, and associated resource reservations, need to be re established to the new location of the mobile after it undergoes a hand off. Many different schemes have been proposed for mobile ATM over the past few years [1, 2, 11, 14, 21, 28, 29], and the signaling protocol for VC rerouting in mobile ATM is now a subject of standardization by the ATM Forum (e.g. 10] For connectionless network, Talukdar et al. in [26] have proposed augmenting the Integrated Services architecture to support QoS for mobile nodes. Specifically they ....

B. A. Akyol and D. C. Cox. "Rerouting for Handoff in a Wireless ATM Network.", ICUPC 96, Sep. 1996.

....the original connection, while preserving the remainder. Finally, Multicast Connection Re routing combines the former three techniques, but includes the maintenance of potential handoff connection routes to support the original connection, reducing the time spent in finding a new route for handoff [13]. 6.3.1 Full Connection Re Routing Full connection re establishment is the most optimal and the simplest re routing technique in that all of the VCs in the connection path from the source to the previous switch are cleared [74] Then new VCs are established from the source to the new switch. It ....

....re routing technique attempts to route connection more efficiently, by preserving some portions of the original route for resource management and simplicity and rerouting other portions for optimality. Nearest Common Node Algorithm The Nearest Common Node Re routing (NCNR) algorithm presented in [13] routes connections according to the Location Area (referred to by the authors as zones) Handoff within the LA or zone constitutes a VC table update. For handoff between zones, the algorithm attempts to bridge the connection at the nearest WATM network node that is common to both of the zones ....

[Article contains additional citation context not shown here]

B. Akyol and D. Cox, "Re-routing for handoff in a wireless ATM network," IEEE Personal Communications, pp. 26--33, October 1996.

....packet loss and duplication. All mentioned factors have an effect on the overall performance of the multicast protocol. The criteria how to evaluate the performance of such a distribution system is an open question. Generally the handover performance can be quantified by comparing several criteria [4]: ffl number of signalling messages exchanged during handover ffl number of signalling messages exchanged during rerouting ffl required buffer space ffl duplication of data in distribution system ffl duplication misordering of data in mobile host ffl duration of service disruption caused by ....

B. A. Akyol, D. C. Cox, Rerouting for Handoff in a Wireless ATM Network, available at Mobile Networking Paper Collection: http://www-tkn.ee.tu-berlin.de/bibl/ps/index.html

.... as IEEE 802.11 [3] Several important aspects of the next generation wireless networks with their implications for teletraffic are discussed in [4] Now, the next step in the evolution of networks is the total integration of ATM and wireless technologies, to obtain the so called Wireless ATM [5 8]. Wireless ATM uses a wired ATM network as a backbone and Base Stations (BSs) for wireless access. Multiple mobile terminals connect to the BSs to share their capacity, which can be expressed in terms of a number of channels. The challenge now is to make the access to an ATM network through BSs ....

B. A. Akyol, D. Cox, "Rerouting for Handoff in a Wireless ATM Network", IEEE Personal Communications, October, 1996.

....two levels: radio and network. The radio level handoff is the actual transfer of the radio connection between two BSs; the network level handoff is to support the radio level handoff by performing packet buffering and rerouting. Several networklevel handoff algorithms have been previously proposed [5] [12] all of which are based on hard handoff at the radio transmission level. Among the algorithms, the NCNR algorithm proposed in [5,6] is a good choice since it has the advantage of minimizing the resources required for rerouting and conserving network bandwidth by eliminating unnecessary ....

....handoff is to support the radio level handoff by performing packet buffering and rerouting. Several networklevel handoff algorithms have been previously proposed [5] 12] all of which are based on hard handoff at the radio transmission level. Among the algorithms, the NCNR algorithm proposed in [5,6] is a good choice since it has the advantage of minimizing the resources required for rerouting and conserving network bandwidth by eliminating unnecessary connections. On the other hand, due to the fact that the algorithm depends on the break before make hard handoff process, it has some ....

[Article contains additional citation context not shown here]

B.A. Akyol, D.C. Cox, Rerouting for handoff in a wireless ATM network, IEEE Personal Communi. 3 (5) (1996) 26-33.

.... as well as flexible data networking [23] Nowadays, ATM is viewed as a strong candidate to extend these services to portable systems using wireless technologies [1] 28] 30] Accordingly, several alternatives for adding mobility to ATM signaling protocols have been presented in the literature [5][6][7] 10] 24] 31] For example, 7] and [28] present WmATM networks as a wireless extension of ATM networks with mobility and no modification in the existing ATM signaling protocols. On the contrary, 24] 30] and [31] believe that minimum changes should be done in the ATM networks to support ....

....as a wireless extension of ATM networks with mobility and no modification in the existing ATM signaling protocols. On the contrary, 24] 30] and [31] believe that minimum changes should be done in the ATM networks to support mobility and to achieve a global WmATM network environment. In [5] and [6], the authors present two different signaling protocols to support both alternatives. 2.1. A Typical WmATM Network Environment Figure 1 illustrates a possible environment that can support the concepts involved in designing a global WmATM network. The wireless service area is divided into cells ....

[Article contains additional citation context not shown here]

Akyol, B. A. and Cox, D. C., "Rerouting for Handoff in a Wireless ATM Network", IEEE Personal Communications, Vol. 3, No. 5, pp. 26-33, October 1996.

....fast response, path extension or first divergence rerouting algorithm may be used. For those services with long holding time and 9 infrequent handoff, optimal path rerouting may be considered. 4 Protocol Designs Many mobility management protocols for mobile ATM networks have been proposed [3,11 13,16 21] since the early 90s when wireless ATMwas first proposed [22] These protocols are each provided to satisfy the designer s specific performance criteria, such as complexity, delay, latency and or network resource utilization. However, in IMT2000 networks, the service performance criteria can be ....

B.Akyol and D. Cox. Rerouting for handoff in a wireless ATM network. IEEE Personal Communications, 3(5), October 1996. 23

....terminals and the satellites result in changing satellite end nodes for the connection. The Figure 2: The Footprints of the LEO Satellites. study did not address the handover re routing problem. The handover re routing problem has been studied in the context of terrestrial wireless networks [1, 7, 12]. For example, a whole new route is established after a handover in [7] Although an optimum route is used all the time, frequent re routing would cause excessive signaling and computational overhead due to the optimum route calculation. Partial re routing algorithms have been proposed in [1, 12] ....

....7, 12] For example, a whole new route is established after a handover in [7] Although an optimum route is used all the time, frequent re routing would cause excessive signaling and computational overhead due to the optimum route calculation. Partial re routing algorithms have been proposed in [1, 12]. These algorithms basically make use of a tree based structure for the network. During a handover, the node which is a parent of both nodes involved in the handover are determined, and the route between the parent and the original end node is replaced with a route between the parent and the new ....

B.A. Akyol and D.C. Cox. Rerouting for Handoff in a Wireless ATM Networks. IEEE Personal Communications, 3(5):26--33, Oct. 1996.

....terminals since the handovers between the ground terminals and the satellites result in changing satellite end nodes for the connection. The study did not address the handover re routing problem. The handover re routing problem has been studied in the context of terrestrial wireless networks [1, 3, 7]. For example, a whole new route has been established after a handover in [3] Although an optimum route is used all the time, frequent re routing would cause excessive signaling and computational overhead due to the optimum route calculation. Partial re routing algorithms have been proposed in ....

....7] For example, a whole new route has been established after a handover in [3] Although an optimum route is used all the time, frequent re routing would cause excessive signaling and computational overhead due to the optimum route calculation. Partial re routing algorithms have been proposed in [1, 7]. These algorithms basically make use of a tree based structure for the network. During a handover, the node that is a parent of both nodes involved in the handover is determined, and the route between the parent and the original end node is replaced with a route between the parent and the new end ....

B.A. Akyol and D.C. Cox. Rerouting for Handoff in a Wireless ATM Networks. IEEE Personal Communications, 3(5):26--33, Oct. 1996.

....the original connection, while preserving the remainder. Finally, Multicast Connection Re routing combines the former three techniques, but includes the maintenance of potential handoff connection routes to support the original connection, reducing the time spent in finding a new route for handoff [10]. Since the first two categories of handoff connection management are self explanatory, they will not be addressed here. Interested readers can refer to [43, 53] 6.2.1 Partial Connection Re routing Partial connection re routing attempts to route the connection more efficiently than the full ....

....6.2.1 Partial Connection Re routing Partial connection re routing attempts to route the connection more efficiently than the full connection or route augmentation methods by preserving some portions of the original route and re routing other portions. Examples of such algorithms can be found in [10, 48]. Each protocol bridges the handoff connection at the nearest WATM network node that is common to both the old and new switch involved in the handoff transaction. In a tree topology, common refers to two nodes branching from the same point. In a hierarchy, the common point is a higher node which ....

B. Akyol and D. Cox, "Re-routing for Handoff in a Wireless ATM Network," IEEE Personal Communications, pp. 26--33, October 1996.

....the original connection, while preserving the remainder. Finally, Multicast Connection Re routing combines the former three techniques, but includes the maintenance of potential handoff connection routes to support the original connection, reducing the time spent in finding a new route for handoff [8]. Connection Extension InterWorking Devices Connection Re route InterWorking Devices RE ROUTING FULL CONNECTION AUGMENTATION ROUTE CONNECTION PARTIAL RE ROUTING MULTICAST CONNECTION RE ROUTING HANDOFF MANAGEMENT Re routing Nearest Common Node Re routing Hybrid Connection Homing ....

....The partial connection re routing technique attempts to route connections by preserving some portions of the original route for simplicity and re routing other portions for optimality. 4.3. 1 Nearest Common Node Algorithm The Nearest Common Node Re routing (NCNR) algorithm presented in [8] routes connections according to the residing zone of the MT. Handoff within a zone constitutes a VC table update. For handoff between zones, the algorithm attempts to bridge the connection at the nearest WATM network node that is common to both of the zones involved in the handoff transaction. In ....

B. Akyol and D. Cox, "Re-routing for handoff in a wireless ATM network," IEEE Personal Communications, pp. 26--33, October 1996.

....the original connection, while preserving the remainder. Finally, Multicast Connection Re routing combines the former three techniques, but includes the maintenance of potential handoff connection routes to support the original connection, reducing the time spent in finding a new route for handoff [17]. Connection Extension InterWorking Devices Connection Re route InterWorking Devices RE ROUTING FULL CONNECTION AUGMENTATION ROUTE CONNECTION PARTIAL RE ROUTING MULTICAST CONNECTION RE ROUTING HANDOFF MANAGEMENT Re routing Nearest Common Node Re routing Hybrid Connection Homing ....

....re routing technique attempts to route connection more efficiently, by preserving some portions of the original route for resource management and simplicity and re routing other portions for optimality. Nearest Common Node Algorithm The Nearest Common Node Re routing (NCNR) algorithm presented in [17] routes connections according to the Location Area (referred to by the authors as zones) Handoff within the LA or zone constitutes a VC table update. For handoff between zones, the algorithm attempts to bridge the connection at the nearest WATM network node that is common to both of the zones ....

B. Akyol and D. Cox, "Re-routing for handoff in a wireless ATM network," IEEE Personal Communications, pp. 26--33, October 1996.

....the original connection, while preserving the remainder. Finally, Multicast Connection Re routing combines the former three techniques, but includes the maintenance of potential handoff connection routes to support the original connection, reducing the time spent in finding a new route for handoff [5]. Since the first two categories represent the self explanatory of handoff connection management, they will not be addressed here. Interested readers can refer to [35, 43] 6.2.1 Partial Connection Re routing Partial connection re routing attempts to route the connection more efficiently than the ....

....6.2.1 Partial Connection Re routing Partial connection re routing attempts to route the connection more efficiently than the full connection or route augmentation methods by preserving some portions of the original route and re routing other portions. Examples of such algorithms can be found in [5, 40]. Each protocol bridges the handoff connection at the nearest WATM network node that is common to both the old and new switch involved in the handoff transaction. In a tree topology, common refers to two nodes branching from the same point. In a hierarchy, the common point is a higher node which ....

B. Akyol and D. Cox, "Re-routing for handoff in a wireless ATM network," IEEE Personal Communications, pp. 26--33, October 1996.

....the same path. However, the cell forwarding based rerouting is only efficient in a flat or a ring network with a fully meshed topology. In a hierarchical network, the NCN is automatically involved in cell forwarding and when the NCN is involved, it is more efficient to reroute instead of forward[5]; moreover, with cell forwarding for a fast moving user in a system that has small radio coverage areas, there will be a network trail left behind the user consisting of cell forwarding among multiple zones. The NCNR always performs the rerouting at the nearest common node thereby minimizing the ....

....zones. The NCNR always performs the rerouting at the nearest common node thereby minimizing the amount of bandwidth used and minimizing the amount of rerouting. The disadvantages of virtual tree based rerouting schemes when compared to dynamic rerouting schemes such as NCNR or Toh are given in [5, 13]. Briefly, virtual tree based rerouting creates multiple connections for a single user connection to all possible handoff candidate zones and performs an immediate rerouting. Acampora and SRMC use virtual tree based rerouting. This type of rerouting is fast; however, it predicts handoff events and ....

[Article contains additional citation context not shown here]

Bora Akyol and Donald C. Cox, "Rerouting for Handoff in a Wireless ATM Network," submitted to IEEE Personal Comm. Mag. for publication.

No context found.

B. A. Akyol, D. C. Cox, "Rerouting for Handoff in a Wireless ATM Network", IEEE Personal Communications Magazine, vol. 3, no. 5, 1996, pp. 26-33.

No context found.

B.Akyol and D. Cox. Rerouting for handoff in a wireless ATM network. IEEE Personal Communications, 3(5), October 1996.

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