Publication

A route pre-computation algorithm for integrated services networks

Jean-Yves Le Boudec
1995
Journal paper

Abstract

We provide an algorithm for computing best paths on a graph where edges have a multidimensional cost, one dimension representing delay, the others representing available capacity. Best paths are those which guarantee maximum capacity with least possible delay. The complexity of the algorithm is of the order of O(V3) in the bidimensional case, for a graph withV vertices. The results can be used for routing connections with guaranteed capacity in a communication network.

Official source

https://infoscience.epfl.ch/record/226?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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 route pre-computation algorithm for integrated services networks

Graph Chatbot

Chat with Graph Search

Maximum Independent Set: Self-Training through Dynamic Programming

Privatized graph federated learning

A full characterization of invariant embeddability of unimodular planar graphs

Maximum Independent Set: Self-Training through Dynamic Programming

A full characterization of invariant embeddability of unimodular planar graphs

Privatized graph federated learning