Share This Author
Link scheduling in polynomial time
Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network that jointly meet a prespecified end-to-end demand and has the smallest possible length.
Optical Networks: A Practical Perspective, 3rd Edition
Fiber-optic networking, on both small and large scales, has lots of advantages over traditional wire and wireless networks. First, optical signals can travel enormous distances without the need for…
Cost effective traffic grooming in WDM rings
- O. Gerstel, R. Ramaswami, G. Sasaki
- Business, PhysicsProceedings. IEEE INFOCOM '98, the Conference on…
- 29 March 1998
Two other OWDM ring networks are considered that are nonblocking, where one has a wide sense non blocking property and the other has a rearrangeably nonblocking property, which are compared using the cost criteria of number of wavelengths and number of transceivers.
Multiwavelength optical networks with limited wavelength conversion
These results show that significant improvements in traffic-carrying capacity can be obtained in WDM network by providing a very limited wavelength conversion capability within the network.
Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings
- O. Gerstel, P. Lin, G. Sasaki
- Computer ScienceProceedings. IEEE INFOCOM '98, the Conference on…
- 29 March 1998
It is argued that the first-order optimization goal should be to minimize the overall network cost which is dominated by the number of required ADMs and not the numberOf wavelengths, and a set of transformations that take any WLA and improve its cost is presented.
Combined WDM and SONET network design
The paper attempts to enumerate the architectural options provided by SONET to arrive at a cost-effective solution, including unidirectional path-switched rings (UPSR) and bidirectional line-switches rings (BLSR), use of back-to-back connections between SONet ADMs to reduce the overall cost, and use of different ring speeds.
Quality of protection (QoP): a quantitative unifying paradigm to protection service grades
A quantitative framework for best- effort protection of the optical layer is discussed, providing a way to bridge the gap between two known protection grades of fully protected connections vis-a-vis unprotected protection.
Scheduling transmissions in WDM broadcast-and-select networks
The authors consider all-to-all transmission schedules, which are defined to be ones that schedule a packet transmission between each input-output pair, and present upper and lower bounds for the minimum length of such schedules.
Wireless sensor placement for reliable and efficient data collection
A variety of regular deployment topologies are presented, including circular and star deployments as well as deployments in square, triangular, and hexagonal grids.
The time complexity of maximum matching by simulated annealing
It is shown for arbitrary graphs that a degenerate form of the basic annealing algorithm (obtained by letting “temperature” be a suitably chosen constant) produces matchings with nearly maximum cardinality in polynomial average time.