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     

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     

A theorem on integer flows on cartesian products of graphs

It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003     

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     

Configuration and E/Z interconversion mechanism of O(S)-allyl-S(O)-methyl-N-(acridin-9-yl) iminothiocarbonate

The configuration and dynamic behavior of O-allyl-S-methyl-N-(acridin-9-yl)iminothiocarbonate (1) and its S-allyl-O-methyl regioisomer (2) were studied using quantum chemical calculations and by applying a novel graphical method to scatter maps obtained from MD simulations for evaluation of an NOE-weighted internuclear distance (r(NOE)). Energy calculations indicated that the Z configuration was predominant for each compound and, further, this was supported both by the calculated chemical shifts and the r(NOE). Both N-inversion- and rotation-type transition-state structures were also calculated for the E/Z isomerization process, the results indicating that the preferred interconversion mechanism for 1 is N-inversion, but contrastingly, interconversion via rotation is equally as probable as N-inversion for 2. This supports the notion that one or the other or both pathways can be active and each system needs to be assessed on a case-by-case basis.     

Regiospecific synthesis,structure and electron ionization mass spectra of 1,3‐thiazolidin‐4‐ones containing the acridine skeleton

The synthesis of regioisomeric 3‐alkyl(aryl)‐2‐(acridin‐9′‐yl)imino‐1,3‐thiazolidin‐4‐ones ( 8b‐i ) and 2‐alkyl(aryl)imino‐3‐(acridin‐9′‐yl)‐1,3‐thiazolidin‐4‐ones ( 11a‐i ) was performed by the reaction of 3‐(acridin‐9‐yl)‐1‐alkyl(aryl)thioureas 5a‐i with methyl bromoacetate and bromoacetyl bromide, respectively, via the corresponding isothiourea hydrobromides with excellent regioselectivity. The structure, NMR spectra and mass spectrometric behavior of the resulting compounds are discussed.     

A survey of quality of service in IEEE 802.11 networks

Developed as a simple and cost-effective wireless technology for best effort services, IEEE 802.11 has gained popularity at an unprecedented rate. However, due to the lack of built-in quality of service support, IEEE 802.11 experiences serious challenges in meeting the demands of multimedia services and applications. This article surveys 802.11 QoS schemes, including service differentiation in the MAC layer, admission control and bandwidth reservation in MAC and higher layers, and link adaptation in the physical layer, designed to meet these challenges by providing the necessary enhancements for the required QoS. Furthermore, the article addresses issues that arise when end-to-end QoS has to be guaranteed in today's pervasive heterogeneous wired-cum-wireless networks. Among these challenges, protocol interoperability, multihop scheduling, full mobility support, and seamless vertical handoff among multiple mobile/wireless interfaces are specifically addressed.     

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.