Sciweavers

177 search results - page 8 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
ISCA
2009
IEEE
186views Hardware» more  ISCA 2009»
14 years 2 months ago
Application-aware deadlock-free oblivious routing
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edwa...
DSOM
2006
Springer
13 years 11 months ago
Reconfiguring Self-stabilizing Publish/Subscribe Systems
Recent work on self-stabilizing routing in publish/subscribe systems showed that it is feasible to automate reconfigurations in case of faults by enabling the system to recover fro...
Michael A. Jaeger, Gero Mühl, Matthias Werner...
IPPS
2003
IEEE
14 years 1 months ago
A Low Cost Fault Tolerant Packet Routing for Parallel Computers
This work presents a new switching mechanism to tolerate arbitrary faults in interconnection networks with a negligible implementation cost. Although our routing technique can be ...
Valentin Puente, José A. Gregorio, Ram&oacu...
ISCC
2002
IEEE
14 years 20 days ago
Survivable routing in WDM networks
—In this paper we consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains ...
Arunabha Sen, Bin Hao, Bao Hong Shen
INFOCOM
2009
IEEE
14 years 2 months ago
Routing Over Multi-Hop Wireless Networks with Non-Ergodic Mobility
—Routing to mobile nodes in a wireless network is conventionally performed by associating a static IP address (or a geographic location) to each node, and routing to that address...
Chris Milling, Sundar Subramanian, Sanjay Shakkott...