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

A Proposed System and Scheduling Algorithm for Grid based Indian Rural health Care

This paper focusses on proposing a system for grid based health care center. The paper dicusses the importance of health care center and grid computing. It also focusses on the proposed sytem architecture for the sys...

Perceiving TheMalevolent Sachet Fatalities

The open nature of the wireless medium leaves it vulnerable to intentional interferenceattacks, typically referred to as jamming. This intentional interference with wirelesstransmissions can be used as a launchpad for...

Survey, Classification and Future Direction for Packet Scheduling in 4G Networks to Provide Quality of Service

Packet scheduling is crucial in providing Quality of Service (QoS) at a network node. There is plenty of research related to QoS provisioning in fourth generation (4G) networks because wireless networks have shifted f...

Enhanced shortest Path and Query Response Time for Users in Location Based Service

The most important brave on answering live shortest paths is scalability, in terms of the number of clients and the amount of live traffic updates. An innovative and talented solution to the shortest path computation...

Secure and Privacy Approach in Mobile-Healthcare emergency Using PPSPC technique

In this paper, we proposing a secure and privacy-preserving opportunistic computing framework, called SPOC, for m-Healthcare emergency. With SPOC, smart phone resources including computing power and energy can be op...

Download PDF file
  • EP ID EP27501
  • DOI -
  • Views 310
  • 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