Concept

Jackson network

Related publications (32)

The mean-field behavior of processor sharing systems with general job lengths under the SQ(d) policy

This paper addresses the mean-field behavior of large-scale systems of parallel servers with a processor sharing service discipline when arrivals are Poisson and jobs have general service time distributions when an SQ(d) routing policy is used. Under this ...

ELSEVIER SCIENCE BV2018

Three Essays on Methodologies for Dynamic Modeling of Emerging Socio-technical Systems

Mohammad Amin Dehdarian

Socio-technical energy transitions are long-term and major transformations in incumbent energy infrastructures. They include fundamental changes in technologies as well as institutions and social patterns. Transition studies are primarily focused on framew ...

EPFL2017

Interference Functionals in Poisson Networks

Martin Haenggi

We propose and prove a theorem that allows the calculation of a class of functionals on Poisson point processes that have the form of expected values of sum-products of functions. In proving the theorem, we present a variant of the Campbell-Mecke theorem f ...

Ieee-Inst Electrical Electronics Engineers Inc2016

The IX Operating System: Combining Low Latency, High Throughput, and Efficiency in a Protected Dataplan

Edouard Bugnion, Christos Kozyrakis, Georgios Prekas, Mia Primorac, Ana Klimovic

The conventional wisdom is that aggressive networking requirements, such as high packet rates for small messages and μs-scale tail latency, are best addressed outside the kernel, in a user-level networking stack. We present ix, a dataplane operating system ...

Association for Computing Machinery2016

IX: A Protected Dataplane Operating System for High Throughput and Low Latency

Edouard Bugnion, Christos Kozyrakis, Georgios Prekas, Ana Klimovic

The conventional wisdom is that aggressive networking requirements, such as high packet rates for small messages and microsecond-scale tail latency, are best addressed outside the kernel, in a user-level networking stack. We present IX, a dataplane operati ...

USENIX2014

Highly Dynamic Distributed Computing with Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Florian Huc

This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two ...

2013

Structural connectomics in brain diseases

Jean-Philippe Thiran, Alessandra Griffa, Patric Hagmann, Philipp Baumann

Imaging the connectome in vivo has become feasible through the integration of several rapidly developing fields of science and engineering, namely magnetic resonance imaging and in particular diffusion MRI on one side, image processing and network theory o ...

Elsevier2013

A High-Throughput Byzantine Fault-Tolerant Protocol

Nikola Knezevic

State-machine replication (SMR) is a software technique for tolerating failures and for providing high availability in large-scale systems, through the use of commodity hardware. A replicated state-machine comprises a number of replicas, each of which runs ...

EPFL2012

Metabolic principles of river basin organization

Andrea Rinaldo

The metabolism of a river basin is defined as the set of processes through which the basin maintains its structure and responds to its environment. Green (or biotic) metabolism is measured via transpiration and blue (or abiotic) metabolism through runoff. ...

2011

Integrated use of time-frequency wavelet decompositions for fault location in distribution networks: Theory and experimental validation

Mario Paolone, Ali Abur

The paper presents a procedure for fault location in distribution networks, based on the use of the integrated time-frequency wavelet decompositions of the voltage transients associated with the fault-originated travelling waves. The proposed analysis of t ...

2010

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.