Survivable MApping Algorithm by Ring Trimming (SMART) for large IP-over-WDM networks
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.
A distributed algorithm comprises a collection of sequential-code entities, which are spread over different computers connected to a network. The process of designing a distributed algorithm is influenced by the assumptions we make on the computational env ...
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 ...
Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive-increase and multiplicative-decrease. We show that the source rates tend to be distributed in order to maximize an objective ...
With WDM networks, the failure of a single link or component may cause the simultaneous failure of several optical channels, potentially making impossible the restoration by rerouting in higher layers directly using the optical network (SDH, ATM, IP). To a ...
We are given a set script T = (T1, T2, . . . , Tk) of rooted binary trees, each Ti leaf-labeled by a subset L[Ti] C (1,2, . . . , n). If T is a tree on (1, 2, . . . , n), we let T|L denote the minimal subtree of T induced by the nodes of L and all their an ...
