• Title/Summary/Keyword: 혼잡도 평가 시뮬레이션 프레임워크

Search Result 6, Processing Time 0.02 seconds

A Simulation Case Study of Congestion Assessment for Validation of Naval Ship's Operability Performance in a Crew Mess Room (함정 Crew Mess Room 운용성 검증을 위한 혼잡도 평가 시뮬레이션 사례 연구)

  • Oh, Dae-Kyun;Lee, Dong-Kun
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.31-41
    • /
    • 2010
  • So far, many simulation researches associated with naval ships have been concentrated on the tactical systems and naval ship development. However, studies on the improvement of living conditions for naval ship crews were limited. This study targets a crew mess room which is a typical welfare facility in naval ships and existing modeling and simulation methodologies for naval tactical and strategic systems cannot be applied to the crew room simulations. This paper suggests a simulation modeling framework based on 3-dimensional discrete event simulation methodology for crew mess room congestion assessment and operation scenarios. The simulation modeling framework is verified through practical case simulations. The purpose of simulation modeling framework consists of process and system architecture for operation feasibility tests of welfare facilities in naval ships and is to guide an assessment of the operability performance of a crew mess room.

The Congestion Control using Selective Slope Control under Multiple Time Scale of TCP (TCP의 다중 시간 간격에서 선택적 기울기 제어를 이용한 혼잡 제어)

  • Kim, Gwang-Jun;Kang, Ki-Woong;Lim, Se-Jung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.2 no.1
    • /
    • pp.10-18
    • /
    • 2007
  • In this paper, we extend the multiple time scale control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of multiple time scale TCP is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. If source traffic is not extended exceeding, when RTT is 450ms, in self similar burst environment, performance gain of TCP-SSC is up to 45% for ${\alpha}$=1.05. However, its is acquired only 20% performance gain for ${\alpha}$=1.95 relatively. Therefore we showed that by TCP-MTS at large time scale into a rate-based feedback congestion control, we are able to improve two times performance significantly.

  • PDF

Adaptive Data Hiding Techniques for Secure Communication of Images (자기유사성 네트워크에서 트래픽 제어에 의한 성능 개선)

  • 석경휴;나상동
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6B
    • /
    • pp.575-583
    • /
    • 2004
  • In this paper, we extend the multiple time scale control framework to the window-based congestion control, in particular, such as the TCP. This is performed by interfacing the TCP with a large time scale control module which adjusts the aggressiveness of the bandwidth consumption behavior exhibited by the TCP as a function of large time scale Self-Similar network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by the RTT. How to effectively utilize such an information-due to its probabilistic nature, dispersion over the multiple time scales, and affection on the top of the existing window-based congestion controls-is a non-trivial problem. The evaluation performance of the multiple time scale TCP is facilitated by a simulation of the bench-mark environment which is based on the physical modeling of a self-similar traffic. We explicate our methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under the self-similar traffic conditions. We discuss issues arising in the comparative performance evaluation under heavy-tailed workloads.

Delay Control using Fast TCP Prototype in Internet Communication (인터넷 통신에서 고속 TCP 프로토타입을 이용한 지연 제어)

  • 나하선;김광준;나상동
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1194-1201
    • /
    • 2003
  • Measurements of network traffic have shown that self-similarity is a ubiquitous phenomenon spanning across diverse network environments. We have advance the framework of multiple time scale congestion control and show its effectiveness at enhancing performance for fast TCP prototype control. In this paper, we extend the fast TCP prototype control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of fast TCP prototype is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. We explicate out methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under self-similar traffic conditions. We discuss issues arising in comparative performance evaluation under heavy-tailed workload. workload.

A P2P Overlay System based on P4P-framework for Live Multimedia Streaming Services (라이브 멀티미디어 스트리밍 서비스를 위한 P4P 프레임워크 기반의 P2P 오버레이 시스템)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.18C no.1
    • /
    • pp.51-60
    • /
    • 2011
  • In this paper, we propose a P4P based P2P system for live multimedia streaming services. In order to satisfy the strict requirement of delay in live multimedia streaming, in the proposed scheme, the P4P server of network provider provides the network status information related to delay and congestion links to P2P system in addition to the information to optimize the network resource utilization. The P2P system server, then, makes the peering suggestion based on the information from the network server. Also, we propose a playback synchronization mechanism that enable each peer to start the playback within the limited variation from the playback positions of source peer. Through the simulation results, it is shown that the proposed scheme not only deals with the original objective of the P4P framework, i.e., effective network utilization, but also the live multimedia streaming requirements. It enhances the playback continuity, and reduces the playback start-up latency and the control overhead. In addition, the proposed scheme reduces the variation in playback positions of the peers.

A Study on Detecting Selfish Nodes in Wireless LAN using Tsallis-Entropy Analysis (뜨살리스-엔트로피 분석을 통한 무선 랜의 이기적인 노드 탐지 기법)

  • Ryu, Byoung-Hyun;Seok, Seung-Joon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.1
    • /
    • pp.12-21
    • /
    • 2012
  • IEEE 802.11 MAC protocol standard, DCF(CSMA/CA), is originally designed to ensure the fair channel access between mobile nodes sharing the local wireless channel. It has been, however, revealed that some misbehavior nodes transmit more data than other nodes through artificial means in hot spot area spreaded rapidly. The misbehavior nodes may modify the internal process of their MAC protocol or interrupt the MAC procedure of normal nodes to achieve more data transmission. This problem has been referred to as a selfish node problem and almost literatures has proposed methods of analyzing the MAC procedures of all mobile nodes to detect the selfish nodes. However, these kinds of protocol analysis methods is not effective at detecting all kinds of selfish nodes enough. This paper address this problem of detecting selfish node using Tsallis-Entropy which is a kind of statistical method. Tsallis-Entropy is a criteria which can show how much is the density or deviation of a probability distribution. The proposed algorithm which operates at a AP node of wireless LAN extracts the probability distribution of data interval time for each node, then compares the one with a threshold value to detect the selfish nodes. To evaluate the performance of proposed algorithm, simulation experiments are performed in various wireless LAN environments (congestion level, how selfish node behaviors, threshold level) using ns2. The simulation results show that the proposed algorithm achieves higher successful detection rate.