The bursting of the dot-com bubble marked a turning point for the web. New kinds of websites sprung up and brought users different experiences, especially in user participation and openness. But academic journals have placed less emphasis on applications of Web 2.0 for business use. This paper tries to develop the business model of these new kinds of websites using ontology approach, which stresses the importance of the social network. Furthermore, this paper suggests using this business model to guide the development of the Web 2.0 website.
{"title":"The Business Model Ontology for Web 2.0 Websites","authors":"Yun Liu","doi":"10.1109/ICEBE.2012.31","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.31","url":null,"abstract":"The bursting of the dot-com bubble marked a turning point for the web. New kinds of websites sprung up and brought users different experiences, especially in user participation and openness. But academic journals have placed less emphasis on applications of Web 2.0 for business use. This paper tries to develop the business model of these new kinds of websites using ontology approach, which stresses the importance of the social network. Furthermore, this paper suggests using this business model to guide the development of the Web 2.0 website.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117063894","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 event processing system discussed in this paper updates target objects' state according to corresponding events. It is widely used in areas such as activity monitoring, business process automation, and business object state management. Existing event driven systems usually employ centralized single-server architecture, which is not scalable, elastic or robust enough to handle highly dynamic workload. In this paper, we propose a cloud-based event driven system that is highly scalable and elastic, and can tolerate even severe system failures. Our event driven system takes advantage of cloud technologies and adopts a completely distributed architecture. It therefore can scale to large number of servers in the cloud quickly with minimum administration overhead. Results from extensive evaluations show that our system's performance grows almost linearly with the number of servers in the system. Our system performs more than one order of magnitude better than a full-replication-based distributed event driven system of the same system scale.
{"title":"A Scalable and Elastic Business Event Processing System","authors":"Ming Li, Liangzhao Zeng","doi":"10.1109/ICEBE.2012.58","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.58","url":null,"abstract":"The event processing system discussed in this paper updates target objects' state according to corresponding events. It is widely used in areas such as activity monitoring, business process automation, and business object state management. Existing event driven systems usually employ centralized single-server architecture, which is not scalable, elastic or robust enough to handle highly dynamic workload. In this paper, we propose a cloud-based event driven system that is highly scalable and elastic, and can tolerate even severe system failures. Our event driven system takes advantage of cloud technologies and adopts a completely distributed architecture. It therefore can scale to large number of servers in the cloud quickly with minimum administration overhead. Results from extensive evaluations show that our system's performance grows almost linearly with the number of servers in the system. Our system performs more than one order of magnitude better than a full-replication-based distributed event driven system of the same system scale.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123331251","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 rapid development of information technology and the severe competition of the bank industry make the internet banking become a new service channel for Chinese banks to acquire new customers and to retain the existing customers. Because the larger part of the profit in internet banking is from the existing customers, Chinese banks have been making their great efforts in order to win the market share by means of retaining loyal customers in recent years. Meanwhile, the studies as to the factors affecting the customer loyalty to internet banking are arousing the interest and attention of more and more scholars in China. This study is to try to find the factors affecting customer loyalty in internet banking, i.e., to investigate the roles of trust and satisfaction in customer loyalty to internet banking in China theoretically and empirically. A model is built with customer loyalty as the endogenous variable, with service quality, brand image and perceived value as exogenous variables, and with satisfaction and trust as mediating variables. Based on data from a sample of 429 internet banking customers collected through a field and an online survey, the results find all the causal relationships in the model significant by using structural equation modeling. Theoretical and managerial implications are provided at the end of the study.
{"title":"An Empirical Study of Customer Loyalty to Internet Banking in China","authors":"Yongbing Jiao, Jian Yang, Zhanfeng Zhu","doi":"10.1109/ICEBE.2012.16","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.16","url":null,"abstract":"The rapid development of information technology and the severe competition of the bank industry make the internet banking become a new service channel for Chinese banks to acquire new customers and to retain the existing customers. Because the larger part of the profit in internet banking is from the existing customers, Chinese banks have been making their great efforts in order to win the market share by means of retaining loyal customers in recent years. Meanwhile, the studies as to the factors affecting the customer loyalty to internet banking are arousing the interest and attention of more and more scholars in China. This study is to try to find the factors affecting customer loyalty in internet banking, i.e., to investigate the roles of trust and satisfaction in customer loyalty to internet banking in China theoretically and empirically. A model is built with customer loyalty as the endogenous variable, with service quality, brand image and perceived value as exogenous variables, and with satisfaction and trust as mediating variables. Based on data from a sample of 429 internet banking customers collected through a field and an online survey, the results find all the causal relationships in the model significant by using structural equation modeling. Theoretical and managerial implications are provided at the end of the study.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125306465","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}
To protect the privacy, users have to encrypt their sensitive data before outsourcing it to the cloud. However, the traditional encryption schemes are inadequate since they make the application of indexing and searching operations more challenging tasks. Accordingly, searchable encryption systems are developed to conduct search operations over a set of encrypted data. Unfortunately, these systems only allow their clients to perform an exact search but not approximate search, an important need for all the current information retrieval systems. Recently, an increased attention has been paid to the approximate searchable encryption systems to find keywords that match the submitted queries approximately. Our work focuses on constructing a flexible secure index that allows the cloud server to perform the approximate search operations without revealing the content of the query trapdoor or the index content. Specifically, the most recently cryptographic primitive, order preserving symmetric encryption (OPSE), has been employed to protect our keywords. Our proposed scheme divides the search operation into two steps. The first step finds the candidate list in terms of secure pruning codes. In particular, we have developed two methods to construct these pruning codes. The second step uses a semi honest third party to determine the best matching keyword depending on secure similarity function. We intend to reveal as little information as possible to that third party. We hope that developing such a system will enhance the utilization of retrieval information systems and make these systems more user-friendly.
{"title":"Approximate Keyword-based Search over Encrypted Cloud Data","authors":"Ayad Ibrahim, Hai Jin, A. Yassin, Deqing Zou","doi":"10.1109/ICEBE.2012.46","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.46","url":null,"abstract":"To protect the privacy, users have to encrypt their sensitive data before outsourcing it to the cloud. However, the traditional encryption schemes are inadequate since they make the application of indexing and searching operations more challenging tasks. Accordingly, searchable encryption systems are developed to conduct search operations over a set of encrypted data. Unfortunately, these systems only allow their clients to perform an exact search but not approximate search, an important need for all the current information retrieval systems. Recently, an increased attention has been paid to the approximate searchable encryption systems to find keywords that match the submitted queries approximately. Our work focuses on constructing a flexible secure index that allows the cloud server to perform the approximate search operations without revealing the content of the query trapdoor or the index content. Specifically, the most recently cryptographic primitive, order preserving symmetric encryption (OPSE), has been employed to protect our keywords. Our proposed scheme divides the search operation into two steps. The first step finds the candidate list in terms of secure pruning codes. In particular, we have developed two methods to construct these pruning codes. The second step uses a semi honest third party to determine the best matching keyword depending on secure similarity function. We intend to reveal as little information as possible to that third party. We hope that developing such a system will enhance the utilization of retrieval information systems and make these systems more user-friendly.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126371201","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}
W. Y. Law, Dickson K. W. Chiu, Haiyang Hu, Yi Zhuang, Hua Hu
Globalization of food production has increased the possibility of public health incidents, involving food contaminated with pathogens or chemicals. In recent years, food poisoning and improper handling of food has caused food safety incidents of international concern. Therefore, rapid access and exchange of food safety alerts is crucial for maintaining consumer confidence in the food supply. In this paper, we introduce an Advanced Rapid Alert System (ARAS) to effectively deliver food safety alerts in a timely manner with structured information to identify affected trades related to problematic food lots and prevent them from selling as soon as possible. The ARAS requires information integration from various government departments and public services through Web services and Service Oriented Architecture (SOA), such as maintaining the databases of food lot, laboratory test results, and food tradesâ information. The ARAS also interacts with the call center through alert mechanisms to integrate incident reporting processes. Moreover, smart phones act as ARAS clients to receive alerts anytime anywhere. Our case study demonstrates the effectiveness of information management through the use of Web services, alerts, and mobile devices in our ARAS framework.
{"title":"An Advanced Rapid Alert System for Food Safety","authors":"W. Y. Law, Dickson K. W. Chiu, Haiyang Hu, Yi Zhuang, Hua Hu","doi":"10.1109/ICEBE.2012.66","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.66","url":null,"abstract":"Globalization of food production has increased the possibility of public health incidents, involving food contaminated with pathogens or chemicals. In recent years, food poisoning and improper handling of food has caused food safety incidents of international concern. Therefore, rapid access and exchange of food safety alerts is crucial for maintaining consumer confidence in the food supply. In this paper, we introduce an Advanced Rapid Alert System (ARAS) to effectively deliver food safety alerts in a timely manner with structured information to identify affected trades related to problematic food lots and prevent them from selling as soon as possible. The ARAS requires information integration from various government departments and public services through Web services and Service Oriented Architecture (SOA), such as maintaining the databases of food lot, laboratory test results, and food tradesâ information. The ARAS also interacts with the call center through alert mechanisms to integrate incident reporting processes. Moreover, smart phones act as ARAS clients to receive alerts anytime anywhere. Our case study demonstrates the effectiveness of information management through the use of Web services, alerts, and mobile devices in our ARAS framework.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133223415","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 cloud computing emphasizes that any resources can be services provided to users. For IaaS, virtualization technologies leverage the use of hardware to serve users without complicated applying procedures. As we know, any physical resources, such as CPU, memory or bandwidth, are precious in general so that they should be used as well as possible. Many researches hence are booming aiming at performance enhancement, especially for cloud networking. The paper presents hardware and software-based concepts to let virtual machines use bandwidth of physical machines under best-effort provisioning. The result can benefit IaaS architecture running from less waste of bandwidth.
{"title":"Efficient Usage of Network Bandwidth in the Cloud Architecture","authors":"Rick C. S. Chen, Chung-Ting Kao, Hui-Kuang Chung","doi":"10.1109/ICEBE.2012.62","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.62","url":null,"abstract":"The cloud computing emphasizes that any resources can be services provided to users. For IaaS, virtualization technologies leverage the use of hardware to serve users without complicated applying procedures. As we know, any physical resources, such as CPU, memory or bandwidth, are precious in general so that they should be used as well as possible. Many researches hence are booming aiming at performance enhancement, especially for cloud networking. The paper presents hardware and software-based concepts to let virtual machines use bandwidth of physical machines under best-effort provisioning. The result can benefit IaaS architecture running from less waste of bandwidth.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128889811","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}
For any IT transformation with significant investment, economic analysis is essential for justifying the risks and expenditures. Much cost modeling has been done for various types of IT transformations, each looks into the unique aspects of the concerned domains. This paper takes a different direction and proposes a general methodology named PANROI for quickly constructing ROI/TCO models to be used in the field. A declarative language, Excedo, is proposed for expressing the model logic and building the user interface. We present a case study on building an ROI model for cloud computing using the methodology and Excedo.
{"title":"Methodology and Tool Design for Building Return on Investment Models for IT Transformations","authors":"Chang-Shing Perng, Rong N. Chang","doi":"10.1109/ICEBE.2012.37","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.37","url":null,"abstract":"For any IT transformation with significant investment, economic analysis is essential for justifying the risks and expenditures. Much cost modeling has been done for various types of IT transformations, each looks into the unique aspects of the concerned domains. This paper takes a different direction and proposes a general methodology named PANROI for quickly constructing ROI/TCO models to be used in the field. A declarative language, Excedo, is proposed for expressing the model logic and building the user interface. We present a case study on building an ROI model for cloud computing using the methodology and Excedo.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126982721","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}
This paper conducts a thorough research on one of the critical technologies in cloud computing, MapReduce programming model. Some of past research results showed that their methods can be executed through allocating identical tasks to each cloud node for enhancing MapReduce performance. However, such allocations are not applicable for the environment of heterogeneous cloud. Due to the different computing power and system resources between the nodes, such uniform distribution of tasks will lower the performance between nodes, and hence this paper makes improvement on the original speculative execution method of Hadoop and LATE Scheduler by proposing a new scheduling scheme known as Dynamic Data Allocation Scheduler (DDAS). DDAS adopts more accurate methods to determine the response time and backup task that affect the system, which is expected to enhance the success ratio of backup tasks and thereby to effectively increase the system ability to respond. Three different simulation experiments are performed and the using of DDAS scheme proves that that DDAS can reduce 30%, 18% and 21% of execution time relative to Hadoop. Also, the DDAS shows a more accurate speculative execution and reasonable allocation of backup tasks. Hence, DDAS can effectively enhance the performance of MapReduce processing in heterogeneous Cloud environment.
本文对云计算的关键技术之一MapReduce编程模型进行了深入的研究。过去的一些研究结果表明，他们的方法可以通过向每个云节点分配相同的任务来执行，以提高MapReduce的性能。但是，这种分配方式并不适用于异构云环境。由于节点之间的计算能力和系统资源不同，这种任务的均匀分布会降低节点之间的性能，因此本文对Hadoop和LATE Scheduler原有的推测执行方法进行了改进，提出了一种新的调度方案动态数据分配调度(Dynamic Data Allocation Scheduler, DDAS)。DDAS采用更精确的方法来确定影响系统的响应时间和备份任务，期望提高备份任务的成功率，从而有效地提高系统的响应能力。通过三种不同的仿真实验，DDAS方案的使用证明DDAS方案相对于Hadoop可以减少30%、18%和21%的执行时间。此外，DDAS还显示了更准确的推测执行和合理的备份任务分配。因此，DDAS可以有效地提高异构云环境下MapReduce的处理性能。
{"title":"Design Dynamic Data Allocation Scheduler to Improve MapReduce Performance in Heterogeneous Clouds","authors":"Shin-Jer Yang, Yi-Ru Chen, Yung-Ming Hsieh","doi":"10.1109/ICEBE.2012.50","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.50","url":null,"abstract":"This paper conducts a thorough research on one of the critical technologies in cloud computing, MapReduce programming model. Some of past research results showed that their methods can be executed through allocating identical tasks to each cloud node for enhancing MapReduce performance. However, such allocations are not applicable for the environment of heterogeneous cloud. Due to the different computing power and system resources between the nodes, such uniform distribution of tasks will lower the performance between nodes, and hence this paper makes improvement on the original speculative execution method of Hadoop and LATE Scheduler by proposing a new scheduling scheme known as Dynamic Data Allocation Scheduler (DDAS). DDAS adopts more accurate methods to determine the response time and backup task that affect the system, which is expected to enhance the success ratio of backup tasks and thereby to effectively increase the system ability to respond. Three different simulation experiments are performed and the using of DDAS scheme proves that that DDAS can reduce 30%, 18% and 21% of execution time relative to Hadoop. Also, the DDAS shows a more accurate speculative execution and reasonable allocation of backup tasks. Hence, DDAS can effectively enhance the performance of MapReduce processing in heterogeneous Cloud environment.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115584354","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}
Composite transaction is a set of two or more related transactions managed in a coordinated logical unit of work. Composite transaction can span multiple data sources or multiple databases. Sometime, we use composite transaction only because we want to split long transactions into short transactions for less lock and more concurrency. In a very large scale distributed system, all of these are valid reasons to use composite transactions. There are different models for composite transaction. Distributed transaction model is widely used in practice since XA specification was released in 1991. However XA specification is notorious for heavy performance cost. To deal with internet scale transaction systems, we have to have some compromised solutions for both performance and consistency considerations. In this paper, we described the methodology and transaction programming model to simplify the system design and provide several guidelines for very large scale distributed transaction systems. We also described the differences between this design model and existing models for composite transaction including distributed transactions (XA 2PC), Sagas and federated transactions. Our design model is practicable and supports true concurrency. It targets at a special type of composite transactions named "Resource Oriented Composite Transaction" (ROCT) which is very common in banking systems, e-commerce systems, airline ticket-sale system, and etc. And our new transaction programming model can be widely used for this type of composite transactions.
复合事务是在一个协调的逻辑工作单元中管理的两个或多个相关事务的集合。复合事务可以跨越多个数据源或多个数据库。有时，我们使用复合事务只是因为我们想把长事务拆分成短事务，以减少锁和提高并发性。在超大规模的分布式系统中，所有这些都是使用复合事务的正当理由。复合事务有不同的模型。自 1991 年发布 XA 规范以来，分布式事务模型在实践中被广泛使用。不过，XA 规范因性能代价高而臭名昭著。要处理互联网规模的事务系统，我们必须在性能和一致性两方面都有一些折中的解决方案。在本文中，我们介绍了简化系统设计的方法和事务编程模型，并为超大规模分布式事务系统提供了若干指导。我们还描述了该设计模型与现有的复合事务模型（包括分布式事务（XA 2PC）、Sagas 和联合事务）之间的区别。我们的设计模型切实可行，支持真正的并发性。它针对的是一种名为 "面向资源的复合事务"（ROCT）的特殊类型的复合事务，这种事务在银行系统、电子商务系统、机票销售系统等中非常常见。我们的新事务编程模型可广泛用于这类复合事务。
{"title":"Resource Oriented Composite Transactions","authors":"R. Liu, Xin Sheng Mao","doi":"10.1109/ICEBE.2012.51","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.51","url":null,"abstract":"Composite transaction is a set of two or more related transactions managed in a coordinated logical unit of work. Composite transaction can span multiple data sources or multiple databases. Sometime, we use composite transaction only because we want to split long transactions into short transactions for less lock and more concurrency. In a very large scale distributed system, all of these are valid reasons to use composite transactions. There are different models for composite transaction. Distributed transaction model is widely used in practice since XA specification was released in 1991. However XA specification is notorious for heavy performance cost. To deal with internet scale transaction systems, we have to have some compromised solutions for both performance and consistency considerations. In this paper, we described the methodology and transaction programming model to simplify the system design and provide several guidelines for very large scale distributed transaction systems. We also described the differences between this design model and existing models for composite transaction including distributed transactions (XA 2PC), Sagas and federated transactions. Our design model is practicable and supports true concurrency. It targets at a special type of composite transactions named \"Resource Oriented Composite Transaction\" (ROCT) which is very common in banking systems, e-commerce systems, airline ticket-sale system, and etc. And our new transaction programming model can be widely used for this type of composite transactions.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131479280","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}
For many smaller and larger entities over the last couple of decades, information systems and technologies have become an integral part of their operations and played a major role in drastically changing and often improving their business processes. As computers become more and more integrated into our business organizations, we end up leaving and storing confidential, vital business and sensitive information on them. In general, larger organizations have the technical expertise and resources to better secure computing services. The Small to Medium Enterprises (SMEâs), however, often lack the platforms, infrastructure, technical expertise, and the required financial resources to be able to utilize modern secure technologies for computing services. This paper discussed the importance of network security, analyzed different type of threats to network infrastructure, different methodologies that can be used to mitigate network infrastructure threats and have proposed an approach for securing SMEâs network infrastructure. This approach suggested Unified Threat Management (UTM) as the first line of protection to the network, based on the links between each distribution switch layers which offers a zone based monitoring and controlling system to prevent the network from any possible threats.
{"title":"Unified Threat Management System Approach for Securing SME's Network Infrastructure","authors":"Saqib Ali, Maitham H. Al Lawati, Syed J. Naqvi","doi":"10.1109/ICEBE.2012.36","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.36","url":null,"abstract":"For many smaller and larger entities over the last couple of decades, information systems and technologies have become an integral part of their operations and played a major role in drastically changing and often improving their business processes. As computers become more and more integrated into our business organizations, we end up leaving and storing confidential, vital business and sensitive information on them. In general, larger organizations have the technical expertise and resources to better secure computing services. The Small to Medium Enterprises (SMEâs), however, often lack the platforms, infrastructure, technical expertise, and the required financial resources to be able to utilize modern secure technologies for computing services. This paper discussed the importance of network security, analyzed different type of threats to network infrastructure, different methodologies that can be used to mitigate network infrastructure threats and have proposed an approach for securing SMEâs network infrastructure. This approach suggested Unified Threat Management (UTM) as the first line of protection to the network, based on the links between each distribution switch layers which offers a zone based monitoring and controlling system to prevent the network from any possible threats.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124963000","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
扫码关注我们
求助内容：
应助结果提醒方式：