118 search results - page 21 / 24 » Minimizing maximum fiber requirement in optical networks |
ICNP
2005
IEEE
14 years 2 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
DATE
1999
IEEE
14 years 22 days ago
1999
IEEE
Dynamically reconfigurable embedded systems offer potential for higher performance as well as adaptability to changing system requirements at low cost. Such systems employ run-tim...
TIT
2010
13 years 3 months ago
2010
Abstract-- In a relay network with a single sourcedestination pair, we examine the achievable rates with amplifyand-forward (AF) relaying strategy. Motivated by applications in sen...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...