An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

Availability analysis of GMPLS connections based on physical network topology

This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Label Space Reduction in MPLS Networks: How Much Can A Single Stacked Label Do?

Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying virtual private networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the configuration of multipoint-to-point connections (MP2P)-as a means of reducing label space in LSRs. We found two main drawbacks in this label space reduction a)it should be separately applied to a set of LSPs with the same egress LSR-which decreases the options for better reductions, and b)LSRs close to the edge of the network experience a greater label space reduction than those close to the core. The later implies that MP2P connections reduce the number of labels asymmetrically

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Partial disjoint path for multi-layer protection in GMPLS networks

In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio

Enhanced multi-layer protection in multi-service GMPLS networks

This paper focuses on QoS routing with protection in an MPLS network over an optical layer. In this multi-layer scenario each layer deploys its own fault management methods. A partially protected optical layer is proposed and the rest of the network is protected at the MPLS layer. New protection schemes that avoid protection duplications are proposed. Moreover, this paper also introduces a new traffic classification based on the level of reliability. The failure impact is evaluated in terms of recovery time depending on the traffic class. The proposed schemes also include a novel variation of minimum interference routing and shared segment backup computation. A complete set of experiments proves that the proposed schemes are more efficient as compared to the previous ones, in terms of resources used to protect the network, failure impact and the request rejection ratio

Adding new components to the knowledge plane GMPLS over WDM networks

A recent study defines a new network plane: the knowledge plane. The incorporation of the knowledge plane over the network allows having more accurate information of the current and future network states. In this paper, the introduction and management of the network reliability information in the knowledge plane is proposed in order to improve the quality of service with protection routing algorithms in GMPLS over WDM networks. Different experiments prove the efficiency and scalability of the proposed scheme in terms of the percentage of resources used to protect the network

Compression-based Image Registration

Image registration is an important component of image analysis used to align two or more images. In this paper, we present a new framework for image registration based on compression. The basic idea underlying our approach is the conjecture that two images are correctly registered when we can maximally compress one image given the information in the other. The contribution of this paper is twofold. First, we show that the image registration process can be dealt with from the perspective of a compression problem. Second, we demonstrate that the similarity metric, introduced by Li et al., performs well in image registration. Two different versions of the similarity metric have been used: the Kolmogorov version, computed using standard real-world compressors, and the Shannon version, calculated from an estimation of the entropy rate of the images

An image quality comparison of standard and dual-side read CR systems for pediatric radiology.

An objective analysis of image quality parameters was performed for a computed radiography (CR) system using both standard single-side and prototype dual-side read plates. The pre-sampled modulation transfer function (MTF), noise power spectrum (NPS), and detective quantum efficiency (DQE) for the systems were determined at three different beam qualities representative of pediatric chest radiography, at an entrance detector air kerma of 5 microGy. The NPS and DQE measurements were realized under clinically relevant x-ray spectra for pediatric radiology, including x-ray scatter radiations. Compared to the standard single-side read system, the MTF for the dual-side read system is reduced, but this is offset by a significant decrease in image noise, resulting in a marked increase in DQE (+40%) in the low spatial frequency range. Thus, for the same image quality, the new technology permits the CR system to be used at a reduced dose level.

Influence of IL28B polymorphisms on response to a lower-than-standard dose peg-IFN-α 2a for genotype 3 chronic hepatitis C in HIV-coinfected patients.

BACKGROUND Data on which to base definitive recommendations on the doses and duration of therapy for genotype 3 HCV/HIV-coinfected patients are scarce. We evaluated the efficacy of a lower peginterferon-α 2a dose and a shorter duration of therapy than the current standard of care in genotype 3 HCV/HIV-coinfected patients. METHODS AND FINDINGS Pilot, open-label, single arm clinical trial which involved 58 Caucasian HCV/HIV-coinfected patients who received weekly 135 µg peginterferon-α 2a plus ribavirin 400 mg twice daily during 20 weeks after attaining undetectable viremia. The relationships between baseline patient-related variables, including IL28B genotype, plasma HCV-RNA, ribavirin dose/kg, peginterferon-α 2a and ribavirin levels with virological responses were analyzed. Only 4 patients showed lack of response and 5 patients dropped out due to adverse events related to the study medication. Overall, sustained virologic response (SVR) rates were 58.3% by intention-to-treat and 71.4% by per protocol analysis, respectively. Among patients with rapid virologic response (RVR), SVR and relapses rates were 92.6% and 7.4%, respectively. No relationships were observed between viral responses and ribavirin dose/kg, peginterferon-α 2a concentrations, ribavirin levels or rs129679860 genotype. CONCLUSIONS Weekly 135 µg pegIFN-α 2a could be as effective as the standard 180 µg dose, with a very low incidence of severe adverse events. A 24-week treatment duration appears to be appropriate in patients achieving RVR, but extending treatment up to just 20 weeks beyond negativization of viremia is associated with a high relapse rate in those patients not achieving RVR. There was no influence of IL28B genotype on the virological responses.

The effect of standard and high-fluence corneal cross-linking (CXL) on cornea and limbus.

PURPOSE: When treating peripheral ectatic disease-like pellucid marginal degeneration (PMD), corneal cross-linking with UV-A and riboflavin (CXL) must be applied eccentrically to the periphery of the lower cornea, partly irradiating the corneal limbus. Here, we investigated the effect of standard and double-standard fluence corneal cross-linking with riboflavin and UV-A (CXL) on cornea and corneal limbus in the rabbit eye in vivo. METHODS: Epithelium-off CXL was performed in male New Zealand White rabbits with two irradiation diameters (7 mm central cornea, 13 mm cornea and limbus), using standard fluence (5.4 J/cm(2)) and double-standard fluence (10.8 J/cm(2)) settings. Controls were subjected to epithelial removal and riboflavin instillation, but were not irradiated with UV-A. Following CXL, animals were examined daily until complete closure of the epithelium, and at 7, 14, 21, and 28 days. Animals were killed and a corneoscleral button was excised and processed for light microscopy and immunohistochemistry. RESULTS: For both irradiation diameters and fluences tested, no signs of endothelial damage or limbal vessel thrombosis were observed, and time to re-epithelialization was similar to untreated controls. Histological and immunohistochemical analysis revealed no differences in the p63 putative stem cell marker expression pattern. CONCLUSIONS: Even when using fluence twice as high as the one used in current clinical CXL settings, circumferential UV-A irradiation of the corneal limbus does not alter the regenerative capacity of the limbal epithelial cells, and the expression pattern of the putative stem cell marker p63 remains unchanged. This suggests that eccentric CXL may be performed safely in PMD.

Navigator-gated coronary magnetic resonance angiography using steady-state-free-precession: comparison to standard T2-prepared gradient-echo and spiral imaging.

RATIONALE AND OBJECTIVES: Recent developments of magnetic resonance imaging enabled free-breathing coronary MRA (cMRA) using steady-state-free-precession (SSFP) for endogenous contrast. The purpose of this study was a systematic comparison of SSFP cMRA with standard T2-prepared gradient-echo and spiral cMRA. METHODS: Navigator-gated free-breathing T2-prepared SSFP-, T2-prepared gradient-echo- and T2-prepared spiral cMRA was performed in 18 healthy swine (45-68 kg body-weight). Image quality was investigated subjectively and signal-to-noise ratio (SNR), contrast-to-noise ratio (CNR) and vessel sharpness were compared. RESULTS: SSFP cMRA allowed for high quality cMRA during free breathing with substantial improvements in SNR, CNR and vessel sharpness when compared with standard T2-prepared gradient-echo imaging. Spiral imaging demonstrated the highest SNR while image quality score and vessel definition was best for SSFP imaging. CONCLUSION: Navigator-gated free-breathing T2-prepared SSFP cMRA is a promising new imaging approach for high signal and high contrast imaging of the coronary arteries with improved vessel border definition.

Asymmetric tunnels in P2MP LSPs as a label space reduction method

The objective of traffic engineering is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization, few works have focused on LSR (label switched router) label space. This paper proposes an algorithm that takes advantage of the MPLS label stack features in order to reduce the number of labels used in LSPs. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The described algorithm sets up NHLFE (next hop label forwarding entry) tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the described algorithm achieves a great reduction factor in the label space. The presented works apply for both types of connections: P2MP (point-to-multipoint) and P2P (point-to-point)