Prim's Algorithm for Optimizing Fiber Optic Trajectory Planning (original) (raw)

Path Minimization Planning of Passive Optical Network using Algorithm for Sub-optimal Deployment of Optical Fiber Cable

2020

1S. K. Biswas is working in the Department of Electronics & Telecommunication Engineering, JIS School of Polytechnic, Kalyani, Pin-741235, India 2Amitava Podder is working in the Department of Computer Science and Technology, JIS School of Polytechnic, Kalyani, Pin-741235, India, ---------------------------------------------------------------------***---------------------------------------------------------------------Abstract Passive Optical Network (PON) is an ultimate solution for the modern communication technology which emphasize on faster, cheaper and more reliable communication system used as access network. The broadband service providers across the globe needs to drive down the complexity of components, time of installation, required skill set for installation and maintenance requirement which ultimately reduces the cost of overall deployment for an access network structure. PON shares one optical fiber with multiple subscribers by using a power splitter connected with diff...

IRJET- Path Minimization Planning of Passive Optical Network using Algorithm for Sub-optimal Deployment of Optical Fiber Cable

IRJET, 2020

Passive Optical Network (PON) is an ultimate solution for the modern communication technology which emphasize on faster, cheaper and more reliable communication system used as access network. The broadband service providers across the globe needs to drive down the complexity of components, time of installation, required skill set for installation and maintenance requirement which ultimately reduces the cost of overall deployment for an access network structure. PON shares one optical fiber with multiple subscribers by using a power splitter connected with different Optical Network Unit (ONU) situated to subscriber's premises. One of the main objective of PON network planning is to determine the optical cable path of a point-to-multipoint network which connects every subscriber to the central offices (COs) through power splitter(s) within a lower cost of deployment under practical restrictions, such as possible fiber paths, the splitting ratio of optical splitters and locations of splitters, when the locations of COs and subscribers are given. So here a plan is proposed to minimize the total path distance by avoiding the obstacle in the path of the fiber. Finally the deployment cost will minimize where all ONUs are connected to a Central Office (CO) through their nearest power splitter.

Implementation of Dynamic programing to find all pairs shortest path on fibre optics networks to produced optimized routing and virtual topology

Abstract: Optical fibre has been the main choice of communication medium for long-haul networks because of its low transmission loss and high capacity of the data rate. A fibre cable can transmit many channels simultaneously using wavelength Division multiplexing (WDM) technology. This makes possible to establish many different virtual topologies on top of the physical topology. In this paper, dynamic programming model has been developed to produce different sets of traffic matrices for finding shortest path from each source to different destinations. On which existing Heuristic logical design Algorithm (HLDA) is implemented to find shortest path by varying number of optical transceivers. A study is made on stage wise 4-node, 7-node and 14-node NSFNET traffic matrices and comparative study has been done on utilisation of Average Weighted hops and Wavelength.

Algorithmic aspects of optical network design

Optical network design problems fall in the broad category of network optimization problems. We give a short introduction on network optimization and general algorithmic techniques that can be used to solve complex and difficult network design problems. We apply these techniques to address the static Routing and Wavelength Assignment problem that is related to planning phase of a WDM optical network. We present simulation result to evaluate the performance of the proposed algorithmic solution.

A note on optical routing on trees

1997

Bandwidth is a very valuable resource in wavelength division multiplexed optical networks. The problem of finding an optimal assignment of wavelengths to requests is of fundamental importance in bandwidth utilization. We present a polynomial-time algorithm for this problem on fixed constant-size topologies. We combine this algorithm with ideas from Raghavan and Upfal (1994) to obtain an optimal assignment of wavelengths on constant degree undirected trees.

Genetic algorithm for planning cable telecommunication networks

Applied Soft Computing, 2001

Optical fiber networks over synchronous digital hierarchy operating on ATM mode appear as one of the best alternatives for the new high-speed telecommunications networks. The network management requires planning studies so that the designed networks allow efficient operation in real time. A quantitative model evaluating the global topological design of an optical fiber network over synchronous digital hierarchy is described.