Publication

Liquid schedule searching strategies for the optimization of collective network communications

Related publications (41)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

An efficient algorithm for locating soft and hard failures in WDM networks

Patrick Thiran, Carmen Mas

Fault identification and location in optical networks is hampered by a multitude of factors: (i) the redundancy and the lack of coordination (internetworking) of the managements at the different layers (WDM, SDH/SONET, ATM, IP) ...

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

1999

Distance transformations: fast algorithms and applications to medical image processing

Olivier Cuisenaire

Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...

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

Fast and exact signed Euclidean distance transformation with linear complexity

Olivier Cuisenaire, Benoît Macq

We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson. Those corrections are only applied to a small neighborhood of a small subset of pixels from the ...

IEEE1999

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

An Alarm Filtering Algorithm For Optical Communication Networks

Jean-Yves Le Boudec, Carmen Mas

A single failure in a communication network can trigger many alarms. We propose an alarm filtering algorithm for the management of an optical network using Wavelength Division Multiplexing (WDM). The algorithm supports: (i) multiple failures and (ii) passi ...

1997

An Alarm Filtering Algorithm for Optical Communication Networks

Jean-Yves Le Boudec, Carmen Mas

1997

Finding all common bases in two matroids

In this paper, we present an algorithm for finding all common bases in two matroids. Our algorithm lists all common bases by using pivot operations in such a way that each basis appears exactly once. The time complexity of the algorithm is O(n(n^2+t)§) whe ...

1995