Error monitoring issues for common channel signaling

Motivated by field data which showed a large number of link changeovers and incidences of link oscillations between in-service and out-of-service states in common channel signalling (CCS) networks, a number of analyses of the link error monitoring procedures in the SS7 protocol were performed by the authors. This paper summarizes the results obtained thus far and include the following: (a) results of an exact analysis of the performance of the error monitoring procedures under both random and bursty errors; (b) a demonstration that there exists a range of error rates within which the error monitoring procedures of SS7 may induce frequent changeovers and changebacks; (c) an analysis of the performance of the SS7 level-2 transmission protocol to determine the tolerable error rates within which the delay requirements can be met; (d) a demonstration that the tolerable error rate depends strongly on various link and traffic characteristics, thereby implying that a single set of error monitor parameters will not work well in all situations; and (e) some recommendations on a customizable/adaptable scheme of error monitoring with a discussion on their implementability. These issues may be particularly relevant in the presence of anticipated increases in SS7 traffic due to widespread deployment of advanced intelligent network (AIN) and personal communications service (PCS) as well as for developing procedures for high-speed SS7 links currently under consideration by standards bodies     

Quantifying DNS namespace influence

Name resolution using the Domain Name System (DNS) is integral to today’s Internet. The resolution of a domain name is often dependent on namespace outside the control of the domain’s owner. In this article we review the DNS protocol and several DNS server implementations. Based on our examination, we propose a formal model for analyzing the name dependencies inherent in DNS. Using our name dependency model we derive metrics to quantify the extent to which domain names affect other domain names. It is found that under certain conditions, more than half of the queries for a domain name are influenced by namespaces not expressly configured by administrators. This result serves to quantify the degree of vulnerability of DNS due to dependencies that administrators are unaware of. When we apply metrics from our model to production DNS data, we show that the set of domains whose resolution affects a given domain name is much smaller than previously thought. However, behaviors such as using cached addresses for querying authoritative servers and chaining domain name aliases increase the number and diversity of influential domains, thereby making the DNS infrastructure more vulnerable.     

Hydration Study of the System Ca3Al2O6–CaSO4· 2H2O–Ca(OH)2–H2O with and without Citric Acid

Hydration occurring in the system Ca₃Al₂O₆–CaSO₄· 2H₂O–Ca(OH)₂–H₂O has been studied at different temperatures and it was found that the reactions are diffusion controlled. The kinetic data obeyed Jander's equation and the rate of reaction increased with increasing temperature. X-ray diffraction studies and calorimetric measurements show that when gypsum is consumed, ettringite is converted into monosulfate. The rate of this conversion also increased with the increasing temperature and decreased in the presence of citric acid. Spectroscopic studies showed that there was some interaction between citric acid and the cement and that the product of hydration is of colloidal nature. Zeta potential measurements show that retardation of Ca₃Al₂O₆ hydration in the presence of gypsum and Ca(OH)₂ is not due to SO²⁻₄ adsorption. Electrical conductivity and thermoelectric potential measurements of solid Ca₃Al₂O₆ show that Ca₃Al₂O₆ is an n -type semiconductor and contains defects. The retardation of Ca₃Al₂O₆ may be due to poisoning of reaction sites by gypsum and Ca(OH)_2.     

Graft copolymerization of 2‐acrylamido‐2‐methyl‐1‐propanesulfonic acid onto carboxymethylcellulose (sodium salt) by H2O2/Fe+2 redox pair

The effect of the reaction conditions on the grafting parameters during grafting of 2‐acrylamido‐2‐methyl‐1‐propanesulfonic acid onto sodium carboxymethylcellulose using H₂O₂/Fe⁺² redox pair are studied at 30°C. The grafting ratio, add on, and conversion initially increase with the H₂O₂ concentration in the range of (10.0–15.0) × 10^?2 mol dm^?3. Thereafter, these parameters decrease with the H₂O₂ concentration. The grafting ratio, add on, and conversion increase when increasing the ferrous ion concentration from (0.5 to 4.0) × 10^?2 mol dm^?3 and decrease with a further increase in the concentration. It is observed that the grafting ratio and add on increase with the monomer concentration, whereas the conversion decrease. The hydrogen ions seem to be facilitating the grafting reaction up to a certain concentration and after this concentration seem to be retarding the process. The grafting ratio, add on, and conversion decrease with the sodium carboxymethylcellulose concentration. When increasing the time period from 60 to 90 min, the grafting parameters increase but decrease thereafter. Similarly, when increasing the temperature from 25 to 30°C, the grafting parameters increase and decrease thereafter. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 100: 4819–4825, 2006     

The Rank-Width of Edge-Coloured Graphs

A C-coloured graph is a graph, that is possibly directed, where the edges are coloured with colours from the set C. Clique-width is a complexity measure for C-coloured graphs, for finite sets C. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor relation. We discuss some possible extensions of the notion of rank-width to C-coloured graphs. There is not a unique natural notion of rank-width for C-coloured graphs. We define two notions of rank-width for them, both based on a coding of C-coloured graphs by ${\mathbb{F}}^{*}$ -graphs— $\mathbb {F}$ -coloured graphs where each edge has exactly one colour from $\mathbb{F}\setminus \{0\},\ \mathbb{F}$ a field—and named respectively $\mathbb{F}$ -rank-width and $\mathbb {F}$ -bi-rank-width. The two notions are equivalent to clique-width. We then present a notion of vertex-minor for $\mathbb{F}^{*}$ -graphs and prove that $\mathbb{F}^{*}$ -graphs of bounded $\mathbb{F}$ -rank-width are characterised by a list of $\mathbb{F}^{*}$ -graphs to exclude as vertex-minors (this list is finite if $\mathbb{F}$ is finite). An algorithm that decides in time O(n ³) whether an $\mathbb{F}^{*}$ -graph with n vertices has $\mathbb{F}$ -rank-width (resp. $\mathbb{F}$ -bi-rank-width) at most k, for fixed k and fixed finite field $\mathbb{F}$ , is also given. Graph operations to check MSOL-definable properties on $\mathbb{F}^{*}$ -graphs of bounded $\mathbb{F}$ -rank-width (resp. $\mathbb{F}$ -bi-rank-width) are presented. A specialisation of all these notions to graphs without edge colours is presented, which shows that our results generalise the ones in undirected graphs.     

A Comparative Investigation of Optical and Structural Properties of Cu-Doped CdO-Derived Nanostructures

In this report, we studied various structural and optical properties of pure and copper-doped cadmium oxide (CdO) thin films. Nanostructured Cu-doped CdO films were deposited using sol–gel spin-coating technique. The structural and morphological changes have been observed by X-ray diffraction (XRD), field emission scanning electron microscopy (FE-SEM), and atomic force microscopy (AFM) studies. The optical and electrical properties of the pure and Cu-doped CdO thin films were studied by UV–vis spectroscopy and four-point probe method, respectively. The XRD peaks show the formation of nanocrystalline CdO with cubic face-centered crystal structure. The band gaps of the as deposited films were found in the range of 2.32–2.73 eV, while after doping, it decreases due to structural deformation. The electrical resitivity was found to decrease approximately ～10 in Cu-doped CdO thin films.     

Drawing planar graphs using the canonical ordering

We introduce a new method to optimize the required area, minimum angle, and number of bends of planar graph drawings on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. Using this method linear-time-and-space algorithms can be designed for many graph-drawing problems. Our main results are as follows:

Every triconnected planar graphG admits a planar convex grid drawing with straight lines on a (2n?4)×(n?2) grid, wheren is the number of vertices.

Every triconnected planar graph with maximum degree 4 admits a planar orthogonal grid drawing on ann×n grid with at most [3n/2]+4 bends, and ifn>6, then every edge has at most two bends.

Every planar graph with maximum degree 3 admits a planar orthogonal grid drawing with at most [n/2]+1 bends on an [n/2]×[n/2] grid.

Every triconnected planar graphG admits a planar polyline grid drawing on a (2n?6)×(3n?9) grid with minimum angle larger than 2/d radians and at most 5n?15 bends, withd the maximum degree.

These results give in some cases considerable improvements over previous results, and give new bounds in other cases. Several other results, e.g., concerning visibility representations, are included.     

Deadlock free routing algorithms for irregular mesh topology NoC systems with rectangular regions

The simplicity of regular mesh topology Network on Chip (NoC) architecture leads to reductions in design time and manufacturing cost. A weakness of the regular shaped architecture is its inability to efficiently support cores of different sizes. A proposed way in literature to deal with this is to utilize the region concept, which helps to accommodate cores larger than the tile size in mesh topology NoC architectures. Region concept offers many new opportunities for NoC design, as well as provides new design issues and challenges. One of the most important among these is the design of an efficient deadlock free routing algorithm. Available adaptive routing algorithms developed for regular mesh topology cannot ensure freedom from deadlocks. In this paper, we list and discuss many new design issues which need to be handled for designing NoC systems incorporating cores larger than the tile size. We also present and compare two deadlock free routing algorithms for mesh topology NoC with regions. The idea of the first algorithm is borrowed from the area of fault tolerant networks, where a network topology is rendered irregular due to faults in routers or links, and is adapted for the new context. We compare this with an algorithm designed using a methodology for design of application specific routing algorithms for communication networks. The application specific routing algorithm tries to maximize adaptivity by using static and dynamic communication requirements of the application. Our study shows that the application specific routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases. But this higher performance for the second algorithm comes at a higher area cost for implementing network routers.     

Passivation of pyrite due to surface treatment

Two samples of naturally occurring pyrite were treated with acetyl acetone, silanes, humic acids, lignin-NaOH mixture, and oxalic acid. The corrosion rate of pyrite was observed to decrease significantly due to the surface treatment by the chemicals used in this study. Surface characterization methods indicate that phenyl triacetoxy silane forms a passive coating a few Angstroms thick on the pyrite, thus preventing its dissolution in 1M H₂SO₄.