• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 추계학술대회
• /
• pp.182-185
• /
• 2014

본 논문에서는 지연시간 최소화를 위한 고속 데이터 광 전송용 ADC 개발에 관한 연구를 진행하였다. 기존 광 중계기의 전송 방식은 데이터 신호 변환에서 $6{\mu}s$이상의 지연시간을 갖고 있어 고속 데이터 전송 및 신호 변환에 제한을 받고 있으므로 이를 직접 변환 방식을 이용하여 데이터 신호 변환 시 지연시간을 $2{\mu}s$ 이내로 줄이는 새로운 기술의 개발이 요구된다. 이동통신 LTE, LTE advanced 등의 서비스 전송망 구축에 필요한 신호변환 부품 핵심기술의 발전이 요구되고 있으므로, 본 논문에서는 신호변환 단계에서 지연시간을 획기적으로 줄일 수 있는 기술을 적용하여 $3{\mu}s$의 지연시간을 갖는 ADC를 개발하였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권10호
• /
• pp.678-689
• /
• 2004

The major concern of networked control system is network uncertainties such as time delay and data loss. Because these uncertainties may degrade the performance of networked control system and destabilize the entire system. Therefore, the performance and the stability variation of networked control system due to network uncertainties must be considered first in designing networked control system. In particular, the stability analysis of networked control system is most important issue since time delay and data loss can make the overall systems unstable. In this paper, we present a new stability analysis method of networked control system with time delay and data loss, which is impossible in previous works. The proposed method can determine maximum time delay and allowable transmission rate that preserve stability performance of networked control system. The results of the simulation validate effectiveness of our stability analysis method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.441-444
• /
• 2003

Network uncertainties such as data loss and time delay can vary the stability property of networked control system. Therefore, these uncertainties must be considered first in designing networked control system. In this paper, we present a new stability analysis method of networked control system with data loss and time delay. The proposed method can determine maximum allowable time delay and minimum allowable transmission rate that preserves stability performance of networked control system. The results of the simulation validate effectiveness of our stability analysis method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2680-2696
• /
• 2018

The collaborative content caching system is an effective solution developed in recent years to reduce transmission delay and network traffic. In order to decrease the service end-to-end transmission delay for future 5G ultra-dense networks (UDN), this paper proposes a novel service migration method that can guarantee the continuity of service and simultaneously reduce the traffic flow in the network. In this paper, we propose a service migration optimization model that minimizes the cumulative transmission delay within the constraints of quality of service (QoS) guarantee and network condition. Subsequently, we propose an improved firefly algorithm to solve this optimization problem. Simulation results show that compared to traditional collaborative content caching schemes, the proposed algorithm can significantly decrease transmission delay and network traffic flow.

• 정보처리학회논문지C
• /
• 제8C권6호
• /
• pp.805-814
• /
• 2001

본 논문에서는 기존의 DWRR(Dynamic Weighted Round Robin) 알고리즘이 고려하지 못한 실시간 트래픽의 지연 특성을 보장하면서, 비실시간 트래픽도 효율적으로 전송할 수 있는 셀 스케쥴링 알고리즘을 제안하고자 한다. 이 스케쥴링 알고리즘은 기존의 DWRR 알고리즘을 개선한 것으로, 지연 우선 순위 기반의 셀 전송방식을 추가하여 실시간 트래픽의 지연 특성을 보장하면서, 그로 인한 비실시간 트래픽의 셀 손실을 막기 위해 비실시간 트래픽에 임계치를 설정한다. 제안한 스케쥴링 알고리즘은 지연 우선 순위 기반의 셀 전송방식이 추가되어 기존의 DWRR 알고리즘에 비하여 복잡도가 다소 증가될 수 있으나, 실시간 트래픽의 지연을 최소화하고 버퍼 크기를 감소시킬 수 있으며, CBR, VBR 트래픽 뿐만 아니라 대역폭에 유연성을 지니는 ABR 트래픽의 서비스를 효과적으로 지원한다.

• 한국통신학회논문지
• /
• 제37권3A호
• /
• pp.135-140
• /
• 2012

이 논문은 순환 지연 다이버시티 OFDM 시스템의 성능을 향상시키기 위하여 주파수 다이버시티를 적용하는 알고리즘을 제안한다. OFDM 시스템에서 주파수 다이버시티 적용은 동일한 심볼을 상관관계가 없는 부반송파로 반복 전송하는 것으로 수행되며, 반복 전송 회수에 비례하여 변조 레벨을 증가시켜서 종래의 전송 시스템의 성능과 비교한다. 이 방법은 순환 지연 다이버시티 알고리즘과 같이 송신기 개수가 많아짐에 따라 수신기에서 부가적인 특별한 하드웨어가 필요하지 않다는 동일한 장점이 있게 되며, 성능 시험을 위해서 다중 송수신 안테나 환경하에서 모의 실험을 수행하였다. 제안하는 알고리즘은 종래의 순환 지연 다이버시티를 활용한 OFDM 시스템과 비교하여 저밀도 변조 레벨에서 성능 향상이 현저함을 보여준다.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.430-438
• /
• 2013

This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.81-84
• /
• 2000

Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.74-77
• /
• 1998

We consider connection-oriented wireless cellular networks. These networks employ dedicated radio channels for the transmission of signaling information. A forward signaling channel is a common signaling channel assigned to carry the multiplexed stream of paging and channel allocation(virtual circuit allocation) packets from a base station to mobile stations. The delay levels experienced by paging and channel allocation packets have serious effect on the utilization level of the limited radio channel capacity. While a slotted mode operation is used to reduce the power consumption level at mobile stations, it may induce an increase in packet delay levels. In this paper, we thus consider a multiplexing scheme for paging and channel allocation packets under which slots are dynamically allocated for the paging packet transmission. For this dynamic scheme, we develop an analytical method for deriving the delay characteristics exhibited by paging and channel allocation packets, and investigate the effect of network parameters on the delay level by using this method.

• 전자공학회논문지B
• /
• 제29B권5호
• /
• pp.21-29
• /
• 1992

This paper proposes a new MAC propocol for high-speed MAN. The proposed protocol is based on the P$_1$-persistent tranmission scheme and each node calculates the transmission probability periodically by using delay information(DI). A window mechanism for the calculation of message delay in each node is proposed to improve the adaptability of the proposed protocol to traffic changes. The capactiy of the proposed protocol is analyzed. The simulation results show that the proposed protocol gives fair message delay under heavy load conditions and, when the transmission speed or distance is increased, the message delay variation of the proposed protocol is less than that of IEEE 802.6 DQDB.