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

Multi Dimensional Digital Radar for Collision Avoidance and Security

A proper remote sensing device is required to provide security and safety from unauthorized areas in case of trespassing or illegal usage of assets, private properties and to avoid collision in transportation system....

A method to predict the offloading potential for DTN and WIFI hotspots

An enormous amount of cellular data traffic has been produced by mobile users which exceeds the capacity of cellular network and hence weaken the network quality. The solution is to enhance the capacity of cellular n...

Representing Competent Revocable Data Access Influence for Multi-Authority Cloud Storage

Cloud computing is rising immensely because of its points of interest and the adaptable storage administrations provided by it. Because of this the quantity of clients has come to at the top. Clearly the clients will...

A Novel Symmetric Key Cryptography Algorithm for Improving Privacy of Data in Cloud Servers

In this paper, a cryptography technique, Novel Symmetric Key Cryptography algorithm is used to improve the data security and access control in the environment of Cloud Computing. The users upload the personal data ov...

Transmission Power Control in Wireless ad hoc Networks

In ad hoc wireless networks packets are relayed over multiple hops to reach their destination. In order to operate ad hoc networks several protocols, for media access control, power control, routing, and transport ar...

Download PDF file
  • EP ID EP27501
  • DOI -
  • Views 354
  • 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://europub.co.uk/articles/-A-27501