Page 80 - ITUJournal Future and evolving technologies Volume 2 (2021), Issue 1
P. 80

ITU Journal on Future and Evolving Technologies, Volume 2 (2021), Issue 1




          [38] Mojgan Mohajer, Karl‑Hans Englmeier, and Volker J  [50] South African National Research Network. Last
               Schmid. “A comparison of Gap statistic de initions    accessed October 2018. URL: https : / / www .
               with and without logarithm function”. In: arXiv       sanren.ac.za/backbone/.
               preprint arXiv:1103.4767 (2011).                [51] Simon Knight, Hung X Nguyen, Nick Falkner, Rhys
          [39] N     Damak.    “Distance    problems    in           Bowden, and Matthew Roughan. “The Internet
               networks—theory and practice”. In: Journal of         topology zoo”. In: IEEE Journal on Selected Areas in
               Classical shortest‑path algorithms (2010), pp. 1–9.   Communications 29.9 (2011), pp. 1765–1775.
          [40] M Bindhu and GP Ramesh. “Load balancing and     [52] The University of Adelaide. The Internet Topology
               congestion control in software de ined networking     Zoo. accessed October 2018. URL: http : / / www .
               using the extended Johnson algorithm for data         topology-zoo.org/dataset.html.
               centre”. In: International Journal of Applied
                                                               [53] Lovisa Lovmar, Annika Ahlford, Mats Jonsson,
               Engineering Research 10.17 (2015), p. 2015.
                                                                                         ̈
                                                                     and Ann‑Christine Syvanen. “Silhouette scores for
          [41] KLEIN Bouleimen and HOUSNI Lecocq. “A new             assessment of SNP genotype clusters”. In: BMC
               ef icient simulated annealing algorithm for the       genomics 6.1 (2005), p. 35.
               resource‑constrained project scheduling problem  [54] Hlabishi I Kobo, Adnan M Abu‑Mahfouz, and
               and its multiple mode version”. In: European          Gerhard P Hancke. “A survey on software‑de ined
               Journal of Operational Research 149.2 (2003),         wireless  sensor  networks:  Challenges  and
               pp. 268–281.                                          design requirements”. In: IEEE access 5 (2017),
          [42] AM Fahim, AM Salem, F Af Torkey, and                  pp. 1872–1899.
               MA Ramadan. “An ef icient enhanced k‑means      [55] Lusani    Mamushiane,   Albert  Lysko,  and
               clustering algorithm”. In: Journal of Zhejiang        Sabelo Dlamini. “A comparative evaluation of
               University‑Science A 7.10 (2006), pp. 1626–1633.      the performance of popular SDN controllers”. In:
          [43] K Krishna and M Narasimha Murty. “Genetic             Wireless Days (WD), 2018. IEEE. 2018, pp. 54–59.
               K‑means algorithm”. In: IEEE Transactions on    [56] Lusani Mamushiane, Albert A Lysko, and Joyce
               Systems, Man, and Cybernetics, Part B (Cybernetics)   Mwangama. “Resilient SDN Controller Placement
               29.3 (1999), pp. 433–439.                             Optimization applied to and emulated on South
          [44] Michael Steinbach, George Karypis, Vipin Kumar,       African National Research Network (SANReN)”.
               et al. “A comparison of document clustering           In: submitted for Wireless Communications and
               techniques”. In: KDD workshop on text mining.         Networking Conference. IEEE, 2019.
               Vol. 400. 1. Boston. 2000, pp. 525–526.
                                                               [57] Jian Li, Jae‑Hyoung Yoo, and James Won‑Ki Hong.
          [45] Qiaoping Zhang and Isabelle Couloigner. “A            “Dynamic   control  plane  management   for
               new and ef icient k‑medoid algorithm for              software‑de ined networks”. In: International
               spatial clustering”. In: International conference     Journal of Network Management 26.2 (2016),
               on computational science and its applications.        pp. 111–130.
               Springer. 2005, pp. 181–189.                    [58] Shizhong Xu, Xiong Wang, Guangxu Yang, Jing Ren,
          [46] Li Sheng Zhang, Mei Jie Yang, and Da Jiang Lei.       and Sheng Wang. “Routing optimization for
               “An improved PAM clustering algorithm based on        cloud services in SDN‑based Internet of Things
               initial clustering centers”. In: Applied Mechanics    with TCAM capacity constraint”. In: Journal of
               and Materials. Vol. 135. Trans Tech Publ. 2012,       Communications and Networks 22.2 (2020),
               pp. 244–249.                                          pp. 145–158.
          [47] Peter O Olukanmi, Fulu helo Nelwamondo, and     [59] Jhih‑Yu Huang and Pi‑Chung Wang. “TCAM‑based
               Tshilidzi Marwala. “k‑Means‑Lite: Real Time           IP address lookup using longest suf ix split”.
               Clustering for Large Datasets”. In: 2018 5th          In: IEEE/ACM Transactions on Networking 26.2
               International Conference on Soft Computing            (2018), pp. 976–989.
               & Machine Intelligence (ISCMI). IEEE. 2018,     [60] Test Case on The Role Intimation Time for Controller
               pp. 54–59.                                            Cluster At Setup. Last accessed January 2019. URL:
          [48] Shalini S Singh and NC Chauhan. “K‑means v/s          https : / / wiki . onosproject . org / pages /
               K‑medoids: A Comparative Study”. In: National         viewpage.action?pageId=11864465.
               Conference on Recent Trends in Engineering &    [61] TheRoleIntimationTimeforControllerClusterAfter
               Technology. Vol. 13. 2011.
                                                                     Master Failover. Last accessed September 2018).
          [49] Erich Schubert and Peter J Rousseeuw. “Faster         URL: https://wiki.onosproject.org/pages/
               k‑Medoids Clustering: Improving the PAM, CLARA,       viewpage.action?pageId=11864470.
               and CLARANS Algorithms”. In: arXiv preprint
               arXiv:1810.05691 (2018).





          64                                 © International Telecommunication Union, 2021
   75   76   77   78   79   80   81   82   83   84   85