6 search results - page 1 / 2 » A simple proof for the constructions of optical priority que... |
QUESTA
2007
13 years 6 months ago
2007
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
SWAT
2004
Springer
14 years 22 days ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— To increase the availability of Free Space Network (FSO) networks, the optical link is provided with a redundant backup network, such as RF, to form a hybrid network. The immed...