Sciweavers

410 search results - page 53 / 82
» Upgrading Shortest Paths in Networks
Sort
View
ICDCS
1999
IEEE
15 years 5 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
ICNP
2007
IEEE
15 years 7 months ago
Geographically Informed Inter-Domain Routing
Abstract— We propose to add geographic location information into BGP routing updates to enable Geographically Informed Inter-Domain Routing (GIRO). GIRO departs from previous geo...
Ricardo V. Oliveira, Mohit Lad, Beichuan Zhang, Li...
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
15 years 1 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
WSC
2004
15 years 2 months ago
Decision Tree Module Within Decision Support Simulation System
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
Mohamed Moussa, Janaka Y. Ruwanpura, George Jergea...
LCN
2007
IEEE
15 years 7 months ago
Lightpath Reconfiguration in Regional IP-over-WDM Networks by a Centralized Control System
—Lightpath reconfiguration performance has been evaluated experimentally for regional IP-over-WDM network applications, making the network scalable and stable when traffic change...
Yutaka Katsuyama, Michio Hashimoto, Keiji Nishikaw...