• Journal of the Korean Magnetics Society
• /
• v.5 no.5
• /
• pp.383-386
• /
• 1995

A universal dispersion equation for magnetostatic waves(MSW) propagating in the film with arbitrary-multiple magnetic layers magnetized in an arbitrary direction was derived with a matching boundary condition method. The computing result curves of delay time were shown.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.23-36
• /
• 2001

To support real-time multicast, the existing DS network may use the EF PHB for transmission, However, because of the dynamic characteristics of the multicast flow and the features of the EF PHB. it is very difficult to make a provision of resources or to manage the network when EF multicast flows increase, Also, the existing LBE PHB can not guarantee the transmission delay bounds required for the real-time multicast traffic, In this paper. a new concept of PHB. namely, low-delay multicast PHB, that may guarantee approximately the per-hop delay is proposed, For the low-delay multicast PHB, router architectures are devised, The queue management algorithm on a low-delay multicast queue and a scheduling method are also devised. This new architecture of the LDM AF class is simple to be implemented.

• ETRI Journal
• /
• v.18 no.3
• /
• pp.127-145
• /
• 1996

A new analytic framework based on a linear algebra approach is proposed for examining the performance of a direct sequence spread spectrum (DS/SS) slotted ALOHA wireless communication network systems with delay capture. The discrete-time Markov chain model has been introduced to account for the effect of randomized time of arrival (TOA) at the central receiver and determine the evolution of the finite population network performance in a single-hop environment. The proposed linear algebra approach applied to the given Markov problem requires only computing the eigenvector ${\prod}$ of the state transition matrix and then normalizing it to have the sum of its entries equal to 1. MATLAB computation results show that systems employing discrete TOA randomization and delay capture significantly improves throughput-delay performance and the employed analysis approach is quite easily and staightforwardly applicable to the current analysis problem.

• Journal of Internet Computing and Services
• /
• v.22 no.5
• /
• pp.9-16
• /
• 2021

Recently, the traffic volume of mobile communications increases rapidly and the small-cell is one of the solutions using two offload schemes, i.e., local IP access (LIPA) and selected IP traffic offload (SIPTO), to reduce the end-to-end delay and amount of mobile data traffic in the core network (CN). However, 3GPP describes the concept of LIPA and SIPTO and there is no decision algorithm to decide the path from source nodes (SNs) to destination nodes (DNs). Therefore, this paper proposes a dynamic mobile data traffic offload scheme using small-cells to decide the path based on the SN and DN, i.e., macro user equipment, small-cell user equipment (SUE), and multimedia server, and type of the mobile data traffic for the real-time and non-real-time. Through analytical models, it is shown that the proposed offload scheme outperforms the conventional small-cell network in terms of the delay of end-to-end mobile data communications and probability of the mobile data traffic in the CN for the heterogeneous networks.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.438-441
• /
• 2003

Construction delays are a common occurrence of most construction projects and difficult to analyze. there are some techniques to analyze delays, such as using CPM, Bar Chart but they are not enough to analyze concurrent and productivity lost delays. Productivity lost delays are different to interruption delays in computing the number of delays and analyzing concurrent delay. This paper describes the delay analysis method considering productivity including concurrent delay analysis.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.33-41
• /
• 2007

With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree(DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the prerformance evaluation and the enhancement is up to about 9% to 29% in terms of the multicast delay variation. The time complexity of our algorithm is $O(mn^2)$M.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.603-618
• /
• 2022

In this paper, a numerical solution of the generalized diffusion equation with a delay has been obtained by a numerical technique based on the Galerkin finite element method by applying the cubic B-spline basis functions. The time discretization process is carried out using the forward Euler method. The numerical scheme is required to preserve the delay-independent asymptotic stability with an additional restriction on time and spatial step sizes. Both the theoretical and computational rates of convergence of the numerical method have been examined and found to be in agreement. As it can be observed from the numerical results given in tables and graphs, the proposed method approximates the exact solution very well. The accuracy of the numerical scheme is confirmed by computing L₂ and L_∞ error norms.

• Publications of The Korean Astronomical Society
• /
• v.16 no.1
• /
• pp.21-23
• /
• 2001

The DE405 ephemeride is introduced as TRAO solar ephemeris system to support the apparent coordinates of planets after 2000. The time delay between planets and observer has to be regarded to get the apparent position of planet. Some fast algorithms about time delay are suggested to reduce the computing time. The CSI method is applied to run these algorithms on any O/S including both real-time and run-time machine.

• Journal of Korea Multimedia Society
• /
• v.25 no.2
• /
• pp.325-334
• /
• 2022

Digital twin has the advantages of quality improvement and cost reduction, so it is widely applied to various industries. In this paper, a method to implement the major technologies of digital twin easily and quickly is presented. These include data management and relay servers, real-time monitoring applications including remote control interfaces, and direct connection protocols for video streaming. In addition, an algorithm for controlling a two-wheeled vehicle with a 2D interface is also proposed. The implemented system performs near real-time synchronization between the real environment and the virtual space. The delay time that occurs in remote control of the vehicle in the real environment was compared with the results of applying the proposed delay time reduction method. In addition, in the case of 2D interface-based control, an algorithm that can guarantee the user experience was implemented and applied to the actual environment and verified through experiments.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.207-216
• /
• 2013

Vehicular ad-hoc networks (VANETs) are self-organizing, self-healing networks which provide wireless communication among vehicular and roadside devices. Applications in such networks can take advantage of the use of simultaneous connections, thereby maximizing the throughput and lowering latency. In order to take advantage of all radio interfaces of the vehicle and to provide good quality of service for vehicular applications, we developed a seamless flow mobility management architecture based on vehicular network application classes with network-based mobility management. Our goal is to minimize the time of flow connection exchange in order to comply with the minimum requirements of vehicular application classes, as well as to maximize their throughput. Network simulator (NS-3) simulations were performed to analyse the behaviour of our architecture by comparing it with other three scenarios. As a result of this work, we observed that the proposed architecture presented a low handover time, with lower packet loss and lower delay.