Sciweavers

1578 search results - page 21 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ATVA
2008
Springer
104views Hardware» more  ATVA 2008»
13 years 10 months ago
A Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
Jefferson O. Andrade, Yukiyoshi Kameyama
ACSC
2007
IEEE
14 years 3 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka
INFOCOM
2009
IEEE
14 years 3 months ago
Multi-VPN Optimization for Scalable Routing via Relaying
—Enterprise networks are increasingly adopting Layer 3 Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) technology to connect geographically disparate locations...
MohammadHossein Bateni, Alexandre Gerber, Mohammad...
ECUMN
2007
Springer
14 years 2 months ago
Path Computation for Incoming Interface Multipath Routing
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
Pascal Mérindol, Jean-Jacques Pansiot, St&e...
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
14 years 1 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain