Sciweavers

410 search results - page 5 / 82
» Upgrading Shortest Paths in Networks
Sort
View
GLOBECOM
2007
IEEE
15 years 3 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
4OR
2010
148views more  4OR 2010»
14 years 10 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
JSAC
2006
108views more  JSAC 2006»
14 years 11 months ago
Distributed Utility Maximization for Network Coding Based Multicasting: A Shortest Path Approach
One central issue in practically deploying network coding is the adaptive and economic allocation of network resource. We cast this as an optimization, where the net-utility
Yunnan Wu, Sun-Yuan Kung
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
15 years 4 months ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
4OR
2005
104views more  4OR 2005»
14 years 11 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella