Sciweavers

48 search results - page 6 / 10
» Static and Dynamic Low-Congested Interval Routing Schemes
Sort
View
QUESTA
2006
101views more  QUESTA 2006»
14 years 9 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
INFOCOM
2005
IEEE
15 years 3 months ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
CN
2004
163views more  CN 2004»
14 years 9 months ago
Highly reliable trust establishment scheme in ad hoc networks
Securing ad hoc networks in a fully self-organized way is effective and light-weight, but fails to accomplish trust initialization in many trust deficient scenarios. To overcome t...
Kui Ren, Tieyan Li, Zhiguo Wan, Feng Bao, Robert H...
INFOCOM
2003
IEEE
15 years 2 months ago
A Dynamic RWA Algorithm in a Wavelength-Routed All-Optical Network with Wavelength Converters
—Existing research demonstrated that an effective Routing and Wavelength Assignment (RWA) scheme and a wavelength converter placement algorithm are the two primary vehicles for i...
Xiaowen Chu, Bo Li
ICW
2005
IEEE
178views Communications» more  ICW 2005»
15 years 3 months ago
Adding Multi-Class Routing into the DiffServ Architecture
- To alleviate the problem of high priority traffic hogging of all the available network capacity and to optimize the network traffic in the DiffServ network, we introduce the mult...
Yin Wang, Raimo Kantola, Shuping Liu