410 search results - page 15 / 82 » Upgrading Shortest Paths in Networks |
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
139
click to vote
EMMCVPR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
127
click to vote
ICALT
2006
IEEE
15 years 7 months ago
2006
IEEE
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
168
click to vote
HICSS
2012
IEEE
13 years 9 months ago
2012
IEEE
—The selection of a path in a network from one node to another is performed by a routing protocol, often using the shortest path approach. However, it has been shown that in wire...
109
click to vote
CNSR
2010
IEEE
15 years 5 months ago
2010
IEEE
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...