Sciweavers

107 search results - page 17 / 22
» On Balancing Delay and Cost for Routing Paths
Sort
View
FPGA
2000
ACM
119views FPGA» more  FPGA 2000»
15 years 3 months ago
Timing-driven placement for FPGAs
In this paper we introduce a new Simulated Annealingbased timing-driven placement algorithm for FPGAs. This paper has three main contributions. First, our algorithm employs a nove...
Alexander Marquardt, Vaughn Betz, Jonathan Rose
IPPS
2005
IEEE
15 years 5 months ago
Dynamic RWA Based on the Combination of Mobile Agents Technique and Genetic Algorithm in WDM Networks with Sparse Wavelength Con
In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile ag...
Vinh Trong Le, Xiaohong Jiang, Son-Hong Ngo, Susum...
TR
2008
107views more  TR 2008»
14 years 11 months ago
A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
János Tapolcai, Pin-Han Ho, Dominique Verch...
ICPP
1998
IEEE
15 years 4 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
GLOBECOM
2007
IEEE
15 years 6 months ago
Heuristics for the Design and Optimization of Streaming Content Distribution Networks
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
Sandjai Bhulai, Robert D. van der Mei, Mengxiao Wu