• Title/Summary/Keyword: Request

Search Result 2,824, Processing Time 0.027 seconds

Efficient Connection Scheduling Technique for Hosting Internet Services on a Cluster of Servers (서버 클러스터에서의 인터넷 서비스를 위한 효율적인 연결 스케줄링 기법)

  • 최재웅;김성천
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.352-358
    • /
    • 2003
  • A cluster of servers is the most promising solution to provide highly scalable and highly available network services with low implementation cost. One of popular solutions is using dispatcher as a request distributor. However this solution has the problem that is can be the bottleneck or single-point of failure point of itself. ONE-IP, the previous work, solves this serious problem by using broadcast message for distributing the request packet in LAN. Using simple scheduling technique, in addition, the overhead due to dispatching the request becomes minimal. However, as ONE-IP using very simple static scheduling algorithm, it would spread the request among servers unevenly and downgrades the cluster performance consequently. In this paper, we propose an improved TCP connection scheduling technique solving this unbalanced distributing problem. Using Round-Robin(RR) scheduling instead of hashing clients IP address, proposed technique can more evenly distribute incoming service requests among the servers. Experiments show average 3.8% improved performance in throughput compared to original ONE-IP technique.

Design and Implementation of a Request and Response Process on Help-Requesting Mobile Application (모바일 도움요청 어플리케이션에서의 요청 및 상호 대응 프로세스 설계)

  • An, Sung-Eun;Lim, Soon-Bum;Kim, Min-Jeong;You, Soo-Yeon
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.4
    • /
    • pp.320-326
    • /
    • 2015
  • With the growing concern over frequent occurrences of criminal events, help-requesting mobile applications have drawn attention. However, existing applications solely focus on providing help-requesting services. Therefore, in this paper, we design and implement a help request and response process which allows users to request help by sending messages and locating their friends, acquaintances and even near-by application users, and to allow help be reached by forwarding messages. This application is composed of three parts: help-requesting, help-responding, and checking-status. This application is developed on the Android platform where we exchange users' longitude and latitude through web server communication. We conducted test to verify the effectiveness of the forwarding function, and it has been confirmed that 93.33% of subjects used the forwarding function to help users at risk.

An Anti Collision Algorithm using Parity Mechanism in RFID Systems (RFID 시스템에서 패리티 메카니즘을 이용한 충돌방지 알고리즘)

  • Kim, Sung-Soo;Kim, Yong-Hwan;Ahn, Kwang-Seon
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.5
    • /
    • pp.389-396
    • /
    • 2009
  • In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

Key Establishment Scheme for Multicast CoAP Security (멀티캐스트 CoAP 보안을 위한 키 설정 기법)

  • Cho, Jung mo;Han, Sang woo;Park, Chang seop
    • Convergence Security Journal
    • /
    • v.17 no.5
    • /
    • pp.77-85
    • /
    • 2017
  • In this paper, we propose a key establishment scheme for multicast CoAP security. For multicast CoAP applications, a CoAP Request message from a CoAP client is sent to a group of CoAP servers while each CoAP server responds with a unicast CoAP Response message. In this case, the CoAP Request message should be secured with a group key common to both the CoAP client and servers, while a pairwise key(unicast key) should be employed to secure each CoAP Response message. In the proposed protocol, the CoAP client and the CoAP server establish the group key and the pairwise key using the ECDH in the initial CoAP message exchange process. The proposed protocol, which is highly efficient and scalable, can replace DTLS Handshake and it can support end-to-end security by setting pairwise keys.

DTLS-based CoAP Security Mechanism Analysis and Performance Evaluation (DTLS 기반의 CoAP 보안 메커니즘 분석 및 성능평가)

  • Han, Sang woo;Park, Chang seop;Cho, Jung mo
    • Convergence Security Journal
    • /
    • v.17 no.5
    • /
    • pp.3-10
    • /
    • 2017
  • Standard Protocol Optimized for Resource-Constrained IoT Environment Constrained Application Protocol (CoAP) supports web-based communication between a sensor node in the IoT environment and a client on the Internet. The CoAP is a Request / Response model that responds to the client's CoAP Request message by responding with a CoAP Response message from the server. CoAP recommends the use of CoAP-DTLS for message protection. However, validation of the use of DTLS in the IoT environment is underway. We analyze CoAP and DTLS security mode, evaluate performance of secure channel creation time, security channel creation step time, and RAM / ROM consumption through Cooja simulator and evaluate the possibility of real environment application.

An Analysis of Wi-Fi Probe Request for Crowd Counting through MAC-Address classification (MAC-Address 분류를 통한 Wi-Fi Probe Request 기반 유동인구 분석 방법)

  • Oppokhonov, Shokirkhon;Lee, Jae-Hyun;Moon, Jun-young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.4
    • /
    • pp.612-623
    • /
    • 2022
  • Estimation of the presence of people in real time is extremely useful for businesses in providing better services. Many companies and researchers have attempted various researches in order to count the number of floating population in a specific space. Recently, as part of smart cities and digital twins, commercialization of measuring floating populations using Wi-Fi signals has become active in the public and private sectors. In this paper we present a method of estimating the floating population based on MAC-address values collected from smartphones. By distinguishing Real MAC-address and Random MAC-address values, we compare the estimated number of smartphone devices and the actual number of people caught on CCTV screens to evaluate the accuracy of the proposed method. And it appeared to have a similar correlation between the two datas. As a result, we present a method of estimating the floating population based on analyzing Wi-Fi Probe Requests.

A Study on the Efficient Information Delivery of Take-Over Request for Semi-Autonomous Vehicles (반자율주행 차량의 제어권 전환 상황에서 효율적 정보 제공 방식에 관한 연구)

  • Park, Cheonkyu;Kim, Dongwhan
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.4
    • /
    • pp.70-82
    • /
    • 2022
  • At the current stage of a semi-autonomous vehicle, there are situations in which the vehicle has to request take-over control to the driver quickly. However, current self-driving cars use only simple messages and warning sounds to notify drivers when handing over control, so they do not adequately convey considerations of individual characteristics or explanations of various emergent situations. This study investigated how visual and auditory information and the efficacy of drivers in self-driving cars can improve efficient take-over requests between the car and the driver. We found that there were significant differences in driver's cognitive load, reliability, safety, usability, and usefulness according to the combination of three visual and auditory information provided in the experiment of the take-over request situation. The results of this study are expected to help design self-driving vehicles that can communicate more safely and efficiently with drivers in urgent control transition situations.

Analysis of the IP Spoofing Attack Exploiting Null Security Algorithms in 5G Networks

  • Park, Tae-Keun;Park, Jong-Geun;Kim, Keewon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.9
    • /
    • pp.113-120
    • /
    • 2022
  • In this paper, we analyze the feasibility of the IP spoofing attack exploiting null security algorithms in 5G networks based on 3GPP standard specifications. According to 3GPP standard specifications, the initial Registration Request message is not protected by encryption and integrity. The IP spoofing attack exploits the vulnerability that allows a malicious gNB (next generation Node B) to modify the contents of the initial Registration Request message of a victim UE (User Equipment) before forwarding it to AMF (Access and Mobility Management Function). If the attack succeeds, the victim UE is disconnected from the 5G network and a malicious UE gets Internet services, while the 5G operator will charge the victim UE. In this paper, we analyze the feasibility of the IP spoofing attack by analyzing whether each signaling message composing the attack conforms to the 3GPP Rel-17 standard specifications. As a result of the analysis, it is determined that the IP spoofing attack is not feasible in the 5G system implemented according to the 3GPP Rel-17 standard specifications.

Why abandon Randomized MAC-Address : An Analysis of Wi-Fi Probe Request for Crowd Counting (Why abandon Randomized MAC-Address : Wi-Fi Probe Request 기반 유동인구 분석 방법)

  • Oppokhonov, Shokirkhon;Lee, Jae-Hyun;Moon, Jun-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.24-34
    • /
    • 2021
  • Estimation of the presence of people in real time is extremely useful for businesses in providing better services. Many companies and researchers have attempted various researches in order to count the number of floating population in specific space. Recently, as part of smart cities and digital twins, commercialization of measuring floating populations using Wi-Fi signals has become active in the public and private sectors. This paper explains the floating population measuring system from the perspective of general consumers(non-experts) who uses current population data. Specifically, it presents a method of estimating the floating population based on MAC-address values collected from smartphones. By distinguishing Real MAC-address and Random MAC-address values, we compare the estimated number of smartphone devices and the actual number of people caught on CCTV screens to evaluate the accuracy of the proposed method. And it appeared to have a similar correlation between the two datas. As a result, we present a method of estimating the floating population based on analyzing Wi-Fi Probe Requests

  • PDF

Comparative Analysis and Validation of CSRF Defense Mechanisms in Spring Security and Apache Shiro (Spring Security와 Apache Shiro의 CSRF 공격 방어 기법 비교 분석 및 검증)

  • Jj-oh Kim;Da-yeon Namgoong;Sanghoon Jeon
    • Convergence Security Journal
    • /
    • v.24 no.2
    • /
    • pp.79-87
    • /
    • 2024
  • This paper addresses the increasing cyber attacks exploiting security vulnerabilities in software due to the rise in web applications. CSRF (Cross-Site Request Forgery) attacks pose a serious threat to web users and developers and must be prevented in advance. CSRF involves performing malicious requests without the user's consent, making protection methods crucial for web applications. This study compares and verifies the CSRF defense performance of two frameworks, Spring Security and Apache Shiro, to propose an effectively applicable framework. The results show that both frameworks successfully defend against CSRF attacks; however, Spring Security processes requests faster, averaging 2.55 seconds compared to Apache Shiro's 5.1 seconds. This performance difference stems from variations in internal processing methods and optimization levels. Both frameworks showed no significant differences in resource usage. Therefore, Spring Security is more suitable for environments requiring high performance and efficient request processing, while Apache Shiro needs improvement. These findings are expected to serve as valuable references for designing web application security architectures