Intrusion detection is an important technique in the defense-in-depth network security framework. The IDS continuously watch the activity on a network or computer, looking for attack and intrusion evidences. However, host-based intrusion detectors are particularly vulnerable, as they can be disabled or tampered by successful intruders. In this paper, a hidden semi-Markov models method for predicting the anomaly events and the intentions of possible intruders to a computer system is developed based on the observation of system call sequences. BSM audit data are used as research data sources. The HsMM structure is redefined to describe the intrusion detection. The time duration of the hidden states is computed by contributing the risk factor of every system call. Then the output probability of current system call sequences are calculated to decide whether the current system behavior is normal and compute the anomaly probability of the subsequent system calls. In the addition, the approximate time when the intrusion has established is estimated. The evaluation of the proposed methodology was carried out through DARPA 1998.The experiment result proves that the proposed method can find the attack attempt in advance to gain the precious time of the active intrusion precaution.
{"title":"The Study of Intrusion Prediction Based on HsMM","authors":"Zhengdao Zhang, Z. Peng, Zhiping Zhou","doi":"10.1109/APSCC.2008.107","DOIUrl":"https://doi.org/10.1109/APSCC.2008.107","url":null,"abstract":"Intrusion detection is an important technique in the defense-in-depth network security framework. The IDS continuously watch the activity on a network or computer, looking for attack and intrusion evidences. However, host-based intrusion detectors are particularly vulnerable, as they can be disabled or tampered by successful intruders. In this paper, a hidden semi-Markov models method for predicting the anomaly events and the intentions of possible intruders to a computer system is developed based on the observation of system call sequences. BSM audit data are used as research data sources. The HsMM structure is redefined to describe the intrusion detection. The time duration of the hidden states is computed by contributing the risk factor of every system call. Then the output probability of current system call sequences are calculated to decide whether the current system behavior is normal and compute the anomaly probability of the subsequent system calls. In the addition, the approximate time when the intrusion has established is estimated. The evaluation of the proposed methodology was carried out through DARPA 1998.The experiment result proves that the proposed method can find the attack attempt in advance to gain the precious time of the active intrusion precaution.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125126062","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}
Li Zhang, Bin Zhang, Y. Liu, Yanxiang Gao, Zhiliang Zhu
With the increasing numbers of Web services and service users on World Wide Web, predicting QoS( Quality of Service ) for users will greatly aid service selection and discovery. Due to the different backgrounds and experiences of users, they have different QoS experiences when interacting with the same service. Even two users who have similar experiences on some services can have diverging views when considering other services. This paper proposes an approach to predict QoS. It is based on not only other users’ QoS experiences, but also the environment factor and user input factor. First bring forwards usage information feature model and calculate the similarity of two users based on the feature model. Then consider not only the historic information, but also environment and users’ inputs, such as bandwidth and data size. Before calculating the user similarity, select a set of Web services that have the highest degree of similarity with the target service, not all of the services. The missing value can be calculated through the data of similar services. The results of the experiment prove that our approach is feasible and effective.
{"title":"A Web Service QoS Prediction Approach Based on Collaborative Filtering","authors":"Li Zhang, Bin Zhang, Y. Liu, Yanxiang Gao, Zhiliang Zhu","doi":"10.1109/APSCC.2010.43","DOIUrl":"https://doi.org/10.1109/APSCC.2010.43","url":null,"abstract":"With the increasing numbers of Web services and service users on World Wide Web, predicting QoS( Quality of Service ) for users will greatly aid service selection and discovery. Due to the different backgrounds and experiences of users, they have different QoS experiences when interacting with the same service. Even two users who have similar experiences on some services can have diverging views when considering other services. This paper proposes an approach to predict QoS. It is based on not only other users’ QoS experiences, but also the environment factor and user input factor. First bring forwards usage information feature model and calculate the similarity of two users based on the feature model. Then consider not only the historic information, but also environment and users’ inputs, such as bandwidth and data size. Before calculating the user similarity, select a set of Web services that have the highest degree of similarity with the target service, not all of the services. The missing value can be calculated through the data of similar services. The results of the experiment prove that our approach is feasible and effective.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"30 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117051963","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}
Wenjing Ma, Mei Song, Yong Zhang, Xin Lin, Huanmei Zhang
With the development of mobile network and computer technology, MIPv6 is brought to the internet. Taking care of the security concerns about network connection, we bring AAA system into the mobile network. In order to be permitted in the integrated architecture of MIPv6 and AAA systems, the users have to get network access permission and AAA response from AAAH. This paper presents an optimization method to enhance handover performance. Above all, we build up a hierarchical AAA architecture and temporarily store AAA credentials at the AAASL. So that mobile user does not have the need to send request to AAAH. Then we encapsulate BU or HoT1 into authentication/authorization request information and save time needed for the BU to travel from MN to HA. Also an improved efficient security association is considered to solve the network access problem. Finally, Experiments indicate that compared with current MIPv6, this optimization method could shorten handover time, especially when the distance between MN and AAAS is long.
{"title":"An Optimization Method to Develop AAA Architectures with MIPv6 Mobility Support","authors":"Wenjing Ma, Mei Song, Yong Zhang, Xin Lin, Huanmei Zhang","doi":"10.1109/APSCC.2008.269","DOIUrl":"https://doi.org/10.1109/APSCC.2008.269","url":null,"abstract":"With the development of mobile network and computer technology, MIPv6 is brought to the internet. Taking care of the security concerns about network connection, we bring AAA system into the mobile network. In order to be permitted in the integrated architecture of MIPv6 and AAA systems, the users have to get network access permission and AAA response from AAAH. This paper presents an optimization method to enhance handover performance. Above all, we build up a hierarchical AAA architecture and temporarily store AAA credentials at the AAASL. So that mobile user does not have the need to send request to AAAH. Then we encapsulate BU or HoT1 into authentication/authorization request information and save time needed for the BU to travel from MN to HA. Also an improved efficient security association is considered to solve the network access problem. Finally, Experiments indicate that compared with current MIPv6, this optimization method could shorten handover time, especially when the distance between MN and AAAS is long.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123884808","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}
Wireless multimedia sensor networks (WMSN) emerges as an important category of Wireless Sensor Networks, which retrieves real-time information such as video and audio streams, still images etc. One of the prominent characteristics of WMSN is severe bandwidth limitation which has great impact on design of routing algorithm. In traditional routing protocols, path(s) are selected aiming at providing optimal transmission performance for the current flow while little attention is paid to bandwidth efficiency. This greedy strategy results in the existence of large amounts of bandwidth fragments which can’t be fully used so that the networks capability to carry real-time flows is degraded. In this paper, bandwidth efficient Collaborative Quality of service Routing (CQR) is proposed. The defining aspect of CQR is to collaboratively optimize the path selections of multiple flows over the networks. The CQR problem is formulized as linear programming. Resource allocation vector is constructed to decouple the inherently dependent path selections between different flows and sub-gradient based searching algorithm is proposed to get the optimal solution. Simulation results show that CQR achieves higher call admission rate for real-time flow comparing to existed algorithm, under heavy load CQR outperforms traditional algorithms about 40% in call admission rate and has similar transmission cost.
{"title":"Bandwidth Efficient Collaborative Quality of Service Routing for Real-Time Flow in Wireless Multimedia Sensor Networks","authors":"Xia Zhang, Hongyi Yu, Gang Zhou","doi":"10.1109/APSCC.2010.20","DOIUrl":"https://doi.org/10.1109/APSCC.2010.20","url":null,"abstract":"Wireless multimedia sensor networks (WMSN) emerges as an important category of Wireless Sensor Networks, which retrieves real-time information such as video and audio streams, still images etc. One of the prominent characteristics of WMSN is severe bandwidth limitation which has great impact on design of routing algorithm. In traditional routing protocols, path(s) are selected aiming at providing optimal transmission performance for the current flow while little attention is paid to bandwidth efficiency. This greedy strategy results in the existence of large amounts of bandwidth fragments which can’t be fully used so that the networks capability to carry real-time flows is degraded. In this paper, bandwidth efficient Collaborative Quality of service Routing (CQR) is proposed. The defining aspect of CQR is to collaboratively optimize the path selections of multiple flows over the networks. The CQR problem is formulized as linear programming. Resource allocation vector is constructed to decouple the inherently dependent path selections between different flows and sub-gradient based searching algorithm is proposed to get the optimal solution. Simulation results show that CQR achieves higher call admission rate for real-time flow comparing to existed algorithm, under heavy load CQR outperforms traditional algorithms about 40% in call admission rate and has similar transmission cost.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126467072","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}
Data distribution is one of the most important steps in the remote sensing applications; it is the bridge between consumers and providers of remote sensing data. Most of the conventional data distribution systems provide Web-based user interface and support a small quantity of data types only. It is not friendly for integrated remote sensing applications. So, a distributed and platform-independent remote sensing data distribution framework which supports multi data type, multi data source, and machine-to-machine intelligent integration is needed. Based on grid technology, a 3-layered remote sensing data distribution system named SIG-DDS is designed and implemented in this paper. In order to make the system simple, extensible and platform-independent, a well-defined extensible data accessing language based on XML is adopted as the accessing language of data sources and data brokers. The distribution system can distribute different sources, types and formats of remote sensing data in one system and make it easier to build up a distributed integrated remote sensing application
{"title":"Remote Sensing Data Distribution by a Grid-Based Data Distribution System","authors":"Zhenchun Huang, Guoqing Li","doi":"10.1109/APSCC.2006.83","DOIUrl":"https://doi.org/10.1109/APSCC.2006.83","url":null,"abstract":"Data distribution is one of the most important steps in the remote sensing applications; it is the bridge between consumers and providers of remote sensing data. Most of the conventional data distribution systems provide Web-based user interface and support a small quantity of data types only. It is not friendly for integrated remote sensing applications. So, a distributed and platform-independent remote sensing data distribution framework which supports multi data type, multi data source, and machine-to-machine intelligent integration is needed. Based on grid technology, a 3-layered remote sensing data distribution system named SIG-DDS is designed and implemented in this paper. In order to make the system simple, extensible and platform-independent, a well-defined extensible data accessing language based on XML is adopted as the accessing language of data sources and data brokers. The distribution system can distribute different sources, types and formats of remote sensing data in one system and make it easier to build up a distributed integrated remote sensing application","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117117423","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}
Haihui Zhang, Xingshe Zhou, Zhiyi Yang, Xiaojun Wu, Ning Fu
In large-scale grid applications, relationship between VOs is not simple information aggregating for autonomy and visiting security. This paper presents a virtual grid information database (VGID) which implements a hierarchical and distributed information management mechanism. An information model is presented with extensible resource metadata management and hierarchical information organization that manages storage-independent resources into a global information structure according to logical relations between resources. Local information database is built within a domain (VO), which includes information collection, storage, and query, as lots of information service has done. Based on dynamical domain information management with topology service and distributed query mechanism, local information databases are integrated to provide a user-transparent global information view. VGID supports standard XPath statement, and index-based query process is tested to be efficient. VGID has been applied to Information Service of ChinaGrid.
{"title":"VGID: A Virtual Hierarchical Distributed Grid Information Database","authors":"Haihui Zhang, Xingshe Zhou, Zhiyi Yang, Xiaojun Wu, Ning Fu","doi":"10.1109/APSCC.2008.148","DOIUrl":"https://doi.org/10.1109/APSCC.2008.148","url":null,"abstract":"In large-scale grid applications, relationship between VOs is not simple information aggregating for autonomy and visiting security. This paper presents a virtual grid information database (VGID) which implements a hierarchical and distributed information management mechanism. An information model is presented with extensible resource metadata management and hierarchical information organization that manages storage-independent resources into a global information structure according to logical relations between resources. Local information database is built within a domain (VO), which includes information collection, storage, and query, as lots of information service has done. Based on dynamical domain information management with topology service and distributed query mechanism, local information databases are integrated to provide a user-transparent global information view. VGID supports standard XPath statement, and index-based query process is tested to be efficient. VGID has been applied to Information Service of ChinaGrid.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122042858","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}
It proposes a fair e-cash payment model on credit outdrawing, which can avoid the odd change and division of e-cash, users, according to the bill of credit issued by the bank, get the e-cash to pay their consumption to sellers after verification by the sellers without the participation of bank at each time. The role of banks is to solve the disputes between the users and sellers to ensure the fairness. It can avoid the problem of partition e-cash for changes, prevent from reusing e-cash and faking e-cash. It fits justice, anonymity, non-deny and impartiality
{"title":"Fair E-cash Payment Model on Credit Overdraft","authors":"Shaobin Wang, N. Su, Lei Hu","doi":"10.1109/APSCC.2006.53","DOIUrl":"https://doi.org/10.1109/APSCC.2006.53","url":null,"abstract":"It proposes a fair e-cash payment model on credit outdrawing, which can avoid the odd change and division of e-cash, users, according to the bill of credit issued by the bank, get the e-cash to pay their consumption to sellers after verification by the sellers without the participation of bank at each time. The role of banks is to solve the disputes between the users and sellers to ensure the fairness. It can avoid the problem of partition e-cash for changes, prevent from reusing e-cash and faking e-cash. It fits justice, anonymity, non-deny and impartiality","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126089881","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}
{"title":"Third Parth Subsidy is Not Effective towards Improving the Trading Efficiency for Most E-Business Markets","authors":"Lung Ngai, Lianchen Liu, Cheng Wu, Lingjuan He","doi":"10.1109/APSCC.2007.1","DOIUrl":"https://doi.org/10.1109/APSCC.2007.1","url":null,"abstract":"","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129873542","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}
Nowadays, Enterprise Information Semantic Integration (EISI) constitutes a real and growing need for most large enterprises, The main problem of EISI is the heterogeneity problem, especially the semantic integration. Current solutions mainly focus on structural and syntactical integration, and the solutions for semantic integration are still immature. In this paper, we introduce a novel FuseGrid-based EISI architecture named FEISI which can achieve dynamic, adaptive and semantic integration of enterprise information resources by organizing, sharing and fusing the information of enterprise. The key issues of FEISI are ontology building and query rewriting, we analyses the organization of ontology and describes a multi-level tree-based ontology structure for the former, for the latter, we show the key algorithm of FEISI. The aim of our approach is to correctly capture, structure and also to manage the semantics within large, dynamic and multidisciplinary enterprises especially enterprise groups.
{"title":"FEISI: Towards Enterprise Information Semantic Integration","authors":"X. Pang, De-yu Qi, Yong Jun Li","doi":"10.1109/APSCC.2006.54","DOIUrl":"https://doi.org/10.1109/APSCC.2006.54","url":null,"abstract":"Nowadays, Enterprise Information Semantic Integration (EISI) constitutes a real and growing need for most large enterprises, The main problem of EISI is the heterogeneity problem, especially the semantic integration. Current solutions mainly focus on structural and syntactical integration, and the solutions for semantic integration are still immature. In this paper, we introduce a novel FuseGrid-based EISI architecture named FEISI which can achieve dynamic, adaptive and semantic integration of enterprise information resources by organizing, sharing and fusing the information of enterprise. The key issues of FEISI are ontology building and query rewriting, we analyses the organization of ontology and describes a multi-level tree-based ontology structure for the former, for the latter, we show the key algorithm of FEISI. The aim of our approach is to correctly capture, structure and also to manage the semantics within large, dynamic and multidisciplinary enterprises especially enterprise groups.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130176443","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
扫码关注我们
求助内容：
应助结果提醒方式：