Sciweavers

92 search results - page 5 / 19
» Restricted Shortest Path Routing with Concave Costs
Sort
View
ISCC
2006
IEEE
133views Communications» more  ISCC 2006»
14 years 1 months ago
Choosing Weights for IP Network Dimensioning Optimization
Often in Internet Protocol (IP) networks, links are assigned weights, and traffic demands are routed along shortest paths. Hence, these link weights are the parameters which dete...
Olivier Klopfenstein, Sebastien Mamy
MUE
2008
IEEE
137views Multimedia» more  MUE 2008»
14 years 1 months ago
Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...
Chu-Hsing Lin, Jui-Ling Yu, Jung-Chun Liu, Chia-Je...
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 2 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
LCN
2008
IEEE
14 years 1 months ago
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
Fen Zhou, Miklós Molnár, Bernard Cou...
TKDE
2002
239views more  TKDE 2002»
13 years 7 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik