Displaying similar documents to “Multiple routing strategies in a labelled network”

The maximum capacity shortest path problem : generation of efficient solution sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)

RAIRO - Operations Research

Similarity:

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...

Efficient algorithms for minimal disjoint path problems on chordal graphs

C.P. Gopalakrishnan, C.R. Satyan, C. Pandu Rangan (1995)

Discussiones Mathematicae Graph Theory

Similarity:

Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. The problem of finding minimum delay disjoint paths in a network directly reduces to the problem of finding the minimal disjoint paths in the graph which models the network. Previous results for this problem on chordal graphs were an O(|V| |E|²) algorithm for 2 edge disjoint paths and an O(|V| |E|) algorithm for 2 vertex disjoint paths. In this paper, we give an O(|V| |E|)...

The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks

Krzysztof Walkowiak (2002)

International Journal of Applied Mathematics and Computer Science

Similarity:

Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented...

Multiple Routing Strategies in a Labelled Network

J. Maublanc, D. Peyrton, A. Quilliot (2010)

RAIRO - Operations Research

Similarity:

We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.