Publications related to Classless Inter-Domain Routing

Repopulating Paris: massive extraction of 4 Million addresses from city directories between 1839 and 1922

Frédéric Kaplan, Isabella Di Lenardo, Raphaël Barman, Albane Bénédicte Descombes

In 1839, in Paris, the Maison Didot bought the Bottin company. Sébastien Bottin trained as a statistician was the initiator of a high impact yearly publication, called “Almanachs" containing the listing of residents, businesses and institutions, arranged g ...

Utrecht University2019

A Novel Basis for Logic Rewriting

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Mathias Soeken, Luca Gaetano Amarù, Winston Jason Haaswijk

Given a set of logic primitives and a Boolean function, exact synthesis finds the optimum representation (e.g., depth or size) of the function in terms of the primitives. Due to its high computational complexity, the use of exact synthesis is limite ...

Ieee2017

Building Evolvable Networks : Flexible and Predictable Packet Processing

Mihai Dobrescu

Software packet-processing platforms- - network devices running on general-purpose servers-- are emerging as a compelling alternative to the traditional high-end switches and routers running on specialized hardware. Their promise is to enable the fast dep ...

EPFL2015

Obtaining Binaural Room Impulse Responses from B-Format Impulse Responses Using Frequency-Dependent Coherence Matching

Hervé Lissek, Christof Faller

Measuring binaural room impulse responses (BRIRs) for different rooms and different persons is a costly and time-consuming task. In this paper, we propose a method that allows to compute BRIRs from a B-format room impulse response (B-format RIR) and a set ...

Institute of Electrical and Electronics Engineers2011

Can One Hear the Shape of a Room: The 2–D Polygonal Case

Martin Vetterli, Yue Lu, Ivan Dokmanic

We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RIRs. In contrast, we are interested in reconstructing the room geometry from a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Adaptive Strategy for the Statistical Analysis of Connectomes

Jean-Philippe Thiran, Reto Meuli, Patric Hagmann, Stephan Morgenthaler, Leila Cammoun, Djalel Eddine Meskaldji, Leila Faiza Ben Hamida Cammoun

We study an adaptive statistical approach to analyze brain networks represented by brain connection matrices of interregional connectivity (connectomes). Our approach is at a middle level between a global analysis and single connections analysis by conside ...

Public Library of Science2011

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Patrick Thiran, Julien Pierre Sacha Herzen

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Agent-Based Routing in Queueing Systems

Olivier Gallay

Waiting time in any network is often a costly and hence a bad experience. Therefore, to avoid jamming regions becomes essential in the optimization of traffic flows. In this regard, the conception and the control of complex networks supporting flows of uni ...

EPFL2010

A Simplified 8 × 8 Transformation And Quantization Real-Time Ip-Block For MPEG-4 H.264/AVC Applications: A New Design Flow Approach

Marco Mattavelli, Ihab Mostafa Amin Mohamed Amer

Current multimedia design processes suffer from the excessively large time spent on testing new IP-blocks with references based on large video encoders specifications (usually several thousands lines of code). The appropriate testing of a single IP-block m ...

2007

On Routing in Distributed Hash Tables

Karl Aberer, Jean-Yves Le Boudec, Fabius Klemm, Sarunas Girdzijauskas

There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allo ...

2007