• Title/Summary/Keyword: 패킷 전송

Search Result 2,387, Processing Time 0.032 seconds

Asymmetric distributed multi server architecture for efficient method of client connection process at online game servers (온라인게임 서버에서의 효율적인 클라이언트 접속 처리를 위한 비대칭 분산형 다중 서버 구조)

  • Hwang Doh-Yeun;Lee Nam-Jae;Kwak Hoon-Sung
    • The KIPS Transactions:PartB
    • /
    • v.12B no.4 s.100
    • /
    • pp.459-464
    • /
    • 2005
  • The online game system could be largely divided into two parts: servers and clients. Clients accesses to a game server and analyzes the packets transmitted from a server. A game server manages users information and database. U a game server allows a new client to access the server to execute a game, it should accept the access request of the new client maintaining the online connection of the existing users. In this paper, we compare Process method and Thread method within the multiple jobs process methods of a server. Then we propose an asymmetric distributed multi server architecture that is adequate to asymmetric distributed architecture that is widely applied to most game servers. The proposed asymmetric distributed multi server architecture includes login server, game server, communication server and database server to perform its own feature independently. Comparing its other architectures, it shows better performance economically and technically. Especially it improves the stability and expandability of a server.

Dynamic Data Path Prediction use Extend EKF Movement Tracing in Net-VE (Net-VE에서 이동궤적을 이용한 동적데이터 경로예측)

  • Song, Sun-Hee;Oh, Haeng-Soo;Park, Kwang-Chae;Kim, Gwang-Jun;Ra, Sang-Dong
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.1 no.2
    • /
    • pp.81-89
    • /
    • 2008
  • Improved EKF suggests variable path prediction to reduce the event traffic caused by the information sharing among multi-users in networked virtual environment. The three dimensional virtual space is maintained consistently by endless status information exchange among dispersed users, and periodic status transmission brings traffic overhead in network. By using the error between the measured movement trace of dynamic information and the EKF predicted, we propose the method applied to predict the mobile packet of dynamic data which is simultaneously changing. And, the simulation results of DIS dead reckoning algorithms and EKF path prediction is compared here. It followed the specific path and while moving, the proposed method which it proposes predicting with DIS dead reckoning algorithm and to compare to the mobile path of the actual object and it got near it predicts the possibility of knowing it was.

  • PDF

Hybrid MAC Protocol Design for an Underwater Acoustic Network (수중음향통신망을 위한 하이브리드 MAC 프로토콜 설계)

  • Park, Jong-Won;Ko, Hak-Lim;Cho, A-Ra;Yun, Chang-Ho;Choi, Young-Chol;Lim, Yong-Kon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2088-2096
    • /
    • 2009
  • This paper deals with hybrid MAC protocol design for underwater acoustic networks. The proposed MAC protocol has the cluster structure with a master node and slave nodes, and the hybrid network structure that combines a contention free period based on TDMA(Time Division Multiple Access) with a contention period. The suggested MAC protocol has a beacon packet for supervising network, a guard period between time slots for packet collision, time tag for estimation of propagation delay with a master node, the time synchronization of nodes, entering and leaving of network, and the communication method among nodes. In this paper, we adapt the proposed hybrid MAC protocol to AUV network, that is the representative mobile device of underwater acoustic network, and verify this protocol is applicable in real underwater acoustic network environment.

Power Model of Sensor Node for Relative Comparison of Power Consumption in Mobile Sensor Network (모바일 센서 네트워크 라우팅 알고리즘 간의 전력 소비량 비교를 위한 센서 노드 전력 모델)

  • Kim, Min-Je;Kim, Chang-Joon;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.886-889
    • /
    • 2010
  • Power consumption measurement in sensor network is difficult to proceed by survey in real field. Thus, through simulation, the power consumption is estimated and replacement time of nodes are decided. A simulation tool simulates various facts such as power consumption, packet transmission traffic, network topology and etc. In this paper, it suggests sensor node power model to simulate power consumption which has large importance among simulation facts in sensor network. This model omits calculating expressions that the data originally surveyed can substitute with, according to power consumption property of each functions in sensor node in order to minimize calculations in simulation. In this case accuracy of power consumption estimation will be reduced, but can simulate it faster due to reduced calculation. Suggested model is fitted to analyze power consumption difference between two or more sensor network algorithms with rapid simulation speed rather than accurate simulation.

  • PDF

Authenticated Route Optimization Protocol for Network Mobility Support (네트워크 이동성 지원을 위한 인증된 경로 최적화 프로토콜)

  • Koo, Jung-Doo;Lee, Gi-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.4
    • /
    • pp.781-787
    • /
    • 2007
  • Network Mobility (NEMO) basic support protocol doesn't execute the process of route optimization and has not presented the particular security mechanism in other blocks except hi-directional tunnel between Mobile Router (MR) and its Home Agent (HA). Therefore in this paper we process secure route optimization courses through authenticated binding update protocol between MR and its Correspondent Node (CN) and the protocol of the competency of mandate between MR and its Mobile Network Node (MNN); its block also uses an bi-directional tunnel as the block between MR and its HA. The address of each node are generated by the way of Cryptographically Generated Address (CGA) for proving the ownership of address. Finally we analyze the robustness of proposed protocol using security requirements of MIPv6 and existing attacks and the efficiency of this protocol using the connectivity recovery and end-to-end packet transmission delay time.

  • PDF

A Protocol Analyzer for SW based Multimedia Communication System (SIP 기반 멀티미디어 통신 시스템을 위한 프로토콜 분석기)

  • Jung In-hwan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.4
    • /
    • pp.312-333
    • /
    • 2005
  • SIP(Session Initiation Protocol) has been proposed for session control protocol of Internet multimedia communication system like VoIP(Voice over IP). SIP has complicated session control steps to support various kinds of audio and video formats and to assure service quality of real time data communication. Up until now, existing protocol analyzers can not provide such detailed information of SIP based communication system. In this paper, therefore, we propose a new protocol analyzer as a tool that can analyze and diagnose SIP based multimedia communication system throughout the session initiation, data exchange and session change steps. The propose traffic analyzer, which is called STAT(SIP based Traffic Analysis Tool), Is implemented on Winder's environment so that it is generally usable and extensible. Since STAT analyze low level packets captured via Ethernet broadcasting property, it is able to provide session status and real time traffic monitoring information without any affection to the communication system. The STAT which is implemented in this paper. therefore, is expected to be a useful tool for developing and managing of a SIP based multimedia communication system.

Router Algorithms for Improving Fairness in Differentiated Services (인터넷 차별화 서비스를 위한 라우터의 공평성 향상 알고리즘)

  • Nam, Dong-Ho;Choi, Young-Soo;Kim, Byung-Chul;Cho, You-Ze
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.358-367
    • /
    • 2002
  • The IETF Differentiated Services (Diffserv) WG focused on Providing service differentiation on the Internet. One problem of the Diffserv Assured Services (AS) architecture is that it cannot guarantee fairness and throughput assurance. In this paper, we propose two schemes for guaranteeing fairness among the various target rates in the AS architecture. One is a variant of RED with IN and OUT (RIO), called the improved RIO (IRIO). The other is a variant of Time Sliding Window (TSW), called the improved TSW (ITSW). To validate the Proposed schemes, their behaviors are then examined under various simulation environments. The simulation results showed that IRIO and ITSW improved fairness and the throughput assurance in the AS architecture.

Reduction of Presentation Latency in Thin-Client of Cloud System (클라우드 시스템의 씬 클라이언트에서의 표시 지연 절감)

  • Kang, Seung Soo;Ko, Hyun;Yoon, Hee Yong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.4
    • /
    • pp.163-176
    • /
    • 2013
  • Cloud-based streaming game service has numerous merits, but it may suffer from presentation latency in a thin-client. It is an important issue especially for game service which needs instantaneous response to user inputs. This research proposes the methods for reducing the presentation latency between the server unit and the thin-client unit. The approaches proposed to be employed with server unit include the source/sync video format equalization, encoding format configuration according to the media type, and the S/W implementation for transmitting clock periodically. The methods for the thin-client unit include the decreasing the number of instructions, use of light encryption algorithm, and improvement on H/W decoding. The proposed schemes are tested with a commercialized streaming service platform, which reveals the reduction of presentation latency as large as a few hundred milliseconds and reaches the acceptable level (about 100 milliseconds).

Design and Performance Evaluation of IP VPNs based MPLS (MPLS 망 기반 IP VPN의 설계 및 성능 평가)

  • 박석천
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.2
    • /
    • pp.148-156
    • /
    • 2000
  • This paper proposed that an MPLS-based VPN using next-generation If switches and appropriate set of traffic engineering algorithms is the best way to implement QoS-capable IP VPNs. While ATM-based solution would not rely scalable the number of connections becomes too large, MPLS-based VPNs’ efficiency could be confirmed network delay time through performance evaluation. And we evaluated the performance about the If VPN based on proposed MPLS, at the result of evaluation. We figured out that delay increased more slowly in case of VPN based on MPLS comparing with the VPN based on ATM which has rapid delay increasement. Therefore we confirm that the VPN based on MPLS has high speed of packet processing and high degree of network efficiency through the performance evaluation.

  • PDF

Analysis of Usefulness of Domain-Based Network Caching in Mobile Environment (이동 환경에서 영역기반의 네트워크 캐슁 효용성 분석)

  • 이화세;이승원;박성호;정기동
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.668-679
    • /
    • 2004
  • When users of mobile environments move fast or slow into a number of base stations(BS) and request the services of continuous media data such as video or audio, this study examines what the caching has the usefulness in mobile environments. Namely, to reduce packet disconnections and network overheads in mobile environments and minimize transmission delay time, we propose domain-based hierarchical caching structure and study whether application of caching has the usefulness. So we have a model based on user environments and hierarchical network structure to process continuous media services, and analyze the usefulness of caching which depends on the mobile patterns of user and the locations of caching nodes. And then, we research whether caching offers the usefulness in mobile environments. As the result, we are able to see that an adaptable application of caching is needed because the hit ratio and the number of replacement vary in large according to mobile patterns of user and locations of caching.

  • PDF