Estimation of Complexity of the Regenerator Placement Problem in Optical Networks
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2012, Vol 1, Issue 6
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
- EP ID EP27501
- DOI -
- Views 361
- Downloads 6
Mobile Phones Data Securely Stored in Cloud Using Hybrid Cryptographic Algorithm
The storage of data for handheld devices is an important issue. If the device is lost or damaged then the whole data inside the device will lost altogether. The data is equally important for the user so the data safet...
An Overview: Peak To Power Average Ratio reduction by Discrete Cosine Transform Selective Mapping
The OFDM is employed in many systems. The main the drawback of the OFDM systems is the high Peak to Power Average Ratio [PAPR].This paper deals with the basic idea of PAPR .The paper also describe in brief the differ...
(NCECD) A Novel Data Distribution Scheme for VoD Services in P2P Networks
Anonymizing networks such as Tor allow users to access internet services privately by using a series of routers to hide the client’s IP address from the server. The success of such networks However has been limited b...
Decentralized Probabilistic Text Clustering by using Distributed Hierarchical peer to peer Clustering
Document clustering (or text clustering) is the application of cluster analysis to textual documents. It has applications in automatic document organization, topic extraction and fast information retrieval or filteri...
Empowering the Privacy in Online Social Networks
Security is one of the converges that develops when correspondence get interceded in Online Social Networks (OSN) distinctive protection issues have been risen in the online interpersonal organization ,this paper cla...