Lightpath (wavelength) routing in large WDM networks

We address the problem of efficient circuit switching in wide area optical networks. The solution provided is based on finding optimal routes for lightpaths and the new concept of semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining together several lightpaths, using wavelength conversion at their junctions. A fast and practical algorithm is presented to optimally route lightpaths and semilightpaths taking into account both the cost of using the wavelengths on links and the cost of wavelength conversion. We prove that the running time of the algorithm is the best possible in the wide class of algorithms allowing linear algebraic operations on weights. This class encompasses all known related practical methods. Additionally, our method works for any physical realization of wavelength conversion, independently whether it is done via optoelectronic conversion or in a fully optical way     

Parallel quicksort

A parallel version of quicksort on a CRCW PRAM is developed. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.     

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     

Lightpath communications: an approach to high bandwidth opticalWAN's

An architectural approach that meets high bandwidth requirements by introducing a communication architecture based on lightpaths, optical transmission paths in the network, is introduced. Since lightpaths form the building block of the proposed architecture, its performance hinges on their efficient establishment and management. It is shown that although the problem of optimally establishing lightpaths is NP-complete, simple heuristics provide near optimal substitutes for several of the basic problems motivated by a lightpath-based architecture     

Predicting the effect of screw wear on the performance of plasticating extruders

The effect of screw wear on the performance of a 2.5 in. diameter extruder is studied with the aid of computer simulations. The effect of progressively increasing flight clearance on the extrusion of low density polyethylene, polypropylene and nylon 6/6 is presented. The remedial effect of increased screw speed and its side effects on melting behavior, solids content, extrudate temperature and power consumption are also described.     

The wave expansion approach to broadcasting in multihop radionetworks

An algorithm for efficient communication between neighbours in multihop radio networks is proposed. The algorithm guarantees a bound on the transmission efficiency in a radio channel for arbitrary topology. The algorithm can be embedded in protocols for solving basic network problems such as broadcast, multicast, leader election, or finding shortest paths. The problem of bounded-time broadcasting utilizing the proposed algorithm is addressed. A polynomial solution in which the process of spreading information over the network is viewed as the expansion of a wave caused by a point of disturbance is presented. The broadcast originates at a source node and is accomplished in repeated transmission periods, emulating a wave progressing away from the source. The algorithm is used to select a subset of potential transmitters in each period, so that a tightly bound proportion of potential receivers receive the transmission without collisions, guaranteeing a high level of spatial reuse in the broadcast process     

Mobile number portability

Mobile number portability allows a mobile subscriber to switch operators without changing his/her telephone number. This article describes and analyzes mobile number portability routing mechanisms and their implementation costs. We first describe the signaling relay function (SRF)-based solution for call related and noncall related routing. Then we describe the intelligent network (IN)-based solution for call related routing. Cost recovery issues for number portability are discussed in this article from a technical perspective. We note that rules for cost recovery also depend on business and regulatory factors that vary from country to country.     

Modeling frame synchronization for UMTS high-speed downlink packet access

Third Generation Partnership Project (3GPP) specification TR 25.950 proposed high-speed downlink packet access for the Universal Mobile Telecommunication System (UMTS). In this mechanism, an active set of cells is defined for every user equipment (UE) communication session. The cell with the best wireless link quality (called the serving cell) in the active set is selected for communication with the UE. When the wireless link quality of the old serving cell degrades below some threshold, a new serving cell in the active set is selected to continue the communication session. Our previous work proposed a high-speed downlink packet access (HSDPA) overflow control scheme with four frame synchronization algorithms to switch the serving cell, and formally proved the correctness of the scheme. We propose an analytic model to investigate the performance of these frame synchronization algorithms, and show how the user movement patterns affect the control message delivery costs of these algorithms.     

An adaptive measured-based preassignment scheme withconnection-level QoS support for mobile networks

This paper presents a new adaptive bandwidth allocation scheme to prevent handoff failure in wireless cellular networks, known as the measurement-based preassignment (MPr) technique. This technique is particularly useful in micro/pico cellular networks which offers quality-of-service (QoS) guarantee against call dropping. The proposed MPr scheme distinguishes itself from the well-known guarded channel (GC) based schemes in that it allows the handoff calls to utilize a prereserved channel pool before competing for the shared channels with new call arrivals. The key advantage of the proposed MPr scheme is that it enables easy derivation of the number of channels that needs to be reserved for handoff based on a predetermined handoff dropping probability, without the need for solving the often complex Markov chain required in GC schemes, thus, making the proposed MPr scheme simple and efficient for implementation. This is essential in handling multiple traffic types with potentially different QoS requirements. In addition, the MPr scheme is adaptive in that it can dynamically adjust the number of reserved channels for the handoff according to the periodical measurement of the traffic status within a local cell, thus completely eliminating the signaling overhead for status information exchange among cells mandated in most existing channel allocation schemes. Numerical results and comparisons are given to illustrate the tradeoff