Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581263
Yang-Seo Choi, J. Oh, Jongsoo Jang, Jaecheol Ryou
Currently attackers are trying to paralyze servers and networks with various types of DDoS attacks. For example, on 7th July in 2009, a DDoS attack occurred against 48 web sites in South Korea and U.S.A. In this attack, the attack traffic pattern and the botnet construction methods are different from that of previous version. Due to the differences of the attack patterns, the 7.7 DDoS attack was not detected easily. These days, such new types of sophisticated attacks occur and it???s not easy to detect those attacks effectively. In fact, it???s been more than ten years since DDoS attacks discovered in late 1990s. However, DDoS attack is still one of the biggest threats in Internet infrastructure and IT environment. It is because almost all the DDoS defense techniques are not focused on general characteristics and infrastructure but on specific characteristics in each attack. In order to develop a general purpose DDoS defense technology, all the attack process and general characteristics should be analyzed. Furthermore, based on the each attack phases and location of network topology also have to be analyzed. For that, in this paper, we show a general DDoS attack process and each phase in this process. For each phase, we propose DDoS attack prevention requirements and finally suggest the integrated DDoS attack defense infrastructure. For the detailed explanation, we classify attack detection techniques into three categories.
{"title":"Integrated DDoS Attack Defense Infrastructure for Effective Attack Prevention","authors":"Yang-Seo Choi, J. Oh, Jongsoo Jang, Jaecheol Ryou","doi":"10.1109/ITCS.2010.5581263","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581263","url":null,"abstract":"Currently attackers are trying to paralyze servers and networks with various types of DDoS attacks. For example, on 7th July in 2009, a DDoS attack occurred against 48 web sites in South Korea and U.S.A. In this attack, the attack traffic pattern and the botnet construction methods are different from that of previous version. Due to the differences of the attack patterns, the 7.7 DDoS attack was not detected easily. These days, such new types of sophisticated attacks occur and it???s not easy to detect those attacks effectively. In fact, it???s been more than ten years since DDoS attacks discovered in late 1990s. However, DDoS attack is still one of the biggest threats in Internet infrastructure and IT environment. It is because almost all the DDoS defense techniques are not focused on general characteristics and infrastructure but on specific characteristics in each attack. In order to develop a general purpose DDoS defense technology, all the attack process and general characteristics should be analyzed. Furthermore, based on the each attack phases and location of network topology also have to be analyzed. For that, in this paper, we show a general DDoS attack process and each phase in this process. For each phase, we propose DDoS attack prevention requirements and finally suggest the integrated DDoS attack defense infrastructure. For the detailed explanation, we classify attack detection techniques into three categories.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127894220","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581277
Jie Song, Y. Bao
In many business and scientific data warehouses, not only the data amount is growing in geometric series, but also the requirement of real-time capability is increasing. Database partitioning technique which adopts ???divide and conquer??? method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning. The traditional range partitioning approach brings heavy burden to the system without a increased partitioning algorithm, so it does not adapt to the real-time data warehouse partitioning. To speed up the partitioning algorithm, the current partitioning technology is well studied and three effective range partitioning algorithms for the massive data are proposed, which based on allowing the fluctuation of data amount in each range of partitions. At last, some experiments and applications show that the proposed algorithms are more effective and efficient to partitioning and repartitioning tables in the real-time data warehouse.
{"title":"NPA: Increased Partitioning Approach for Massive Data in Real-Time Data Warehouse","authors":"Jie Song, Y. Bao","doi":"10.1109/ITCS.2010.5581277","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581277","url":null,"abstract":"In many business and scientific data warehouses, not only the data amount is growing in geometric series, but also the requirement of real-time capability is increasing. Database partitioning technique which adopts ???divide and conquer??? method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning. The traditional range partitioning approach brings heavy burden to the system without a increased partitioning algorithm, so it does not adapt to the real-time data warehouse partitioning. To speed up the partitioning algorithm, the current partitioning technology is well studied and three effective range partitioning algorithms for the massive data are proposed, which based on allowing the fluctuation of data amount in each range of partitions. At last, some experiments and applications show that the proposed algorithms are more effective and efficient to partitioning and repartitioning tables in the real-time data warehouse.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122654630","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581271
Ki-Won Yeom
This paper presents an approach to develop and manage self organizing distributed components systems in dynamically changing environments. The main idea of this approach is to construct an application by a dynamic association of bio-inspired modular agents that can migrate and reorganize by themselves while the application is being executed. An association of agents can be migrated and transformed according to agents??? local policies including deployment based on biological processes. We have designed an adaptive architecture, which can reorganize and reconfigure agents after several biological concepts and mechanisms, and implemented a platform to host the architecture on the dynamically changing environments. The agents in the proposed framework are designed based on several biological concepts. This paper depicts several key features of the agents in the framework, and describes the design and implementation of the proposed platform. Several simulation results are presented to examine scalability and efficiency of the platform.
{"title":"Bio-Inspired Self-Reconfigurable Architecture for Mobile Agents in Distributed and Networked Environments","authors":"Ki-Won Yeom","doi":"10.1109/ITCS.2010.5581271","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581271","url":null,"abstract":"This paper presents an approach to develop and manage self organizing distributed components systems in dynamically changing environments. The main idea of this approach is to construct an application by a dynamic association of bio-inspired modular agents that can migrate and reorganize by themselves while the application is being executed. An association of agents can be migrated and transformed according to agents??? local policies including deployment based on biological processes. We have designed an adaptive architecture, which can reorganize and reconfigure agents after several biological concepts and mechanisms, and implemented a platform to host the architecture on the dynamically changing environments. The agents in the proposed framework are designed based on several biological concepts. This paper depicts several key features of the agents in the framework, and describes the design and implementation of the proposed platform. Several simulation results are presented to examine scalability and efficiency of the platform.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131118860","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581281
Chul-ki Baek, In-Sub Kim, Jung-Tae Kim, Yong-Hyun Kim, Hyoung B. Min, Jae-Hoon Lee
ANoC (Asynchronous Network-on-Chip) has been developed to solve problems of large number of cores in SoC (System-on-Chip) by giving asynchronism to every core. This new architecture requires new Testing methods different from the existing SoC Test, and it freshly needs the test of router and routing networks. This paper first offers high-speed testing architecture that tests more than one routers and networks at the same time in the 2-D mesh topology. Then, the structure of wrapper for realization of this method is explained. We show that the more number of routers is, the more effective performance is by checking the clock count for test of various ANoCs that have several sizes.
{"title":"A Fast Test Architecture for Asynchronous Network-on-Chip Routing Networks","authors":"Chul-ki Baek, In-Sub Kim, Jung-Tae Kim, Yong-Hyun Kim, Hyoung B. Min, Jae-Hoon Lee","doi":"10.1109/ITCS.2010.5581281","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581281","url":null,"abstract":"ANoC (Asynchronous Network-on-Chip) has been developed to solve problems of large number of cores in SoC (System-on-Chip) by giving asynchronism to every core. This new architecture requires new Testing methods different from the existing SoC Test, and it freshly needs the test of router and routing networks. This paper first offers high-speed testing architecture that tests more than one routers and networks at the same time in the 2-D mesh topology. Then, the structure of wrapper for realization of this method is explained. We show that the more number of routers is, the more effective performance is by checking the clock count for test of various ANoCs that have several sizes.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115193560","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581279
Sun Moo Kim, Giseob Byun, Hyunsik Seo, Taisiya Kim, B. Lee
The purpose of this study is to investigate the impact of the activities for KM on the knowledge sharing through the social networking and digital networking. The research conducted a survey and analyzed the level of the social and digital networking, and identified the relationships with the factors of KM activities, and the knowledge sharing. As the results, the findings illustrate that the managers focused on digital networking based on IS for knowledge sharing. In contrast, for the employees, they mainly focused on social networking. Moreover, as a result of that all the social and digital networking are positive effect on the knowledge sharing, it is need to establish strategies for knowledge sharing through social networking in their organizations.
{"title":"A Comparative Study of Knowledge Sharings of Social and Digital Networkings","authors":"Sun Moo Kim, Giseob Byun, Hyunsik Seo, Taisiya Kim, B. Lee","doi":"10.1109/ITCS.2010.5581279","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581279","url":null,"abstract":"The purpose of this study is to investigate the impact of the activities for KM on the knowledge sharing through the social networking and digital networking. The research conducted a survey and analyzed the level of the social and digital networking, and identified the relationships with the factors of KM activities, and the knowledge sharing. As the results, the findings illustrate that the managers focused on digital networking based on IS for knowledge sharing. In contrast, for the employees, they mainly focused on social networking. Moreover, as a result of that all the social and digital networking are positive effect on the knowledge sharing, it is need to establish strategies for knowledge sharing through social networking in their organizations.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130065623","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581298
Cheng Chen, Jie Zhang, R. Cohen, P. Ho
In this paper, we present a trust-based message propagation and evaluation framework in vehicular ad-hoc networks where peers share information regarding road condition or safety and others provide opinions about whether the information can be trusted. More specifically, our trustbased message propagation model collects and propagates peers??? opinions in an efficient, secure and scalable way by dynamically controlling information dissemination. The trust-based message evaluation model allows peers to evaluate the information in a distributed and collaborative fashion by taking into account others??? opinions. Experimental results demonstrate that our proposed framework promotes network scalability and system effectiveness in information evaluation under the pervasive presence of false information, which are the two essentially important factors for the popularization of vehicular networks.
{"title":"A Trust Modeling Framework for Message Propagation and Evaluation in VANETs","authors":"Cheng Chen, Jie Zhang, R. Cohen, P. Ho","doi":"10.1109/ITCS.2010.5581298","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581298","url":null,"abstract":"In this paper, we present a trust-based message propagation and evaluation framework in vehicular ad-hoc networks where peers share information regarding road condition or safety and others provide opinions about whether the information can be trusted. More specifically, our trustbased message propagation model collects and propagates peers??? opinions in an efficient, secure and scalable way by dynamically controlling information dissemination. The trust-based message evaluation model allows peers to evaluate the information in a distributed and collaborative fashion by taking into account others??? opinions. Experimental results demonstrate that our proposed framework promotes network scalability and system effectiveness in information evaluation under the pervasive presence of false information, which are the two essentially important factors for the popularization of vehicular networks.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134614948","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581291
W. Nie, N. Xiong, J. Park, Sang-Soo Yeo
The IEEE 802.16 standard is proposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We study the scheduling algorithm and propose a fairoriented two-level scheduling scheme for downlink traffic in a WiMAX network. A central controller (Base Station) has a number of users, and different mobile subscriber stations have different channel conditions. Even the same mobile subscriber station has different service requirements in the WiMAX network. Our design improves throughput and alleviates the delay and also ensures fairness in the network. Our results show our scheduling algorithm can increase the network throughput, maintain the relative fairness, and lower delay compared with the round robin algorithm.
{"title":"A Fair-Oriented Two-Level Scheduling Scheme for Downlink Traffic in WiMAX Network","authors":"W. Nie, N. Xiong, J. Park, Sang-Soo Yeo","doi":"10.1109/ITCS.2010.5581291","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581291","url":null,"abstract":"The IEEE 802.16 standard is proposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We study the scheduling algorithm and propose a fairoriented two-level scheduling scheme for downlink traffic in a WiMAX network. A central controller (Base Station) has a number of users, and different mobile subscriber stations have different channel conditions. Even the same mobile subscriber station has different service requirements in the WiMAX network. Our design improves throughput and alleviates the delay and also ensures fairness in the network. Our results show our scheduling algorithm can increase the network throughput, maintain the relative fairness, and lower delay compared with the round robin algorithm.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123980574","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581262
G. Kim, SuGil Choi, Deok-Gyu Lee, J. Han
In SAT (Single Authentication Through) scheme, each smart camera is capable of identifying, tracking identified objects, and delivering associate ID information to sibling subjects. So in this paper, we suggest a privacy preservation scheme for preventing privacy infringement during propagation of sensitive information.
{"title":"Privacy Preservation in SAT (Single Authentication Through)","authors":"G. Kim, SuGil Choi, Deok-Gyu Lee, J. Han","doi":"10.1109/ITCS.2010.5581262","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581262","url":null,"abstract":"In SAT (Single Authentication Through) scheme, each smart camera is capable of identifying, tracking identified objects, and delivering associate ID information to sibling subjects. So in this paper, we suggest a privacy preservation scheme for preventing privacy infringement during propagation of sensitive information.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121422067","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}
Pub Date : 2010-09-23DOI: 10.1109/ITCS.2010.5581265
Sanghoon Kim, K. Jeong, Hyeonjoon Moon
3D model based approach for face recognition has been investigated as a robust solution for pose and illumination variation. Since a generative 3D face model consists of a large number of vertices, a 3D model based face recognition system is generally inefficient in computation time and complexity. In this paper we propose a novel 3D face representation algorithm based on pixel to vertex map (PVM) to reduce number of vertices. We explore shape and texture coefficient vectors of the model by fitting it to an input face using inverse compositional image alignment (ICIA) to evaluate face recognition performance. Experimental results show that proposed face recognition system is efficient in computation time while maintaining reasonable accuracy.
{"title":"3D Model Based Face Recognition Using Inverse Compositional Image Alignment","authors":"Sanghoon Kim, K. Jeong, Hyeonjoon Moon","doi":"10.1109/ITCS.2010.5581265","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581265","url":null,"abstract":"3D model based approach for face recognition has been investigated as a robust solution for pose and illumination variation. Since a generative 3D face model consists of a large number of vertices, a 3D model based face recognition system is generally inefficient in computation time and complexity. In this paper we propose a novel 3D face representation algorithm based on pixel to vertex map (PVM) to reduce number of vertices. We explore shape and texture coefficient vectors of the model by fitting it to an input face using inverse compositional image alignment (ICIA) to evaluate face recognition performance. Experimental results show that proposed face recognition system is efficient in computation time while maintaining reasonable accuracy.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"52 361 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126160519","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}
Pub Date : 2010-09-23DOI: 10.1504/IJITCC.2012.045806
Dave E. Marcial, Josel Pasilan, Andrew Glovasa, Alfran Keith Consing, Carl Louie Mamhot, Aine Aira Tomada
This paper discusses the techniques and methods in developing a web-based auction site which integrates behavioral targeting into its design. This paper further presents and explains several theorems in achieving behavioral and intuitive approaches to online auctioning process. The system, called i-BID, is developed using a Web 2.0 standards in its design to demonstrate the implementation of the behavioral and intuitive approaches. This online system is objectively developed to provide users with a rich, intuitive, and efficient interface. i-BID was rated high on the ???Ease and Intuitiveness??? criterion while the general impact of the behavioral targeting functions of the site is fairly high.
{"title":"Developing Online Auction with Behavioral and Intuitive Functions","authors":"Dave E. Marcial, Josel Pasilan, Andrew Glovasa, Alfran Keith Consing, Carl Louie Mamhot, Aine Aira Tomada","doi":"10.1504/IJITCC.2012.045806","DOIUrl":"https://doi.org/10.1504/IJITCC.2012.045806","url":null,"abstract":"This paper discusses the techniques and methods in developing a web-based auction site which integrates behavioral targeting into its design. This paper further presents and explains several theorems in achieving behavioral and intuitive approaches to online auctioning process. The system, called i-BID, is developed using a Web 2.0 standards in its design to demonstrate the implementation of the behavioral and intuitive approaches. This online system is objectively developed to provide users with a rich, intuitive, and efficient interface. i-BID was rated high on the ???Ease and Intuitiveness??? criterion while the general impact of the behavioral targeting functions of the site is fairly high.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126924511","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
扫码关注我们
求助内容：
应助结果提醒方式：