• Title/Summary/Keyword: Protocols

Search Result 3,980, Processing Time 0.031 seconds

The Communication Protocol Model for Semiconductor Equipment with Internet of Things (사물인터넷을 이용한 반도체 장비 통신 프로토콜 모델)

  • Kim, Doo Yong;Kim, Kiwan
    • Journal of the Semiconductor & Display Technology
    • /
    • v.18 no.4
    • /
    • pp.40-45
    • /
    • 2019
  • The smart factory has developed with the help of several technologies such as automation, artificial intelligence, big data, smart sensors and communication protocols. The Internet of things(IOT) among communication protocols has become the key factor for the seamless integration of various manufacturing equipment. Therefore, it is important that the IOT cooperate with the standards of communication protocols proposed by the SEMI in the semiconductor industry. In this paper, we suggest a novel reference model of the communication protocols for semiconductor equipment by introducing an IOT service layer. With the IOT service layer, we can use the functions and the additional services provided by the IOT standards that give the inter-operability between factory machines and host computers. We implement the standard of the communication protocols for semiconductor equipment with the IOT service layer by using ns3 simulator. It concludes that it is necessary to provide the platform for the IOT service layer to deploy efficiently the proposed reference model of the communication protocols.

Two-Pathway Model for Enhancement of Protocol Reverse Engineering

  • Goo, Young-Hoon;Shim, Kyu-Seok;Baek, Ui-Jun;Kim, Myung-Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4310-4330
    • /
    • 2020
  • With the continuous emergence of new applications and cyberattacks and their frequent updates, the need for automatic protocol reverse engineering is gaining recognition. Although several methods for automatic protocol reverse engineering have been proposed, each method still faces major limitations in extracting clear specifications and in its universal application. In order to overcome such limitations, we propose an automatic protocol reverse engineering method using a two-pathway model based on a contiguous sequential pattern (CSP) algorithm. By using this model, the method can infer both command-oriented protocols and non-command-oriented protocols clearly and in detail. The proposed method infers all the key elements of the protocol, which are syntax, semantics, and finite state machine (FSM), and extracts clear syntax by defining fine-grained field types and three types of format: field format, message format, and flow format. We evaluated the efficacy of the proposed method over two non-command-oriented protocols and three command-oriented protocols: the former are HTTP and DNS, and the latter are FTP, SMTP, and POP3. The experimental results show that this method can reverse engineer with high coverage and correctness rates, more than 98.5% and 99.1% respectively, and be general for both command-oriented and non-command-oriented protocols.

Survivability Analysis of MANET Routing Protocols under DOS Attacks

  • Abbas, Sohail;Haqdad, Muhammad;Khan, Muhammad Zahid;Rehman, Haseeb Ur;Khan, Ajab;Khan, Atta ur Rehman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3639-3662
    • /
    • 2020
  • The network capability to accomplish its functions in a timely fashion under failures and attacks is known as survivability. Ad hoc routing protocols have been studied and extended to various domains, such as Intelligent Transport Systems (ITSs), Unmanned Aerial Vehicles (UAVs), underwater acoustic networks, and Internet of Things (IoT) focusing on different aspects, such as security, QoS, energy. The existing solutions proposed in this domain incur substantial overhead and eventually become burden on the network, especially when there are fewer attacks or no attack at all. There is a need that the effectiveness of these routing protocols be analyzed in the presence of Denial of Service (DoS) attacks without any intrusion detection or prevention system. This will enable us to establish and identify the inherently stable routing protocols that are capable to survive longer in the presence of these attacks. This work presents a DoS attack case study to perform theoretical analysis of survivability on node and network level in the presence of DoS attacks. We evaluate the performance of reactive and proactive routing protocols and analyse their survivability. For experimentation, we use NS-2 simulator without detection or prevention capabilities. Results show that proactive protocols perform better in terms of throughput, overhead and packet drop.

DIMPLE-II: Dynamic Membership Protocol for Epidemic Protocols

  • Sun, Jin;Choi, Byung-K.;Jung, Kwang-Mo
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.3
    • /
    • pp.249-273
    • /
    • 2008
  • Epidemic protocols have two fundamental assumptions. One is the availability of a mechanism that provides each node with a set of log(N) (fanout) nodes to gossip with at each cycle. The other is that the network size N is known to all member nodes. While it may be trivial to support these assumptions in small systems, it is a challenge to realize them in large open dynamic systems, such as peer-to-peer (P2P) systems. Technically, since the most fundamental parameter of epidemic protocols is log(N), without knowing the system size, the protocols will be limited. Further, since the network churn, frequently observed in P2P systems, causes rapid membership changes, providing a different set of log(N) at each cycle is a difficult problem. In order to support the assumptions, the fanout nodes should be selected randomly and uniformly from the entire membership. This paper investigates one possible solution which addresses both problems; providing at each cycle a different set of log(N) nodes selected randomly and uniformly from the entire network under churn, and estimating the dynamic network size in the number of nodes. This solution improves the previously developed distributed algorithm called Shuffle to deal with churn, and utilizes the Shuffle infrastructure to estimate the dynamic network size. The effectiveness of the proposed solution is evaluated by simulation. According to the simulation results, the proposed algorithms successfully handle network churn in providing random log(N0 fanout nodes, and practically and accurately estimate the network size. Overall, this work provides insights in designing epidemic protocols for large scale open dynamic systems, where the protocols behave autonomically.

Outcome of Childhood Acute Lymphoblastic Leukemia Treated Using the Thai National Protocols

  • Seksarn, Panya;Wiangnon, Surapon;Veerakul, Gavivann;Chotsampancharoen, Thirachit;Kanjanapongkul, Somjai;Chainansamit, Su-On
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.11
    • /
    • pp.4609-4614
    • /
    • 2015
  • Background: In recent decades, the prognosis for childhood leukemia has improved, especially for acute lymphoblastic leukemia (ALL). In Thailand, though, the survival rate for ALL is unimpressive. In 2006, standard national protocols for childhood leukemia treatment were implemented. We herein report the outcome of the ALL national protocols and explanations behind discrepancies in outcomes between institutions. Materials and Methods: Between March 2006 and February 2008, 486 children with ALL from 12 institutions were enrolled in the Thai national protocols. There were 3 different protocols based on specific criteria: one each for standard risk, high risk and Burkitt's ALL. We classified participating centers into 4 groups of institutions, namely: medical schools in Bangkok, provincial medical schools, hospitals in Bangkok and provincial hospitals. We also evaluated supportive care, laboratory facilities in participating centers, socioeconomics, and patient compliance. Overall and event-free survival were determined for each group using the Kaplan Meier method. Statistical differences were determined using the log-rank test. Previous outcomes of Thai childhood ALL treatment between 2003 and 2005 served as the historic control. Results: Five-year overall survival of ALL treated using the Thai national protocol was 67.2%; an improvement from the 63.7% of the 12-institute historical control (p-value=0.06). There were discrepancies in event-free survival of ALL between centers in Bangkok and up-country provinces (69.9% vs 51.2%, p-value <0.01). Socioeconomics and patient compliance were key elements in determining the outcome (65.5% vs 47.5%, 59.4% vs 42.9%) (p-value < 0.02). Conclusions: Implementation of standard national protocols for childhood leukemia in Thailand did not significantly improve the outcome of ALL. Factors leading to better outcomes included (a) improvement of treatment compliance (b) prevention of treatment abandonment and (c) financial support to the family.

Optimal cluster formation in cluster-basedmobile P2P algorithm (클러스터 기반 모바일 P2P 알고리즘의 최적 클러스터 구성)

  • Wu, Hyuk;Lee, Dong-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.2
    • /
    • pp.204-212
    • /
    • 2011
  • Mobile P2P(Peer-to-Peer) protocols in MANET(mobile ad-hoc networks) have gained much attention recently. Existing P2P protocols can be categorized into structured and unstructured ones. In MANET, structured P2P protocols show large control traffic because they does not consider the locality of P2P data and unstructured P2P protocols have a scalability problem with respect to the number of nodes. Hybrid P2P protocols combine advantages of the structured and unstructured P2P protocols. Cluster-based P2P protocol is one of the hybrid P2P protocols. Our study makes an analysis of the cluster-based P2P protocol and derives the optimal cluster formation in MANET. In the derived optimal cluster formation, the cluster-based P2P protocol shows better performance than Gnutella protocol with respect to control traffic.

Efficient RFID Search Protocols Providing Enhanced User Privacy (강화된 사용자 프라이버시를 보장하는 효율적인 RFID 검색 프로토콜)

  • Lim, Ji-Hwan;Oh, Hee-Kuck;Nyang, Dae-Hun;Lee, Mun-Kyu;Kim, Sang-Jin
    • The KIPS Transactions:PartC
    • /
    • v.16C no.3
    • /
    • pp.347-356
    • /
    • 2009
  • In an RFID search protocol, a reader uses designated query to determine whether a specific tag is in the vicinity of the reader. This fundamental difference makes search protocol more vulnerable to replay attacks than authentication protocols. Due to this, techniques used in existing RFID authentication protocols may not be suitable for RFID search protocols. In this paper, we propose two RFID search protocols, one based on static ID and the other based on dynamic ID, which use counter to prevent replay attacks. Moreover, we propose a security model for RFID search protocols that includes forward/backward traceability, de-synchronization and forgery attack. Based on this model, we analyze security of our protocols and related works.

Response System for DRDoS Amplification Attacks (DRDoS 증폭 공격 대응 시스템)

  • Kim, Hyo-Jong;Han, Kun-Hee;Shin, Seung-Soo
    • Journal of Convergence for Information Technology
    • /
    • v.10 no.12
    • /
    • pp.22-30
    • /
    • 2020
  • With the development of information and communication technology, DDoS and DRDoS continue to become security issues, and gradually develop into advanced techniques. Recently, IT companies have been threatened with DRDoS technology, which uses protocols from normal servers to exploit as reflective servers. Reflective traffic is traffic from normal servers, making it difficult to distinguish from security equipment and amplified to a maximum of Tbps in real-life cases. In this paper, after comparing and analyzing the DNS amplification and Memcached amplification used in DRDoS attacks, a countermeasure that can reduce the effectiveness of the attack is proposed. Protocols used as reflective traffic include TCP and UDP, and NTP, DNS, and Memcached. Comparing and analyzing DNS protocols and Memcached protocols with higher response sizes of reflective traffic among the protocols used as reflective traffic, Memcached protocols amplify ±21% more than DNS protocols. The countermeasure can reduce the effectiveness of an attack by using the Memcached Protocol's memory initialization command. In future studies, various security-prone servers can be shared over security networks to predict the fundamental blocking effect.

Simple Credit Card Payment Protocols Based on SSL and Passwords (SSL과 패스워드 기반의 신용카드 간편결제 프로토콜)

  • Kim, Seon Beom;Kim, Min Gyu;Park, Jong Hwan
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.3
    • /
    • pp.563-572
    • /
    • 2016
  • Recently, a plenty of credit card payment protocols have been proposed in Korea. Several features of proposed protocols include: using passwords for user authentication in stead of official certificate for authenticity, and no need to download additional security module via ActiveX into user's devices. In this paper, we suggest two new credit card payment protocols that use both SSL(Security Socket Layer) as a standardized secure transaction protocol and password authentication to perform online shopping and payment. The first one is for the case where online shopping mall is different from PG(Payment Gateway) and can be compared to PayPal-based payment methods, and the second one is for the case where online shopping mall is the same as PG and thus can be compared to Amazon-like methods. Two proposed protocols do not require users to perform any pre-registration process which is separate from an underlying shopping process, instead users can perform both shopping and payment into a single process in a convenient way. Also, users are asked to input a distinct payment password, which increases the level of security in the payment protocols. We believe that two proposed protocols can help readers to better understand the recent payment protocols that are suggested by various vendors, and to analyze the security of their payment protocols.