Results 1 
8 of
8
Concepts of Exact Qos Routing Algorithms
 IEEE/ACM Transactions on Networking
, 2004
"... Abstract—The underlying concepts of an exact QoS routing algorithm are explained. We show that these four concepts, namely 1) nonlinear definition of the path length; 2) ashortest path approach; 3) nondominance; and 4) lookahead, are fundamental building blocks of a multiconstrained routing algori ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
Abstract—The underlying concepts of an exact QoS routing algorithm are explained. We show that these four concepts, namely 1) nonlinear definition of the path length; 2) ashortest path approach; 3) nondominance; and 4) lookahead, are fundamental building blocks of a multiconstrained routing algorithm. The main reasons to consider exact multiconstrained routing algorithms are as follows. First, the NPcomplete behavior seems only to occur in specially constructed graphs, which are unlikely to occur in realistic communication networks. Second, there exist exact algorithms that are equally complex as heuristics in algorithmic structure and in running time on topologies that do not induce NPcomplete behavior. Third, by simply restricting the number of paths explored during the path computation, the computational complexity can be decreased at the expense of possibly loosing exactness. The presented four concepts are incorporated in SAMCRA, a selfadaptive multiple constraints routing algorithm. Index Terms—Lookahead, path dominance, QoS routing, shortest path.
Information bounds are weak in the shortest distance problem
 J. ACM
, 1980
"... ASSTRACT. In the allpair shortest distance problem, one computes the matrix D = (du), where dq is the minimum weighted length of any path from vertex i to vertexj in a directed complete graph with a weight on each edge. In all the known algorithms, a shortest path p, ~ achieving di./is also implici ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
ASSTRACT. In the allpair shortest distance problem, one computes the matrix D = (du), where dq is the minimum weighted length of any path from vertex i to vertexj in a directed complete graph with a weight on each edge. In all the known algorithms, a shortest path p, ~ achieving di./is also implicitly computed. In fact, logs(f (n)) is an informationtheoretic lower bound, wheref(n) is the total number of distinct patterns (Po) for nvertex graphs. As f(n) potentially can be as large as 2":', it would appear possible that a nontrivial lower bound can be derived this way in the decision tree model. The characterization and enumeration of realizable patterns is studied, and it is shown thatf(n) < C "~. Thus no lower bound greater than Cn 2 can be derived from this approach. It is proved as a corollary that the Triangular polyhedron T ~"~, defined in E ¢~' ~ by d,j> 0 and the triangle inequalities d~j + dik> d,k, has at most C" ' faces of all dimensions, thus resolving an open question in a similar information bound approach to the shortest distance problem.
SpeedUp Techniques for ShortestPath Computations
 IN PROCEEDINGS OF THE 24TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS’07
, 2007
"... During the last years, several speedup techniques for Dijkstra’s algorithm have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
During the last years, several speedup techniques for Dijkstra’s algorithm have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can be used to prune or guide the search. Timetable information in public transport is a traditional application domain for such techniques. In this paper, we provide a condensed overview of new developments and extensions of classic results. Furthermore, we discuss how combinations of speedup techniques can be realized to take advantage from different strategies.
Finding realvalued singlesource shortest paths in o(n³) expected time
 J. ALGORITHMS
, 1998
"... Given an nvertex, medge directed network G with real costs on the edges and a designated source vertex s, we give a new algorithm to compute shortest paths from s. Our algorithm is a simple deterministic one with O(n² log n) expected running time over a large class of input distributions. This is ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Given an nvertex, medge directed network G with real costs on the edges and a designated source vertex s, we give a new algorithm to compute shortest paths from s. Our algorithm is a simple deterministic one with O(n² log n) expected running time over a large class of input distributions. This is the first strongly polynomial algorithm in over 35 years to improve upon some aspect of the O(nm) running time of the BellmanFord algorithm. The result extends to an O(n² log n) expected running time algorithm for finding the minimum mean cycle, an improvement over Karp's O(nm) worstcase time bound when the underlying graph is dense. Both of our time bounds are shown to be achieved with high probability.
Exact and Approximation Algorithms for Network Flow and DisjointPath Problems
, 1998
"... Network flow problems form a core area of Combinatorial Optimization. Their significance arises both from their very large number of applications and their theoretical importance. This thesis focuses on efficient exact algorithms for network flow problems in P and on approximation algorithms for NP ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Network flow problems form a core area of Combinatorial Optimization. Their significance arises both from their very large number of applications and their theoretical importance. This thesis focuses on efficient exact algorithms for network flow problems in P and on approximation algorithms for NP hard variants such as disjoint paths and unsplittable flow. Given an nvertex
Three Drexel Information Science Research Studies
, 1967
"... AND ITS APPLICATION TO BIOMEDICAL LITERATURE F. Lunin . . . . . . 47 I ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
AND ITS APPLICATION TO BIOMEDICAL LITERATURE F. Lunin . . . . . . 47 I
Development and Testing of Dynamic Traffic Assignment . . .
, 1994
"... This report describes the methodologies and procedures developed through a contract to the University of Texas at Austin, in collaboration with the University of Maryland, to address these essential needs. Specifically, a simulationassignment methodology has been developed to describe user's path ..."
Abstract
 Add to MetaCart
This report describes the methodologies and procedures developed through a contract to the University of Texas at Austin, in collaboration with the University of Maryland, to address these essential needs. Specifically, a simulationassignment methodology has been developed to describe user's path choices in the network in response to realtime information, and the resulting flow patterns that propagate through the network, yielding information about overall quality of service and effectiveness, as well as localized information pointing to problem spots and opportunities for improvement. This methodology is intended for use offline for evaluation purposes, or online for prediction purpose in support of advanced traffic management functions. In additional, algorithmic procedures have been developed to determine the best paths to which users should be directed so as to optimize overall system performance. Powerful extension
Bellman Ford Algorithm 1
"... Abstract: There exit several high speed computation applications that requires minimum distance computation between nodes in weighted graph. Dedicated techniques exist for this purpose are called as shortest path computation. Depending upon need of application, there are three type of shortest path ..."
Abstract
 Add to MetaCart
Abstract: There exit several high speed computation applications that requires minimum distance computation between nodes in weighted graph. Dedicated techniques exist for this purpose are called as shortest path computation. Depending upon need of application, there are three type of shortest path problems; Single Source Shortest Path (SSSP), Single Destination Shortest Path (SDSP) and All Pair Shortest Path (APSP). For Single source shortest path computation Bellman Ford Algorithm provides most efficient results. This paper present verilog implementation of Bellman Ford algorithm for determination of shortest path between one node to all other nodes of graph. This implementation leads to the hardware implementation of Bellman ford algorithm which is not possible with existing implementation.