• 한국컴퓨터정보학회논문지
• /
• 제19권5호
• /
• pp.79-87
• /
• 2014

본 논문에서는 분산된 협업 환경을 통합하는 콘텐츠 공유 모델을 제안한다. 확장 가능한 고해상도 디스플레이 자원, 로컬 및 원격 콘텐츠 공유, 다중 사용자 상호작용 및 접근제어 특성들을 통합하여 결합된 하나의 모델을 제공한다. 다중 사용자의 상호 작용은 모든 사용자가 상호 작용이 가능하다는 이점이 있지만, 그로 인해 오버랩이 발생할 수 있다. 그 오버랩을 관리하기 위해 접근 제어를 모델에 적용했으나 작업 흐름의 방해가 가능하다. 따라서 이 두 가지 사항을 중점으로 모델을 평가하기 위해 상호작용성에 대한 이용자 연구를 실시했다. 그 결과를 바탕으로 제안된 콘텐츠 공유 모델은 상호작용과 그 흐름을 방해 하지 않아 작업에 집중할 수 있는 분산 협업 환경을 제공한다.

• 한국멀티미디어학회논문지
• /
• 제12권3호
• /
• pp.419-426
• /
• 2009

본 논문에서는 고속 무선 홈 네트워크를 위한 UWB 기술 기반 WiMedia Distributed Medium Access Control (D-MAC) 프로토콜에서 실시간 트래픽을 위한 공평한 QoS 제공 방법에 초점을 맞추어 현재 D-MAC 프로토콜의 문제점을 제시하고, 공평하고 분산적인 타임슬롯 자원 할당 방법을 제안하며, 그 성능을 분석한다. 본 논문에서 제안하는 타임슬롯 자원 할당 방법은 Satisfaction of QoS (SoQ) 알고리즘을 각 단말 디바이스에서 분산적으로 실행함으로써, 현재 트래픽 부하 상태에 대한 최적의 타임 슬롯들을 디바이스들에게 할당하여 공평하고 적응적인 QoS 제공을 가능하게 한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 D
• /
• pp.2212-2215
• /
• 2002

This dissertation suggests and implements a middle level network which is called PICNET-NP (Plant Implementation and Control Network for Nuclear Power Plant). PICNET-NP is based partly on IEEE 802.4 token-passing bus access method and partly on IEEE 802.3 physical layer. For this purpose a new interface a physical layer service translator, is introduced. A control network using this method is implemented and applied to a distributed real-time system. To verify the performance of proposed protocol experimental were carried out, and the following results are obtained. 1) proper initialization of the protocol. 2) normal receiving and transmission of data. 3) proper switching of transmission media in case of a fault condition on the one of transmission media. The proposed protocol exhibits the excellent performance in the experimental system. From the test results in the experimental system, the proposed protocol, PICNET-NP, can be used for the upgrading of a nuclear power plant and the distributed control system in the next generation of nuclear power plant.

• Journal of information and communication convergence engineering
• /
• 제7권4호
• /
• pp.480-488
• /
• 2009

A channel-shared modified accelerative pre-allocation wavelength division multiple access (CMAP-WDMA) media access control (MAC) has been proposed for metro-WDMA networks, as an extension of modified pre-allocation wavelength division multiple access (MAP-WDMA) MAC protocol. Similarly, CAP WDMA as an extension of accelerative pre-allocation wavelength division multiple access (AP-WDMA) MAC protocol. Performance of CMAP- and CAP-WDMA was extensively investigated under several channel sharing methods (CSMs), asymmetric traffic load patterns (TLPs), and non-uniform traffic distribution patterns (TDPs). The result showed that the channel utilization of the CMAP-WDMA always outperforms that of CAP-WDMA at the expense of longer channel access delay for channel shared case while CMAP-WDMA provided higher channel utilization at specific network conditions but always shorter channel access delay than CAP-WDMA for non-channel shared case. Additionally both for CMAP- and CAP-WDMA, determining an effective CSM is a critical design issue because TDPs and TLPs can be neither managed nor expected while CSM is manageable, and the CSM supporting the best channel utilization can be recommended.

• 제어로봇시스템학회논문지
• /
• 제19권7호
• /
• pp.653-660
• /
• 2013

This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.524-532
• /
• 2012

In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.638-638
• /
• 2006

• 한국해양공학회지
• /
• 제11권4호
• /
• pp.180-188
• /
• 1997

This paper proposes a new efficient MAC(Media Access Control) protocol to establish the ultrasonic communication network for underwater vehicles, which ensures a certain level of maximum throughput regardless of the propagation delay of ultrasonic and allows fast data transmission through the multiple ultrasonic communication channel. A MAC protocol for underwater communication network that allows 'peer-to-peer' communication between a surface ship and multiple underwater systems is designed, and the proposed control protocol is implemented for its verification.

• 정보처리학회논문지A
• /
• 제8A권3호
• /
• pp.217-226
• /
• 2001

본 논문은 클러스터 기반의 분산 구조를 갖는 CCMSS(Clustered Continuous Media Storage Server) 시스템의 미디어 검색 동작에 대해 디스크의 입출력 지연 시간 뿐맘 아니라 내부 네트워크의 통신 지연 시간을 함께 고려한, 열린 큐잉 네트워크 기반의 해석적 모델을 제시하고 이를 이용하여 전체 서비스 지연 시간에 대한 확률적 모델을 정의한다. 그리고 정의된 확률적 모델을 바탕으로 허용된 서비스 실패율 범위에서 최대 서비스 가능한 사용자 요구 수를 구하고 이 값을 이용하여 승인 제어를 수행하는 통합형 통계적 승인 제어 모델을 제안한다. 제안된 승인 제어 기법의 성능 분석을 위해 단순히 디스크 성능만을 고려한 확률적 모델과 본 논문에서 제안한 디스크 성능과 내부 네트워크의 성능을 함께 고려한 확률적 모델을 통해 산출한 마감시간 실패율과 실제 클러스터 기반 서버 환경에서 모의 실험을 통해 얻은 결과를 비교하였으며, 실험 결과에 대한 분석을 통해 제안된 승인 제어 기법이 CCMSS 시스템의 실제 서비스 지연 요소를 정확히 반영하고 있다는 것을 알 수 있었다.

• 대한산업공학회지
• /
• 제29권2호
• /
• pp.150-156
• /
• 2003

The IEEE 802.11 MAC (Media Access Control) Protocol supports two modes of operation, a random access mode for nonreal-time data applications processed by Distributed Coordinated Function (DCF), and a polling mode for real-time applications served by Point Coordinated Function (PCF). It is known that the standard IEEE 802.11 is insufficient to serve real-time traffic. To provide Quality of Service (QoS) of real-time traffic, we propose the Downlink-first scheduling with Earliest Due Date (EDD) in Contention Free Period (CFP) with suitable admission control. The capacity and deadline violation probability of the proposed system is analyzed and compared to the standard pair system of downlink and uplink. Analytical and simulation results show that the proposed scheme is remarkably efficient in view of the deadline violation probability.