Realization strategies of dedicated path protection: A bandwidth cost perspective

Communication networks have to provide a high level of availability and instantaneous recovery after failures in order to ensure sufficient survivability for mission-critical services. Currently, dedicated path protection (or 1 + 1) is implemented in backbone networks to provide the necessary resilience and instantaneous recovery against single link failures with remarkable simplicity. However, in order to satisfy strict availability requirements, connections also have to be resilient against Shared Risk Link Group (SRLG) failures. In addition, switching matrix reconfigurations have to be avoided after a failure in order to guarantee instantaneous recovery. For this purpose, there are several possible realization strategies improving the characteristics of traditional 1 + 1 path protection by lowering reserved bandwidth while conserving all its favorable properties. These methods either utilize diversity coding, network coding, or generalize the disjoint-path constraint of 1 + 1.In this paper, we consider the cost aspect of the traditional and the alternative 1 + 1 realization strategies. We evaluate the bandwidth cost of different schemes both analytically and empirically in realistic network topologies. As the more complex realizations lead to NP-complete problems even in the single link failure case, we propose both Integer Linear Programming (ILP) based optimal methods, as well as heuristic and meta-heuristic approaches to solve them. Our findings provide a tool and guidelines for service providers for selecting the path protection method with the lowest bandwidth cost for their network corresponding to a given level of reliability.     

Search space reduction in QoS routing

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given quality-of-service constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a near-optimal solution. However, these heuristics either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we focus on solving the delay-constrained minimum-cost path problem, and present a fast algorithm to find a near-optimal solution. This algorithm, called delay-cost-constrained routing (DCCR), is a variant of the k-shortest-path algorithm. DCCR uses a new adaptive path weight function together with an additional constraint imposed on the path cost, to restrict the search space. Thus, DCCR can return a near-optimal solution in a very short time. Furthermore, we use a variant of the Lagrangian relaxation method proposed by Handler and Zang [Networks 10 (1980) 293] to further reduce the search space by using a tighter bound on path cost. This makes our algorithm more accurate and even faster. We call this improved algorithm search space reduction + DCCR (SSR + DCCR). Through extensive simulations, we confirm that SSR + DCCR performs very well compared to the optimal but very expensive solution.     

QoS management in heterogeneous home networks

An OSGi (Open Services Gateway Initiative) home gateway system manages the integration of heterogeneous home networks protocols and devices to develop ubiquitous applications. Wired and wireless heterogeneous home networks have different QoS concerns. For instance, jitter and latency are important concerns in web phones, while packet loss ratio is important in on-line video. This study adopts UPnP QoS specification version 1.0 to design an adaptive QoS management mechanism based on the RMD (Resource Management in DiffServ) architecture. This study monitors real-time network traffic, and adaptively controls the bandwidth, to satisfy the minimum but most important quality for each application in home network congestion. Simulation results indicate that the average jitter, latency and packet loss are reduced by 0.1391 ms, 0.0066 s, and 5.43%, respectively. The packet loss ratio is reduced by 4.53%, and the throughput is increased by 1.2% in high definition video stream; the packet loss ratio is reduced by 1.89% for standard definition video stream, and in VoIP (Voice over IP) the jitter and latency are reduced to 0.0407 ms and 0.0209 s, respectively.     

A traffic cellular automata model based on road network grids and its spatial and temporal resolution’s influences on simulation

Microscopic Traffic Simulation Model based on Cellular Automata (CA) has become more and more popular since it was firstly introduced by Creamer and Ludwig in 1986. Cellular automata are simpler to implement on computers, provide a simple physical picture of the system and can be easily modified to deal with different aspects of traffic. However, in a traditional traffic CA model, the spatial resolution of CA and temporal resolution of simulation are low. Take TRANSIMS for example. The size of cellular automata is 7.5 m and the time step equals 1 s. In such a case, if a vehicle drives at a speed of 4 cells per s, the speed difference between 95 km/h (3.5 1 7.5 m/s) and 121 km/h (4.4999 1 7.5 m/s) will not be distinguished by simulation models. And the temporal resolution of 1 s makes the system hard to model different drivers’ reaction time, which plays a very important role in vehicular movement models. In this paper, a microscopic traffic cellular automata model based on road network grids is proposed to overcome the low spatial and temporal resolutions of traditional traffic CA models. In our model, spatial resolution can be changed by setting different grid size for lanes and intersections before or during simulation and temporal resolution can be defined according to simulation needs to model different drivers’ reaction time, whereas the vehicular movement models are still traditional CA models. By doing so, the low spatial and temporal resolution of CA model can be overcome and the advantages of using CA to simulate traffic are preserved. The paper also presents analyses of the influences on simulation of different 1D lane grid size, 2D intersection grid size and different combinations of temporal resolution and mean drivers’ reaction time. The analysis results prove the existence of spatial and temporal resolution thresholds in traffic CA models. They also reveal that the size of grids, the combinations of different temporal resolutions and mean drivers’ reaction time do pose influences on the speed of vehicles and lane/intersection occupancy, but do not affect the volume of traffic greatly.     

Efficient multimedia transmission using adaptive packet bursting for wireless LANs

In addition to an unprecedented 600 Mb/s physical data rate in upcoming standards with greater than 1 Gb/s being considered for future systems, 802.11 has evolved from its earlier incarnations to become a ubiquitous, high-throughput wireless access technology utilized in heterogeneous networks. Although capable of advanced QoS provisioning, commercial 802.11 implementations often support only a subset of QoS specifications, utilize manufacturer-specific QoS enhancements, or use sub-optimal MAC reference specifications with limited capability in achieving optimal system throughput and QoS provisioning.Although more efficient ARQ modes have been defined in the 802.11e and imminent 802.11n amendment standards, opportunities exist within this framework for further optimization through dynamic adaptation of key ARQ-related parameters, which is out of scope of current 802.11 standard specifications. Considering such opportunities, this article presents a novel adaptive ARQ scheme designed to improve the quality and reliability of multimedia transmission through the real-time adaptation of the maximum packet burst size and actual ARQ mode employed. Comprehensive simulation studies show that this scheme can potentially improve the QoS and throughput performance of multimedia traffic in both existing and future 802.11 wireless LANs.     

A new approach of audio emotion recognition

A new architecture of intelligent audio emotion recognition is proposed in this paper. It fully utilizes both prosodic and spectral features in its design. It has two main paths in parallel and can recognize 6 emotions. Path 1 is designed based on intensive analysis of different prosodic features. Significant prosodic features are identified to differentiate emotions. Path 2 is designed based on research analysis on spectral features. Extraction of Mel-Frequency Cepstral Coefficient (MFCC) feature is then followed by Bi-directional Principle Component Analysis (BDPCA), Linear Discriminant Analysis (LDA) and Radial Basis Function (RBF) neural classification. This path has 3 parallel BDPCA + LDA + RBF sub-paths structure and each handles two emotions. Fusion modules are also proposed for weights assignment and decision making. The performance of the proposed architecture is evaluated on eNTERFACE’05 and RML databases. Simulation results and comparison have revealed good performance of the proposed recognizer.     

Performance analysis of networks of queues under active queue management scheme

Analysis of networks of queues under repetitive service blocking mechanism has been presented in this paper. Nodes are connected according to an arbitrary configuration and each node in the networks employs an active queue management (AQM) based queueing policy to guarantee certain quality of service for multiple class external traffic. This buffer management scheme has been implemented using queue thresholds. The use of queue thresholds is a well known technique for network traffic congestion control. The analysis is based on a queue-by-queue decomposition technique where each queue is modelled as a GE/GE/1/N queue with single server, R (R ⩾ 2) distinct traffic classes and {N = N₁, N₂, … , N_R} buffer threshold values per class under first-come-first-serve (FCFS) service rule. The external traffic is modelled using the generalised exponential (GE) distribution which can capture the bursty property of network traffic. The analytical solution is obtained using the maximum entropy (ME) principle. The forms of the state and blocking probabilities are analytically established at equilibrium via appropriate mean value constraints. The initial numerical results demonstrate the credibility of the proposed analytical solution.     

Facebook use and academic performance among college students: A mixed-methods study with a multi-ethnic sample

This paper uses a mixed-methods approach to examine the relation between online academic disclosure and academic performance. A multi-ethnic sample of college students (N = 261; male = 66; female = 195; M age ≈ 22 years) responded to open-ended questions about their Facebook use. Thematic analysis revealed that over 14% of the Facebook wall posts/status updates (N = 714) contained academic themes; positive states were more frequent than negative and neutral states and students with lower GPAs expressed negative states more often. A path analysis suggested that academic performance may determine college students’ Facebook use, rather than the reverse. Implications for student support services are discussed.     

Aviation emission inventory development and analysis

An up to date and accurate aviation emission inventory is a prerequisite for any detailed analysis of aviation emission impact on greenhouse gases and local air quality around airports. In this paper we present an aviation emission inventory using real time air traffic trajectory data. The reported inventory is in the form of a 4D database which provides resolution of 1° × 1° × 1000 ft for temporal and spatial emission analysis. The inventory is for an ongoing period of six months starting from October 2008 for Australian Airspace.In this study we show 6 months of data, with 492,936 flights (inbound, outbound and over flying). These flights used about 2515.83 kt of fuel and emitted 114.59 kt of HC, 200.95 kt of CO, 45.92 kt of NO_x, 7929.89 kt of CO₂, and 2.11 kt of SO_x. From the spatial analysis of emissions data, we found that the CO₂ concentration in some parts of Australia is much higher than other parts, especially in some major cities. The emission results also show that NO_x emission of aviation may have a significant impact on the ozone layer in the upper troposphere, but not in the stratosphere.It is expected that with the availability of this real time aviation emission database, environmental analysts and aviation experts will have an indispensable source of information for making timely decisions regarding expansion of runways, building new airports, applying route charges based on environmentally congested airways, and restructuring air traffic flow to achieve sustainable air traffic growth.     

MATHA: Multiple sense amplifiers with transceiver for high performance improvement in NoC Architecture

Now-a-days there is much research attempts aim to find out low power consumption in the area of Network-on-chip (NoC), both in architectural as well as algorithmic approach. Even though a lot of Double Tail Sense Amplifiers (DTSA) are used in architectural approach, the conventional DTSA with transceiver exhibits a difficulty of consuming more energy than its indented design during heavy traffic condition. Multiple sense amplifiers with transceiver for high performance improvement in NoC Architecture (MATHA) is designed in this research to eliminate the difficulty. This MATHA is a combination of reconfigurable DTSA and transceiver. The reconfigurable DTSA consist of modified DTSA (M-DTSA), modified clock gating with DTSA (MCG-DTSA), Modified Dual Edge Triggered with DTSA (MDET-DTSA), Soft-DTSA (S-DTSA), graph theory based traffic estimator and multiplexer. Depending upon the traffic rate, one of the DTSA among the available four DTSA is selected and information transferred to the receiver. The proposed MATHA design is evaluated on TSMC 90 nm technology, showing 6.1 GB/s data rate and 0.32 W total link power.     

Guided local search as a network planning algorithm that incorporates uncertain traffic demands

A search based heuristic for the optimisation of communication networks where traffic forecasts are uncertain and the problem is NP-complete is presented. While algorithms such as genetic algorithms (GA) and simulated annealing (SA) are often used for this class of problem, this work applies a combination of newer optimisation techniques specifically: fast local search (FLS) as an improved hill climbing method and guided local search (GLS) to allow escape from local minima. The GLS + FLS combination is compared with an optimised GA and SA approaches. It is found that in terms of implementation, the parameterisation of the GLS + FLS technique is significantly simpler than that for a GA and SA. Also, the self-regularisation feature of the GLS + FLS approach provides a distinctive advantage over the other techniques which require manual parameterisation. To compare numerical performance, the three techniques were tested over a number of network sets varying in size, number of switch circuit demands (network bandwidth demands) and levels of uncertainties on the switch circuit demands. The results show that the GLS + FLS outperforms the GA and SA techniques in terms of both solution quality and optimisation speed but even more importantly GLS + FLS has significantly reduced parameterisation time.     

A two-dimensional optical cross-connect with integrated waveguides and surface micromachined crossbar switches

The design, fabrication and test results of an all-optical cross-connect, which uses electrostatically actuated micromechanical digital mirrors to steer optical signals in a network of planar waveguides, are presented. The substrate consists of a network of spliced planar waveguides on silica substrates. The switches, located at the waveguide intersections, are formed with an electroplated T-structure consisting of a horizontal perforated square plate suspended by four elastic beams. When operated, the horizontal plate is pulled up making the mirror move out of the optical path thus steering the beam. An 8×8 switch array has been fabricated and tested. Actuation and relaxation switching times near 3 ms have been demonstrated with an actuation voltage of 120 V. The optical insertion loss for the array typically varied from 2.3 dB for a single trench in the optical path (shortest optical path) to 8 dB for 15 trenches in the optical path (longest optical path).     

Compound Linguistic Scale

Rating scales are the essential interfaces for many research areas such as in decision making and recommendation. Some issues concerning syntactic and sematic structures are still open to discuss. This research proposes a Compound Linguistic Scale (CLS), a two dimension rating scale, as a promising rating interface. The CLS is comprised of Compound Linguistic Variable (CLV) and Deductive Rating Strategy (DRS). CLV can ideally produce 21 to 73 ((7 ± 2)((7 ± 2) − 1) + 1) ordinal-in-ordinal rating items, which extends the classic rating scales usually on the basis of 7 ± 2 principle, to better reflect the raters’ preferences whilst DRS is a double step rating approach for a rater to choose a compound linguistic term among two dimensional options on a dynamic rating interface. The numerical analyses show that the proposed CLS can address rating dilemma for a single rater and more accurately reflects consistency among various raters. CLS can be applied to surveys, questionnaires, psychometrics, recommender systems and decision analysis of various application domains.     

A subtree-based approach to failure detection and protection for multicast in SDN

Software-defined networking (SDN) has received tremendous attention from both industry and academia. The centralized control plane in SDN has a global view of the network and can be used to provide more effective solutions for complex problems, such as traffic engineering. This study is motivated by recent advancement in SDN and increasing popularity of multicasting applications. We propose a technique to increase the resiliency of multicasting in SDN based on the subtree protection mechanism. Multicasting is a group communication technology, which uses the network infrastructure efficiently by sending the data only once from one or multiple sources to a group of receivers that share a common path. Multicasting applications, e.g., live video streaming and video conferencing, become popular, but they are delay-sensitive applications. Failures in an ongoing multicast session can cause packet losses and delay, which can significantly affect quality of service (QoS). In this study, we adapt a subtree-based technique to protect a multicast tree constructed for OpenFlow switches in SDN. The proposed algorithm can detect link or node failures from a multicast tree and then determines which part of the multicast tree requires changes in the flow table to recover from the failure. With a centralized controller in SDN, the backup paths can be created much more effectively in comparison to the signaling approach used in traditional multiprotocol label switching (MPLS) networks for backup paths, which makes the subtree-based protection mechanism feasible. We also implement a prototype of the algorithm in the POX controller and measure its performance by emulating failures in different tree topologies in Mininet.     

Energy-efficient topology control algorithm for maximizing network lifetime in wireless sensor networks with mobile sink

Uneven energy consumption is an inherent problem in wireless sensor networks characterized by multi-hop routing and many-to-one traffic pattern. Such unbalanced energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of prolonging network lifetime in large-scale wireless sensor networks where a mobile sink gathers data periodically along the predefined path and each sensor node uploads its data to the mobile sink over a multi-hop communication path. By using greedy policy and dynamic programming, we propose a heuristic topology control algorithm with time complexity O(n(m + n log n)), where n and m are the number of nodes and edges in the network, respectively, and further discuss how to refine our algorithm to satisfy practical requirements such as distributed computing and transmission timeliness. Theoretical analysis and experimental results show that our algorithm is superior to several earlier algorithms for extending network lifetime.     

On the mechanism of substrate/non-substrate recognition by P-glycoprotein

P-Glycoprotein (P-gp, multi-drug resistance protein, MDR1) plays a gatekeeper role, interfering delivery of multiple pharmaceuticals to the target tissues and cells. We performed Molecular Dynamics (MD) simulations to generate fifty side-chain variants for P-gp (PDB ID: 4Q9H-L) followed by docking of 31 drugs (0.6 ≤ ER ≤ 22.7) to the whole surface except the ATPase domains and the extracellular part. A selection of the most negative energy complex for each ligand followed. All compounds docked to the two areas – the main binding cavity at the top of P-gp (12.5% of compounds with ER < 1; 44.4% of 1 ≤ ER ≤ 2; and 100% of ER > 2), and the binding sites in the middle of P-gp (87.5% of ER < 1; 55.6% of 1 ≤ ER ≤ 2; and 0% of ER > 2). Our results show that anti-substrates (ER < 1), intermediate compounds (1 ≤ ER ≤ 2) and strong substrates (ER > 2) might behave differently in relation to the P-gp. According to our calculations, the anti-substrates almost do not bind the main binding cavity (MBC) of P-gp and rather approach the other binding sites on the protein; the substrates preferably bind the MBC; the intermediate compounds with 1 ≤ ER ≤ 2 bind both MBC and other binding sites almost equally. The modelling results are in line with the known hypothesis that binding the MBC is prerequisite for the pumping the compound off the P-gp.     

Energy efficiency analysis of high speed triple-play services in next-generation PON deployments

In this paper, the energy consumption of high speed access services up to 1 Gb/s per customer is estimated for different passive optical network (PON) technologies. While other studies on PON power consumption typically assume a fixed split ratio, we also consider a greenfield approach, where the split ratio can be optimized for each technology, taking full advantage of its capacity and reach. The split ratio optimization takes into account Quality of Service (QoS) in terms of bandwidth availability and packet loss for triple-play services (voice, television and Internet). This paper includes an in-depth discussion of our split ratio dimensioning approach and our power consumption model for an optical access network in a major city. The obtained results show that statistical gain provided by dynamic bandwidth allocation as well as power splitting ratio optimization in PONs are key factors for achieving energy efficiency. For access rates up to 900 Mb/s, XG-PON1 turns out to be the most energy efficient option. For higher access rates up to 1 Gb/s, the optimal technology depends on split ratio restrictions. If an existing optical distribution network (ODN) with split ratio 1:64 is used, XG-PON1 remains the most energy efficient technology. If higher split ratios up to 1:256 can be achieved, TWDM PON becomes the most energy efficient solution for access rates up to 1 Gb/s.     

Solvent effect on the crystal morphology of 2,6-diamino-3,5-dinitropyridine-1-oxide: A molecular dynamics simulation study

The attachment energy (AE) calculations were performed to predict the growth morphology of 2,6-diamino-3,5-dinitropyridine-1-oxide (ANPyO) in vacuum. The molecular dynamics (MD) method was applied to simulate the interaction of trifluoroacetic acid solvent with the habit faces and the corrected AE model was adopted to predict the growth habit of ANPyO in the solvent. The results indicate that the growth morphology of ANPyO in vacuum is dominated by (1 1 0), (1 0 0), (1 0 −1) and (1 1 −2) faces. The corrected AE energies change in the order of (1 1 0) > (1 0 −1) > (1 1 −2) > (1 0 0), which causes the crystal morphology to become very close to a flake in trifluoroacetic acid solvent and accords well with the results obtained from experiments. The radial distribution function analysis shows that the solvent molecules adsorb on the ANPyO faces mainly via the solvent–crystal face interactions of hydrogen bonds, Coulomb and Van der Waals forces. In addition to the above results, the analysis of diffusion coefficient of trifluoroacetic acid molecules on the crystal growth faces shows that the growth habit is also affected by the diffusion capacity of trifluoroacetic acid molecules. These suggestions may be useful for the formulation design of ANPyO.     

Crystal morphology prediction of 1,3,3-trinitroazetidine in ethanol solvent by molecular dynamics simulation

In order to understand the mechanism of the effect of solvent on the crystal morphology of explosives, and be convenient for the choice of crystallization solvent, the attachment energy (AE) model was performed to predict the growth morphology and the main crystal faces of 1,3,3-trinitroazetidine (TNAZ) in vacuum. The molecular dynamics simulation was applied to investigate the interactions of TNAZ crystal faces and ethanol solvent, and the growth habit of TNAZ in ethanol solvent was predicted using the modified AE model. The results indicate that the morphology of TNAZ crystal in vacuum is dominated by the six faces of [0 2 1], [1 1 2], [0 0 2], [1 0 2], [1 1 1] and [0 2 0], and the crystal shape is similar to polyhedron. In ethanol solvent, The binding strength of ethanol with TNAZ faces changes in the order of [0 2 1] > [1 1 2] > [0 0 2] > [1 0 2] > [1 1 1] > [0 2 0], which causes that [1 1 1] and [0 2 0] faces disappear and the crystal morphology becomes more regular. The radial distribution function analysis shows that the interactions between solvent and crystal faces mainly consist of coulomb interaction, van der Waals force and hydrogen bonds.     

Irregular Primes and Cyclotomic Invariants to 12 Million

Computations of irregular primes and associated cyclotomic invariants were extended to all primes up to 12 million using multisectioning/convolution methods and a novel approach which originated in the study of Stickelberger codes Shokrollahi (1996). The latter idea reduces the problem to that of finding zeros of a polynomial overF_pof degree  <  (p −  1) / 2 among the quadratic nonresidues mod p. Use of fast polynomial gcd-algorithms gives anO (p log²p loglog p)-algorithm for this task. A more efficient algorithm, with comparable asymptotic running time, can be obtained by using Schönhage–Strassen integer multiplication techniques and fast multiple polynomial evaluation algorithms; this approach is particularly efficient when run on primes p for whichp −  1 has small prime factors. We also give some improvements on previous implementations for verifying the Kummer–Vandiver conjecture and for computing the cyclotomic invariants of a prime.