Recently, Borgatti [Borgatti, S.P., 2005. Centrality and network flow. Social Networks 27, 55–71] proposed a taxonomy of centrality measures based on the way that traffic flows through the network—whether over path, geodesic, trail, or walk, and whether by means of transfer, serial duplication, or parallel duplication. Most of the extant centrality measures assume that traffic propagates via pa...

The network measurement community has proposed multiple machine learning (ML) methods for traffic classification during the last years. Although several research works have reported accuracies over 90%, most network operators still use either obsolete (e.g., port-based) or extremely expensive (e.g., pattern matching) methods for traffic classification. We argue that one of the barriers to the r...

In this paper, we introduce a new channel model we term the q-ary multi-bit channel (QMBC). This channel models a memory device, where q-ary symbols (q = 2) are stored in the form of current/voltage levels. The symbols are read in a measurement process, which provides a symbol bit in each measurement step, starting from the most significant bit. An error event occurs when not all the symbol bit...

Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of markers from each map such that the two extracted sequences are decomposable into non-intersecting strips (or synteny blocks). This aims at defining a robust set of synteny blocks between different species, which is a key to unde...

Two points are definitely different between network models in systems biology and those in engineering fields. One is that most network models (structures) in biology are not static but change depending on external conditions, and the other is that the models including unmeasured variables frequently emerged so as to measure the variables under the conditions with as less perturbation to the or...

Abstract. We present an elementary model of random size varying population given by a stationary continuous state branching process. For this model we compute the joint distribution of: the time to the most recent common ancestor, the size of the current population and the size of the population just before the most recent common ancestor (MRCA). In particular we show a natural mild bottleneck ...

The way in which research groups evaluate router software (QoS and routing components, for example) seems to be restricted to methodologies using mathematical modelling and simulation techniques. We believe that an experimental methodology is rarely used as the deployment of custom routing software to a testbed comprising multiple routers is a non-trivial task that is beyond the scope of most n...