Sciweavers

1016 search results - page 157 / 204
» Optimized algorithms for multi-agent routing
Sort
View
SIGCOMM
2005
ACM
15 years 3 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
FPGA
2004
ACM
126views FPGA» more  FPGA 2004»
15 years 3 months ago
A synthesis oriented omniscient manual editor
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
Tomasz S. Czajkowski, Jonathan Rose
NETWORKING
2010
14 years 11 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
84
Voted
IAT
2005
IEEE
15 years 3 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi
JSAC
2006
174views more  JSAC 2006»
14 years 9 months ago
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations
Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheles...
Yajian Liu, Reza Hoshyar, X. Yang, Rahim Tafazolli