References of "Donnet, Benoît"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailQuantifying ASes Multiconnectivity Using Multicast Information
Mérindol, Pascal; Van den Schriek, Virginie; Donnet, Benoît ULg et al

in 9th ACM SIGCOMM Conference on Internet Measurement (2009, November)

Redundant connectivity (or multiconnectivity) between adjacent autonomous systems (ASes) is important for inter-domain traffic engineering and fast recovery in case of failures. However, the redundancy of ... [more ▼]

Redundant connectivity (or multiconnectivity) between adjacent autonomous systems (ASes) is important for inter-domain traffic engineering and fast recovery in case of failures. However, the redundancy of ASes business relationship links has not been quantitatively studied, mainly due to the difficulty of obtaining relevant data. In this paper, we show that the mrinfo multicast monitoring tool can provide useful data about the Internet topology and such redundant links in particular. Our analysis relies on more than four years of daily queries to about ten thousand routers mapped into more than two hundred ASes. We demonstrate that peering links between ASes are frequently redundant. In particular, our analysis shows that more than half of the studied ASes pairs are connected through multiple physical links. We then refine our analysis by considering the different types of ASes and their business relationships. A particular result of our analysis is that at least 75% of the peer-to-peer relationships between adjacent Tier-1 ASes are redundant, i.e., the con- nections between these ASes involve several physical links. Our analysis is conservative, providing so a lower bound, as some links might not be seen by mrinfo due to ISPs filtering policies. [less ▲]

Detailed reference viewed: 14 (4 ULg)
Full Text
Peer Reviewed
See detailA Comparative Study of Path Performance Metrics Predictors
Narino Mendoza, Juan Pablo; Donnet, Benoît ULg; Dupont, Pierre

in Advanced Learning for Networking Workshop (2009, June)

Using quality-of-service (QoS) metrics for Internet traffic is expected to improve greatly the performance of many network enabled applications, such as Voice-over-IP (VoIP) and video conferencing ... [more ▼]

Using quality-of-service (QoS) metrics for Internet traffic is expected to improve greatly the performance of many network enabled applications, such as Voice-over-IP (VoIP) and video conferencing. However, it is not possible to constantly measure path performance metrics (PPMs) such as delay and throughput without interfering with the network. In this work, we focus on PPMs measurement scalability by considering machine learning techniques to estimate predictive models from past PPMs observations. Using real data collected from PlanetLab, we provide a comparison between three different predictors: AR(MA) models, Kalman filters and support vector machines (SVMs). Some predic- tors use delay and throughput jointly to take advantage of the possible relationship between PPMs, while other predictors consider PPMs individually. Our current results illustrate that the best performing model is an individual SVM specific to each time series. Overall, delay can be predicted with very good accuracy while accurate forecasting of throughput remains an open problem. [less ▲]

Detailed reference viewed: 50 (0 ULg)
Full Text
Peer Reviewed
See detailDTS: a Decentralized Tracing System
Masui, Kenji; Donnet, Benoît ULg

in First International Workshop on Traffic Monitoring and Analysis (2009, May)

A new generation of widely distributed systems to measure the Internet topology at the interface level is currently being deployed. Cooperation between monitors in these systems is required in order to ... [more ▼]

A new generation of widely distributed systems to measure the Internet topology at the interface level is currently being deployed. Cooperation between monitors in these systems is required in order to avoid over-consumption of network resources. This paper proposes an architecture for a distributed topology measurement (DTM) system that, for the first time, decentralizes probing information. The key idea of our proposal is that, by utilizing a shared database as a communication method among monitors and taking advantage of the characteristics of the Doubletree algorithm, we can get rid of a specific control point, and a DTM system can be constructed in a decentralized manner. In this paper, we describe our implementation of a DTM, called Decentralized Tracing System (DTS). Decentralization within DTS is achieved using various distributed hash tables (DHTs), each one being dedicated to a particular plane (i.e., control or data). We also provide preliminary evaluation results. [less ▲]

Detailed reference viewed: 6 (0 ULg)
Full Text
Peer Reviewed
See detailIncentives for BGP Guided IP-Level Topology Discovery
Donnet, Benoît ULg

in First International Workshop on Traffic Monitoring and Analysis (2009, May)

Internet topology discovery has been an attractive research field during the past decade. In particular, the research community was interested in modeling the network as well as providing efficient tools ... [more ▼]

Internet topology discovery has been an attractive research field during the past decade. In particular, the research community was interested in modeling the network as well as providing efficient tools, mostly based on traceroute, for collecting data. In this paper, we follow this track of rendering traceroute-based exploration more efficient. We discuss incentives for coupling passive monitoring and active measurements. In particular, we show that high-level information, such as BGP updates, might be used to trigger targeted traceroutes. As a result, the network dynamics might be better capture. We also provide a freely available tool for listening to BGP feeds and triggering dedicated traceroutes. [less ▲]

Detailed reference viewed: 21 (2 ULg)
Full Text
Peer Reviewed
See detailOn the Impact of Clustering on Measurement Reduction
Saucez, Damien; Donnet, Benoît ULg; Bonaventure, Olivier

in 8th International IFIP-TC 6 Networking Conference (2009, May)

Measuring a path performance according to one or several metrics, such as delay or bandwidth, is becoming more and more pop- ular for applications. However, constantly probing the network is not suitable ... [more ▼]

Measuring a path performance according to one or several metrics, such as delay or bandwidth, is becoming more and more pop- ular for applications. However, constantly probing the network is not suitable. To make measurements more scalable, the notion of clustering has emerged. In this paper, we demonstrate that clustering can limit the measurement overhead in such a context without loosing too much accuracy. We first explain that measurement reduction can be observed when vantage points collaborate and use clustering to estimate path performance. We then show, with real traces, how effective is the overhead reduction and what is the impact in term of measurement accuracy. [less ▲]

Detailed reference viewed: 9 (1 ULg)
Full Text
Peer Reviewed
See detailInterdomain Traffic Engineering in a Locator/Identifier Separation Context
Saucez, Damien; Donnet, Benoît ULg; Iannone, Luigi et al

in IEEE Internet Network Management Workshop (2008, October)

The Routing Research Group (RRG) of the Internet Research Task Force (IRTF) is currently discussing several architectural solutions to build an interdomain routing architecture that scales better than the ... [more ▼]

The Routing Research Group (RRG) of the Internet Research Task Force (IRTF) is currently discussing several architectural solutions to build an interdomain routing architecture that scales better than the existing one. The solutions family currently being discussed concerns the addresses separation into locators and identifiers, LISP being one of them. Such a separation provides opportunities in terms of traffic engineering. In this paper, we propose an open and flexible solution that allows an ISP using identifier/locator separation to engineer its interdomain traffic. Our solution relies on the utilization of a service that transparently ranks paths using cost functions. We implement a prototype server and demonstrate its benefits in a LISP testbed. [less ▲]

Detailed reference viewed: 8 (1 ULg)
Full Text
See detailOn BGP Communities
Donnet, Benoît ULg; Bonaventure, Olivier

in Computer Communication Review (2008), 38(2),

This paper focuses on BGP communities, a particular BGP attribute that has not yet been extensively studied by the research community. It allows an operator to group destinations in a single entity to ... [more ▼]

This paper focuses on BGP communities, a particular BGP attribute that has not yet been extensively studied by the research community. It allows an operator to group destinations in a single entity to which the same routing decisions might be applied. In this paper, we show that the usage of this attribute has increased and that it also contributes to routing table growth. In addition, we propose a taxonomy of BGP community attributes to allow operators to better document their communities. We further manually collect information on BGP communities and tag it according to our taxonomy. We show that a large propor- tion of the BGP communities are used for traffic engineering purposes. [less ▲]

Detailed reference viewed: 9 (0 ULg)
Full Text
See detailIDIPS: ISP-Driven Informed Path Selection
Saucez, Damien; Donnet, Benoît ULg; Bonaventure, Olivier

Report (2008)

This draft describes a simple network-based protocol to facilitate Path Selection and to improve traffic engineering capabilities in multihomed corporate networks. With this protocol, any network device ... [more ▼]

This draft describes a simple network-based protocol to facilitate Path Selection and to improve traffic engineering capabilities in multihomed corporate networks. With this protocol, any network device that requires to select a path among a list of different paths asks a Traffic Engineering service called IDIPS (ISP-Driven Informed Path Selection) to obtain an ordered list of the possible paths. The ordering is constructed according to policies and performance requirements of both the host and network provider [less ▲]

Detailed reference viewed: 10 (1 ULg)
Full Text
See detailThe Case for an Informed Path Selection Service
Bonaventure, Olivier; Saucez, Damien,; Donnet, Benoît ULg

Report (2008)

With today's peer-to-peer applications, more and more content is available from multiple sources. In tomorrow's Internet hosts will have multiple paths to reach one destination host with the deployment of ... [more ▼]

With today's peer-to-peer applications, more and more content is available from multiple sources. In tomorrow's Internet hosts will have multiple paths to reach one destination host with the deployment of dual-stack IPv4/IPv6 hosts, but also with new techniques such as shim6 or other locator/identifier mechanisms being discussed within the IRTF RRG. All these hosts will need to rank paths in order to select the best paths to reach a given destination/content. In this draft, we propose an informed path selection service that would be queried by hosts and would rank paths based on policies and performance metrics defined by the network operator to meet his traffic engineering objectives. A companion document describes a protocol that implements this service. [less ▲]

Detailed reference viewed: 7 (2 ULg)
Full Text
Peer Reviewed
See detailInternet Topology Discovery: a Survey
Donnet, Benoît ULg; Friedman, Timur

in IEEE Communications Surveys and Tutorials (2007), 9(4), 2-15

Since the beginning of the nineties, the internet has undergone impres- sive growth. This growth can be appreciated in terms of the equipment, such as routers and links, that has been added, as well as in ... [more ▼]

Since the beginning of the nineties, the internet has undergone impres- sive growth. This growth can be appreciated in terms of the equipment, such as routers and links, that has been added, as well as in the numbers of users and the value of commerce that it supports. In parallel to this expansion, over the past decade the networking research community has shown a growing interest in discovering and analyzing the internet topology. Some researchers have developed tools for gathering network topology data while others have tried to understand and model the internet’s properties. These efforts have brought us to a crucial juncture for toplogy measurement infrastructures: while, previously, these were both small (in terms of number of measurement points) and monolithic, we are starting to see the deployment of large-scale distributed systems composed of hundreds or thousands of monitors. As we look forward to this next generation of systems, we take stock of what has been achieved so far. In this survey, we discuss past and current mechanisms for discovering the internet topology at various levels: the IP interface, the router, the AS, and the PoP level. In addition to discovery techniques, we provide insights into some of the well- known properties of the internet topology. [less ▲]

Detailed reference viewed: 89 (7 ULg)
Full Text
Peer Reviewed
See detailOn the Construction of WiMAX Mesh Tree
Nahle, Salim; Iannone, Luigi,; Donnet, Benoît ULg et al

in IEEE Communications Letters (2007), 11(12),

The IEEE 802.16 protocol, also known as WiMAX, has been designed to support long-range communications with high bitrates, using two operation modes: Point-to-Multi-Point (PMP) and Mesh. In the mesh mode ... [more ▼]

The IEEE 802.16 protocol, also known as WiMAX, has been designed to support long-range communications with high bitrates, using two operation modes: Point-to-Multi-Point (PMP) and Mesh. In the mesh mode, Subscriber Stations (SSs) can directly communicate with each other, thus forming a tree, and can be used to forward other's data packets in a multi-hop fashion. On the contrary, in the PMP mode only one hop communication toward the Base Station (BS) is allowed. In this paper, we investigate the performance of the mesh mode by proposing an algorithm for constructing the WiMAX mesh tree. Our algorithm increases routes' effective throughput by splitting long links into multiple shorter ones. We show through simulations that this approach leads to improving the throughput capacity of WiMAX-based wireless mesh networks. [less ▲]

Detailed reference viewed: 6 (0 ULg)
Full Text
Peer Reviewed
See detailImplementation and Preliminary Evaluation of an ISP-Driven Informed Path Selection
Saucez, Damien; Donnet, Benoît ULg; Bonaventure, Olivier

in ACM CoNEXT conference (2007, December)

Detailed reference viewed: 7 (1 ULg)
Full Text
Peer Reviewed
See detailA Multihoming Architecture for OneLab
de la Oliva, Antonio,; Donnet, Benoît ULg; Parmentelat, Thierry, et al

in Real Overlays and Distributed Systems (2007, July)

This paper describes the work in progress in the European Commission funded OneLab project to extend PlanetLab nodes with multihoming functionalities. These multihoming functionalities aim at enabling ... [more ▼]

This paper describes the work in progress in the European Commission funded OneLab project to extend PlanetLab nodes with multihoming functionalities. These multihoming functionalities aim at enabling application developers, for example, to test the impact of multihoming solutions on their applications, or to find out appropriate parameters for multihoming solutions according to the requirements of their applications. [less ▲]

Detailed reference viewed: 21 (1 ULg)
Full Text
Peer Reviewed
See detailInvestigating Depth-Fanout Trade-Off in WiMAX Mesh Networks
Nahle, Salim; Iannone, Luigi; Donnet, Benoît ULg et al

in 1st WEIRD Workshop on WiMAX, Wireless and Mobility (2007, May)

In the last years, Wireless Mesh Networks (WMNs) have been an emerging technology for providing cost/effective broadband Internet access. The research done insofar usually assumes that the wireless ... [more ▼]

In the last years, Wireless Mesh Networks (WMNs) have been an emerging technology for providing cost/effective broadband Internet access. The research done insofar usually assumes that the wireless backbone of a WMN is built using IEEE 802.11 technologies. Such an approach has the drawback of leading to dense and sub-optimal deployments, due to the short transmission range of this standard. Recently standardized, the WiMAX technology is supposed to transcend this limitation by a transmission range of several miles. In particular, the mesh mode of the WiMAX standard enables direct communications between subscriber stations and, hence, reduces dead zones while increasing the global throughput. In this paper, we investigate the throughput capacity of a WiMAX mesh tree. More specifically, we are interested in balancing the impact of the depth of the tree with its fanout. We provide a traffic model and evaluate the WiMAX mesh tree by simulations. [less ▲]

Detailed reference viewed: 24 (0 ULg)
Full Text
Peer Reviewed
See detailPreliminary Analysis of the TCP Behavior in 802.16 Networks
Perez, Jesus Arturo,; Donnet, Benoît ULg; Bonaventure, Olivier

in 1st WEIRD Workshop on WiMAX, Wireless and Mobility (2007, May)

Currently, broadband wireless access is gaining a great deal of interest from the networking research community. Particularly, the recently standardized WiMAX presents interesting perspectives, notably ... [more ▼]

Currently, broadband wireless access is gaining a great deal of interest from the networking research community. Particularly, the recently standardized WiMAX presents interesting perspectives, notably due to its capacity to offer consistent bandwidth and therefore consistent QoS. However, the behavior of network protocols, such as TCP, has not been studied in detail in a WiMAX environment. This is a problem that could slow down the widespread deployment of WiMAX. In this paper, we present preliminary results of the performance of TCP in a pre-WiMAX network. We are interested in the RTT and the relationship between the delay and packet loss rate. We find that TCP presents an acceptable cyclic behavior but with a high percentage of packet loss, 6.2%. We further notice some burst packet losses that vary in size and duration. Some of these bursts correspond to a packet loss rate of 100% during periods of up to one second. [less ▲]

Detailed reference viewed: 151 (0 ULg)
Full Text
Peer Reviewed
See detailIncreasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Donnet, Benoît ULg; Huffaker, Bradley; Friedman, Timur et al

in Proceedings IFIP/TC6 Networking (2007, May)

Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost as many nodes and links ... [more ▼]

Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost as many nodes and links while strongly reducing the quantity of probes sent. This paper examines the problem of the nodes and links missed by Doubletree. In particular, this paper's first contribution is to carefully describe properties of the nodes and links that Doubletree fails to discover. We explain incomplete coverage as a consequence of the way Doubletree models the network: a tree-like structure of routes. But routes do not strictly form trees, due to load balancing and routing changes. This paper's second contribution is the Windowed Doubletree algorithm, which increases Doubletree's coverage up to 16% without increasing its load. Compared to classic Doubletree, Windowed Doubletree does not start probing at a fixed hop distance from each monitor, but randomly picks a value from a range of possible values. [less ▲]

Detailed reference viewed: 10 (1 ULg)
Full Text
Peer Reviewed
See detailA Reputation-Based Approach for Securing Vivaldi Embedding System
Saucez, Damien; Donnet, Benoît ULg; Bonaventure, Olivier

in 13th Conference on Dependable and Adaptable Networks and Services (2007)

Many large-scale Internet applications optimize their overlay network to reduce latencies. Embedding coordinate systems like Vivaldi are valuable tools for this new range of applications since they ... [more ▼]

Many large-scale Internet applications optimize their overlay network to reduce latencies. Embedding coordinate systems like Vivaldi are valuable tools for this new range of applications since they propose light-weight algorithms that permit to estimate the latency between any pair of nodes without having to contact them first. It has been recently demonstrated that coordinate systems in general and Vivaldi in particular are sensible to attacks. Typically, nodes can lie about their coordinate and distort the coordinate space. In this paper, we propose a formal reputation model to detect misbehaving nodes and propose a reputation adaptation of Vivaldi called RVivaldi. We evaluate the performance of RVivaldi using the King dataset and show that RVivaldi is less sensitive to malicious nodes than Vivaldi. [less ▲]

Detailed reference viewed: 2 (0 ULg)
Full Text
Peer Reviewed
See detailDeployment of an Algorithm for Large-Scale Topology Discovery
Donnet, Benoît ULg; Raoult, Philippe; Friedman, Timur et al

in IEEE Journal on Selected Areas In Communications (2006), 24(12), 2210--2220

Topology discovery systems are starting to be in- troduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the problem of how to perform such ... [more ▼]

Topology discovery systems are starting to be in- troduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the problem of how to perform such measurements efficiently and in a network-friendly manner. This paper describes several contributions towards that end. These were first presented in the proceedings of ACM SIGMETRICS 2005. We show that standard topology discovery methods (e.g., skitter) are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to resemble DDoS attacks. We propose two metrics focusing on redundancy in probing and show that both are important. We also propose and evaluate Doubletree, an algorithm that strongly reduces redundancy while maintaining nearly the same level of node and link coverage. The key ideas are to exploit the tree-like structure of routes to and from a single point in order to guide when to stop probing, and to probe each path by starting near its midpoint. Following the SIGMETRICS work, we implemented Doubletree, and deployed it in a real network environment. This paper describes that implementation, as well as preliminary favorable results. [less ▲]

Detailed reference viewed: 16 (6 ULg)
Full Text
Peer Reviewed
See detailRetouched Bloom Filters: Allowing Networked Applications to Flexibly Trade Off False Positives Against False Negatives
Donnet, Benoît ULg; Baynat, Bruno; Friedman, Timur

in ACM CoNEXT (2006, December)

Where distributed agents must share voluminous set mem- bership information, Bloom filters provide a compact, though lossy, way for them to do so. Numerous recent networking papers have examined the trade ... [more ▼]

Where distributed agents must share voluminous set mem- bership information, Bloom filters provide a compact, though lossy, way for them to do so. Numerous recent networking papers have examined the trade-offs between the bandwidth consumed by the transmission of Bloom filters, and the er- ror rate, which takes the form of false positives, and which rises the more the filters are compressed. In this paper, we introduce the retouched Bloom filter (RBF), an extension that makes the Bloom filter more flexible by permitting the removal of selected false positives at the expense of gen- erating random false negatives. We analytically show that RBFs created through a random process maintain an overall error rate, expressed as a combination of the false positive rate and the false negative rate, that is equal to the false positive rate of the corresponding Bloom filters. We further provide some simple heuristics that decrease the false posi- tive rate more than than the corresponding increase in the false negative rate, when creating RBFs. Finally, we demon- strate the advantages of an RBF over a Bloom filter in a dis- tributed network topology measurement application, where information about large stop sets must be shared among route tracing monitors. [less ▲]

Detailed reference viewed: 18 (2 ULg)
Full Text
Peer Reviewed
See detailApproche Récursive d'Etiquetage des Chemins Alternatifs au Niveau IP
Donnet, Benoît ULg; Huffaker, Bradley; Friedman, Timur, et al

in Colloque Francophone d'Ingénierie des Protocoles (2006, October)

Un diamant correspond à l'existence de plusieurs chemins alternatifs entre deux points du réseau. Cette notion joue un rôle important en ingénierie du trafic où il faut, par exemple, répartir la charge de ... [more ▼]

Un diamant correspond à l'existence de plusieurs chemins alternatifs entre deux points du réseau. Cette notion joue un rôle important en ingénierie du trafic où il faut, par exemple, répartir la charge de trafic entre plusieurs chemins. Ces diamants peuvent être présents au niveau SA ou au niveau IP. Cet article s'intéresse au niveau IP et propose une méthode récursive d'étiquetage des diamants, RLPA. Nous avons appliqué RLPA sur un sous-ensemble des données skitter. Nous montrons, sur le sous-ensemble observé, que les diamants sont majoritairement composés d'un seul noeud intermédiaire, qu'ils sont formés de deux chemins alternatifs, qu'ils sont essentiellement symétriques et qu'ils se situent entre 10 et 15 sauts de la source du traceroute. [less ▲]

Detailed reference viewed: 7 (3 ULg)