• Title/Summary/Keyword: Message Processing

Search Result 859, Processing Time 0.03 seconds

Design of Multicast Cut-through Switch using Shared Bus (공유 버스를 사용한 멀티캐스트 Cut-through 스위치의 설계)

  • Baek, Jung-Min;Kim, Sung-Chun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.3
    • /
    • pp.277-286
    • /
    • 2000
  • Switch-based network is suitable for the environment of demanding high performance network. Traditional shared-medium Local Area Networks(LANs) do not provide sufficient throughput and latency. Specially, communication performance is more important with multimedia application. In these environments, switch-based network results in high performance. A kind of switch-based network provides higher bandwidth and low latency. Thus high-speed switch is essential to build switch-based LANs. An effective switch design is the most important factor of the switch-based network performance, and is required for the multicast message processing. In the previous cut-through switching technique, switch element reconfiguration has the capability of multicasting and deadlock-free. However, it has problems of low throughput as well as large scale of switch. Therfore, effective multicating can be implemented by using divided hardware unicast and multicast. The objective of this thesis is to suggest switch configuration with these features.

  • PDF

A Study on Optimization of Networking Mechanism of Distributed List (분산리스트 네트워킹 메카니즘의 최적화에 관한 연구)

  • 임동주
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.3
    • /
    • pp.475-482
    • /
    • 2001
  • In this paper, I describe the implementation of the distributed lists based on socket and on RMI(Remote Method Invocation). First, I describe and implement an interface of distributed list based on socket using object stream in a distributed environment, when encapsulating the message in the distributed list. Second, the major purpose to implement a distributed list in RMI is to compare advantages and disadvantages with other networking mechanisms by implementing complicated applications. The major advantage in using RMI is to implement simply the programs without using application-level protocol. In terms of program efficiency, the applications using HMI can degrade the performance due to many TCP/IP connections generated every update. TCP/IP connection requires much less cost than RMI. Even though RMI has the mechanism processing many method calls using a sing]e network connection, RMI is less efficient than the direct use of socket. However, RMI makes it possible to communicate beyond firewall using HTTP proxying mechanism. Consequently, I present a modeling of networking mechanism in finding out optimization solution by comparing and analyzing the two systems.

  • PDF

Assisted SBAS Global Navigation Satellite System Operation Method for Reducing SBAS Time to First Fix (SBAS 보강항법 초기 위치 결정 시간 단축을 위한 A-SGNSS 운용 방안)

  • Lee, Ju Hyun;Kim, Il Kyu;Seo, Hung Seok
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.2
    • /
    • pp.92-100
    • /
    • 2020
  • Satellite-based argumentation systems (SBAS) is a system that enhances the accuracy, integrity, availability and continuity of GNSS navigation users by using geostationary orbit (GEO) satellites to send correction information and the failures of global navigation satellite system (GNSS) satellites in the form of messages. The correction information provided by SBAS is pseudorange error, satellite orbit error, clock error, and ionospheric delay error at 250 bps. Therefore, A lot of message processing are required for the SBAS navigation. There is a need to reduce SBAS time to first fix (TTFF) for using SBAS navigation in systems with short operating time. In this paper, A-SGNSS operation method was proposed for reducing SBAS TTFF. Also, A-SGNSS TTFF and availability were analyzed.

Design and Implementation of SMS Application System with Wireless Internet Environment (무선인터넷환경과 연계한 SMS애플리케이션 시스템의 설계 및 구현)

  • Yang Hae-Sool;Hong Jung-Hun
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1507-1516
    • /
    • 2004
  • Recently, the most remarkable word is 'ubiuuitous' in field of information and communication. Ubiquitous has a meaning 'exist everywhere' that means our daily life is connect as network. It means we can get the information which in need whenever and wherever with safety. We predict this word will be symbolical keyword which lead an information-oriented society including the internet a quite long it. It's already per-meate to us the Ubiquitous. It's taken by CCTV when we visit bank. It's made to us can know the fastest way the GPS system to be connected by an artificial satcllite on mobile, and many people use mobile and PDA for investment in stocks. Among them, it has begun to spread many mobile services to us. In this paper, it's the aim a creation of value added through an efficient mobile services to use wireless internet different with previous way, cutting down on expenses and business modeling.

A feedback Scheme for Synchronization in a Distributed Multimedia (분산 멀티미디어 프리젠테이션 시스템에서 동기화를 위한 피드백 기법)

  • Choi, Sook-Young
    • The KIPS Transactions:PartB
    • /
    • v.9B no.1
    • /
    • pp.47-56
    • /
    • 2002
  • In the distributed multimedia document system, media objects distributed over a computer network are retrieved from their sources and presented to users according to specified temporal relations. For effective presentation, synchronization has to be supported. Furthermore, since the presentation in the distributed environment is influenced by the network bandwidth and delay, they should be considered for synchronization. This paper proposes a distributed multimedia presentation system that performs presentation effectively in the distributed environment. And it also suggests a method to supports synchronization, in which, network situation and resources are monitored when media objects are transferred from servers to a client. Then a feedback message for the change of them is sent to the server so that the server might adjust the data sending rate to control synchronization. To monitor the situation of network, we use two methods together. One is to manage the level of the buffer by setting thresholds on a buffer and the other is to check the difference between the sending time of a packet from the server and the arrival time of the packet to the client.

Design of a New Audio Watermarking System Based on Human Auditory System (청각시스템을 기반으로 한 새로운 오디오 워터마킹 시스템 설계)

  • Shin, Dong-Hwan;Shin Seung-Won;Kim, Jong-Weon;Choi, Jong-Uk;Kim, Duck-Young;Kim, Sung-Hwan
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.7
    • /
    • pp.308-316
    • /
    • 2002
  • In this paper, we propose a robust digital copyright-protection technique based on the concept of human auditory system. First, we propose a watermarking technique that accepts the various attacks such as, time scaling, pitch shift, add noise and a lot of lossy compression such as MP3, AAC WMA. Second, we implement audio PD(portable device) for copyright protection using proposed method. The proposed watermarking technique is developed using digital filtering technique. Being designed according to critical band of HAS(human auditory system), the digital filers embed watermark without nearly affecting audio quality. Before processing of digital filtering, wavelet transform decomposes the input audio signal into several signals that are composed of specific frequencies. Then, we embed watermark in the decomposed signal (0kHz~11kHz) by designed band-stop digital filer. Watermarking detection algorithm is implemented on audio PD(portable device). Proposed watermarking technology embeds 2bits information per 15 seconds. If PD detects watermark '11', which means illegal song. PD displays "Illegal Song" message on LCD, skips the song and plays the next song, The implemented detection algorithm in PD requires 19 MHz computational power, 7.9kBytes ROM and 10kBytes RAM. The suggested technique satisfies SDMI(secure digital music initiative) requirements of platform3 based on ARM9E core.

Address Auto-Resolution Network System for Neutralizing ARP-Based Attacks (ARP 기반 공격의 무력화를 위한 주소 자동 결정 네트워크 시스템)

  • Jang, RhongHo;Lee, KyungHee;Nyang, DaeHun;Youm, HeungYoul
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.4
    • /
    • pp.203-210
    • /
    • 2017
  • Address resolution protocol (ARP) is used for binding a logical address to a physical address in many network technologies. However, since ARP is an stateless protocol, it always abused for performing ARP-based attacks. Researchers presented many technologies to improve ARP protocol, but most of them require a high implementation cost or scarify the network performance for improving security of ARP protocol. In this paper, we present an address auto-resoultion (AAR) network system to neutralize the ARP-based attacks. The AAR turns off the communication function of ARP messages(e.g. request and reply), but does not disable the ARP table. In our system, the MAC address of destination was designed to be derived from destination IP address so that the ARP table can be managed statically without prior knowledge (e.g., IP and MAC address pairs). In general, the AAR is safe from the ARP-based attacks since it disables the ARP messages and saves network traffics due to so.

Development of a High Performance Web Server Using A Real-Time Compression Architecture (실시간 압축 전송 아키텍쳐를 이용한 고성능 웹서버 구현)

  • Min Byungjo;Hwang June;Kim Hagbae
    • The KIPS Transactions:PartC
    • /
    • v.11C no.6 s.95
    • /
    • pp.781-786
    • /
    • 2004
  • In these days, such services are popularized as E-commerce, E- government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of sewer resources when heavy requests reach the web server. Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

An Efficient Variant of Self-Healing Group Key Distribution Scheme with Revocation Capability (자가 치료 기능과 취소 능력을 가진 효율적인 그룹키 분배 기법)

  • Kang Ju-Sung;Hong Dowon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.7 s.103
    • /
    • pp.941-948
    • /
    • 2005
  • In the self-healing group key distribution scheme, users are capable of recovering lost group keys on their own without requesting additional transmission from the group manager, where there is no reliable network infrastructure. In this paper, we propose a new self-healing group key distribution scheme with revocation capability, which is optimal in terms of user memory storage and more efficient in terms of communication complexity than the previous results. We obtain a slightly improved result from (13) and (14) by using the new broadcasting method. In addition, we prove that our scheme has the properties of t-wise forward secrecy and t-wise backward secrecy, and extend this self-healing approach to the session key recovery scheme from a single broadcast message.

Definition of Performance Indices and Unplementation of Tester for SIP Servers in Next Generation Networks (차세대 방 SIP 서버 시험을 위한 성능 지표 및 시험기 구현)

  • 김용권;박준형;기장근;이규호;최길영;최진규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4B
    • /
    • pp.411-423
    • /
    • 2004
  • This paper defines test methodologies and performance indices for SIP server system, and describes elements that can have influence on the test of SIP network equipments. Moreover, we implement a tester to evaluate the performance of SIP Servers such as Registrar and Proxy server. The performance indices for testing SIP servers are message processing rate, transaction delay, and call success probability. The parameters that can have an effect on the performance of SIP servers are user population, transport protocol, method of database access, method of DNS, call creation pattern, definition of transactions, and size of packets. We tested several SIP servers that act as Registrar, Proxy, and Redirect server using the implemented SIP tester, and, as a result, verified functions of the tester and performance indices and input parameters defined in this paper. Performance indices and methodologies presented in this paper can be used to evaluate SIP servers in NGN