Estimation of Complexity of the Regenerator Placement Problem in Optical Networks

Abstract

Placement of regenerators in optical networks has attracted the attention of recent research works in optical networks. In this problem, we are given a network with an underlying topology of a graph and with a set of requests that correspond to paths in . There is a need to put a regenerator every certain distance, because of a decrease in the power of the signal. In this paper, we investigate the problem of minimizing the number of locations to place the regenerators. We present analytical results regarding the complexity of this problem, in four cases, depending on whether or not there is a bound on the number of regenerators at each node, and depending on whether or not the routing is given or only the requests are given (and part of the solution is also to determine the actual routing). These results include polynomial time algorithms, NP-completeness results, approximation algorithms, and inapproximability results.

Authors and Affiliations

V V S NARAYANA MURTHY KAMINI, Kesana Kurthy, M Vamsi Krishna

Keywords

Related Articles

Design Of A Rceat Architecture For Detecting Multi- Bit Error In RFID

Radio Frequency Identification (RFID) plays an important role in Warehouse Management, especially during the automatic identification of items. Unfortunately, a warehouse environment has electromagnetic interferences...

EEG and Picture Based Brain Controlled Pic and Place Robot for Paralyzed Patients

This anticipate talked about around a cerebrum controlled biometric in light of Brain–computer interfaces (BCI). BCIs are frameworks that can sidestep traditional channels of correspondence (i.e., muscles and thought...

LACK OF TRAINING DATA IN SENTIMENT CLASSIFICATION: CURRENT SOLUTIONS

In recent years, sentiment classification has attracted much attention from natural language processing researchers. Most of researchers in this field consider sentiment classification as a supervised classification p...

Dynamic Authentication over Graphical Passwords using Visual Cryptography

CAPTCHA is a test build by computer programs which human can pass but computer programs cannot pass CAPTCHA as graphical passwords (CaRP) are a graphical password scheme used for a user access authentication. It is m...

Monitoring the efficiency of workflow in industry and secure access using NFC and Ethernet

Mobile phones have evolved from their usual function of calling to a lot more in the last decade, the 4G networks are being used for microwave access, But the use of mobile in field of Tele-monitoring is still a open...

Download PDF file
  • EP ID EP27501
  • DOI -
  • Views 363
  • Downloads 6

How To Cite

V V S NARAYANA MURTHY KAMINI, Kesana Kurthy, M Vamsi Krishna (2012). Estimation of Complexity of the Regenerator Placement Problem in Optical Networks. International Journal of Research in Computer and Communication Technology, 1(6), -. https://www.europub.co.uk/articles/-A-27501