Impact of QoS on Replica Placement in Tree Networks

This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. We study three strategies. The first two strategies assign each client to a unique server while the third allows requests of a client to be processed by multiple servers. The main contribution of this paper is to assess the impact of QoS constraints on the total replication cost. In this paper, we establish the NP-completeness of the problem on homogeneous networks when the requests of a given client can be processed by multiple servers. We provide several efficient polynomial heuristic algorithms for NP-complete instances of the problem. These heuristics are compared to the optimal solution provided by the formulation of the problem in terms of the solution of an integer linear program.Dans ce rapport, on discute et compare plusieurs politiques de placement de répliques dans les arbres, en prenant en compte à la fois des contraintes de capacité de traitement de chaque serveur et des contraintes de type QoS (Qualité de Service). Les requêtes des clients sont connues avant exécution, alors que le nombre et l’emplacement des répliques (serveurs) sont déterminés par l’algorithme de placement. Nous étudions trois stratégies. Les deux premières stratégies assignent chaque client à un serveur unique alors que la troisième permet que les requêtes d’un client soient traitées par plusieurs serveurs. L’objectif principal de ce travail est l’étude de l’impact des contraintes de qualité de service sur le coût total. Nous établissons la NP-complétude du problème sur des réseaux homogènes quand les requêtes d’un client peuvent être traitées par des serveurs multiples. Nous présentons plusieurs heuristiques polynomiales et efficaces pour les instances NP-complètes du problème sur plateformes hétérogènes. Ces heuristiques sont comparées à la solution optimale obtenue grâce à la formulation du problème en terme d’un programme linéaire en nombres entiers

Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree

We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of $O(n\log \Delta)$ bits per node and $O(nD)$ respectively, where $\Delta$ is the highest degree of a node, $n$ is the number of nodes and $D$ is the diameter of the network. In contrast, our algorithm has a space complexity of $O(\log n)$ bits per node, which is optimal for silent-stabilizing spanning trees and runs in $O(n)$ time. In addition, our solution is modular since it utilizes the distributed verification algorithm as an independent subtask of the overall solution. It is possible to use the verification algorithm as a stand alone task or as a subtask in another algorithm. To demonstrate the simplicity of constructing efficient DFS algorithms using the modular approach, We also present a (non-sielnt) self-stabilizing DFS token circulation algorithm for general networks based on our silent-stabilizing DFS tree. The complexities of this token circulation algorithm are comparable to the known ones

On-the-Fly Adaptive Routing for dragonfly interconnection networks

Adaptive deadlock-free routing mechanisms are required to handle variable traffic patterns in dragonfly networks. However, distance-based deadlock avoidance mechanisms typically employed in Dragonflies increase the router cost and complexity as a function of the maximum allowed path length. This paper presents on-the-fly adaptive routing (OFAR), a routing/flow-control scheme that decouples the routing and the deadlock avoidance mechanisms. OFAR allows for in-transit adaptive routing with local and global misrouting, without imposing dependencies between virtual channels, and relying on a deadlock-free escape subnetwork to avoid deadlock. This model lowers latency, increases throughput, and adapts faster to transient traffic than previously proposed mechanisms. The low capacity of the escape subnetwork makes it prone to congestion. A simple congestion management mechanism based on injection restriction is considered to avoid such issues. Finally, reliability is considered by introducing mechanisms to find multiple edge-disjoint Hamiltonian rings embedded on the dragonfly, allowing to use multiple escape subnetworks

Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling

In order to differentiate the perceived QoS between traffic classes in heterogeneous packet networks, equipment discriminates incoming packets based on their class, particularly in the way queued packets are scheduled for further transmission. We review a common stochastic modelling framework in which scheduling mechanisms can be evaluated, especially with regard to the resulting per-class delay distribution. For this, a discrete-time single-server queue is considered with two classes of packet arrivals, either delay-sensitive (1) or delay-tolerant (2). The steady-state analysis relies on the use of well-chosen supplementary variables and is mainly done in the transform domain. Secondly, we propose and analyse a new type of scheduling mechanism that allows precise control over the amount of delay differentiation between the classes. The idea is to introduce N reserved places in the queue, intended for future arrivals of class 1

Fast and efficient neural conversion of human hematopoietic cells

Neurons obtained directly from human somatic cells hold great promise for disease modeling and drug screening. Available protocols rely on overexpression of transcription factors using integrative vectors and are often slow, complex, and inefficient. We report a fast and efficient approach for generating induced neural cells (iNCs) directly from human hematopoietic cells using Sendai virus. Upon SOX2 and c-MYC expression, CD133-positive cord blood cells rapidly adopt a neuroepithelial morphology and exhibit high expansion capacity. Under defined neurogenic culture conditions, they express mature neuronal markers and fire spontaneous action potentials that can be modulated with neurotransmitters. SOX2 and c-MYC are also sufficient to convert peripheral blood mononuclear cells into iNCs. However, the conversion process is less efficient and resulting iNCs have limited expansion capacity and electrophysiological activity upon differentiation. Our study demonstrates rapid and efficient generation of iNCs from hematopoietic cells while underscoring the impact of target cells on conversion efficiency

Comparing Presenting Clinical Features in 48 Children With Microscopic Polyangiitis to 183 Children Who Have Granulomatosis With Polyangiitis (Wegener's) : an ARChiVe Cohort Study

OBJECTIVE: To uniquely classify children with microscopic polyangiitis (MPA), to describe their demographic characteristics, presenting clinical features, and initial treatments in comparison to patients with granulomatosis with polyangiitis (Wegener's) (GPA). METHODS: The European Medicines Agency (EMA) classification algorithm was applied by computation to categorical data from patients recruited to the ARChiVe (A Registry for Childhood Vasculitis: e-entry) cohort, with the data censored to November 2015. The EMA algorithm was used to uniquely distinguish children with MPA from children with GPA, whose diagnoses had been classified according to both adult- and pediatric-specific criteria. Descriptive statistics were used for comparisons. RESULTS: In total, 231 of 440 patients (64% female) fulfilled the classification criteria for either MPA (n\u2009=\u200948) or GPA (n\u2009=\u2009183). The median time to diagnosis was 1.6 months in the MPA group and 2.1 months in the GPA group (ranging to 39 and 73 months, respectively). Patients with MPA were significantly younger than those with GPA (median age 11 years versus 14 years). Constitutional features were equally common between the groups. In patients with MPA compared to those with GPA, pulmonary manifestations were less frequent (44% versus 74%) and less severe (primarily, hemorrhage, requirement for supplemental oxygen, and pulmonary failure). Renal pathologic features were frequently found in both groups (75% of patients with MPA versus 83% of patients with GPA) but tended toward greater severity in those with MPA (primarily, nephrotic-range proteinuria, requirement for dialysis, and end-stage renal disease). Airway/eye involvement was absent among patients with MPA, because these GPA-defining features preclude a diagnosis of MPA within the EMA algorithm. Similar proportions of patients with MPA and those with GPA received combination therapy with corticosteroids plus cyclophosphamide (69% and 78%, respectively) or both drugs in combination with plasmapheresis (19% and 22%, respectively). Other treatments administered, ranging in decreasing frequency from 13% to 3%, were rituximab, methotrexate, azathioprine, and mycophenolate mofetil. CONCLUSION: Younger age at disease onset and, perhaps, both gastrointestinal manifestations and more severe kidney disease seem to characterize the clinical profile in children with MPA compared to those with GPA. Delay in diagnosis suggests that recognition of these systemic vasculitides is suboptimal. Compared with adults, initial treatment regimens in children were comparable, but the complete reversal of female-to-male disease prevalence ratios is a provocative finding