Network survivability is gaining increasing attention from the Internet research community.
The ubiquity of IP services has fueled increasing interest in ensuring their dependability, by …

The open shortest path first (OSPF) and IS-IS routing protocols widely used in today's
Internet compute a shortest path tree (SPT) from each router to other routers in a routing …

Network protocols must work. The effects of protocol specification or implementation errors
range from reduced performance, to security breaches, to bringing down entire networks …

A key functionality in today's widely used interior gateway routing protocols such as OSPF
and IS-IS involves the computation of a shortest path tree (SPT). In many existing …

We consider the problem of maintaining the topological order of a directed acyclic graph
(DAG) in the presence of edge insertions and deletions. We present a new algorithm and …

In recent years there has been an increasing move towards analyzing software programs
with the aid of model checking. In this tutorial we will focus on one of the first model checkers …

We consider the problem of maintaining the distances and the shortest paths from a single
source in either a directed or an undirected graph with positive real edge weights, handling …

In today's Internet, the shortest path tree (SPT) construction is an important issue in data
exchange. To forward a data packet, each router uses routing protocols and link state …

In recent years, real-time data mining for large-scale time-evolving graphs is becoming a hot
research topic. Most of the prior arts target relatively static graphs and also process them in …

We show how to maintain a shortest path tree of a general directed graph G with unit edge
weights and n vertices, during a sequence of edge deletions or a sequence of edge …