• 한국ITS학회 논문지
• /
• 제10권6호
• /
• pp.24-31
• /
• 2011

본 연구는 회전교차로의 운영효과를 다루고 있다. 회전교차로는 신호교차로에 비해 지체감소와 친환경적이라는 기존 연구결과에 따라 우리나라에서 설치가 고려되는 실정이다. 본 연구의 목적은 보행교통량을 고려한 회전교차로의 운영효과를 분석하는데 있다. 이를 위해 이 연구는 교차로 네트워크를 구성하고 보행교통량과 진입교통량에 따른 분석시나리오를 설정하고, 차량당 평균제어지체 비교 분석에 중점을 두고 있다. 이 연구에서는 VISSIM 프로그램이 교통 시뮬레이션 도구로 사용된다. 분석된 주요결과는 다음과 같다. 첫째, 보행교통량에 근거하여 지체를 분석한 결과, 보행교통량이 회전교차로의 운영에 큰 영향을 미치는 것으로 분석되었다. 둘째, 보행교통량이 증가할수록 회전교차로의 지체도 증가하여, 보행교통량 1,000인/시 일 때 1차로 회전교차로에서는 총 진입교통량 800pcph, 2차로 회전교차로에서는 1,600pcph 이상 진입 시 신호교차로가 회전교차로보다 운영효율이 높게 평가되었다.

• 한국산업융합학회 논문집
• /
• 제4권1호
• /
• pp.41-49
• /
• 2001

This study developed signal optimization algorithm by analyzing vehicle arrival patterns. The major principle of signal optimization is dissipate all queueing vehicle in 1cycle and assign delay time uniformly for all approaches. For this, this study used optimal green time and surplus green time. Optimal green time calculated by estimated traffic volume from vehicle arrival model. Surplus green time defined as the gap of optimal green time and queue dissipated time. And alternative cycle has minimum surplus green time was selected as the optimal cycle. Finally, total delay and average delay per vehicle can be calculated by using queueing theory.

• ETRI Journal
• /
• 제30권2호
• /
• pp.282-289
• /
• 2008

We propose a new mini-slot transmission scheme for a passive optical network (PON) in which each customer can be switched either to access mode or to internetworking mode dynamically. In this paper, we present the system implementation (called LAN-PON) as well as the performance of the proposed transmission scheme to illustrate its feasibility and benefits. A mini-slot scheme can rapidly reduce the queuing delay, which increases due to the flooding of the deflected packets in a deflection scheme. We evaluate the impact of mode switching time on the bandwidth gain (throughput) and delay of local area network (LAN) traffic in the LAN-PON with a mini-slot scheme. We also analyze a theoretical delay model of the proposed scheme. The simulation results demonstrate that switching time has an impact on LAN performance, and the average packet delay of the proposed scheme is significantly improved compared to that of the deflection scheme.

• 한국경영과학회지
• /
• 제29권3호
• /
• pp.99-109
• /
• 2004

In this paper, we investigate the impact of window mechanisms on end to end delay in a series of nodes with constant service times. It is shown that arbitrary combinations of window mechanisms, each applying to an arbitrary subset of data, can be embedded on the nodes without affecting the departure instants from the system if the windows are at least as large as the number of nodes spanned. The window mechanisms are shown to have no impact on the average end to end delay of data. As the condition on the windows is a minimal necessary requirement for full parallelism, the results show that the transparent operation from viewpoint of data transmission can be achieved with minimal resources.

• 대한산업공학회지
• /
• 제22권2호
• /
• pp.231-245
• /
• 1996

Semiconductor manufacturing line includes several batch processes which are to be controlled effectively to enhance the productivity of the line. The key problem in batch processes is a dynamic batch sizing problem which determines number of lots processed simultaneously in a single botch. The batch sizing problem in semiconductor manufacturing has to consider delay of lots, setup cost of the process, machine utilization and so on. However, an optimal solution cannot be attainable due to dynamic arrival pattern of lots, and difficulties in forecasting future arrival times of lots of the process. This paper proposes an efficient batch sizing heuristic, which considers delay cost, setup cost, and effect of the forecast errors in determining the botch size dynamically. Extensive numerical experiments through simulation are carried out to investigate the effectiveness of the proposed heuristic in four key performance criteria: average delay, variance of delay, overage lot size and total cost. The results show that the proposed heuristic works effectively and efficiently.

• 대한산업공학회지
• /
• 제34권3호
• /
• pp.289-295
• /
• 2008

The shared-route decision algorithms in multicasting communications networks to provide the internet-based services such as IPTV, remote education/health, and internet broadcasting are presented. The three main measures of maximum delay, average delay and estimated delay between each node and member are adopted. Under the Mesh network with the uniform random cost between each node, the algorithm's performance is compared to the optimal solution with the minimum cost by all enumeration. The simulation results show that the algorithm using the estimated delay outperforms the other two methods.

• 한국멀티미디어학회논문지
• /
• 제7권1호
• /
• pp.106-112
• /
• 2004

Global Internet에서 이동성을 위한 해결책으로 모바일 IP가 제시된 바 있다. 그러나 사용자가 증가하는 경우와 이동노드의 움직임이 많은 경우에는 서비스 지연이 발생하게 된다. 이러한 지연을 줄이기 위해 지역등 록을 사용한 모바일 IP가 제시되었다. 본 논문에서는 모바일 IP에서 등록지연을 최소로 하는 최적의 지역등록 관리 방법을 소개한다. 이산적 해석 모델을 통해 이동 노드의 움직임을 나타내며 제안한 방법을 통해 평균 패킷 도착률과 이동노드의 이동성을 고려한 경우의 네트워크의 크기에 따른 등록비용을 해석적으로 분석한다.

• 한국컴퓨터정보학회논문지
• /
• 제21권11호
• /
• pp.65-71
• /
• 2016

This paper proposes a novel traffic and resource management scheme based on Service Level Agreement (SLA) which allows to guarantee the quality of experience (QoE) for various high-quality mobile multimedia service users to a certain level. For this purpose, QoE-SLA coupling structure is considered and a novel scheme is suggested to suppress the processing delay of the mobile terminal and to decrease the transfer delay in the transmission network. According to simulation results, our proposed scheme can increase the total throughput and decrease the average delay by adjusting SLA.

• 디지털산업정보학회논문지
• /
• 제6권1호
• /
• pp.83-90
• /
• 2010

DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

• 한국항공운항학회지
• /
• 제24권2호
• /
• pp.11-18
• /
• 2016

Global Positioning System (GPS) is currently widely used for aviation applications. Single-frequency GPS receivers are highly affected by the ionospheric delay error, and the ionospheric delay should be corrected for accurate positioning. Single-frequency GPS receivers use the Klobuchar model, whose model parameters are transmitted from GPS satellites. In this paper, the long-term accuracy of the Klobuchar model from 2002 to 2014 is analyzed. The IGS global ionosphere map is considered as true ionospheric delay, and hourly, seasonal, and geographical error variations are analyzed. Histogram of the ionospheric delay error is also analyzed. The influence of solar and geomagnetic activity on the Klobuchar model error is analyzed, and the Klobuchar model error is highly correlated with solar activity. The results show that the Klobuchar model estimates 8 total electron content unit (TECU) over the true ionosphere delay in average. The Klobuchar model error is greater than 12 TECU within $20^{\circ}$ latitude, and the error is less than 6 TECU at high latitude.