467 search results - page 77 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
WG
2004
Springer
14 years 2 days ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
ICNP
1998
IEEE
13 years 11 months ago
1998
IEEE
The JiNao project at MCNC/NCSU focuses on detecting intrusions, especially insider attacks, against OSPF (Open Shortest Path First) routing protocol. This paper presents the imple...
ICS
1994
Tsinghua U.
13 years 10 months ago
1994
Tsinghua U.
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
ICDCS
2010
IEEE
13 years 10 months ago
2010
IEEE
—This paper presents the CONTRACT framework to address a fundamental deficiency of the IP network control plane, namely the lack of coordination between an IGP and other control...
AINA
2008
IEEE
13 years 8 months ago
2008
IEEE
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...