We propose a different reflection-based technique, named efficient neighbor channel reservation, where a contending burst is reflected from a suitable neighbor node and then resumes its original path. Our proposed scheme does not use any extra hardware and addresses several limitations of other schemes including: (a) eliminating the use of bulky fiber delay lines, (b) avoiding complexity required with burst segmentation, (c) preventing resource wastage that occurs with prereservation schemes, and (d) preventing loop formation inherent in most deflection routing schemes.
In this paper, we discuss the Passive Optical Network deployment on an arbitrary grid with guaranteed tolerance towards <i>p</i>-1 equipment failure. We show that this problem in general is NP-hard. We propose an algorithm, which guarantees a solution of 4-approximation to the optimal deployment, and further argue that this is the best lower bound achievable in our case. We do comparative studied with randomized layouts, were our proposed algorithm saves 45% - 55% deployment cost (fiber, equipment, etc.) on average.
Smart Dust particles, are small smart materials used for generating weather maps. We investigate question of the optimal number of Smart Dust particles necessary for generating precise, computationally feasible and cost effective 3-D weather maps. We also give an optimal matching algorithm for the generalized scenario, when there are N Smart Dust particles and M ground receivers.