In wireless local area network (WLAN), a station (STA) accesses the Internet through an access point (AP). When switching from one AP to another, the STA executes the transition process, which may incur long delay and result in force-termination for real-time applications. The IEEE 802.11r proposes the fast basic service set (BSS) transition to speed up the transition process for a STA moving w...

The transition towards services has been imperative for manufacturing firms years. change from a product-oriented to more service-dominant business model affects the organizational structure of firms. However, literature provides limited insights into how organize themselves in this transition. Even though digital technologies are critical transition, it is unclear orchestrate and traditional I...

During the transition from IPv4 to IPv6, it is necessary to provide IPv6 access service for IPv6 islands inside the native IPv4 network to access the native IPv6 network. The existing IPv4/IPv6 transition methods make IPv6relay gateways maintained by IPv6 service providers become potential communication bottlenecks. In this paper, a new method PS6 is presented to reduce the reliance on these re...

Operating guidelines characterize correct interaction (e. g., deadlock freedom) with a service. They can be stored in a service registry. They are typically represented as an annotated transition system where the annotations are Boolean formulae attached to the states. The core result of this article is to propose an alternative representation of operating guidelines where, instead of a Boolean...

Net compression technologies are widely researched to avoid the problem of state explosion. Current researches of transition refinement and subnet abstraction mainly paid attention to preserve different attributes during the transformation, usually led to very strict conditions for the subnet, so that the application of these technologies was limited. Aiming to provide the same service and inte...

Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems theory, and it is determined by a transition matrix inherent in the system. The departure epochs of a customer from the queues are considered as state variab...

A technique is developed for comparing a non-Markov process to a Markov process on a general state space with many possible stochastic orderings. Two such comparisons with a common Markov process yield a comparison between two non-Markov processes. The technique, which is based on stochastic monotonidty of the Markov process, yields stochastic comparisons of the limiting distributions and the m...

Open system architectures and platforms are gaining ground in distributed computing very fast. Several architecture models and even metamodels are created to ensure interoperability between systems that declare themselves to be open. However, the transition from traditional closed systems on traditional platforms to the usage of new paradigms offered by the new models is difficult. In this pape...

OBJECTIVE To evaluate the evidence on the transition process from child to adult services for young people with palliative care needs. DESIGN Systematic review. SETTING Child and adult services and interface between healthcare providers. PATIENTS Young people aged 13-24 years with palliative care conditions in the process of transition. MAIN OUTCOME MEASURES Young people and their famil...