Sciweavers

552 search results - page 22 / 111
» Routing complexity of faulty networks
Sort
View
JCM
2006
72views more  JCM 2006»
13 years 8 months ago
QoS Routing with Bandwidth and Hop-Count Consideration: A Performance Perspective
QoS Routing has been studied to provide evidence that it can increase network utilization compared to routing that is insensitive to QoS traffic requirements. However, because of i...
Bo Peng, Andrew H. Kemp, Said Boussakta
CAL
2002
13 years 8 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
APWEB
2003
Springer
14 years 1 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...
INFOCOM
2008
IEEE
14 years 3 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
INFOCOM
2005
IEEE
14 years 2 months ago
Failure inferencing based fast rerouting for handling transient link and node failures
— With the emergence of Voice over IP and other real-time business applications, there is a growing demand for an IP network with high service availability. Unfortunately, in tod...
Zifei Zhong, Srihari Nelakuditi, Yinzhe Yu, Sanghw...