Scalability Enhancements for Connection-Oriented 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.
We present a new photon number resolving detector (PNR), the Parallel Nanowire Detector (PND), which uses spatial multiplexing on a subwavelength scale to provide a single electrical output proportional to the photon number. The basic structure of the PND ...
Recent detail-preserving shape deformation techniques are either based on a combination of multiresolution decomposition and variational bending energy minimization, or they manipulate differential coordinates and solve a Poisson system to obtain the defor ...
For original paper see Chlamtac et al. (IEEE/ACM Trans. Networking, vol.6, no.4, p.422-31, 1998 August). We prove that the buffer bound in the above paper, can be improved by using a modification of the proofs in the original paper together with so-called ...
When performing a tractography experiment it is essential to know whether a reconstructed tract results from the diffusion signal itself or from some random effect or noise. In this study, we introduce a way to associate to every connection a confidence le ...
Personal computing and communication devices such as computers, personal digital assistants (PDAs), and mobile phones are moving to their next generation in which the end user will be able to access a multitude of information with a single device either lo ...
We study the fairness of TCP Vegas. The latter is an alternative to the commonly used TCP Reno, and uses measures of the round trip time as feedback on congestion. We consider two cases that depend on the value of the two parameters alpha and beta controll ...
We consider a source that transmits information to a receiver by routing it over a communication network represented by a graph and examine rate benefits that finite complexity processing at the intermediate nodes may offer. We show that there exist config ...
We address the quantitative comparison of two basic connection schemes for on-chip communication, connection-oriented and connection-less, regarding their enforcement of a defined Quality-of-Service for the communication. For such comparison, we have built ...
We prove that the buffer bound in [CFZF98] can be improved, by using an extension of the so-called network calculus bounds. We also show that the delay bound in [CFZF98] is simply the sum of worst case queuing delays at all nodes along the path of a connec ...
