Publication date
December 2014
DOI Publisher
IEEE Computer Society Journal
issn:1087-4089Abstract
2003-2004 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
2003-2004 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
Abstract. We obtain the following results related to dynamic versions of the shortest-paths problem:...
We address the problem of single-source shortest path computation in digraphs with non-negative edg...
MANET routing protocols are designed to scale up to thousands of routers with frequent changes of th...
Shortest path tree (SPT) construction is essential in high performance routing in an interior networ...
2004-2005 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
Previous approaches for the Shortest Path Tree (SPT) dynamic update are mainly focused on the case o...
Abstract — Implementing a high speed routing is important in the network. Each router has a database...
Abstract—Let G ðV;E; wÞ be a simple digraph, in which all edge weights are nonnegative real numbers...
Abstract. The problem of updating shortest paths in networks whose topology dynamically changes over...
Let G =(V,E,w) be a simple digraph, in which all edge weights are non-negative real numbers. Let G ′...
AbstractWe propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on...
Alternate paths may significantly improve reliability of routing protocols. We develop a fast altern...
Because most link-state routing protocols, such as OSPF arid IS-IS, calculate routes using the Dijks...
International audienceWe study the problem of dynamically updatingall-pairs shortest paths in a dist...
oai:ojs.journals.agh.edu.pl:article/4We address the problem of single-source shortest path computati...
Abstract. We obtain the following results related to dynamic versions of the shortest-paths problem:...
We address the problem of single-source shortest path computation in digraphs with non-negative edg...
MANET routing protocols are designed to scale up to thousands of routers with frequent changes of th...
Shortest path tree (SPT) construction is essential in high performance routing in an interior networ...
2004-2005 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe
Previous approaches for the Shortest Path Tree (SPT) dynamic update are mainly focused on the case o...
Abstract — Implementing a high speed routing is important in the network. Each router has a database...
Abstract—Let G ðV;E; wÞ be a simple digraph, in which all edge weights are nonnegative real numbers...
Abstract. The problem of updating shortest paths in networks whose topology dynamically changes over...
Let G =(V,E,w) be a simple digraph, in which all edge weights are non-negative real numbers. Let G ′...
AbstractWe propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on...
Alternate paths may significantly improve reliability of routing protocols. We develop a fast altern...
Because most link-state routing protocols, such as OSPF arid IS-IS, calculate routes using the Dijks...
International audienceWe study the problem of dynamically updatingall-pairs shortest paths in a dist...
oai:ojs.journals.agh.edu.pl:article/4We address the problem of single-source shortest path computati...
Abstract. We obtain the following results related to dynamic versions of the shortest-paths problem:...
We address the problem of single-source shortest path computation in digraphs with non-negative edg...
MANET routing protocols are designed to scale up to thousands of routers with frequent changes of th...
Add to ORKG