Sciweavers

47 search results - page 5 / 10
» Deadlock-Free Routing Based on Ordered Links
Sort
View
LCN
2008
IEEE
14 years 2 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...
TCAD
2010
105views more  TCAD 2010»
13 years 3 months ago
Fault Tolerant Network on Chip Switching With Graceful Performance Degradation
The structural redundancy inherent to on-chip interconnection networks [networks on chip (NoC)] can be exploited by adaptive routing algorithms in order to provide connectivity eve...
Adán Kohler, Gert Schley, Martin Radetzki
BROADNETS
2006
IEEE
14 years 2 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
ICCCN
2008
IEEE
14 years 3 months ago
Improving Load Balancing with Multipath Routing
— Internet service providers have to provision network resources to optimize bandwidth utilization. Dynamic routing protocols take traffic variations into account to control the...
Pascal Mérindol, Jean-Jacques Pansiot, St&e...
AIMS
2007
Springer
14 years 2 months ago
RAQNet: A Topology-Aware Overlay Network
Peer-to-peer overlay networks provide a useful infrastructure for building distributed applications. These networks provide efficient and fault-tolerant routing and object locating...
Seyed Iman Mirrezaei, Javad Shahparian, Mohammad G...