Sciweavers

49 search results - page 5 / 10
» Optimal-Complexity Optical Router
Sort
View
CCR
2005
103views more  CCR 2005»
13 years 7 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
ICC
2008
IEEE
14 years 2 months ago
Multiple-Hop Routing in Ultrafast All-Optical Packet Switching Network Using Multiple PPM Routing Tables
—In this paper we present the modeling and simulation of multiple-hop routing in ultrafast all-optical packet switching based routers employing multiple pulse position modulation...
Ming-Feng Chiang, Fary Ghassemlooy, Wai Pang Ng, H...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 2 months ago
A Distributed Scheduling Algorithm for an Optical Switching Fabric
— Designing switching architectures for network routers and switches needs to consider limits imposed by the electronic technology, like small bandwidth×distance factors, power ...
Andrea Bianco, Elisabetta Carta, Davide Cuda, Jorg...
HPCC
2007
Springer
14 years 1 months ago
Systolic Routing in an Optical Ring with Logarithmic Shortcuts
Abstract. We present an all-optical ring network architecture with logarithmic shortcuts and a systolic routing protocol for it. An r-dimensional optical ring network with logarith...
Risto Honkanen, Juha-Pekka Liimatainen
DAC
2004
ACM
14 years 1 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong