Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computing Traversal Times on Dynamic Markovian Paths   In source routing, a complete path is chosen for a packet to travel from
source to destination. While computing the time to traverse such a path may be
straightforward in a fixed, static graph, doing so becomes much more
challenging in dynamic graphs, in which the state of an edge in one time slot
(i.e., its presence or absence) is random, and may depend on its state in the
previous time step. The traversal time is due to both time spent waiting for
edges to appear and time spent crossing them once they become available. We
compute the expected traversal time (ETT) for a dynamic path in a number of
special cases of stochastic edge dynamics models, and for three edge failure
models, culminating in a surprisingly challenging yet realistic setting in
which the initial configuration of edge states for the entire path is known. We
show that the ETT for this "initial configuration" setting can be computed in
quadratic time, by an algorithm based on probability generating functions. We
also give several linear-time upper and lower bounds on the ETT.

12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
34
The categories of this paper are: chem-ph
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
16
The categories of this paper are: stat
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex