Skip to search formSkip to main contentSkip to account menu

Link scheduling in polynomial time

TLDR
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.
View via Publisher (opens in a new tab)

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

TLDR
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.
View on IEEE (opens in a new tab)

Multiwavelength optical networks with limited wavelength conversion

TLDR
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.
View on ACM (opens in a new tab)

Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings

TLDR
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.
View on IEEE (opens in a new tab)

Combined WDM and SONET network design

TLDR
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.
View on IEEE (opens in a new tab)

Quality of protection (QoP): a quantitative unifying paradigm to protection service grades

  • O. GerstelG. Sasaki
  • Computer Science
    OptiComm: Optical Networking and Communications…
  • 9 August 2001
TLDR
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.
View on SPIE (opens in a new tab)

Scheduling transmissions in WDM broadcast-and-select networks

TLDR
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.
View on ACM (opens in a new tab)

Wireless sensor placement for reliable and efficient data collection

  • E. BiagioniG. Sasaki
  • Computer Science
    36th Annual Hawaii International Conference on…
  • 6 January 2003
TLDR
A variety of regular deployment topologies are presented, including circular and star deployments as well as deployments in square, triangular, and hexagonal grids.
View on IEEE (opens in a new tab)

The time complexity of maximum matching by simulated annealing

TLDR
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.
View on ACM (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)