Sciweavers

155 search results - page 2 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
NETWORKS
2008
13 years 6 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ICNP
1999
IEEE
13 years 10 months ago
Policy Disputes in Path-Vector Protocols
The Border Gateway Protocol, BGP, is currently the only interdomain routing protocol employed on the Internet. As required of any interdomain protocol, BGP allows policy-based met...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
JUCS
2010
118views more  JUCS 2010»
13 years 4 months ago
Reachability in Restricted Walk on Integers
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
Philip Ginzboorg, Valtteri Niemi
ICCSA
2004
Springer
13 years 11 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
ICN
2005
Springer
13 years 11 months ago
Fault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiï¬...
Ngoc Chi Nguyen, Vo Dinh Minh Nhat, Sungyoung Lee