• 제목/요약/키워드: Internet Speed

Search Result 1,565, Processing Time 0.031 seconds

CBT/Anycast Routing Strategy for The Distribution of MMORPG Traffic (MMORPG 트래픽의 분산을 위한 CBT/Anycast 라우팅 전략)

  • Jurng, Jin-Tae;Lee, Kwang-Jae
    • Journal of Korea Game Society
    • /
    • v.4 no.4
    • /
    • pp.3-9
    • /
    • 2004
  • Expansion of internet and construction of high speed network which require multimedia services like MMORPG are exceeding the infra-structure. In this work, CBT is analyzed by focusing on the multicast routing protoco and the algorithm which is transformable to Anycast scheme from CBT scheme is suggested to adapt game traffic. Anycast routing scheme is suitable to distribute high density traffic. Simulation model was set per a number of group and group member, which enabled to reflect real environments. Performance evaluation of routing based on the characteristics of end-to-end delay of CBT and Anycast was mainly focused, The result showed that Anycast method was improved up 8.7%, 25.5%, 34.0%, 38.6% and 51.8%, 56.6% comparing with PIM-DM and CBT routing when packet site was 128, 512 and 1K byte respectively. From the simulation, CBT/Anycast routing scheme can be presented as a flexible and solid solution for the MMORPG traffic to improve the delay characteristics of game packets.

  • PDF

A Mechanism to Support Real-Time Internet Services over the ATM Network (ATM 망을 통한 실시간 인터넷 서비스 지원 메커니즘)

  • 금정현;정광수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1113-1122
    • /
    • 1999
  • In this paper, we propose MSS(Multicast Synchronization Server) and QCS(QoS Conversion Server) models that can support IP multicast and QoS(Quality of Service) over the ATM network more efficiently. In the MSS model, it is possible to establish shortcut VCs(Virtual Circuits) among all hosts in the ATM network and to transfer multicast data at high speed. Also the MSS model is more scalable, because the number of inter-cluster VCs needed in the MSS model is less than that of EARTH. In the QCS model, ATM switch is modified to support one QoS service and best effort service through the one point-to-multipoint VC at the same time so required network resources are reduced, and dedicated server is used for QoS conversion to accept heterogeneous receivers more efficiently. In this Paper, the proposed MSS model and QCS model have solved both efficiency problem and scalability problem. It is proved through the comparison of the VCs required in each model.

  • PDF

Investigation on Library Services for Visually Imparied at Public Libraries (공공도서관 시각장애인실 서비스에 관한 조사 연구 - 한밭도서관 시각장애인실을 중심으로 -)

  • Kim Young-Shin
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.38 no.3
    • /
    • pp.177-199
    • /
    • 2004
  • Information technology and internet became necessities of life facilitating communication and information access. Physically handicapped people, who cannot access to new Information easily due to economic, technical and physical handicaps, are likely to live with severe disadvantage in the high-speed information society in which information access right is considered as one of the basic human rights. Therefore, It is highly desirable to develop and improve library service programs for visually imparied at public libraries. In this study, the analyse of service activities for the visually unpaired at Hanbat Public Library and the investigation of user's needs and provider's points of view of staff members through individual Interviews were followed by the propositions gor the Improvement of services at local public libraries. And the consrtuction of cooperative networks with proper role-shares among service rooms for visually Imparired In public libraries, special libranes, social welfare organigations and government offices was confrimed to be the most urgent task.

A Study on the Development Web Services Component Based Service Oriented Architecture (SOA 기반의 웹 서비스 컴포넌트 개발에 관한 연구)

  • Park Dong-Sik;Shin Ho-Jun;Kim Haeng-Kon
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.10
    • /
    • pp.1496-1504
    • /
    • 2004
  • Web service should be to connect business between enterprise through the Internet, promotion of construction speed and decrease of development expense of service construction are possible. Also, unification with other domain is possible easily, and update or correction is easy by offering reusability and replaceability through component based development. In this paper, We suggest development process to build architecture and this to integrate consisted component efficiently to develop web service that is embodied in supplier side on service oriented architecture(SOA). The suggest architecture to integrate component that is consisted for this efficiently, and describes development process. So that component develops web service to base structure of web service because do command stratification logically function in each hierarchy define, and presents architecture based on logical hierarchy. The web services consist of Facade and Backside component; The Facade component have web service functions. We describe process that develop to Facade component and present mailing web services as case study. It can be decrease production cost and development time. The web service based on component will improve reliability for reuseability and replaceability.

  • PDF

Design and Implementation of a Pre-processing Method for Image-based Deep Learning of Malware (악성코드의 이미지 기반 딥러닝을 위한 전처리 방법 설계 및 개발)

  • Park, Jihyeon;Kim, Taeok;Shin, Yulim;Kim, Jiyeon;Choi, Eunjung
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.5
    • /
    • pp.650-657
    • /
    • 2020
  • The rapid growth of internet users and faster network speed are driving the new ICT services. ICT Technology has improved our way of thinking and style of life, but it has created security problems such as malware, ransomware, and so on. Therefore, we should research against the increase of malware and the emergence of malicious code. For this, it is necessary to accurately and quickly detect and classify malware family. In this paper, we analyzed and classified visualization technology, which is a preprocessing technology used for deep learning-based malware classification. The first method is to convert each byte into one pixel of the image to produce a grayscale image. The second method is to convert 2bytes of the binary to create a pair of coordinates. The third method is the method using LSH. We proposed improving the technique of using the entire existing malicious code file for visualization, extracting only the areas where important information is expected to exist and then visualizing it. As a result of experimenting in the method we proposed, it shows that selecting and visualizing important information and then classifying it, rather than containing all the information in malicious code, can produce better learning results.

Binary Search Tree with Switch Pointers for IP Address Lookup (스위치 포인터를 이용한 균형 이진 IP 주소 검색 구조)

  • Kim, Hyeong-Gee;Lim, Hye-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.1
    • /
    • pp.57-67
    • /
    • 2009
  • Packet forwarding in the Internet routers is to find out the longest prefix that matches the destination address of an input packet and to forward the input packet to the output port designated by the longest matched prefix. The IP address lookup is the key of the packet forwarding, and it is required to have efficient data structures and search algorithms to provide the high-speed lookup performance. In this paper, an efficient IP address lookup algorithm using binary search is investigated. Most of the existing binary search algorithms are not efficient in search performance since they do not provide a balanced search. The proposed binary search algorithm performs perfectly balanced binary search using switch pointers. The performance of the proposed algorithm is evaluated using actual backbone routing data and it is shown that the proposed algorithm provides very good search performance without increasing the memory amount storing the forwarding table. The proposed algorithm also provides very good scalability since it can be easily extended for multi-way search and for large forwarding tables

Virtual Credit Card Number Payment System with Stored Hash Value for Efficient Authentication (효율적인 인증을 위한 해시 저장방식의 가상카드번호 결제 시스템)

  • Park, Chan-Ho;Kim, Gun-Woo;Park, Chang-Seop
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.1
    • /
    • pp.5-15
    • /
    • 2015
  • Electronic transactions have been increasing with the development of the high-speed Internet and wireless communication. However, in recent years financial corporations and mobile carriers were attacked by hackers. And large numbers of privacy information have been leaked. In particular, in the case of credit card information can be misused in the online transaction, and the damage of this given to cardholder. To prevent these problems, it has been proposed to use a virtual card number instead of the actual card number. But it has security vulnerability and requires additional security infrastructure. In this paper, we analyzed the proposed virtual card number schemes. and we propose a new virtual credit card number scheme. In the newly proposed scheme, cardholder generates a key pair (public key/private key) and pre-register public key to the issuer. then, cardholder can pay no additional security infrastructure while still efficiently satisfy the security requirements.

The Method of Analyzing Firewall Log Data using MapReduce based on NoSQL (NoSQL기반의 MapReduce를 이용한 방화벽 로그 분석 기법)

  • Choi, Bomin;Kong, Jong-Hwan;Hong, Sung-Sam;Han, Myung-Mook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.4
    • /
    • pp.667-677
    • /
    • 2013
  • As the firewall is a typical network security equipment, it is usually installed at most of internal/external networks and makes many packet data in/out. So analyzing the its logs stored in it can provide important and fundamental data on the network security research. However, along with development of communications technology, the speed of internet network is improved and then the amount of log data is becoming 'Massive Data' or 'BigData'. In this trend, there are limits to analyze log data using the traditional database model RDBMS. In this paper, through our Method of Analyzing Firewall log data using MapReduce based on NoSQL, we have discovered that the introducing NoSQL data base model can more effectively analyze the massive log data than the traditional one. We have demonstrated execellent performance of the NoSQL by comparing the performance of data processing with existing RDBMS. Also the proposed method is evaluated by experiments that detect the three attack patterns and shown that it is highly effective.

A Security Protocol for Swarming Technique in Peer-to-Peer Networks (피어 투 피어 네트워크에서 스워밍 기법을 위한 보안 프로토콜)

  • Lee, Kwan-Seob;Lee, Kwan-Sik;Lee, Jang-Ho;Han, Seung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.9
    • /
    • pp.1955-1964
    • /
    • 2011
  • With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

A Fast stream cipher Canon (고속 스트림 암호 Canon)

  • Kim, Gil-Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.7
    • /
    • pp.71-79
    • /
    • 2012
  • Propose stream cipher Canon that need in Wireless sensor network construction that can secure confidentiality and integrity. Create Canon 128 bits streams key by 128 bits secret key and 128 bits IV, and makes 128 bits cipher text through whitening processing with produced streams key and 128 bits plaintext together. Canon for easy hardware implementation and software running fast algorithm consists only of simple logic operations. In particular, because it does not use S-boxes for non-linear operations, hardware implementation is very easy. Proposed stream cipher Canon shows fast speed test results performed better than AES, Salsa20, and gate number is small than Trivium. Canon purpose of the physical environment is very limited applications, mobile phones, wireless Internet environment, DRM (Digital Right Management), wireless sensor networks, RFID, and use software and hardware implementation easy 128 bits stream ciphers.