Extending B-ISDN to support user terminal mobility over an ATM-based personal communications network

Yu, Oliver; Leung, Victor C. M.

doi:10.1109/glocom.1995.502809

Cited by 22 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we give an upper bound, assuming all the PVC's holding time is . We can model that as a queuing system, where the arrival rate is and the average holding time is , so we have (8) By (8), we can obtain the upper bound of that satisfies the handoff call blocking probability .…”

Section: B Performance Analysismentioning

confidence: 99%

“…Here, the main problem is still the time constraint. In the multicast establishment scheme [7], [8], whenever a new call is initiated, a set of virtual connections, named a virtual connection tree (VCT), is created, reaching all cells to which the mobile might move in the future. When the mobile roams to one of these cells, the preestablished VC can be used immediately.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient handoff management scheme for mobile wireless ATM networks

Chan

Chan²,

Ko³

et al. 2000

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

In this paper, 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 (PVC's) and to the access switch (AS) by switched virtual circuits (SVC's) which are only for new calls. Some carefully chosen cells, called rerouting cells, are also connected to the AS by PVC's. 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.

show abstract

Section: B Performance Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An efficient handoff management scheme for mobile wireless ATM networks

Chan

Chan²,

Ko³

et al. 2000

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…Several VC rerouting schemes have been proposed in the literature [1], [4], [5], [8], [12], [15], [20], [28], [30]. These include variants of the following basic schemes (see Fig.…”

Section: Overview Of Various Vc Rerouting Strategiesmentioning

confidence: 99%

“…Moreover, the disruption in communication caused by a hand-off implies that any attempt to minimize cell loss comes at the expense of an increase in the cell delay and cell delay variation. The various VC rerouting schemes that have been proposed in the literature 1 [1], [4], [5], [8], [12], [15], [20], [30] make particular optimization choices based on specific assumptions about network parameters and topologies. However, the performance seen by an application in the presence of host mobility depends not only on the VC rerouting mechanism, but also on the manner in which higher layer protocols react to the service impairments, such as increased delay or losses, caused by VC rerouting.…”

Section: Introductionmentioning

confidence: 99%

Effect of connection rerouting on application performance in mobile networks

Mishra

Srivastava

1998

IEEE Trans. Comput.

View full text Add to dashboard Cite

The increasing deployment of wireless access technology, along with the emergence of high speed integrated service networks, such as ATM, promises to provide mobile users with ubiquitous access to multimedia information in the near future. One of the key problems in building connection-oriented ATM networks that support host mobility is designing mechanisms for rerouting virtual circuits to maintain data flow to and from mobile hosts. Ideally, VC rerouting must be done fast enough so as to cause minimal disruption to applications while minimizing the signaling overhead. In this paper, we evaluate the impact of several virtual circuit rerouting strategies on application performance. We initially identify the primitive operations required by any rerouting policy and use this to analytically quantify the cost of each rerouting policy in terms of wireless link disruption as a function of various network parameters. We then evaluate the effect of the VC rerouting policy on application-level performance using simulations. Our results show that the effect of rerouting policies are strongly dependent on the transport protocol policies and application QoS requirements, in addition to the network topology.

show abstract

“…Thus, the mobile user can freely roam in the area covered by the tree without invoking the network call acceptance capabilities during handover. The allocation of the virtual connection tree may be static [8] or dynamic [9] during the connection lifetime. This approach is fast and statistically guarantees the QoS contract in case of network handover, since the QoS negotiation is executed only once, at connection establishment, allocating resources in the entire area where the mobile user is expected to roam.…”

Section: Approaches To Network Handoversmentioning

confidence: 99%