Sciweavers

358 search results - page 14 / 72
» A Computational Study of Routing Algorithms for Realistic Tr...
Sort
View
TON
2010
158views more  TON 2010»
13 years 6 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
TAMC
2009
Springer
14 years 3 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
COR
2011
13 years 3 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
MASCOTS
2008
13 years 10 months ago
Optimal Layered Multicast with Network Coding: Mathematical Model and Empirical Studies
Abstract--Recent advances in network coding research dramatically changed the underlying structure of optimal multicast routing algorithms and made them efficiently computable. Whi...
Ajay Gopinathan, Zongpeng Li
PADS
2006
ACM
14 years 2 months ago
Modeling Autonomous-System Relationships
The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocol...
Xenofontas A. Dimitropoulos, George F. Riley