• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2397-2402
• /
• 2010

Dielectric resonator bandpass filters with various time-delay at 800MHz were designed and fabricated in this paper. from the results of this study. first of all, good response. characteristics were measured for all cases. The insertion loss was below 2dB and flatness for ripple was below 0.2dB, whereas return loss was over 20dB, respectively. The measured delay time of the fabricated prototype were 6ns, 12ns and 200s, respectively and the flatness characteristics did not exceeding Ins for all cases. Furthermore, 2~4ns of flatness were measured for 2-hole dielectric block and other dielectric resonator filters with various delay time by combination of each prototypes filters were also implemented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.431-437
• /
• 2007

Web proxy caching provides an effective way to reduce access latency and bandwidth requirement. In particular, prefix caching is considered as an alternative for improving video delivery over wide area networks because video objects are usually too large to be cached in their entirety. Nevertheless, many studies have pointed that the user-perceived latency is often not dominated by object transmission time, but rather by setup process such as TCP connection time that precedes it. We propose pre-connecting techniques and show that the techniques can be used efficiently in TCP splicing. Our analysis shows the pre-connection significantly reduces start-up latency and TCP connection time in simple analytical model. The deployment of the proposed pre-connection does not require protocol modification or the cooperation of other entities.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.693-695
• /
• 2016

A random and systematic jitter suppressed DLL is presented. The AC averages the delay time of successive delay stages and equalizes the delay time of all delay stages. Measurement results of the DLL-based clock generator fabricated in a one-poly six-metal $0.18{\mu}m$ CMOS process shows 13.4-ps rms jitter.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1177-1186
• /
• 2003

The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we implemented the delay guaranteed fair queueing (DGFQ) scheme distributively. Through the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.31-32
• /
• 2022

Commercialized game engines help develop content and support various platforms, but there are performance differences depending on the function. In this paper, a VR video conferencing platform corresponding to source multi-use was implemented, and the connection delay time according to the type of game server engine and the number of platform users was measured. As a result of the measurement, the latency was the lowest at 22.146 msec when using the Amazon GameLift engine and with 2 users, and the latency was the highest at 27.007 msec when using the ProudNet engine and with 10 users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.306-315
• /
• 2003

On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization signal management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various scheme is performed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.253-260
• /
• 2015

Love which is one of the emotional of mankind, has been studied in sociology and psychology as a matter of grate concern. In this paper we represent romantic behaviors in the love equation of Romeo and Juliet as time series and phase portraits in the case of with and without time delay. And we also analyze their difference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.586-592
• /
• 2002

In this paper, new channel scheduling algorithms which reduce transmission delay caused by wireless network are proposed in AMC/TDM wireless data communication. The concept of the Proposed algorithms is based on the proportional fairness, M-LWDF, and performance-guaranteeing algorithm proposed by Xin Liu. The proposed algorithm can be applied to QoS guaranteeing services as well as best-effort services. Simulation results show that new algorithm reduced transmission delay upto 11.5% in case of proportional fairness algorithm and also decreased transmission delay unto 9% in case of M-LWBF algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.220-222
• /
• 2000

이동통신 시스템에서 가입자수가 증가하고 다양한 서비스가 구현됨으로써 전체적인 장비 또는 자원에 대한 부하가 증가하고 있다. 특히, 셀의 반경이 작아지고 단문(Short Message)을 활용한 다양한 부가 서비스가 개발됨으로써 이와 관련된 정보를 전달하는 페이징 메시지의 분류도 복잡해지고 페이징 채널의 부하도 커지고 있다. 본 연구에서는 먼저, 이동통신시스템에서 페이징 패널의 구조와 역할을 분석하고 페이징 채널에서 전송하는 메시지를 그 기능과 특성에 따라 분류한다. 긴급하게 전송되어야 하는 메시지를 보호하기 위한 우선권 부여 방법을 모색하고, 각 방법에 있어서 메시지 종류별 전송지연시간(Delay)을 수리적으로 도출하고 결과를 비교한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.