• Title/Summary/Keyword: Packet structure

Search Result 289, Processing Time 0.03 seconds

Analysis of Data Transmission Rate and Power Consumption in Zigbee Based Electrocardiography (지그비 기반 심전계의 데이터 전송률과 소비 전력 분석)

  • Kim, Nam-Jin;Hong, Joo-Hyun;Lee, Tae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.96-104
    • /
    • 2006
  • In this study, data transmission ratio and power consumption issues of Zigbee based sensor module and personal digital assistant(PDA) were addressed to develop ECG telemetry device. PDA processes the data transmitted through serial port using non-blocking method. The transmission rate was dependent on the packet structure. It was 300 ECG samples/sec, when each packet was composed of 2 ECG data and 3-axial acceleration vector. Using two AAA batteries in series, operating time of the wireless sensor module was above 28 hours in average. Power consumption of PDA was dependent on screen ON/OFF condition and serial port usage. In this application, operating time of PDA was 5 hours in average. In conclusion, there was no problem in the power consumption of wireless sensor module and transmission rate, when the developed device was used as 24 hour Holter device. But, PDA has the problem of power consumption, which should be solved.

  • PDF

High-speed W Address Lookup using Balanced Multi-way Trees (균형 다중 트리를 이용한 고속 IP 어드레스 검색 기법)

  • Kim, Won-Iung;Lee, Bo-Mi;Lim, Hye-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.427-432
    • /
    • 2005
  • Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.

A high speed processing method of web server cluster through round robin load balancing (라운드로빈 부하균형을 통한 웹 서버 클러스터 고속화 처리기법)

  • Sung Kyung;Kim Seok-soo;Park Gil-cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1524-1531
    • /
    • 2004
  • This study analyzes a load balancing technique using Round Robin Algorithm. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network structure (data generator, virtual server, Server1,2,3), and finds out traffic distribution toward Server1,2 and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume. As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time.

A Study on IISS Software Architecture of Combat Management System for improving modifiability

  • Park, Ji-Yoon;Yang, Moon-Seok;Lee, Dong-Hyeong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.133-140
    • /
    • 2020
  • The IISS(Integrated Interface Storage System) software uses communication methods such as DSS(Data Sharing Service), UDP to perform the function of sending all messages from the Combat Management System to the analytical computer. Because IISS software handles all message used in the Combat Management System, the source code is large and has a highly dependent feature on message changes. Modification of software is a task that requires a lot of labor, such as series of software reliability test. so research has been conducted to reduce software development costs, including minimizing software modifications. In this paper, We study the method of messages receiving and architectural structure improvement to minimize reliance on message changes in the Combat Management System and improve the modifiability. Reduced message dependency by changing the way DSS and UDP protocols are communicated to Packet Sniffing. In addition, Factory Method Pattern were applied to improve the software design. Test comparing existing software and development elements have confirmed that the software has improved its modifiability and reuse.

Traffic Distributed Processing System Implementation on the Web Sever Networking (웹서버 네트워킹에서의 트래픽분산 처리 시스템 구현)

  • Park, Gil-Cheol;Sung, Kyung;Kim, Seok-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.4
    • /
    • pp.846-853
    • /
    • 2004
  • This paper introduces implementation of a traffic distributed processing system on the Web Sever Networking. The study used two software packages (Packet Capture and Round-Robin Test Package) to check packet quantity from Virtual Network Structure (data generator, virtual server, Serve. 1, 2, 3), and could find out traffic distribution toward Server 1, 2, and 3. The functions of implemented Round-Robin Load Balancing Monitoring System include Round-Robin testing, system monitoring, and graphical indication of data transmission/packet quantity (figures & diagram). As the result of the study shows, Round-Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some cases, they were eventually alleviated by repeated tests for a long period of time.

Traffic Analysis and Modeling for Network Games (네트워크 게임 트래픽 분석 및 모델링)

  • Park Hyo-Joo;Kim Tae-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.635-648
    • /
    • 2006
  • As the advances of Internet infra structure and the support of console and mobile for network games, the industry of online game has been growing rapidly, and the online game traffic in the Internet has been increasing steadily. For design and simulation of game network, the analysis of online game traffic have to be preceded. Therefore a number of papers have been proposed for the purpose of analyzing the traffic data of network games and providing the models. We make and use GameNet Analyzer as a dedicated tool for game traffic measurement and analysis in this paper. We measure the traffic of FPS Quake 3, RTS Starcraft and MMORPG World of Warcraft (WoW), and analyze the packet size, packet IAT(inter-arrival time), data rate and packet rate according to the number of players and in-game behaviors. We also present the traffic models using measured traffic data. These analysis and models of game traffic can be used for effective network simulation, performance evaluation of game network and the design of online games.

  • PDF

Virtual Output Queue Structure for Fair Uni and Multicasting in Metro WDM Network (메트로 WDM 링 네트워크상에서의 공평성에 관한 연구)

  • Yang, Hyo-Sik
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.2
    • /
    • pp.55-60
    • /
    • 2008
  • Packet-switched wavelength division multiplexing (WDM) ring networks have been extensively studied as solutions to the increasing amount of traffic in metropolitan area networks, which is widely expected to be a mix of unicast and multicast traffic. In this paper we study the fairness between unicasting and multicasting in slotted packet-switched WDM ring networks that employ a tunable transmitter and fixed tuned receiver at each node and a posteriori buffer selection. We find that single-step longest queue selection algorithm generally results in unfairness between unicasting and multicasting or a lilted relative priority for multicast vs. unicast traffic. We present the various virtual output queue structures and their performance.

No-Referenced Video-Quality Assessment for H.264 SVC with Packet Loss (패킷 손실시 H.264 SVC의 무기준법 영상 화질 평가 방법)

  • Kim, Hyun-Tae;Kim, Yo-Han;Shin, Ji-Tae;Won, Seok-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11C
    • /
    • pp.655-661
    • /
    • 2011
  • The transmission issues for the scalable video coding extension of H.264/AVC (H.264 SVC) video has been widely studied. In this paper, we propose an objective video-quality assessment metric based on no-reference for H.264 SVC using scalability information. The proposed metric estimate the perceptual video-quality reflecting error conditions with the consideration of the motion vectors, error propagation patterns with the hierarchical prediction structure, quantization parameters, and number of frame which damaged by packet loss. The proposed metric reflects the human perceptual quality of video and we evaluate the performance of proposed metric by using correlation relationship between differential mean opinion score (DMOS) as a subjective quality and proposed one.

A Study on DDoS Attack Mitigation Technique in MANET (MANET 환경에서 DDoS 공격 완화 기법에 관한 연구)

  • Yang, Hwan-Seok;Yoo, Seung-Jae
    • Convergence Security Journal
    • /
    • v.12 no.1
    • /
    • pp.3-8
    • /
    • 2012
  • MANET composed wireless nodes without fixed infrastructure provides high flexibility, but it has weak disadvantage to various attack. It has big weakness to DDoS attack because every node perform packet forwarding especially. In this paper, packet transmission information control technique is proposed to reduce damage of DDoS attack in MANET and search location of attacker when DDoS attacks occur. Hierarchical structure using gateway node is adopted for protect a target of attack in this study. Gateway node in cluster is included like destination nodes surely when source nodes route path to destination nodes and it protects destination nodes. We confirmed efficiency by comparing proposed method in this study with CUSUM and measured the quantity consumed memory of cluster head to evaluate efficiency of information control using to location tracing.

Study on a Secure Active network Architecture (안전한 액티브 네트워크 구조에 관한 연구)

  • Hong, Sung-Sik;Han, In-Sung;Ryou, Hwang-Bin
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.4 s.304
    • /
    • pp.17-24
    • /
    • 2005
  • The existing passive networks have the only data-storing and transmission functions. On the other hand, the active network which can do operation jobs on the transmitting packets was introduced at 1990's. However, the advantages of activating processing are obviously more complex than traditional networks and raise considerable security issues. In this paper, we propose the safer structure in Active Networks that is based on the discrete approach which resolves the weak point of the Active Network. The proposed system provides the node management and user management in the Active Networks, and improves the security of Packet transmission with packet cryptography and the session.