• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.454-464
• /
• 2002

In the ATM-PON (Asynchronous Transfer Mode-Passive Optical Network), the downstream cell transmitted by an OLT is broadcast to all ONUs. The ONU receives selectively its own cells by VP filtering. On the other hand, the upstream cell can be transmitted by ONU in the case of receiving a grant from the OLT. After providing the grant to an ONU, the OLT expects the arrival of a cell after an elapse of the equalized round trip delay. ITU-T G.983.1 recommends that one bit error is allowed between the expected arrival time and the actual arrival time at the OLT. Because the ONU processes the different delay to each type of grant (ranging, user cell, and mimi-slot grant), it is not simple to design the transmission part of ONU. In this paper, we implement a grant processor which provides the delay accurately in the ONU TC chip with the FPGA. For the given equalized delay, it deals with the delay for the cell, the byte, and the bit unit by using the shift register, the byte counter, and the D flip-flop, respectively. We verify the operation of the grant processor by the time simulation and the measurement of the optical board output.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.99-108
• /
• 2014

WBAN(Wireless Body Area Network) is network to support medical and non-medical services. It is susceptible to loss and delay of data. WBAN is required to satisfy many kinds of demands such as a variety of data rate and a data priority for providing various service. In this paper scheduling algorithm, considering a data priority and transmission delay time, is proposed to improve service quality of WBAN. The proposed algorithm operates by allocating a channel to a flow with longer transmission delay. When a packet, in a queue of herb, is left within a certain period, the packet is assigned a channel and transmitted according to a data priority. Through the comparison with other existing scheduling algorithms, it is confirmed that QoS is improved due to higher arrival probability of medical data and less delay time in the proposed algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.63-68
• /
• 2019

Emerging applications such as Smart factory, in-car network, wide area power network require strict bounds on the end-to-end network delays. Flow-based scheduler in traditional Integrated Services (IntServ) architecture could be possible solution, yet its complexity prohibits practical implementation. Sub-optimal class-based scheduler cannot provide guaranteed delay since the burst increases rapidly as nodes are passed by. Therefore a leaky-bucket type regulator placed next to the scheduler is being considered widely. This paper proposes a simple server that achieves both fair scheduling and traffic regulation at the same time. The performance of the proposed server is investigated, and it is shown that a few msec delay bound can be achieved even in large scale networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.715-718
• /
• 2016

SpaceWire invented for on-board data handling in a spacecraft has Time-Code defined for time synchronization over SpaceWire network. Delay and jitter of the transmission of Time-Code caused when a Time-Code travels through a network are the main reasons of time synchronization error. This work proposes a scheme that can reduce the time synchronization error by using extended Time-Codes. The proposed scheme can remove both transmission jitter and transmission delay. The scheme will be validated in a simulation environment built with OMNeT++.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1376-1391
• /
• 2015

In bus delay-tolerant networks, the route of bus is determinate but its arrival time is indeterminate. However, most conventional approaches predict future contact without considering its uncertainty, which makes a limitation on routing performance. A novel approach is proposed by employing interval algebra to characterize the contact's uncertainty and time-varying nature. The contact is predicted by using the Bayesian estimation to achieve a better routing performance. Simulation results show that this approach achieves a good balance between delivery latency and delivery ratio.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.450-464
• /
• 2023

To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.89-102
• /
• 2010

This paper concerns the problem of global robust stability of a time-delay discontinuous system with a positive-defined connection matrix under polytopic-type uncertainty. In order to give the stability condition, we firstly address the existence of solution and equilibrium point based on the properties of M-matrix, Lyapunov-like approach and the theories of differential equations with discontinuous right-hand side as introduced by Filippov. Second, we give the delay-independent and delay-dependent stability condition in terms of linear matrix inequalities (LMIs), and based on Lyapunov function and the properties of the convex sets. One numerical example demonstrate the validity of the proposed criteria.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.5
• /
• pp.190-196
• /
• 2002

In this paper, the response characteristics of CAN-based feedback control system are analyzed when message time delays through the network are considered. The message time delays are composed of computation time delay and communication time delay. The application layer of CAN communication is modeled mathematically to analyze two time delays, and the communication time delay is redefined under several assumption conditions. The CAN-based feedback control system is proposed as a target system that is the machining system with the three axes. The response characteristics of time delays in the proposed system are analyzed through computer simulations, and can be improved by the compensation using the PID tuning method to satisfy the design specifications of the system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3029-3045
• /
• 2017

The main processes of a cognitive radio system include spectrum sensing, spectrum decision, spectrum sharing, and spectrum conversion. Experimental results show that these stages introduce a time delay that affects the spectrum sensing accuracy, reducing its efficiency. To reduce the time delay, the frequency spectrum prediction was proposed to alleviate the burden on the spectrum sensing. In this paper, the deep recurrent neural network (DRNN) was proposed to predict the spectrum of multiple time slots, since the existing methods only predict the spectrum of one time slot. The continuous state of a channel is divided into a many time slots, forming a time series of the channel state. Since there are more hidden layers in the DRNN than in the RNN, the DRNN has fading memory in its bottom layer as well as in the past input. In addition, the extended Kalman filter was used to train the DRNN, which overcomes the problem of slow convergence and the vanishing gradient of the gradient descent method. The spectrum prediction based on the DRNN was verified with a WiFi signal, and the error of the prediction was analyzed. The simulation results proved that the multiple slot spectrum prediction improved the spectrum efficiency and reduced the energy consumption of spectrum sensing.

• IE interfaces
• /
• v.4 no.1
• /
• pp.63-69
• /
• 1991

In this paper, the Go-Back-N ARQ protocol with decoding in communication network is considered. The time delay and throughput are respectively analyzed as a function of window size and decoding time out. Packets arrive continuously at the decoder, and are stored in a buffer if the decoder is busy upon its arrival. The decoder devotes no more than a time-out period of predetermined length to the decoding of any single packet. If packet decoding is completed within that period, the packet leaves the system. Otherwise, it is retransimitted and its decoding starts anew. The time delay and throughput are obtained using recursive formula and difference equation. An appropriate time out and window size that satisfies the grade of service can be determined.