論文 - 久世　尚美

Managed self-organizing control method inspired by adaptive biological behavior

久世尚美

大阪大学 大学院情報科学研究科     2016年01月

Detection of Vulnerability Scanning Using Features of Collective Accesses Based on Information Collected from Multiple Honeypots

Naomi Kuze, Shu Ishikura, Takeshi Yagi, Daiki Chiba, Masayuki Murata

NOMS 2016 - 2016 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM ( IEEE )    1067 - 1072   2016年  [査読有り]

　概要を見る

Attacks against websites are increasing rapidly with the expansion of web services. An increasing number of diversified web services make it difficult to prevent such attacks due to many known vulnerabilities in websites. To overcome this problem, it is necessary to collect the most recent attacks using decoy web honeypots and to implement countermeasures against malicious threats. Web honeypots collect not only malicious accesses by attackers but also benign accesses such as those by web search crawlers. Thus, it is essential to develop a means of automatically identifying malicious accesses from mixed collected data including both malicious and benign accesses. Specifically, detecting vulnerability scanning, which is a preliminary process, is important for preventing attacks. In this study, we focused on classification of accesses for web crawling and vulnerability scanning since these accesses are too similar to be identified. We propose a feature vector including features of collective accesses, e.g., intervals of request arrivals and the dispersion of source port numbers, obtained with multiple honeypots deployed in different networks for classification. Through evaluation using data collected from 37 honeypots in a real network, we show that features of collective accesses are advantageous for vulnerability scanning and crawler classification.

通信の多様化に向けた生物の環境適応性に基づくWebサイトへのぜい弱性スキャン検知

久世 尚美, 石倉 秀, 八木 毅, 千葉 大紀, 村田 正幸

コンピュータセキュリティシンポジウム2015論文集   2015 ( 3 ) 512 - 519   2015年10月

Crawler Classification using Ant-based Clustering Scheme

Naomi Kuze, Shu Ishikura, Takeshi Yagi, Daiki Chiba, Masayuki Murata

2015 10TH INTERNATIONAL CONFERENCE FOR INTERNET TECHNOLOGY AND SECURED TRANSACTIONS (ICITST) ( IEEE )    84 - 89   2015年  [査読有り]

　概要を見る

Attacks against websites are increasing rapidly with the expansion of web services. More and more diversified web services make it difficult to prevent such attacks due to many known vulnerabilities in websites. To overcome this problem, it is necessary to collect latest attacks using decoy web honeypots and to implement countermeasures against malicious threats. Web honeypots collect not only malicious accesses by attackers but also benign accesses such as those by web search crawlers. Thus, it is essential to develop a means of identifying malicious accesses automatically from mixed collected data including both malicious and benign accesses. In this study, we have focused on detection of crawlers whose accesses has been increasing rapidly. A related study proposed a crawler detection scheme in which crawlers are identified based on the features of well-known crawlers such as Google crawlers. However, the diversity of crawler accesses has been increasing rapidly, and adapting to that diversity is a challenging task. Therefore, we have adapted AntTree, a bio-inspired clustering scheme that has high scalability and adaptability, for crawler detection. Through our evaluations using data collected in a real network, we show that AntTree can detect crawlers more precisely than a conventional scheme.

Hierarchical optimal control method for controlling self-organized networks with light-weight cost

Naomi Kuze, Daichi Kominami, Kenji Kashima, Tomoaki Hashimoto, Masayuki Murata

2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) ( IEEE )    1 - 7   2015年  [査読有り]

　概要を見る

Self-organization has potential for high scalability, adaptability, flexibility, and robustness, which are vital features for realizing future networks. Convergence of self-organizing control, however, is comparatively slow in some practical applications. It is therefore important to enhance convergence of self-organizing controls without sacrificing the above advantages. Controlled self-organization is one key idea for that, which introduces an external controller into self-organizing systems to guide them to a desired state. We previously designed an external controller that provided the optimal input for fast convergence, however, it suffered from scalability issues. In this paper, we propose a hierarchical control system where a network is partitioned into some sub-networks, sub-controllers manage respective sub-networks, and the top-level deals with the global network stability. The proposed system achieves fast convergence speed with low computational and communication cost.

低次元近似化したモデルを用いた最適制御のポテンシャルルーティングへの応用

久世尚美, 小南大智, 加嶋健司, 橋本智昭, 村田正幸

電子情報通信学会技術研究報告 (IN2014-32)   114 ( 139 ) 13 - 18   2014年07月

モデル予測制御を用いたポテンシャルルーティングのロバスト性に関する検討

久世尚美, 小南大智, 加嶋健司, 橋本智昭, 村田正幸

電子情報通信学会技術研究報告 (IN2013-195)   113 ( 473 ) 305 - 310   2014年03月

A predictive mechanism for enhancing adaptability of self-organised routing

Naomi Kuze

International Journal of Bio-Inspired Computation ( Inderscience Publishers )  6 ( 6 ) 384 - 384   2014年01月

DOI

Enhancing Convergence with Optimal Feedback for Controlled Self-Organizing Networks

Naomi Kuze, Daichi Kominami, Kenji Kashima, Tomoaki Hashimoto, Masayuki Murata

2014 IEEE 80TH VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL) ( IEEE )    1 - 7   2014年  [査読有り]

　概要を見る

To tackle with problems emerging with rapid growth of information networks in scale and complexity, self-organization is one of promising design principles for future networks. Convergence of self-organizing controls, however, is pointed out to be comparatively slow in some practical applications. Therefore, it is important to reveal and enhance convergence of self-organizing controls. In controlled self-organization, which introduces an external observer/controller into self-organizing systems, systems are controlled in order to guide them to the desired state. Although previous controlled self-organization schemes could achieve this feature, convergence speed for reaching an optimal or a semi-optimal solution is still a challenging task. In this paper, we take potential-based self-organizing routing and provide an optimal feedback for faster convergence using the future state of the system. Simulation results show that the convergence speed of potentials is improved by 7.3 times with a proposed mechanism.

Proposal and evaluation of a predictive mechanism for ant-based routing

久世尚美, 小南大智, 加嶋健司, 橋本智昭, 村田正幸

Proceedings of International Conference on Emerging Network Intelligence (EMERGING 2013)     7 - 12   2013年09月  [査読有り]

Proposal and evaluation of a predictive mechanism for controlled self-organization based routing

久世尚美

大阪大学 大学院情報科学研究科     2013年02月

Proposal and evaluation of ant-based routing with prediction

久世尚美, 若宮直紀, 村田正幸

Proceedings of the Fifth International Workshop on Guided Self-Organization (GSO-2012)     2012年09月  [査読有り]

自律的な領域分割を行うゾーンベースアントルーチング手法の提案と評価

久世 尚美, 若宮 直紀, 村田 正幸

電子情報通信学会技術研究報告. IN, 情報ネットワーク ( 一般社団法人電子情報通信学会 )  111 ( 469 ) 353 - 358   2012年03月

　概要を見る

ネットワークのさらなる大規模化,複雑化によって顕在化する様々な問題に対応できる新たなネットワークシステムを構築するため,生物などにみられる自己組織化の仕組みを応用する手法が注目を集めている.自己組織型のネットワーク制御技術は,拡張性,頑健性,適応性があることが示されているが,一方で,環境条件によっては局所解に陥る,収束性が低下する場合があることから,近年,制御された自己組織化の研究が行われるようになってきた.本研究では,アリの採餌行動に着想を得た経路制御手法AntNetを題材に,大域情報を用いることなく探索領域を狭めることで,経路全体の収束時間を短縮する手法を提案している.シミュレーション評価により,探索範囲を制限することで自己組織化が促進され,収束性が向上するとともに,より短い経路が得られることを示した.

Proposal and evaluation of ant-based routing with autonomous zoning for convergence improvement

Naomi Kuze, Naoki Wakamiya, Masayuki Murata

Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012     290 - 297   2012年  [査読有り]

　概要を見る

To tackle problems emerging with rapid growth of information networks in scale and complexity, bio-inspired self organization is considered one of promising design principles of a new generation network which is scalable, robust, adaptive, and sustainable. However, self-organizing systems would fall into a local optimum or never converge under some environmental conditions. Controlled or guided self-organization is a novel concept attracting many researchers in these years, where loose and moderate control is imposed on a self-organizing system to push it toward a desired state. In this paper, we take Ant Net, an ant-based routing protocol, as an example and consider a mechanism to accelerate convergence by limiting the search space. The proposed mechanism is compared with Ant Net and HOPNET from viewpoints of the convergence time, path length, and control overhead. Simulation results show that our proposal can accelerate convergence of ant-based routing to a shorter path than Ant Net and with lower control overhead than HOPNET. © 2012 IEEE.

DOI