Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in parts of a network, thereby distributing the traffic load in the network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. Therefore, we should consider an appropriate definition of ``distance'' in networks with the topological features of the network instead of traffic demands. Recent studies have demonstrated a scale-free property of network topology, and node outbound degree distribution is an important factor in the scale-free networks. This paper proposes a new definition of "distance" between two arbitrary communication nodes in the Internet by using node degree information for avoiding congestion in the network. Some simulation results show that the proposed scheme can distribute traffic load from high degree nodes to other nodes, and thus provides robustness of networks.
TE (Traffic Engineering)是一种减少网络中部分高负载链路/节点的技术，从而分散网络中的流量负荷。为了有效地利用网络资源，将流量需求有效地映射到网络资源是非常重要的。因此，我们应该根据网络的拓扑特征而不是流量需求来考虑网络中“距离”的适当定义。近年来的研究表明网络拓扑具有无标度特性，节点出站度分布是影响无标度网络的重要因素。为了避免网络拥塞，本文利用节点度信息，提出了互联网中任意两个通信节点之间的距离的新定义。仿真结果表明，该方案可以将高节点的流量负载分散到其他节点，从而提高了网络的鲁棒性。
{"title":"Node Degree-Aware Link Cost for Traffic Load-Distribution in Large-Scale Networks","authors":"H. Tamura, M. Köppen, M. Uchida, M. Tsuru, Y. Oie","doi":"10.1109/INCoS.2011.126","DOIUrl":"https://doi.org/10.1109/INCoS.2011.126","url":null,"abstract":"Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in parts of a network, thereby distributing the traffic load in the network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. Therefore, we should consider an appropriate definition of ``distance'' in networks with the topological features of the network instead of traffic demands. Recent studies have demonstrated a scale-free property of network topology, and node outbound degree distribution is an important factor in the scale-free networks. This paper proposes a new definition of \"distance\" between two arbitrary communication nodes in the Internet by using node degree information for avoiding congestion in the network. Some simulation results show that the proposed scheme can distribute traffic load from high degree nodes to other nodes, and thus provides robustness of networks.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123297982","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}
In our previous paper, we proposed metabolic computing model in order to realize sustainable information system. We think that metabolic computing model has high fault tolerance and sustainability. We also proposed a realistic architecture of metabolic computing model. Metaboloid is a processing unit in this architecture. A set of metaboloids is organized as mesh connected NORMA. However, in simple metabolism, the specification of architecture is not changed. So, even if manufacturing technology of hardware is innovative, the performance will not be improved. In this paper, we propose an evolutional architecture for metabolic computing model. In this architecture, if the specification is portable and if the difference between specifications is only 1, a set of metaboloids of which specification is different can work together.
{"title":"Proposal of an Evolutional Architecture for Metabolic Computing","authors":"M. Uehara","doi":"10.1109/INCoS.2011.138","DOIUrl":"https://doi.org/10.1109/INCoS.2011.138","url":null,"abstract":"In our previous paper, we proposed metabolic computing model in order to realize sustainable information system. We think that metabolic computing model has high fault tolerance and sustainability. We also proposed a realistic architecture of metabolic computing model. Metaboloid is a processing unit in this architecture. A set of metaboloids is organized as mesh connected NORMA. However, in simple metabolism, the specification of architecture is not changed. So, even if manufacturing technology of hardware is innovative, the performance will not be improved. In this paper, we propose an evolutional architecture for metabolic computing model. In this architecture, if the specification is portable and if the difference between specifications is only 1, a set of metaboloids of which specification is different can work together.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486672","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}
The scale, diversity, and decentralized administration of the Internet mean that to continuously acquire the global status of the network and to timely identify the causes of communication performance degradation is reasonably difficult. However, emerging advanced network applications, which are often sensitive to communication quality and bandwidth consumption, as well as increasing security threats, strongly require a higher quality of network measurement and analysis in terms of granularity (spatial and temporal), timeliness, continuity, coverage, and reliability. Integrating multiple-location, diverse-type, and long-term measurements has been considered a key means for coping with such difficulties. In addition, the measured data and analyzed results should be flexibly shared and reused for efficiency. Therefore, a multi-domain network measurement platform should be realized, as it can provide integrated network monitoring and analysis functionality over the Internet on demand and can adapt to the purposes of the individual users (applications) and operators. In this paper, we thus briefly introduce the design principles and software implementation for a perfSONAR-based integrated network measurement system aiming at gInternet Monitoring As aServiceh, together with a preliminary experiment using a prototype system on the Internet. With help of a function we newly designed and developed, our system can easily utilize new measurement tools and flexibly integrate and provide the measurement results of those tools to users.
{"title":"A perfSONAR-based Integrated Multi-domain Network Measurement Platform -- Internet Monitoring as a Service","authors":"Katsuichi Nakamura, M. Tsuru, Y. Oie","doi":"10.1109/INCoS.2011.1","DOIUrl":"https://doi.org/10.1109/INCoS.2011.1","url":null,"abstract":"The scale, diversity, and decentralized administration of the Internet mean that to continuously acquire the global status of the network and to timely identify the causes of communication performance degradation is reasonably difficult. However, emerging advanced network applications, which are often sensitive to communication quality and bandwidth consumption, as well as increasing security threats, strongly require a higher quality of network measurement and analysis in terms of granularity (spatial and temporal), timeliness, continuity, coverage, and reliability. Integrating multiple-location, diverse-type, and long-term measurements has been considered a key means for coping with such difficulties. In addition, the measured data and analyzed results should be flexibly shared and reused for efficiency. Therefore, a multi-domain network measurement platform should be realized, as it can provide integrated network monitoring and analysis functionality over the Internet on demand and can adapt to the purposes of the individual users (applications) and operators. In this paper, we thus briefly introduce the design principles and software implementation for a perfSONAR-based integrated network measurement system aiming at gInternet Monitoring As aServiceh, together with a preliminary experiment using a prototype system on the Internet. With help of a function we newly designed and developed, our system can easily utilize new measurement tools and flexibly integrate and provide the measurement results of those tools to users.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125666112","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}
In this paper we describe the challenges involved in automating collaborative negotiations and propose solution idea that can reduce computational cost of deal identification. We consider negotiations over a matter that has multiple issues and each issue can take any one of the multiple possible values for that issue. Two challenges are discussed in detail. The first one is the difficulty of assigning utility value ( i.e. evaluating) each possible contract in large contract spaces. The second is the computational complexity of locating the optimal contract. Previous work proposed grouping contracts to avoid evaluating each contract and a mediated bidding based deal identification algorithm to reduce the search for the optimal contract. However, the computational cost of exhaustively matching bids from agents grows exponentially with the number of agents and bids. We propose a rule that can be used during grouping of contracts (defining constraints) that reduces the number of possible bids from agents and hence increases the number of agents that could participate in the negotiation. We assume that each constraint corresponds to one evaluation criterion. The rule states that when evaluating contracts by a criterion, only contracts that satisfied previous contracts are considered.
{"title":"Challenges in Automating Collaborative Negotiations","authors":"Raiye Hailu, Takayuki Ito","doi":"10.1109/INCoS.2011.61","DOIUrl":"https://doi.org/10.1109/INCoS.2011.61","url":null,"abstract":"In this paper we describe the challenges involved in automating collaborative negotiations and propose solution idea that can reduce computational cost of deal identification. We consider negotiations over a matter that has multiple issues and each issue can take any one of the multiple possible values for that issue. Two challenges are discussed in detail. The first one is the difficulty of assigning utility value ( i.e. evaluating) each possible contract in large contract spaces. The second is the computational complexity of locating the optimal contract. Previous work proposed grouping contracts to avoid evaluating each contract and a mediated bidding based deal identification algorithm to reduce the search for the optimal contract. However, the computational cost of exhaustively matching bids from agents grows exponentially with the number of agents and bids. We propose a rule that can be used during grouping of contracts (defining constraints) that reduces the number of possible bids from agents and hence increases the number of agents that could participate in the negotiation. We assume that each constraint corresponds to one evaluation criterion. The rule states that when evaluating contracts by a criterion, only contracts that satisfied previous contracts are considered.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131961244","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}
After achieving the goal of TV digitalization, having an experience of the great earthquake, the government is promoting development and enhancement of the disaster prevention communication network across the nation. The field estimations is significantly important to design high-performance radio communication networks such as fire and disaster prevention wireless communication network. We have developed and proposed the discrete ray tracing method (DRTM) to compute electric field distributions along the land surface structure. We discuss on the discretization of the terrain surface, dividing by observation plate length, the equal interval size of linear piece wise strips. And we consider the alternative plate length for the shape of the surface, for example, short length is only for the mountain summit and long length is for the other. That enables us to reduce more computation time, adjusting the observation point length, keeping an accuracy of calculated output data.
{"title":"Electric Field Intensity Computed by DRTM in Relation to the Number of Plate Observation Points and Frequency","authors":"M. Takematsu, J. Honda, K. Uchida","doi":"10.1109/INCoS.2011.81","DOIUrl":"https://doi.org/10.1109/INCoS.2011.81","url":null,"abstract":"After achieving the goal of TV digitalization, having an experience of the great earthquake, the government is promoting development and enhancement of the disaster prevention communication network across the nation. The field estimations is significantly important to design high-performance radio communication networks such as fire and disaster prevention wireless communication network. We have developed and proposed the discrete ray tracing method (DRTM) to compute electric field distributions along the land surface structure. We discuss on the discretization of the terrain surface, dividing by observation plate length, the equal interval size of linear piece wise strips. And we consider the alternative plate length for the shape of the surface, for example, short length is only for the mountain summit and long length is for the other. That enables us to reduce more computation time, adjusting the observation point length, keeping an accuracy of calculated output data.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128212516","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}
In distributed e-learning paradigm, learning pedagogy demands different content retrieval methodologies after reaching certain boundary of learning. Hence, the learners are expected, to retrieve the contents and they need to improvise at substantially faster rate. The overall learning process converges into a finite time usage and they will return to the same point of access point. The present paper proposes an innovative fish school algorithm to minimize the turnaround time of content retrieval of learner so as to improve learning efficiency. The deployment of fish school contemplates either Prey (the fish perceives the concentration of food in water to determine the movement by vision or sense and then chooses the tendency) swarm ( the fish will assemble in groups naturally in the moving process, which is a kind of living habits in order to guarantee the existence of the colony and avoid dangers) or Follow(in the moving process of the fish swarm, when a single fish or several fish find food, the neighborhood partners will trail and reach the food quickly). In the present problem of content retrieval, these verticals of Fish school are referred to quantify the symbol definition, constraint strategy and stopping criteria for improving turnaround time for the content. The Fish school has the better iterative potential over the other conventional derivative free optimization techniques e.g. Particle Swarm Optimization and Ant Colony Algorithm, and moreover the proposed algorithm can be well interfaced with web portal of e-learning content retrieval. Couples of characteristic results have been included to support the anomalies as the improvement of turnaround time.
{"title":"Exploring Fish School Algorithm for Improving Turnaround Time: An Experience of Content Retrieval","authors":"S. Banerjee, S. Caballé","doi":"10.1109/INCOS.2011.89","DOIUrl":"https://doi.org/10.1109/INCOS.2011.89","url":null,"abstract":"In distributed e-learning paradigm, learning pedagogy demands different content retrieval methodologies after reaching certain boundary of learning. Hence, the learners are expected, to retrieve the contents and they need to improvise at substantially faster rate. The overall learning process converges into a finite time usage and they will return to the same point of access point. The present paper proposes an innovative fish school algorithm to minimize the turnaround time of content retrieval of learner so as to improve learning efficiency. The deployment of fish school contemplates either Prey (the fish perceives the concentration of food in water to determine the movement by vision or sense and then chooses the tendency) swarm ( the fish will assemble in groups naturally in the moving process, which is a kind of living habits in order to guarantee the existence of the colony and avoid dangers) or Follow(in the moving process of the fish swarm, when a single fish or several fish find food, the neighborhood partners will trail and reach the food quickly). In the present problem of content retrieval, these verticals of Fish school are referred to quantify the symbol definition, constraint strategy and stopping criteria for improving turnaround time for the content. The Fish school has the better iterative potential over the other conventional derivative free optimization techniques e.g. Particle Swarm Optimization and Ant Colony Algorithm, and moreover the proposed algorithm can be well interfaced with web portal of e-learning content retrieval. Couples of characteristic results have been included to support the anomalies as the improvement of turnaround time.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130453837","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}
The purpose of this research is to design a new queue management algorithm effectively controlling for all kinds of traffics. Among active queue managements (AQM), Random Early Detection (RED), has been widely used to improve the TCP throughput. AQM such as the RED can sustain the small delay and jitter performance, even if RED generates the retransmission packets. In this paper, we proposed the Stable time RED (ST-RED) to improve the delay and jitter performance without degradation of throughput and good putt performances. ST-RED enables to stabilize the calculation timing for average queue length leading to suppress the queue fluctuations. We also implemented the ST-RED mechanism on the ns-2 simulator. As the results of simulation, we extracted the following features. Firstly, RED improves the delay performance without the degradation of throughput and good put performances for all different alphas of the Pareto distribution. Secondly, ST-RED with 0.5 msec time interval improves the delay and jitter performances compared to the RED.
{"title":"Performance of a Stable Unit Active Queue Management","authors":"Fumihiko Nakamura, T. Nakashima","doi":"10.1109/INCoS.2011.137","DOIUrl":"https://doi.org/10.1109/INCoS.2011.137","url":null,"abstract":"The purpose of this research is to design a new queue management algorithm effectively controlling for all kinds of traffics. Among active queue managements (AQM), Random Early Detection (RED), has been widely used to improve the TCP throughput. AQM such as the RED can sustain the small delay and jitter performance, even if RED generates the retransmission packets. In this paper, we proposed the Stable time RED (ST-RED) to improve the delay and jitter performance without degradation of throughput and good putt performances. ST-RED enables to stabilize the calculation timing for average queue length leading to suppress the queue fluctuations. We also implemented the ST-RED mechanism on the ns-2 simulator. As the results of simulation, we extracted the following features. Firstly, RED improves the delay performance without the degradation of throughput and good put performances for all different alphas of the Pareto distribution. Secondly, ST-RED with 0.5 msec time interval improves the delay and jitter performances compared to the RED.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132013931","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}
Daiki Nobayashi, K. Kumazoe, Y. Fukuda, T. Ikenaga, Tetsuya Ito
The widespread deployment of wireless LANs (WLANs) has increased the importance of developing power-saving technologies. We have been involved in the research and development of Radio-On-Demand Networks (ROD) that reduce energy consumption in the operation of WLANs. In this paper, we evaluate the effectiveness of a power-saving scheme with that uses station aggregation for ROD WLANs by simulations. The simulation results show that our proposed scheme can contribute in reducing the power consumption of access points (APs).
{"title":"Performance Evaluation of Power Saving Scheme for Wireless LAN with Station Aggregation","authors":"Daiki Nobayashi, K. Kumazoe, Y. Fukuda, T. Ikenaga, Tetsuya Ito","doi":"10.1109/INCoS.2011.134","DOIUrl":"https://doi.org/10.1109/INCoS.2011.134","url":null,"abstract":"The widespread deployment of wireless LANs (WLANs) has increased the importance of developing power-saving technologies. We have been involved in the research and development of Radio-On-Demand Networks (ROD) that reduce energy consumption in the operation of WLANs. In this paper, we evaluate the effectiveness of a power-saving scheme with that uses station aggregation for ROD WLANs by simulations. The simulation results show that our proposed scheme can contribute in reducing the power consumption of access points (APs).","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116796694","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}
Insider threats, such as information leakages, are big problems in many organizations. They are difficult to detect and control, because insiders such as employees have legitimate rights to access the organization's resources in order to carry out their responsibilities. For this reason, existing security systems such as firewalls, intrusion detection systems, and access control mechanisms are ineffective countermeasures. Therefore, a framework is being developed for detecting suspicious insiders by triggering monitoring and analysis of suspicious actions done to hide digital evidence. This framework first creates an event (called a "trigger") that will impel malicious members to behave suspiciously, for example, deleting digital data that may be evidence of their malicious behavior. In addition, the framework also monitors and analyzes actions by comparing operational logs before/after the trigger. This work is still in progress. Here, a system architecture based on the detection framework and cases in which it is used are described. Also, the effectiveness and the limitations of the proposed framework are discussed.
{"title":"Towards Detecting Suspicious Insiders by Triggering Digital Data Sealing","authors":"Takayuki Sasaki","doi":"10.1109/INCoS.2011.157","DOIUrl":"https://doi.org/10.1109/INCoS.2011.157","url":null,"abstract":"Insider threats, such as information leakages, are big problems in many organizations. They are difficult to detect and control, because insiders such as employees have legitimate rights to access the organization's resources in order to carry out their responsibilities. For this reason, existing security systems such as firewalls, intrusion detection systems, and access control mechanisms are ineffective countermeasures. Therefore, a framework is being developed for detecting suspicious insiders by triggering monitoring and analysis of suspicious actions done to hide digital evidence. This framework first creates an event (called a \"trigger\") that will impel malicious members to behave suspiciously, for example, deleting digital data that may be evidence of their malicious behavior. In addition, the framework also monitors and analyzes actions by comparing operational logs before/after the trigger. This work is still in progress. Here, a system architecture based on the detection framework and cases in which it is used are described. Also, the effectiveness and the limitations of the proposed framework are discussed.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122206082","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}
Accidents of information leakage and insider threats by malicious employee are major issues in enterprise IT system. Data importance analysis methods can resolve this issue, the importance of data is automatically analyzed by the method and confirms whether the operation suits the security policy for the level of importance of the data. Insider threads are also protected by analyzing data importance and data flows. A mechanism to ascertain data importance via automatic analysis is useful for avoiding human error. The mechanism finds the appropriate category for user sent data in terms of data importance, highly secret, important, and unclassified. In this paper, we presented an analysis method and discussed its application. It will apply to information leakage by both human error and insider threads. The method is a combination of data diagnosis and data categorization, and it can analyze whether the transaction to send the data compiles with the security policy.
{"title":"On Data Importance Analysis","authors":"S. Kiyomoto, Yutaka Miyake","doi":"10.1109/INCoS.2011.127","DOIUrl":"https://doi.org/10.1109/INCoS.2011.127","url":null,"abstract":"Accidents of information leakage and insider threats by malicious employee are major issues in enterprise IT system. Data importance analysis methods can resolve this issue, the importance of data is automatically analyzed by the method and confirms whether the operation suits the security policy for the level of importance of the data. Insider threads are also protected by analyzing data importance and data flows. A mechanism to ascertain data importance via automatic analysis is useful for avoiding human error. The mechanism finds the appropriate category for user sent data in terms of data importance, highly secret, important, and unclassified. In this paper, we presented an analysis method and discussed its application. It will apply to information leakage by both human error and insider threads. The method is a combination of data diagnosis and data categorization, and it can analyze whether the transaction to send the data compiles with the security policy.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122274538","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：