Concept

Spanning Tree Protocol

Publications associées (67)

Reconstructing Loopy Curvilinear Structures Using Integer Programming

Pascal Fua, Engin Türetken, Fethallah Benmansour

We propose a novel approach to automated delineation of linear structures that form complex and potentially loopy networks. This is in contrast to earlier approaches that usually assume a tree topology for the networks. At the heart of our method is an Int ...

Ieee2013

On the Asymptotic Validity of the Decoupling Assumption for Analyzing 802.11 MAC Protocol

Jean-Yves Le Boudec

Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. This decoupling assumption results from mean field convergence and is gen ...

Institute of Electrical and Electronics Engineers2012

Hydrologic Activity of Deciduous Agroforestry Tree Observed through Monitoring of Stable Isotopes in Stem Water, Solar Radiation Attenuation, and Sapflow

Marc Parlange, Natalie Claire Ceperley, Theophile Mande

The net benefit of agroforestry trees for small scale farmers in dryland agricultural systems is debatable because while they provide significant direct and indirect services, they also consume considerable amounts of scare water resources. In this study w ...

2012

Maximum likelihood estimation for multiple-source losss tomography with network coding

Christina Fragouli

Loss tomography aims at inferring the loss rate of links in a network from end-to-end measurements. Previous work in [1] has developed optimal maximum likelihood estimators (MLEs) for link loss rates in a single-source multicast tree. However, only sub-opt ...

2011

Valuable Detours: Least-Cost Anypath Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

2011

Stable routing under the Spanning Tree Protocol

Laura Sanità

The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we design efficient algorithms to compute polynomial-size integer weights so as t ...

Elsevier2010

Practical issues in the development of a minimalistic power management solution for WSNs

Jorge Miguel Dias Almeida Rodrigues Soares

A flexible Wireless Sensor Network platform for implementation of diverse applications has been developed and deployed at Instituto Superior Técnico - Technical University of Lisbon (IST-TUL). Since its initial deployment in 2007, this testbed has grown st ...

2010

On the Validity of the Fixed Point Equation and Decoupling Assumption for Analyzing the 802.11 MAC Protocol

Jean-Yves Le Boudec

Abstract—Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. A necessary condition for the validity of this approach is the e ...

2010

On the validity of the fixed point equation and decoupling assumption for analyzing the 802.11 MAC protocol

Jean-Yves Le Boudec

Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. A necessary condition for the validity of this approach is the existence ...

2010

Local restoration for trees and arborescences

Laura Sanità

Protocols belonging to the Spanning Tree Protocol (STP) route traffic demands on tree topologies that are evaluated through shortest path procedures. In this paper we deal with the problem of assigning costs to the arcs of a network in order to guarantee t ...

Springer Berlin / Heidelberg2009

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search