552 search results - page 88 / 111 » Constrained Shortest Path Computation |
ICNP
1998
IEEE
15 years 1 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.
15 years 1 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
15 years 1 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
14 years 11 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...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...