Concept

Réseau en anneau

Publications associées (81)

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

Minimum-energy broadcast in all-wireless networks: NP-Completeness and distribution issues

Jean-Pierre Hubaux, Christian Enz, Mario Cagalj

In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of the radio transmissio ...

2002

The total demand scale: A new measure of quality for static and dynamic origin-destination trip tables

Michel Bierlaire

We propose a measure of quality for OD trip tables estimated from link counts. This measure, called the total demand scale is based only on the estimated OD trip table and on the assignment matrix used to estimate it. It is independent of the OD estimation ...

2002

Security Management in Data Processing Networks

Sonja Buchegger

NOVELTY - An event received by a node, from a neighboring node, in the network is evaluated, to determine whether the event satisfies predetermined security test. The entry associated with the neighboring node in the topology data is modified, if the event ...

2002

A Proven Delay Bound for a Network with Aggregate Scheduling

Jean-Yves Le Boudec

We consider a network implementing scheduling per aggregate flow. We show that the derivation of bounds that was published in [1] is false. We give a worst case bound which is valid for any network topology, given the maximum hop count for every flow and t ...

2000

A Delay Bound for a Network with Aggregate Scheduling

Jean-Yves Le Boudec, Félix Farkas

Given the increasing demand for services that can guarantee a maximum end-to-end delay in the Internet, it is important to understand the behaviour of different existing networks. We consider networks that implement scheduling per aggregate flow. We give a ...

2000

Fault Localization at the WDM Layer

Jean-Yves Le Boudec, Patrick Thiran, Carmen Mas

A single failure in a communication network may trigger many alarms. When the communication network uses optical fibres as transmission medium and increases its capacity by using Wavelength Division Multiplexing (WDM), the number of alarms and the difficul ...

1999

Fault Localization at the WDM Layer

Jean-Yves Le Boudec, Patrick Thiran, Carmen Mas

We propose an Alarm Filtering Algorithm (AFA) for the fault management of an optical network that supports multiple failures and works in the presence of passive elements, that is, network elements which may fail but never generate an alarm (e.g. optical f ...

1999

Fault Localization at the WDM layer

Jean-Yves Le Boudec, Patrick Thiran, Carmen Mas

1999

Fault Localisation for optical networks

Jean-Yves Le Boudec, Carmen Mas

A single failure in a communication network may trigger many alarms. When the communication network uses optical fibres as a transmission medium and increases its capacity by using Wavelength Division Multiplexing (WDM) and Space Division Multiplexing (SDM ...

1998

A Petri Net Model for FDDI

Nicoleta Sergent

Fiber Distributed Data Interface (FDDI) is a high speed local area network operating at 100Mbps using a fiber optic ring transmission medium. The purpose of this paper is to build a Petri net model for the FDDI media access control (MAC) protocol. This mod ...

1997