Int. J. Commun. Networks Distributed Syst.最新文献

筛选
英文 中文
SLA-aware task allocation with resource optimisation on cloud environment 支持sla的任务分配,并在云环境中进行资源优化
Int. J. Commun. Networks Distributed Syst. Pub Date : 2019-02-05 DOI: 10.1504/IJCNDS.2019.10018153
Shrabanee Swagatika, A. Rath
{"title":"SLA-aware task allocation with resource optimisation on cloud environment","authors":"Shrabanee Swagatika, A. Rath","doi":"10.1504/IJCNDS.2019.10018153","DOIUrl":"https://doi.org/10.1504/IJCNDS.2019.10018153","url":null,"abstract":"Cloud computing is a materialised environment for several users due to its unpredictable nature. However cloud is a challengeable environment for many researches because of its hardness on predicting the accurate status of virtual machines (VM) in order to allocate resources for cloud consumers. Many researchers focus on optimisation and scheduling algorithms for predicting accurate status about VMs and their researches fail in providing the predominant results. In order to furnish efficacious results, we propose a novel cloud framework with resource optimisation. Two special components are chosen on it: one is resource manager (RM) and the other one is virtual machine re-allocator (VMRA). This framework has several methodologies like task clustering, task allocation, VM clustering and re-allocation of VMs. Specifically we introduce SLA-priority clustering algorithm for several tasks available on cloud, and these are allocated using ETC matrix with PSO algorithm. Our proposed cloud framework can be implemented using a CloudSim simulation tool which furnishes the efficient results. Thus our process effectively allocates resources on cloud environment and we also solve the problem of re-allocation of VM, power efficient VM re-allocation algorithm is proposed to solving the random failure issues.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114073244","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 review on propagation of secure data, prevention of attacks and routing in mobile ad-hoc networks 移动自组织网络中安全数据传播、攻击预防和路由的研究进展
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-11-30 DOI: 10.1504/IJDS.2018.10017548
G. Borkar, A. Mahajan
{"title":"A review on propagation of secure data, prevention of attacks and routing in mobile ad-hoc networks","authors":"G. Borkar, A. Mahajan","doi":"10.1504/IJDS.2018.10017548","DOIUrl":"https://doi.org/10.1504/IJDS.2018.10017548","url":null,"abstract":"Wireless communication is considered as a significant part in our modern innovation for transmitting the packets from source node to destination node. In the developing current situation of wireless communications mobile ad-hoc network (MANET) assumes a major part. In this paper, we have built up a definite review about the algorithms and systems utilised for fathoming the different issues such as security, authentication and routing. We have clarified three different classifications of issues that happen during broadcasting the packets by contrasting each and the past advancements in this paper. To acquire precise solutions to issues such as authentication, protection and security a vast number of protocols, routing strategy and algorithms have been utilised, however, it is exceptionally testing to discover the ideal and proficient technique that can be utilised internationally. In this paper, we have displayed an overview of different existing procedures and afterward basically investigated the work done by the different scientists in the field of MANETs.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134085681","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}
引用次数: 10
Service orchestration over clouds and networks 云和网络上的服务编排
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-10-04 DOI: 10.1504/IJCNDS.2018.10015936
Muhammad Afaq, Dong-hun Kang, Seung-Joon Seok, Wang-Cheol Song
{"title":"Service orchestration over clouds and networks","authors":"Muhammad Afaq, Dong-hun Kang, Seung-Joon Seok, Wang-Cheol Song","doi":"10.1504/IJCNDS.2018.10015936","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015936","url":null,"abstract":"The dynamic and constantly changing nature of request by a typical end-user for resource allocation demands service orchestration over clouds and networks. In order to meet such requests, it is necessary to control and aggregate diverse types of resources from cloud infrastructures and network functions. To that end, in this paper, we propose an orchestration framework for resource management and provisioning. The proposed orchestrator manages and provisions resources by: 1) exploiting application program interfaces (APIs) provided by the cloud provider in order to control/manage/allocate storage and compute resources; 2) interacting with software-defined networking (SDN) controller to get the details of the available resources, and instructing the changes/rules to manage the network based on the cloud service requirements. For resource allocation, an algorithm is proposed, which allocates resources on the basis of unutilised resources in a pool of virtual machines. An algorithm has been taken into account for comparison with the proposed resource allocation algorithm. The experiment results show that the considered algorithm is outperformed by the proposed algorithm.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130004754","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
Failure detection and recovery in self-healing WSN 自修复WSN的故障检测与恢复
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-10-04 DOI: 10.1504/IJCNDS.2018.10015938
C. B. Lakshmi, S. K. M. Rao
{"title":"Failure detection and recovery in self-healing WSN","authors":"C. B. Lakshmi, S. K. M. Rao","doi":"10.1504/IJCNDS.2018.10015938","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015938","url":null,"abstract":"In wireless sensor networks (WSNs), there are some problems of failures in self-healing network which need to be detected and recovered. So, there is need of failures detection and recovery technique for these failures. For this we propose correlation-based detection and self-healing based recover technique. The proposed technique, detects the communication backbone node failures and use self-healing policy for recovery. In the proposed technique, the mean values of sensor signals are used for correlation which detect inconsistencies in sensor inputs lucratively and having low false positives. We use self healing method for recovery which is able to recover both the backbone node failure and sentry node failure. This recovery technique is more reactive to node failures through considerable energy efficiency.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130049649","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}
引用次数: 3
Three-party password-based authenticated key exchange protocol based on the computational Diffie-Hellman assumption 基于计算Diffie-Hellman假设的三方密码认证密钥交换协议
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-10-04 DOI: 10.1504/IJCNDS.2018.10015942
Aqeel Sahi, D. Lai, Yan Li
{"title":"Three-party password-based authenticated key exchange protocol based on the computational Diffie-Hellman assumption","authors":"Aqeel Sahi, D. Lai, Yan Li","doi":"10.1504/IJCNDS.2018.10015942","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015942","url":null,"abstract":"The three-party password-based authenticated key exchange protocol gives two clients the ability to negotiate a session key through a trusted server over a public channel. Most of the proposed 3PAKE protocols use public keys to guarantee identities; however, the sharing of public keys may lead to various types of attacks, such as a man-in-the-middle attack, which allows an attacker to simply intercept and insert traffic traversing a network. In this paper, we briefly describe an updated three-party password-based authenticated key exchange protocol and analyse its security. The proposed TPAKE protocol does not share plain-text data. Data shared between the parties are either hashed or encrypted. Using the random oracle model, the security of the proposed TPAKE protocol is formally proven under the computational Diffie-Hillman assumption. Furthermore, the analyses included in this paper show that our protocol can ensure perfect forward secrecy and can also resist many types of common attacks.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"284 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132025419","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 neural-MCDM-based routing protocol for packet transmission in mobile ad hoc networks 一种基于神经mcdm的移动自组织网络分组传输路由协议
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-10-04 DOI: 10.1504/IJCNDS.2018.10015934
Mohammad Samadi Gharajeh
{"title":"A neural-MCDM-based routing protocol for packet transmission in mobile ad hoc networks","authors":"Mohammad Samadi Gharajeh","doi":"10.1504/IJCNDS.2018.10015934","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015934","url":null,"abstract":"This paper proposes a novel neural-MCDM-based routing protocol, called NMRouting, to transmit data packets in mobile ad hoc network (MANET). Data packets are transmitted through neighbouring nodes that have high success rates from among a list of available neighbours. A perceptron-based neural controller specifies a success rate for every neighbour based on remaining energy, occupied buffer, and mobility speed. A MCDM controller determines the number of paths based on packet priority rate, distance, and average mobility speed. An energy management model is suggested to conduct energy consumption of the nodes efficiently as well as three queue types - critical, reliability, and ordinary - are considered to guarantee network reliability. Besides, the paper presents UML diagrams to develop NMRouting in real applications. Simulation results show that the proposed protocol has a high performance in terms of packet delivery ratio, network lifetime, and network traffic, compared to DSR, AODV, DPG and QMRPRNS.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130257451","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}
引用次数: 2
Steady-state throughput discrete model of multipath TCP based on linked increase algorithm 基于链接增长算法的多路径TCP稳态吞吐量离散模型
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-10-04 DOI: 10.1504/IJCNDS.2018.10015933
Hongcheng Huang, Xinran Sun, Min Hu
{"title":"Steady-state throughput discrete model of multipath TCP based on linked increase algorithm","authors":"Hongcheng Huang, Xinran Sun, Min Hu","doi":"10.1504/IJCNDS.2018.10015933","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015933","url":null,"abstract":"This paper established a discrete model for the steady-state throughput of multipath TCP (MPTCP), which is based on linked increase algorithm (LIA) and is presented to analyse the relationship between subflow performances and throughput capacity under the steady-state bulk transmission of MPTCP data. With consideration of the coupling of subflow congestion windows' changes, the characteristics of subflow in states such as the congestion avoidance, fast recovery timeout retransmission and slow start was analysed. Furthermore, by calculating the expectations of transmitted packet number and transmission duration in a given MPTCP connection, the discrete model of MPTCP steady-state throughput can be established. Simulation results show that the proposed model can achieve the improved accuracy and robustness when predicting the steady-state transmission throughput of MPTCP.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122290786","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}
引用次数: 0
Clique-based socially-aware intelligent message forwarding scheme for delay tolerant network 时延容忍网络中基于小团体的社会感知智能消息转发方案
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-10-04 DOI: 10.1504/IJCNDS.2018.10013676
Vandana Juyal, R. Saggar, Nitin Pandey
{"title":"Clique-based socially-aware intelligent message forwarding scheme for delay tolerant network","authors":"Vandana Juyal, R. Saggar, Nitin Pandey","doi":"10.1504/IJCNDS.2018.10013676","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10013676","url":null,"abstract":"Delay tolerant network (DTN) is a challenged class of mobile ad hoc network that allows unbounded delay and intermittent contacts. In such a network the routing strategies involve storing a message and forward it to some future contact. In the past, most of the strategies defined were flooding based that eventually creates multiple duplicate copies of a message. This leads to the consumption of most of the network resources like energy, buffer space, processing power, etc. For this, we have extended our previous work based on artificial neural network based forwarding using trust value, which has potential to diminish these issues. Using trust as a modelling factor, we propose a trusted DTN clique which is socially aware and intelligently forwards in DTN. The work is examined using extensive simulation on real-world external traces. Also, the work is compared with existing routing protocols namely Prophet, SprayAndWait, and EpidemicOracle. The performance metric chosen for the proposed algorithm are messages aborted, messages relayed and messages dropped. Experimental results show that the proposed algorithm limits the number of message copies relayed in the DTN network and further provides a light weight intrinsic security to the DTN nodes.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123353423","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}
引用次数: 4
Mobile ad hoc networks problem - a queueing approach 移动自组织网络问题——排队方法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-10-04 DOI: 10.1504/IJCNDS.2018.10015935
S. Maragathasundari, K. Dhanalakshmi
{"title":"Mobile ad hoc networks problem - a queueing approach","authors":"S. Maragathasundari, K. Dhanalakshmi","doi":"10.1504/IJCNDS.2018.10015935","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015935","url":null,"abstract":"This paper investigates a study on mobile communication network by means of queuing theory approach. The good QOS in mobile communication network is necessary at this, the presence financially viable situation of global economic meltdown and competitive business environment with low tariff. In order to endure in this present economic situation, the network operators must put into consideration the effective use of their available resources. Due to technical error such as electromagnetic causes, irregular user behaviour, etc. the calls are truncated during conversation. Also the congestion is caused when the offered load of the network is more than the available resources. This problem of congestion and other breakdown occurring in MANET is approached through queueing theory in this study. Queueing attitude defines the slip-up in the networking and gives out the required ideas to be passed out to minimise the error occurring resources. It also introduces the concept of preservation period after the completion of service. Numerical illustration and an elaborate graphical study are carried out at the end to validate the model. It gives a clear thought about the conceptual study of queueing theory in mobile ad hoc networks.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125039042","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}
引用次数: 3
CD-SFA: stochastic frontier analysis approach to revenue modelling in large cloud data centres CD-SFA:大型云数据中心收入建模的随机前沿分析方法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2018-09-05 DOI: 10.1504/IJCNDS.2018.10015052
J. Sarkar, Bidisha Goswami, Snehanshu Saha, S. Kar
{"title":"CD-SFA: stochastic frontier analysis approach to revenue modelling in large cloud data centres","authors":"J. Sarkar, Bidisha Goswami, Snehanshu Saha, S. Kar","doi":"10.1504/IJCNDS.2018.10015052","DOIUrl":"https://doi.org/10.1504/IJCNDS.2018.10015052","url":null,"abstract":"Data centre is a facility, which houses computer systems and associated components, such as telecommunications and storage systems. Due to the emergence of data centre-based computing services, it has become necessary to examine how the costs associated with data centres evolve over time, mainly in view of efficiency issues. We have presented a quasi form of Cobb-Douglas model, which addresses revenue and profit issues in running large data centres. The stochastic form has been introduced and explored along with the quasi Cobb-Douglas model to understand the behaviour of the model in depth. Harrod neutrality and Solow neutrality are incorporated in the model to identify the technological progress in cloud data centres. This allows us to shed light on the stochastic uncertainty of cloud data centre operations. The insightful results are found to be quite useful in view of production reorganisation in large data centres' around the world.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114769083","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信