Int. J. Commun. Networks Distributed Syst.最新文献_第9页

Achieving efficiency in autonomic network management of IP networks based on SDN management logic 基于SDN管理逻辑实现IP网络的自主网络管理效率

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-06-07 DOI: 10.1504/IJCNDS.2018.10013190

M. B. Lehocine, M. Batouche

{"title":"Achieving efficiency in autonomic network management of IP networks based on SDN management logic","authors":"M. B. Lehocine, M. Batouche","doi":"10.1504/IJCNDS.2018.10013190","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013190","url":null,"abstract":"The layer-three redundancy in large companies' IP networks remains a major concern, aiming to increase, as much as possible, the availability ratio for the offered services to the customers. However, deploying the existing protocols requires in addition to providing backup links and physical equipment, the manual configuration which is time-consuming and error-prone. Autonomic router redundancy controller (ARRC) was the first autonomic solution whose objective was to deploy redundancy on existing networks. Yet, this solution was unable to handle redundancy in all network scenarios. In this paper, we propose a new approach extended ARRC (E-ARRC), inspired from software defined networking (SDN) management logic to address ARRC shortcomings and limitations. SDN represents a new vision for the future networks, aiming to reduce complexity and to ensure an efficient control of the network behaviour. Based on a global view of the network, SDN achieves business needs via a high-level specification of rules which are applied accordingly on the SDN capable nodes. The results of our approach, which is based on shared-networks reachability, illustrate a more granular level of redundancy, with a reliable exploitation of all the available resources.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132996798","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

Web user interface based on OGC standards for sensor cloud using big data 基于OGC标准的大数据传感器云Web用户界面

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-06-07 DOI: 10.1504/IJCNDS.2018.10013186

Vijayasherly Velayutham, Srimathi Chandrasekaran, Subaji Mohan

引用次数: 1

Resource prediction-based routing using agents in mobile ad hoc networks 移动自组织网络中使用代理的基于资源预测的路由

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-06-07 DOI: 10.1504/IJCNDS.2018.10013189

S. Chaudhari, R. Biradar

引用次数: 2

Energy efficient QoS routing for mobile ad hoc networks 移动自组织网络的高能效QoS路由

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-04-13 DOI: 10.1504/IJCNDS.2018.10010693

R. Saravanan

引用次数: 3

Energy conservation routing algorithm for wireless sensor networks using hybrid optimisation approach 基于混合优化方法的无线传感器网络节能路由算法

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-04-13 DOI: 10.1504/IJCNDS.2018.10010692

R. Logambigai, A. Kannan

引用次数: 8

A robust deterministic approach to node localisation using NLOS signal 一个鲁棒的确定性方法节点定位使用NLOS信号

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-04-13 DOI: 10.1504/IJCNDS.2018.10010685

Kaushik Mondal, P. Mandal, B. Sinha

引用次数: 1

Performance analysis of WMNs by WMN-GA simulation system for two WMN architectures and different TCP congestion-avoidance algorithms and client distributions 利用WMN- ga仿真系统对两种WMN结构、不同TCP拥塞避免算法和客户端分布的WMN网络进行性能分析

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-04-13 DOI: 10.1504/IJCNDS.2018.10010703

Keita Matsuo, Shinji Sakamoto, Tetsuya Oda, Admir Barolli, Makoto Ikeda, L. Barolli

{"title":"Performance analysis of WMNs by WMN-GA simulation system for two WMN architectures and different TCP congestion-avoidance algorithms and client distributions","authors":"Keita Matsuo, Shinji Sakamoto, Tetsuya Oda, Admir Barolli, Makoto Ikeda, L. Barolli","doi":"10.1504/IJCNDS.2018.10010703","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10010703","url":null,"abstract":"In this paper, we evaluate the performance of two wireless mesh networks (WMNs) architectures considering packet delivery ratio (PDR), throughput, delay and fairness index metrics. For simulations, we used ns-3, distributed coordination function (DCF) and optimised link state routing (OLSR). We compare the performance of transmission control protocol (TCP) Tahoe, Reno and NewReno for normal and uniform distributions of mesh clients by sending multiple constant bit rate (CBR) flows in the network. The simulation results show that the PDR for both distributions and architectures is almost the same, but the PDR of I/B WMN for uniform distribution is a little bit higher than normal distribution. For both WMN architectures, the throughput of normal distribution is better than uniform distribution. The delay of Tahoe is a little bit lower compared with other algorithms for normal distribution and Hybrid WMN, but in case of uniform distribution, the NewReno performs better than other algorithms for both architectures. The fairness index of normal distribution is higher than uniform distribution.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132157889","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}

引用次数: 35

Routing selection in mobile ad hoc network using soft computing approaches 基于软计算方法的移动自组网路由选择

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-04-13 DOI: 10.1504/IJCNDS.2018.10010691

Hany Ramadan, B. S. Tawfik, A. Riad

{"title":"Routing selection in mobile ad hoc network using soft computing approaches","authors":"Hany Ramadan, B. S. Tawfik, A. Riad","doi":"10.1504/IJCNDS.2018.10010691","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10010691","url":null,"abstract":"Routing in the mobile ad hoc network (MANET) is a challenging task and has received a great amount of attention from researchers. This paper introduces an exact reference routing model to find the shortest path (optimum route). This model is a conventional combinatorial that selects the shortest route from all possible routes. To demonstrate the use of this reference model for comparison a second model is selected which is a modified ant colony optimisation (ACO). The good selection of the heuristic parameters of the ACO model increases its matching degree with the reference one. Therefore, a training pre-processing phase is added to select the best parameters for ACO model. The two models are compared using four different criteria. These criteria are the execution time, energy consumption, the total cost, and the network lifetime. A simulation experiment is performed, and the results show that the modified ant colony algorithm is superior in execution time but consumed more energy than the reference combinatorial and its total cost is greater than or equal to the other one. The lifetime analysis shows that the reference model has better lifetime than the modified ACO model.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127836060","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

A task allocation model for minimising system cost and maximising reliability of distributed computing system 面向分布式计算系统成本最小化和可靠性最大化的任务分配模型

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-02-10 DOI: 10.1504/IJCNDS.2018.10010386

H. Kumar, N. Chauhan, P. Yadav

引用次数: 3

Design and analysis of a stable AQM controller for network congestion control 网络拥塞控制中稳定AQM控制器的设计与分析

Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-02-10 DOI: 10.1504/IJCNDS.2018.10010375

S. Bisoy, P. Pattnaik, Bibudhendu Pati, C. Panigrahi

引用次数: 3