• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.1-10
• /
• 2016

In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.491-498
• /
• 2005

The Denial of Service(DoS) attacks, which are done by consuming all of the computing or communication resources necessary for the services, are known very difficult to be protected from. TCP has drawbacks in its connection establishment for possible DoS attacks. TCP maintains the state of each partly established connection in the connection queue until it is established completely and accepted by the application. The attackers can make the queue full by sending connection requests repeatedly and not completing the connection establishment steps for those requests. In this paper, we have designed and implemented the extended TCP for preventing from SYN Flood DoS attacks. In the extended TCP, the state of each partly established connection is not maintained in the queue until the connection is established completely. For the extended TCP, we have modified the 3-way handshake procedure of TCP and implemented the extended TCP in the Linux operating system. The test result shows $0.05\%$ delay more than original TCP, but it shows that the extended TCP is strong for SYN Flood attacks.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2008.11a
• /
• pp.628-633
• /
• 2008

Tall building construction has been increasing due to the need to maximize land usage. It causes the increase of vertical transportation for workers and materials, which significantly affects the productivity and lifting planning, therefore, has to be made carefully based on the characteristics of the field. However, the existing method to calculate the number of lift is too simple to consider complex and various characteristics in tall building construction. Accordingly, we developed the model for selecting the best system of vertical transportation by using Queueing theory. To find out the situation of the queue of resources such as material and workers, a simulation program will be applied.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.159-178
• /
• 1995

Supervisory control is an approach based on formal language. it is used to model and control discrete event systems in which each discrete event process is represented as an automation. A supervisor is a generator that switches control patterns in such a way that a given discrete evenet process behaves in obedience to various constraints. A flexible manufacturing cell (FMC) is one of discrete evenet systems. Functions necessary for the operation of an FMC are characterized by operational components and informational compoments. The operational components can be modeled using the finite state machines and the informational components can be modeled using the abstract formalism which describes supporting operations of the cell controller. In this paper, we addressed function required for FMC control specification, software engineering aspects on FMC control based on supervisory control, a concept of event queue for resolving synchronization problem, and complexity reduction. Based on the mathematical model of an FMC. we synthesized the controller by integrating a supervisor for FMC with control specification that specifies event-driven operation of the cell controller. The proposed control scheme is stable mathematically so that the system always behaves on a controlled way even under the existence of uncontrollable events. Furthermore, using an event queue concept, we can solve a synchronization problem caused by the violation of instantaneity assumption of supervisory control theory in real life situation. And also, we can propotype a control software rapidly due to the modularity of the proposed control scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2769-2774
• /
• 2013

The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of the Korea Society for Simulation
• /
• v.8 no.2
• /
• pp.29-43
• /
• 1999

As real-time processing of data with large storage space is required in the era of multimedia, disk arrays are generally used as storage subsystems which be able to provide improved I/O performance. To design the cost-effective disk array, it is important to develop performance models which evaluate the disk array performance. Both queueing theory and simulation are applicable as the method of performance evaluation through queueing modeling. But there is a limit to the analytical method using queueing theory due to the characteristics of disk array requests being serviced in the parallel and concurrent manner. So in this paper we evaluate the disk array performance using simulation method which abstract disk array systems in the low level. Performance results were evaluated through simulation, so that mean response time, mean queueing delay, mean service time, mean queue length for disk array requests and utilization, throughput for disk array systems, can be utilized for capacity planning in the phase of disk array design.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.293-298
• /
• 2010

The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.