Displaying similar documents to “Forecast horizon and planning horizon paths in time-indexed 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...

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of...

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.

The Variance Location Problem on a Network with Continuously distributed demand

Ma Cruz López de los Mozos, Juan A. Mesa (2010)

RAIRO - Operations Research

Similarity:

Most location problems on networks consider discrete nodal demand. However, for many problems, demands are better represented by continuous functions along the edges, in addition to nodal demands. Several papers consider the optimal location problem of one or more facilities when demands are continuously distributed along the network, and the objective function dealt with is the median one. Nevertheless, in location of public services it is desirable to use an equity criterion. One...

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...

Local dependency in networks

Miloš Kudělka, Šárka Zehnalová, Zdeněk Horák, Pavel Krömer, Václav Snášel (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network's nodes...