Sciweavers

2612 search results - page 237 / 523
» Switching Graphs and Their Complexity
Sort
View
BROADNETS
2006
IEEE
15 years 12 months ago
Minimum Rejection Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
Nahid Saberi, Mark Coates
DATE
2005
IEEE
143views Hardware» more  DATE 2005»
15 years 11 months ago
Energy Bounds for Fault-Tolerant Nanoscale Designs
- The problem of determining lower bounds for the energy cost of a given nanoscale design is addressed via a complexity theory-based approach. This paper provides a theoretical fra...
Diana Marculescu
ICOIN
2005
Springer
15 years 11 months ago
A Rerouting Scheme with Dynamic Control of Restoration Scope for Survivable MPLS Network
This paper proposes a rerouting scheme that can be applied to the restoration of working Label Switched Paths (LSPs) and preprovisioned backup LSPs, which consists of two subsequen...
Daniel Won-Kyu Hong, Choong Seon Hong
NPC
2004
Springer
15 years 11 months ago
Request Distribution for Fairness with a New Load-Update Mechanism in Web Server Cluster
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
MinHwan Ok, Myong-Soon Park
PATMOS
2004
Springer
15 years 11 months ago
Physical Extension of the Logical Effort Model
Abstract. The logical effort method has appeared very convenient for fast estimation and optimization of single paths. However it necessitates a calibration of all the gates of the...
B. Lasbouygues, Robin Wilson, Philippe Maurine, Na...