Sciweavers

5079 search results - page 356 / 1016
» Hidden-Action in Network Routing
Sort
View
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
16 years 1 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
ICNS
2007
IEEE
16 years 1 months ago
Erlang Reduced Load Model for Optical Burst Switched Grids
—This paper presents an Erlang reduced load model to analyze Optical Burst Switched Grid networks. The model allows the evaluation of job blocking probabilities, in which blockin...
Marc De Leenheer, Chris Develder, Filip De Turck, ...
BIOSYSTEMS
2007
175views more  BIOSYSTEMS 2007»
15 years 7 months ago
Alternative routes and mutational robustness in complex regulatory networks
Alternative pathways through a gene regulation network connect a regulatory molecule to its (indirect) regulatory target via different intermediate regulators. We here show for tw...
Andreas Wagner, Jeremiah Wright
ICN
2009
Springer
16 years 2 months ago
Acquisition of Channel State Information for Routing Purposes in Relay-Based WiMAX Networks
— The paper focuses on multi-hop routing mechanism used in relay based WiMAX networks. The proposal how to acquire channel state information (CSI) on relay and access path for de...
Pavel Mach, Zdenek Becvar, Robert Bestak
IPCCC
2006
IEEE
16 years 1 months ago
Energy-efficient cooperative routing in multi-hop wireless ad hoc networks
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
Fulu Li, Kui Wu, Andrew Lippman