Smart Algorithms for Hierarchical Clustering in Optical Network.

Shadi Atalla; Saed Tarapiah; Mahmoud El Hendy; Kamarul Faizal Bin Hashim

Author(s)

Shadi Atalla College of Engineering and Information Technology (CEIT), University of Dubai, Dubai, UAE,

Saed Tarapiah Telecommunication Engineering Department, An-Najah National University, Nablus, Palestine,

Mahmoud El Hendy College of Engineering and Information Technology (CEIT), University of Dubai, Dubai, UAE,

Kamarul Faizal Bin Hashim College of Engineering and Information Technology (CEIT), University of Dubai, Dubai, UAE,

Abstract

Network design process is a very important in order to balance between the investment in the network and the supervises offered to the network user, taking into consideration, both minimizing the network investment cost, on the other hand, maximizing the quality of service offered to the customers as well. Partitioning the network to smaller sub-networks called clusters is required during the design process in order to ease studying the whole network and achieve the design process as a trade-off between several attributes such as quality of service, reliability, cost, and management. Under Clustered Architecture for Nodes in an Optical Network (CANON), a large scale optical network is partitioned into a number of geographically limited areas taking into account many different criteria like administrative domains, topological characteristics, traffic patterns, legacy infrastructure etc. An important consideration is that each of these clusters is comprised of a group of nodes in geographical proximity. The clusters can coincide with administrative domains but there could be many cases where two or more clusters belong to the same administrative domain. Therefore, in the most general case the partitioning into specific clusters can be either an off-line or an online process. In this work only the off-line case is considered. In this Study, we look at the problem of designing efficient 2-level Hierarchical Optical Networks (HON), in the context of network costs optimization. 2-level HON paradigm only has local rings to connect disjoint sets of nodes and a global sub-mesh to interconnect all the local rings. We present a Hierarchical algorithm that is based on two phases. We present results for scenarios containing a set of real optical topologies.

Publication Details

Page(s) 119-129

DOI DOI not available

Published Journal: International Journal of Communication Networks and Information Security, Volume: 8, Issue: 2, Year: 2016

Request the full text from PASTIC

References

Che, 2010.Xianhui, "Overview of optical local access networks development and design challenges.",International Journal of Communication Networks and Information Security 2 35 -

Róka , Rastislav, and Martin,Mokrán, 2015."Modeling of the PSK utilization at the signal transmission in the optical transmission medium.",International Journal of Communication Networks and Information Security 7 187 -

K.Srinivasarao,R.Dutta, 2005.Traffic-partitioning approaches to grooming ring networks,” in Autonomic and Autonomous Systems and International Conference on Networking and Services 6 -

S.Yadlapalli,W.Malik,S.Darbha,M.Pachter, July 2007.A lagrangian-based algorithm for a multiple depot, multiple travelling salesmen problem, 07 4027 -4032

S.Kirkpatrick,C. D.Gelatt,M. P.Vecchi,August, 2016.Optimization by simulated annealing,” Science, 220 671 -680

V., 1985.Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm,” Journal of Optimization Theory and Applications 45 41 -51

C.-H. Song , K.,Lee , and W. D.,Lee, 2003.Extended simulated annealing for augmented tsp and multi-salesmen tsp,” in Neural Networks -

July 2003.,[8] Proceedings of the International Joint Conference on, vol. 3 2340 -2343

T.-H.Kim,C.-H. Song , W. D.,Lee, 2006.Building a packages delivery schedule using extended simulated annealing,” in Neural Networks 2691 -2695

T.Bektas,August, 2016.The multiple traveling salesman problem: an overview of formulations and solution procedures,” Omega 34 219 -219

C.Feremans,M.Labbe,A.Letchford,J. J.Salazar, 2003.The generalized subgraph problem: Complexity, approximability, -

E. W.Dijkstra, 1959.A note on two problems in connexion with graphs,” Nu-merische Mathematik, 1 10 -271

B.Chen,R.Dutta, 2008.On hierarchical traffic grooming in wdm networks,” Networking, 16 1226 -1238

L.Sun,August, 2016., last -