International Conference on Data Communication Networking最新文献_第3页

Metaheuristic Solutions for Solving Controller Placement Problem in SDN-based WAN Architecture 基于sdn的广域网架构中控制器放置问题的元启发式解决方案

International Conference on Data Communication Networking Pub Date : 1900-01-01 DOI: 10.5220/0006483200150023

Kshira Sagar Sahoo, Anamay Sarkar, S. Mishra, B. Sahoo, Deepak Puthal, M. Obaidat, B. Sadoun

{"title":"Metaheuristic Solutions for Solving Controller Placement Problem in SDN-based WAN Architecture","authors":"Kshira Sagar Sahoo, Anamay Sarkar, S. Mishra, B. Sahoo, Deepak Puthal, M. Obaidat, B. Sadoun","doi":"10.5220/0006483200150023","DOIUrl":"https://doi.org/10.5220/0006483200150023","url":null,"abstract":"Software Defined Networks (SDN) is a popular paradigm in the modern networking systems that decouples the control logic from the underlying hardware devices. The control logic has implemented as a software component and residing in a server called controller. To increase the performance, deploying multiple controllers in a largescale network is one of the key challenges of SDN. To solve this, authors have considered controller placement problem (CPP) as a multi-objective combinatorial optimization problem and used different heuristics. Such heuristics can be executed within a specific time-frame for small and medium sized topology, but out of scope for large scale instances like Wide Area Network (WAN). In order to obtain better results, we propose Particle Swarm Optimization (PSO) and Firefly two population-based meta-heuristic algorithms for optimal placement of the controllers, which take a particular set of objective functions and return the best possible position out of them. The problem has been defined, taking into consideration both controllers to switch and inter-controller latency as the objective functions. The performance of the algorithms evaluated on a set of publicly available network topologies in terms execution time. The results show that the FireFly algorithm performs better than PSO and random approach under various conditions.","PeriodicalId":172337,"journal":{"name":"International Conference on Data Communication Networking","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125017115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 25

Parallel Multi-path Forwarding Strategy for Named Data Networking 命名数据网络的并行多路径转发策略

International Conference on Data Communication Networking Pub Date : 1900-01-01 DOI: 10.5220/0005964600360046

Bouacherine Abdelkader, Mustapha Réda Senouci, B. Merabti

{"title":"Parallel Multi-path Forwarding Strategy for Named Data Networking","authors":"Bouacherine Abdelkader, Mustapha Réda Senouci, B. Merabti","doi":"10.5220/0005964600360046","DOIUrl":"https://doi.org/10.5220/0005964600360046","url":null,"abstract":"Named Data Networking (NDN) is one of the most promising instantiations of the Information Centric Networking (ICN) philosophy. This new design needs a new thinking due to the fact that the definitions of some concepts used in TCP/IP paradigm are no longer appropriate. In this context, flow and fairness concepts are examined and new perspectives are proposed. An important literature exists about forwarding strategies and congestion control in NDN context. Unfortunately, the lack of definitions pushed many researchers to use the TCP/IP heritage. As a consequence, they neither fully benefit from the native multi-path support nor address the fairness problem. In order to overcome such a drawback and to meet end-users fairness while optimizing network throughput, a new Parallel Multi-Path Forwarding Strategy (PMP-FS) is proposed in this paper. The PMP-FS proactively splits traffic by determining how the multiple routes will be used. It takes into consideration NDN in-network caching and NDN Interest aggregation features to achieve weighted alpha fairness among different flows. Obtained preliminary results show that PMP-FS looks promising.","PeriodicalId":172337,"journal":{"name":"International Conference on Data Communication Networking","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125316219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

A Quasi-realistic Internet Graph 一个准现实的互联网图

International Conference on Data Communication Networking Pub Date : 1900-01-01 DOI: 10.5220/0006440100270032

P. Salvador

{"title":"A Quasi-realistic Internet Graph","authors":"P. Salvador","doi":"10.5220/0006440100270032","DOIUrl":"https://doi.org/10.5220/0006440100270032","url":null,"abstract":"The existence of a realistic Internet interconnections model has been an important requirement to effectively support areas as routing optimization, routing security, and services QoS prediction. However, no usable and no useful models exist. The existing interconnection models are to (i) simplistic to be applicable in real scenarios, or (ii) incorporate to much uncorrelated information that cannot be used due to its complexity. This work presents the construction steps and final solution for a quasi-realist graph that models the Internet as an all. The graph is based on all known Internet exchange points (IX) and landing points of all known submarine cables. The lack of information about interconnections between IX and landing points is extrapolated from simple rules that take in consideration Earth geographic characteristics. This approach results in a graph that includes all major corner stones of the Internet while maintaining a simple structure. This graph can then be used to predict connectivity and routing properties between any two geographical points in Earth. The proof-of-concept results, even with very simplistic assumptions as similar node and link loads and symmetric routing by the shortest path, show that the model allows the prediction of the round-trip time of traffic and number of nodes between any two Internet points with an acceptable average error.","PeriodicalId":172337,"journal":{"name":"International Conference on Data Communication Networking","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128350349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Multicast Algebraic Formal Modelling using ACP - Study on PIM Dense Mode and Sparse Mode 基于ACP的组播代数形式化建模——PIM密集模式和稀疏模式的研究

International Conference on Data Communication Networking Pub Date : 1900-01-01 DOI: 10.5220/0006398800570068

P. Roig, S. Alcaraz, K. Gilly

引用次数: 0