118 search results - page 6 / 24 » The Performance of Routing Algorithms under Bursty Traffic L... |
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
ICNP
1997
IEEE
13 years 11 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
CCR
2002
13 years 7 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
KES
2000
Springer
13 years 11 months ago
2000
Springer
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
AHSWN
2010
13 years 7 months ago
2010
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...