首页 > 最新文献

2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)最新文献

英文 中文
Q-AODV: A Flood control Ad-Hoc on Demand Distance Vector Routing Protocol Q-AODV:一种洪水控制Ad-Hoc按需距离矢量路由协议
Bhagyalakshmi, A. Dogra
Mobile ad hoc network (MANET) is a self-organized and self-configurable infrastructure less network where the mobile nodes move arbitrarily. One of the major characteristic that differentiate mobile ad-hoc networks from other types of networks is the ability of the mobile nodes to receive and forward packets as a router. The focus of the work is to devise a strategy to control the flooding of control packets through the network in a way to improve the QoS parameters associated with MANETs. The proposed strategy tries to reduce the number of the intermediate nodes that participate in the route discovery process thereby, reducing the total number of control packets that are forwarded by the nodes in the network. This is achieved by controlling the route request (RREQ) broadcast storm using the node’s queue length. The source appends a random number with RREQ which is compared with the queue vacancy proportion at each intermediate node. The intermediate node relays the RREQ packet if the random number generated is less than the queue vacancy proportion. This reduces the number of congested nodes forwarding the RREQ packets thereby improving QoS parameters, preserving the energy and increasing the overall network lifetime. The proposed algorithm Q-AODV is advancement over AODV that tries to find a less congested route based on queue vacancy. The proposed algorithm QAODV improves average end to end delay, throughput and jitter, to some extent, as compared to AODV. The simulation has been carried out on Qualnet.
移动自组织网络(MANET)是一种自组织、自配置的无基础设施网络,其移动节点可以任意移动。将移动ad-hoc网络与其他类型的网络区分开来的主要特征之一是移动节点作为路由器接收和转发数据包的能力。工作的重点是设计一种策略来控制通过网络的控制数据包的泛滥,以改善与manet相关的QoS参数。该策略试图减少参与路由发现过程的中间节点的数量,从而减少网络中节点转发的控制数据包总数。这是通过使用节点的队列长度控制路由请求(RREQ)广播风暴来实现的。源附加一个带有RREQ的随机数,该随机数与每个中间节点的队列空置比例进行比较。如果生成的随机数小于队列空闲比例,中间节点将转发RREQ报文。这样可以减少转发RREQ报文的拥塞节点数量,从而提高QoS参数,节约能量,提高整体网络生存时间。本文提出的算法Q-AODV是对AODV算法的一种改进,AODV算法试图根据队列空缺来寻找更少拥塞的路由。与AODV算法相比,所提出的QAODV算法在一定程度上改善了端到端平均延迟、吞吐量和抖动。在Qualnet上进行了仿真。
{"title":"Q-AODV: A Flood control Ad-Hoc on Demand Distance Vector Routing Protocol","authors":"Bhagyalakshmi, A. Dogra","doi":"10.1109/ICSCCC.2018.8703220","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703220","url":null,"abstract":"Mobile ad hoc network (MANET) is a self-organized and self-configurable infrastructure less network where the mobile nodes move arbitrarily. One of the major characteristic that differentiate mobile ad-hoc networks from other types of networks is the ability of the mobile nodes to receive and forward packets as a router. The focus of the work is to devise a strategy to control the flooding of control packets through the network in a way to improve the QoS parameters associated with MANETs. The proposed strategy tries to reduce the number of the intermediate nodes that participate in the route discovery process thereby, reducing the total number of control packets that are forwarded by the nodes in the network. This is achieved by controlling the route request (RREQ) broadcast storm using the node’s queue length. The source appends a random number with RREQ which is compared with the queue vacancy proportion at each intermediate node. The intermediate node relays the RREQ packet if the random number generated is less than the queue vacancy proportion. This reduces the number of congested nodes forwarding the RREQ packets thereby improving QoS parameters, preserving the energy and increasing the overall network lifetime. The proposed algorithm Q-AODV is advancement over AODV that tries to find a less congested route based on queue vacancy. The proposed algorithm QAODV improves average end to end delay, throughput and jitter, to some extent, as compared to AODV. The simulation has been carried out on Qualnet.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598334","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}
引用次数: 14
Cognitive State Classification using Genetic Algorithm based Linear Collaborative Discriminant Regression 基于遗传算法的线性协同判别回归认知状态分类
K. Gupta, P. Chatur
Functional Magnetic Resonance imaging (fMRI) provides sequence of 3D images which contains large number of voxels as information. There are many statistical methods evolved in last few years to analyze this information. Main concern of all these techniques is huge dimensions of the data produced by these images. This paper proposes an efficient hybrid method for feature selection and classification. This method combine entropy based genetic algorithm (EGA) with Linear Collaborative Discriminant Regression Classification (LCDRC) to form feature based classification method. Entropy based genetic algorithm is applied to find maximum significance between the input and output and also it radically reduces the redundancy within the input features. Experiments’ using Star-Plus dataset to classify fMRI images shows that EGA-LCDRC reduces up to 60% features and produces 96.73% accuracy.
功能磁共振成像(fMRI)提供包含大量体素的三维图像序列作为信息。在过去的几年里,有许多统计方法发展出来来分析这些信息。所有这些技术的主要关注点是这些图像产生的数据的巨大维度。提出了一种高效的特征选择与分类混合方法。该方法将基于熵的遗传算法(EGA)与线性协同判别回归分类(LCDRC)相结合,形成基于特征的分类方法。采用基于熵的遗传算法寻找输入和输出之间的最大显著性,从根本上减少了输入特征内部的冗余。使用Star-Plus数据集对fMRI图像进行分类的实验表明,EGA-LCDRC减少了高达60%的特征,准确率达到96.73%。
{"title":"Cognitive State Classification using Genetic Algorithm based Linear Collaborative Discriminant Regression","authors":"K. Gupta, P. Chatur","doi":"10.1109/ICSCCC.2018.8703280","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703280","url":null,"abstract":"Functional Magnetic Resonance imaging (fMRI) provides sequence of 3D images which contains large number of voxels as information. There are many statistical methods evolved in last few years to analyze this information. Main concern of all these techniques is huge dimensions of the data produced by these images. This paper proposes an efficient hybrid method for feature selection and classification. This method combine entropy based genetic algorithm (EGA) with Linear Collaborative Discriminant Regression Classification (LCDRC) to form feature based classification method. Entropy based genetic algorithm is applied to find maximum significance between the input and output and also it radically reduces the redundancy within the input features. Experiments’ using Star-Plus dataset to classify fMRI images shows that EGA-LCDRC reduces up to 60% features and produces 96.73% accuracy.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"531 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116229144","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
ICSCCC 2018 Table of Contents ICSCCC 2018目录
{"title":"ICSCCC 2018 Table of Contents","authors":"","doi":"10.1109/icsccc.2018.8703274","DOIUrl":"https://doi.org/10.1109/icsccc.2018.8703274","url":null,"abstract":"","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114763498","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
Sentimental Analysis On Social Feeds to Predict the Elections 对社交信息进行情感分析以预测选举
Neha Gigi, AmanPreet Kaur
Information mining is an assignment which is utilized to discover the concealed example or data to break down any subject. These days a ton of research is going on web mining i.e. to mine the web assets to discover the example or shrouded data. In our research the main aim is to perform the text mining over the real time data to predict the result of election that which party will win the state or national election held in India. In our work we get the data from twitter where the citizens of India give the opinion about the political parties and the analysis of these sentiments is done to conclude the result.
信息挖掘是一种通过发现隐藏的实例或数据来分解任何主题的任务。这些天,大量的研究都在进行网络挖掘,即挖掘网络资产以发现示例或隐藏数据。在我们的研究中,主要目的是对实时数据进行文本挖掘,以预测哪一方将赢得印度举行的州或全国选举的选举结果。在我们的工作中,我们从推特上获得数据,印度公民在推特上发表对政党的看法,并对这些情绪进行分析以得出结果。
{"title":"Sentimental Analysis On Social Feeds to Predict the Elections","authors":"Neha Gigi, AmanPreet Kaur","doi":"10.1109/ICSCCC.2018.8703347","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703347","url":null,"abstract":"Information mining is an assignment which is utilized to discover the concealed example or data to break down any subject. These days a ton of research is going on web mining i.e. to mine the web assets to discover the example or shrouded data. In our research the main aim is to perform the text mining over the real time data to predict the result of election that which party will win the state or national election held in India. In our work we get the data from twitter where the citizens of India give the opinion about the political parties and the analysis of these sentiments is done to conclude the result.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114638843","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
Group Head Selection in WSN using EM Algorithm 基于EM算法的WSN组头选择
Tanuj Wala, N. Chand, A. Sharma
Recently wireless sensor network has become attractive field of research. A wireless sensor network (WSN) contains plenty of sensor nodes (SNs) that continuously monitor the physical phenomenon. The sensed data is cooperatively transferred through the network towards sink. In large wireless sensor network numerous nodes are deployed together to perform a task. The nodes have sensing, computing and communication features. Since the nodes are constrained in power, storage and computation, so it is necessary to deal with these issues efficiently. Therefore, a greater challenge is involved in saving energy and enhancing the lifespan of the network. Connectivity among the sensor nodes is another critical challenge in WSN due to limited communication range of sensor nodes. As a result, there arises the problem of network disconnection and huge energy consumption. The issues have been addressed in this paper and the proposal contains two phase scheme. In first phase, SGP (Spectral Graph Partitioning) technique is applied for the identification of disconnected portion of the network. Second phase is based on the improved EM (Expectation Maximization) clustering scheme for efficient cluster head and group head selection to diminish the energy consumption in the network.
近年来,无线传感器网络已成为一个有吸引力的研究领域。无线传感器网络(WSN)包含大量的传感器节点(SNs),这些传感器节点持续监测物理现象。感知到的数据通过网络协同传输到sink。在大型无线传感器网络中,许多节点被部署在一起执行任务。节点具有传感、计算和通信功能。由于节点在功率、存储和计算方面受到限制,因此必须有效地处理这些问题。因此,节能和延长网络寿命是一个更大的挑战。由于传感器节点之间的通信范围有限,传感器节点之间的连接是WSN的另一个关键挑战。这就产生了断网问题和巨大的能源消耗。本文对这些问题进行了讨论,提出了两阶段方案。在第一阶段,采用谱图划分(SGP)技术对网络的断开部分进行识别。第二阶段是基于改进的EM(期望最大化)聚类方案进行高效的簇头和群头选择,以降低网络能耗。
{"title":"Group Head Selection in WSN using EM Algorithm","authors":"Tanuj Wala, N. Chand, A. Sharma","doi":"10.1109/ICSCCC.2018.8703310","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703310","url":null,"abstract":"Recently wireless sensor network has become attractive field of research. A wireless sensor network (WSN) contains plenty of sensor nodes (SNs) that continuously monitor the physical phenomenon. The sensed data is cooperatively transferred through the network towards sink. In large wireless sensor network numerous nodes are deployed together to perform a task. The nodes have sensing, computing and communication features. Since the nodes are constrained in power, storage and computation, so it is necessary to deal with these issues efficiently. Therefore, a greater challenge is involved in saving energy and enhancing the lifespan of the network. Connectivity among the sensor nodes is another critical challenge in WSN due to limited communication range of sensor nodes. As a result, there arises the problem of network disconnection and huge energy consumption. The issues have been addressed in this paper and the proposal contains two phase scheme. In first phase, SGP (Spectral Graph Partitioning) technique is applied for the identification of disconnected portion of the network. Second phase is based on the improved EM (Expectation Maximization) clustering scheme for efficient cluster head and group head selection to diminish the energy consumption in the network.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125268712","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
Systematic Survey on Sentiment Analysis 情感分析的系统调查
Shubham Jain, Pardeep Singh
Sentiment Analysis and Opinion Mining have been of great interest to the researchers during recent years. It is the process of classifying the opinions or sentiments according to the polarity of the text into positive, neutral and negative. Most of the organizations and industries highly depend on data analytics for their planning and decisionmaking process. Opinion mining and sentiment analysis have great importance in our day-to-day decision making from purchasing products and services to making investments. In this survey, we briefly incorporated the approaches and techniques proposed by researchers in recent investigations along with the issue related to sentiment analysis and opinion mining.
情感分析和意见挖掘是近年来研究人员非常感兴趣的问题。它是根据文本的极性将观点或情绪分类为积极、中性和消极的过程。大多数组织和行业高度依赖数据分析来进行计划和决策过程。从购买产品和服务到进行投资,意见挖掘和情感分析在我们的日常决策中非常重要。在这项调查中,我们简要地结合了研究人员在最近的调查中提出的方法和技术,以及与情感分析和意见挖掘相关的问题。
{"title":"Systematic Survey on Sentiment Analysis","authors":"Shubham Jain, Pardeep Singh","doi":"10.1109/ICSCCC.2018.8703370","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703370","url":null,"abstract":"Sentiment Analysis and Opinion Mining have been of great interest to the researchers during recent years. It is the process of classifying the opinions or sentiments according to the polarity of the text into positive, neutral and negative. Most of the organizations and industries highly depend on data analytics for their planning and decisionmaking process. Opinion mining and sentiment analysis have great importance in our day-to-day decision making from purchasing products and services to making investments. In this survey, we briefly incorporated the approaches and techniques proposed by researchers in recent investigations along with the issue related to sentiment analysis and opinion mining.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128037050","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}
引用次数: 9
Stock Market Prediction Using Machine Learning 利用机器学习预测股票市场
I. Parmar, Navanshu Agarwal, Sheirsh Saxena, Ridam Arora, Shikhin Gupta, Himanshu Dhiman, Lokesh Chouhan
In Stock Market Prediction, the aim is to predict the future value of the financial stocks of a company. The recent trend in stock market prediction technologies is the use of machine learning which makes predictions based on the values of current stock market indices by training on their previous values. Machine learning itself employs different models to make prediction easier and authentic. The paper focuses on the use of Regression and LSTM based Machine learning to predict stock values. Factors considered are open, close, low, high and volume.
在股票市场预测中,目的是预测公司金融股的未来价值。股票市场预测技术的最新趋势是使用机器学习,通过对当前股票市场指数的先前值进行训练,从而根据当前股票市场指数的值进行预测。机器学习本身使用不同的模型来使预测更容易和真实。本文的重点是使用回归和基于LSTM的机器学习来预测股票价值。考虑的因素包括开、关、低、高和成交量。
{"title":"Stock Market Prediction Using Machine Learning","authors":"I. Parmar, Navanshu Agarwal, Sheirsh Saxena, Ridam Arora, Shikhin Gupta, Himanshu Dhiman, Lokesh Chouhan","doi":"10.1109/ICSCCC.2018.8703332","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703332","url":null,"abstract":"In Stock Market Prediction, the aim is to predict the future value of the financial stocks of a company. The recent trend in stock market prediction technologies is the use of machine learning which makes predictions based on the values of current stock market indices by training on their previous values. Machine learning itself employs different models to make prediction easier and authentic. The paper focuses on the use of Regression and LSTM based Machine learning to predict stock values. Factors considered are open, close, low, high and volume.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"36 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124508531","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}
引用次数: 17
Classification in Devanagari Script using Elliptical Region-wise Features 基于椭圆区域特征的梵文文字分类
Rajib Ghosh, Shaktideo Kumar, Prabhat Kumar
In this article, an attempt has been made to develop a system for classification of online handwritten text and non-text data from within a single online handwritten document in the most popular Indic script-Devanagari. As per our knowledge, no recognized work exists for handwritten text and non-text document classification in online mode in any Indic script. To develop this system an elliptical region-wise feature extraction approach has been proposed in this article. In this approach, each online stroke information of text and non-text documents is divided into smaller elliptical regions by constructing several concentric ellipses around the stroke. Each elliptical region is further divided into several sub-regions before extracting various structural and directional features of stroke portions from each sub region. These features are then studied in Hidden Markov Model (HMM) based classification platform. The efficiency of the present system has been measured on a self-generated dataset and it has provided promising result.
在本文中,尝试开发一个系统,用于对最流行的印度语——devanagari的单个在线手写文档中的在线手写文本和非文本数据进行分类。据我们所知,在任何印度文字的在线模式下,手写文本和非文本文档分类都没有公认的工作存在。为了开发该系统,本文提出了一种椭圆区域特征提取方法。该方法通过在笔画周围构造若干同心椭圆,将文本和非文本文档的每个在线笔画信息划分为更小的椭圆区域。将每个椭圆区域进一步划分为几个子区域,然后从每个子区域提取笔划部分的各种结构和方向特征。然后在基于隐马尔可夫模型(HMM)的分类平台上对这些特征进行研究。在一个自生成的数据集上测试了该系统的效率,并提供了令人满意的结果。
{"title":"Classification in Devanagari Script using Elliptical Region-wise Features","authors":"Rajib Ghosh, Shaktideo Kumar, Prabhat Kumar","doi":"10.1109/ICSCCC.2018.8703200","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703200","url":null,"abstract":"In this article, an attempt has been made to develop a system for classification of online handwritten text and non-text data from within a single online handwritten document in the most popular Indic script-Devanagari. As per our knowledge, no recognized work exists for handwritten text and non-text document classification in online mode in any Indic script. To develop this system an elliptical region-wise feature extraction approach has been proposed in this article. In this approach, each online stroke information of text and non-text documents is divided into smaller elliptical regions by constructing several concentric ellipses around the stroke. Each elliptical region is further divided into several sub-regions before extracting various structural and directional features of stroke portions from each sub region. These features are then studied in Hidden Markov Model (HMM) based classification platform. The efficiency of the present system has been measured on a self-generated dataset and it has provided promising result.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123722964","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
ECSim-2: A Performance Evaluator for Erasure Code based Storage Systems ECSim-2:基于Erasure Code存储系统的性能评估器
Ojus Thomas Lee, Rajat Porwal, S. D. M. Kumar, P. Chandran
In today’s world, cloud storage systems built on distributed technology, are being used to store, manage and access massive amount of data in real time. The data replication based storage method is used by the storage service providers, to ensure fault tolerance although simple, results in storage overhead. With erasure code based storage systems, additional storage requirements to ensure fault tolerance can be reduced, while ensuring reliability equivalent to data replication. Several schemes of erasure coding existing today, however performance evaluation of such schemes through real distributed storage systems, is costly and time consuming. A feasible alternative solution for the problem is the use of simulators. In this research paper, we present a framework that simulates the behavior of an erasure code based storage system. This framework is implemented as an extension to CloudSim, thus making it a platform capable of performance evaluation of the erasure coding schemes. The simulator developed can measure the encoding, decoding delays, transmission delays and congestion. The simulator also has provisions for creating virtual storage nodes, fail the nodes and restore them as part of the testing of the erasure coded storage system.
在当今世界,基于分布式技术的云存储系统被用于实时存储、管理和访问大量数据。存储服务提供商采用基于数据复制的存储方法,虽然简单,但保证了容错,造成了存储开销。使用基于erasure code的存储系统,可以减少额外的存储需求,以确保容错性,同时确保相当于数据复制的可靠性。目前已有几种擦除编码方案,但是通过实际的分布式存储系统对这些方案进行性能评估是昂贵且耗时的。这个问题的一个可行的替代解决方案是使用模拟器。在这篇研究论文中,我们提出了一个框架来模拟基于擦除码的存储系统的行为。该框架作为CloudSim的扩展实现,从而使其成为一个能够对擦除编码方案进行性能评估的平台。所开发的仿真器可以测量编码、解码延迟、传输延迟和拥塞。模拟器还提供了创建虚拟存储节点、故障节点和恢复节点的规定,作为擦除编码存储系统测试的一部分。
{"title":"ECSim-2: A Performance Evaluator for Erasure Code based Storage Systems","authors":"Ojus Thomas Lee, Rajat Porwal, S. D. M. Kumar, P. Chandran","doi":"10.1109/ICSCCC.2018.8703273","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703273","url":null,"abstract":"In today’s world, cloud storage systems built on distributed technology, are being used to store, manage and access massive amount of data in real time. The data replication based storage method is used by the storage service providers, to ensure fault tolerance although simple, results in storage overhead. With erasure code based storage systems, additional storage requirements to ensure fault tolerance can be reduced, while ensuring reliability equivalent to data replication. Several schemes of erasure coding existing today, however performance evaluation of such schemes through real distributed storage systems, is costly and time consuming. A feasible alternative solution for the problem is the use of simulators. In this research paper, we present a framework that simulates the behavior of an erasure code based storage system. This framework is implemented as an extension to CloudSim, thus making it a platform capable of performance evaluation of the erasure coding schemes. The simulator developed can measure the encoding, decoding delays, transmission delays and congestion. The simulator also has provisions for creating virtual storage nodes, fail the nodes and restore them as part of the testing of the erasure coded storage system.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121571456","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
Smart Applications of Internet of Things 物联网的智能应用
Kavleen Kour, Jaspreet Kour, Parminder Singh
The Internet of Things abbreviated as IoT is a concept that refers to physical objects which can gather and share information. The aim of developing this concept is to develop a real time platform to communicate efficiently, smartly and quickly as compared to a system depending on human intervention. The smart objects exchange and consume data and finally analyze and manage it. It is a broad and widespread concept which has many smart applications which create better life experiences in terms of health, safety, security, business etc. In this paper we discuss the building blocks of IoT followed by its smart applications. It covers Smart city as one of its important application along with a brief study of smart city in India and abroad.
物联网(Internet of Things,简称IoT)是一个概念,指的是能够收集和共享信息的物理对象。开发这一概念的目的是开发一个实时平台,与依赖于人为干预的系统相比,可以高效、智能和快速地进行通信。智能对象交换和消费数据,并最终对其进行分析和管理。这是一个广泛而广泛的概念,它有许多智能应用,可以在健康,安全,保安,商业等方面创造更好的生活体验。在本文中,我们讨论了物联网的构建模块及其智能应用。它涵盖了智慧城市作为其重要应用之一,并简要介绍了印度和国外对智慧城市的研究。
{"title":"Smart Applications of Internet of Things","authors":"Kavleen Kour, Jaspreet Kour, Parminder Singh","doi":"10.1109/ICSCCC.2018.8703278","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703278","url":null,"abstract":"The Internet of Things abbreviated as IoT is a concept that refers to physical objects which can gather and share information. The aim of developing this concept is to develop a real time platform to communicate efficiently, smartly and quickly as compared to a system depending on human intervention. The smart objects exchange and consume data and finally analyze and manage it. It is a broad and widespread concept which has many smart applications which create better life experiences in terms of health, safety, security, business etc. In this paper we discuss the building blocks of IoT followed by its smart applications. It covers Smart city as one of its important application along with a brief study of smart city in India and abroad.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"47 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120975741","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
期刊
2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1