QoS online routing and MPLS multilevel protection: a survey

A survey of MPLS protection methods and their utilization in combination with online routing methods is presented in this article. Usually, fault management methods pre-establish backup paths to recover traffic after a failure. In addition, MPLS allows the creation of different backup types, and hence MPLS is a suitable method to support traffic-engineered networks. In this article, an introduction of several label switch path backup types and their pros and cons are pointed out. The creation of an LSP involves a routing phase, which should include QoS aspects. In a similar way, to achieve a reliable network the LSP backups must also be routed by a QoS routing method. When LSP creation requests arrive one by one (a dynamic network scenario), online routing methods are applied. The relationship between MPLS fault management and QoS online routing methods is unavoidable, in particular during the creation of LSP backups. Both aspects are discussed in this article. Several ideas on how these actual technologies could be applied together are presented and compared

Adding QoS protection in order to enhance MPLS QoS routing

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed

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

Multicast algorithms evaluation using an adaptative routing in ATM networks

This paper proposes a multicast implementation based on adaptive routing with anticipated calculation. Three different cost measures for a point-to-multipoint connection: bandwidth cost, connection establishment cost and switching cost can be considered. The application of the method based on pre-evaluated routing tables makes possible the reduction of bandwidth cost and connection establishment cost individually

A dramatic lung cancer course in a patient with a rare EGFR germline mutation exon 21 V843I: Is EGFR TKI resistance predictable?

We report on the medical history of a Caucasian smoker woman diagnosed with a stage IV NSCLC adenocarcinoma, characterized by a rare epidermal growth factor receptor (EGFR) point mutation in exon 21 codon 843 (p.V843I/c.2527G>A/COSMIC ID 85894). This genetic alteration revealed to be germline, after its presence was demonstrated in chondroblasts from the bone biopsy. While it is the first description of germline V843I mutation without concomitant additional known EGFR activating mutation, we modeled the EGFR ATP catalytic domain in complex with ATP, gefitinib and erlotinib using computer-aided approaches to estimate possible changes in affinity upon the V843I mutation.

Predictable Life-Cycle Shocks, Income Risk and Consumption Inequality

Was the increase in income inequality in the US due to permanent shocks or merely to an increase in the variance of transitory shocks? The implications for consumption and welfare depend crucially on the answer to this question. We use CEX repeated cross-section data on consumption and income to decompose idiosyncratic changes in income into predictable life-cycle changes, transitory and permanent shocks and estimate the contribution of each to total inequality. Our model fits the joint evolution of consumption and income inequality well and delivers two main results. First, we find that permanent changes in income explain all of the increase in inequality in the 1980s and 90s. Second, we reconcile this finding with the fact that consumption inequality did not increase much over this period. Our results support the view that many permanent changes in income are predictable for consumers, even if they look unpredictable to the econometrician, consistent with models of heterogeneous income profiles.

Inventory-routing model, for a multi-period problem with stochastic and deterministic demand

The need for integration in the supply chain management leads us to considerthe coordination of two logistic planning functions: transportation andinventory. The coordination of these activities can be an extremely importantsource of competitive advantage in the supply chain management. The battle forcost reduction can pass through the equilibrium of transportation versusinventory managing costs. In this work, we study the specific case of aninventory-routing problem for a week planning period with different types ofdemand. A heuristic methodology, based on the Iterated Local Search, isproposed to solve the Multi-Period Inventory Routing Problem with stochasticand deterministic demand.

Roles of multiple acyl-CoA oxidases in the routing of carbon flow towards β-oxidation and polyhydroxyalkanoate biosynthesis in Yarrowia lipolytica.

The oleaginous yeast Yarrowia lipolytica possesses six acyl-CoA oxidase (Aox) isoenzymes encoded by genes POX1-POX6. The respective roles of these multiple Aox isoenzymes were studied in recombinant Y. lipolytica strains that express heterologous polyhydroxyalkanoate (PHA) synthase (phaC) of Pseudomonas aeruginosa in varying POX genetic backgrounds, thus allowing assessment of the impact of specific Aox enzymes on the routing of carbon flow to β-oxidation or to PHA biosynthesis. Analysis of PHA production yields during growth on fatty acids with different chain lengths has revealed that the POX genotype significantly affects the PHA levels, but not the monomer composition of PHA. Aox3p function was found to be responsible for 90% and 75% of the total PHA produced from either C9:0 or C13:0 fatty acid, respectively, whereas Aox5p encodes the main Aox involved in the biosynthesis of 70% of PHA from C9:0 fatty acid. Other Aoxs, such as Aox1p, Aox2p, Aox4p and Aox6p, were not found to play a significant role in PHA biosynthesis, independent of the chain length of the fatty acid used. Finally, three known models of β-oxidation are discussed and it is shown that a 'leaky-hose pipe model' of the cycle can be applied to Y. lipolytica.

Anonymous Routing Protocol in decentralized networks

Peer-reviewed

Secure Dynamic MANET On-demand (SEDYMO) Routing Protocol

This paper describes the state of the art of secure ad hoc routing protocols and presents SEDYMO, a mechanism to secure a dynamic multihop ad hoc routing protocol. The proposed solution defeats internal and external attacks usinga trustworthiness model based on a distributed certification authority. Digital signatures and hash chains are used to ensure the correctness of the protocol. The protocol is compared with other alternatives in terms of security strength, energy efficiency and time delay. Both computational and transmission costs are considered and it is shown that the secure protocol overhead is not a critical factor compared to the high network interface cost.

Evaluation of Routing solution for Next Generation Open Platform

Verkkoon kytkettävien laitteiden määrä on lisääntynyt viime vuosina, joka luo tarpeen reitittimille ja niiden ominaisuuksille. On muodostunut uusi tarve laitteille, jotka voivat yhdistää erilaisia verkkoja toisiinsa. Tällaisen reitittimen rakentamiseen tarvitaan vakaa alusta. Tällaisella alustalla luodaan mahdollisuus kuormittaa järjestelmää ilman suuria ongelmia. Tällainen alusta on Open Platform, joka on suunniteltu tällaisille toiminnoille ja yhdessä oikeanlaisen verkkoratkaisun kanssa sitä voidaan käyttää sille suunnitellussa ympäristössä. Tämän diplomityön tarkoituksena on arvioida neljää eri reititysohjelmistoa ja kahta eri IP pinoa. Työssä käytetyt testit on suunniteltu arviointia varten ja niiden tarkoituksena on tuoda esille ohjelmistoissa esiintyvät viat ja ongelmat. Kaikki testit ovat samoja kaikille ohjelmille ja tehdään samassa ympäristössä. Testit analysoidaan niiden ajon jälkeen ja niiden tulosten avulla tehdään päätös mitä näistä ohjelmistoista tullaan käyttämään seuraavan sukupolven avoimella alustalla, joka tulee toimimaan Nokian Intelligent Service Nodessa. Tämä verkon laite toimii yhdyskäytävänäerilaisten verkkojen välillä.

Cost Models for Routing and Wavelength Assignment in Wavelength-Division Multiplexing Optical Net

WDM (Wavelength-Division Multiplexing) optiset verkot on tällä hetkellä suosituin tapa isojen määrän tietojen siirtämiseen. Jokaiselle liittymälle määrätään reitin ja aallonpituus joka linkin varten. Tarvittavan reitin ja aallon pituuden löytäminen kutsutaan RWA-ongelmaksi. Tämän työn kuvaa mahdollisia kustannuksen mallein ratkaisuja RWA-ongelmaan. Olemassa on paljon erilaisia optimoinnin tavoitteita. Edellä mainittuja kustannuksen malleja perustuu näillä tavoitteilla. Kustannuksen malleja antavat tehokkaita ratkaisuja ja algoritmeja. The multicommodity malli on käsitelty tässä työssä perusteena RV/A-kustannuksen mallille. Myöskin OB käsitelty heuristisia menetelmiä RWA-ongelman ratkaisuun. Työn loppuosassa käsitellään toteutuksia muutamalle mallille ja erilaisia mahdollisuuksia kustannuksen mallein parantamiseen.

Question Waves: A multicast query routing algorithm for social search

This paper describes Question Waves, an algorithm that can be applied to social search protocols, such as Asknext or Sixearch. In this model, the queries are propagated through the social network, with faster propagation through more trustable acquaintances. Question Waves uses local information to make decisions and obtain an answer ranking. With Question Waves, the answers that arrive first are the most likely to be relevant, and we computed the correlation of answer relevance with the order of arrival to demonstrate this result. We obtained correlations equivalent to the heuristics that use global knowledge, such as profile similarity among users or the expertise value of an agent. Because Question Waves is compatible with the social search protocol Asknext, it is possible to stop a search when enough relevant answers have been found; additionally, stopping the search early only introduces a minimal risk of not obtaining the best possible answer. Furthermore, Question Waves does not require a re-ranking algorithm because the results arrive sorted

Servei de rutes basat en Open Source Routing Machine

Aquesta memòria descriu la preparació, l'execució i els resultats obtinguts d'implementar un sistema calculador de rutes. El projecte Open Source Routing Machine és un motor calculador de rutes d'alt rendiment que utilitza les dades de OpenStreetMaps per calcular el camí més curt entre dos punts. En aquest projecte final no únicament es volen utilitzar les dades OpenStreetMap sinó que també es pretenen utilitzar dades pròpies en format shapefile i poder visualitzar-los en un visor web. Aquest visor permet a l'usuari, de forma senzilla, sol•licitar rutes al servidor OSRM creat, obtenint la ruta desitjada en molt pocs milisegons